Abstract
The Capacitated Arc Routing Problem (CARP) is a prototypical optimization problem asking a fleet of vehicles to serve a set of customer demands located on the arcs of a network. The problem is closely related to Vehicle Routing Problem (VRP), and in fact every CARP instance can be transformed into an equivalent VRP instance using a graph which has a number of nodes twice the number of customer arcs of the original CARP graph [1] plus one.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baldacci, R., Maniezzo, V.: Exact methods based on node routing formulations for arc routing problems. Technical Report ULBCS-2004-10, Department of Computer Science, University of Bologna (2004)
Doerner, K., Hartl, R., Maniezzo, V., Reimann, M.: An ant system metaheuristic for the capacitated arc routing problem. In: Proceedings of the Fifth Metaheuristics International Conference, MIC 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doerner, K.F., Hartl, R.F., Maniezzo, V., Reimann, M. (2004). Applying Ant Colony Optimization to the Capacitated Arc Routing Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive