Applying Ant Colony Optimization to the Capacitated Arc Routing Problem

  • Karl F. Doerner
  • Richard F. Hartl
  • Vittorio Maniezzo
  • Marc Reimann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)

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.

Keywords

Memetic Algorithm Vehicle Route Problem Heuristic Information Short Path Distance Pheromone Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

References

  1. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Karl F. Doerner
    • 1
  • Richard F. Hartl
    • 1
  • Vittorio Maniezzo
    • 2
  • Marc Reimann
    • 3
  1. 1.Department of Management ScienceUniversity of ViennaAustria
  2. 2.Department of Computer ScienceUniversity of BolognaItaly
  3. 3.Inst. for Operations ResearchSwiss Federal Inst. of Tech.ZurichSwitzerland

Personalised recommendations