Solving the Vehicle Routing Problem Using Genetic Algorithm
The main goal of this paper is to find a solution of vehicle routing problem using genetic algorithms. The Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem that belongs to the NP-complete class. Due to the nature of the problem it is not possible to use exact methods for large instances of the VRP. Genetic algorithms provide a search technique used in computing to find true or approximate solution to optimization and search problems. However, the authors used some heuristic in addition during crossover or mutation for tuning the system to obtain better result.