Summary
The VRP (Vehicle Routing Problem) and the CARP (Capacitated Arc Routing Problem) involve the routing of vehicles in an undirected network to service respectively a set of nodes or a set of arcs. Motivated by applications in waste collection, we define a more general model called NEARP (Node, Edge and Arc Routing Problem) for tackling mixed graphs with required nodes, edges and arcs. A memetic algorithm (MA) is developed for the NEARP. An evaluation on standard VRP and CARP benchmarks shows that the MA is competitive with most metaheuristics for these particular cases of the NEARP. We finally propose a set of NEARP instances, together with the solutions costs achieved by the MA, as a challenge for other researchers in vehicle routing.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Toth P, Vigo D (1998) Exact solution of the Vehicle Routing Problem. In: Crainic TG, Laporte G (eds) Fleet management and logistics, 1–31. Kluwer, Boston.
Laporte G, Gendreau M, Potvin JY, Semet F (2000) Classical and modern heuristics for the Vehicle Routing Problem. International Transactions in Operational Research 7:285–300.
Gendreau M, Laporte G, Potvin JY (1998) Metaheuristics for the Vehicle Routing problem. GERAD research report G-98-52, Montreal, Canada.
Golden BL, Wasil EA, Kelly JP, Chao IM (1998) The impact of metaheuristics on solving the Vehicle Routing Problem: algorithms, problem sets, and computational results. In: Crainic TG, Laporte G (eds) Fleet management and logistics, 33–56. Kluwer, Boston.
Toth P, Vigo D. The granular tabu search and its application to the Vehicle Routing Problem. To appear in INFORMS Journal on Computing.
Assad AA, Golden BL (1995) Arc routing methods and applications. In: Ball MO et al. (eds) Handbooks in OR and MS, volume 8, 375–483. Elsevier.
Pearn WL, Assad A, Golden BL (1987) Transforming arc routing into node routing problems. Computers and Operations Research 14:285–288.
Hirabayashi R, Saruwatari Y, Nishida N (1992) Tour construction algorithm for the Capacitated Arc Routing Problem. Asia-Pacific Journal of Operational Research 9:155–175.
Belenguer JM, Benavent E (2003) A cutting plane algorithm for the Capacitated Arc Routing Problem. Computers and Operations Research 30(5):705–728.
Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10:47–59.
Golden BL, Wong RT (1981) Capacitated arc routing problems, Networks 11:305–315.
Ulusoy G (1985) The fleet size and mix problem for capacitated arc routing. European Journal of Operational Research 22:329–337.
Hertz A, Laporte G, Mittaz M (2000) A tabu search Heuristic for the Capacitated Arc Routing Problem. Operations Research 48:129–135.
Lacomme P, Prins C, Ramdane-Chérif W (2001) A genetic algorithm for the Capacitated Arc Routing Problem and its extensions. In: Boers EJW et al. (eds) Applications of evolutionnary computing. Lecture Notes in Computer Science 2037, 473–483. Springer, Berlin.
Lacomme P, Prins C, Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems. To appear in Annals of Operations Research.
DeArmon JS (1981) A comparison of heuristics for the Capacitated Chinese Postman Problem. Master’s thesis, The University of Maryland at College Park, MD, USA.
Orloff CS (1974) A fundamental problem in vehicle routing. Networks 4:35–64.
Cormen TH, Leiserson CL, Rivest ML, Stein C (2001) Introduction to algorithms, 2nd edition. The MIT Press, Cambridge, MA.
Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Dorigo M and Glover F. (eds) New ideas in optimization, 219–234. McGraw-Hill.
Oliver IM, Smith DJ, Holland JRC (1987) A study of permutation crossover operators on the traveling salesman problem. In: Grefenstette JJ (ed) Proceedings of the 2nd Int. Conf. on Genetic Algorithms, 224–230. Lawrence Erlbaum, Hillsdale, NJ.
Belenguer JM, Benavent E. Directory with 3 sets of CARP instances. Web site: http://www.uv.es/~belengue/carp.html.
Christofides N, Mingozzi A, Toth P (1979) The Vehicle Routing Problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization, 315–338. Wiley.
Beasley JE. Set of VRP instances from the OR library. Web site: http://mscmga.ms.ic.ac.uk/jeb/orlib/vrpinfo.html.
Crescenzi P, Kann V. A compendium of NP optimization problem. Web site: http://www.nada.kth.se/~viggo/wwwcompendium/node103.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Prins, C., Bouchenoua, S. (2005). A Memetic Algorithm Solving the VRP, the CARP and General Routing Problems with Nodes, Edges and Arcs. In: Hart, W.E., Smith, J.E., Krasnogor, N. (eds) Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32363-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-32363-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22904-9
Online ISBN: 978-3-540-32363-1
eBook Packages: EngineeringEngineering (R0)