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. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Doerner, K. F., Hartl, R. F., Maniezzo, V., & Reimann, M. (2004). Applying ant colony optimization to the capacitated arc routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 420–421). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
