Applying Ant Colony Optimization to the Capacitated Arc Routing Problem
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  plus one.
KeywordsMemetic Algorithm Vehicle Route Problem Heuristic Information Short Path Distance Pheromone Information
- 1.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)Google Scholar
- 2.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)Google Scholar