Sciweavers

Share
EVOW
2004
Springer

Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms

8 years 8 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overlapped neighborhoods. Such a kind of structured algorithms is specially well suited for complex problems. In this paper we propose the utilization of some cGAs with and without including local search techniques for solving the vehicle routing problem (VRP). A study on the behavior of these algorithms has been performed in terms of the quality of the solutions found, execution time, and number of function evaluations (effort). We have selected the benchmark of Christofides, Mingozzi and Toth for testing the proposed cGAs, and compare them with some other heuristics in the literature. Our conclusions are that cGAs with an added local search operator are able of always locating the optimum of the problem at low times and reasonable effort for the tested instances.
Enrique Alba, Bernabé Dorronsoro
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where EVOW
Authors Enrique Alba, Bernabé Dorronsoro
Comments (0)
books