First Competitive Ant Colony Scheme for the CARP

  • Philippe Lacomme
  • Christian Prins
  • Alain Tanguy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)


The CARP consists on determining a set of vehicle trips with minimum total cost. Each trip starts and ends at the depot, each required edge of the site graph is serviced by one single trip, and the total demand handled by any vehicle does not exceed the capacity Q. The most efficient metaheuristics published so far are a sophisticated taboo search method (CARPET) of Hertz et al. [1] and a hybrid genetic algorithm proposed by Lacomme et al. [2]. In the beginning, no collective memory is used and ants use only heuristic information. Pheromone deposition is proportional to the fitness that can be defined for minimization objectives as the inverse of the solution quality or solution cost. Local search can also be applied to increase the convergence rate. The process is iterated until a lower bound is reached or a maximal number of iterations is carried out.


Local Search Hybrid Genetic Algorithm Collective Memory Solution Cost Heuristic 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.


  1. 1.
    Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research 48(1), 129–135 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive genetic algorithms for the Capacitated Arc Routing Problem and its extensions. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 473–483. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Philippe Lacomme
    • 1
  • Christian Prins
    • 2
  • Alain Tanguy
    • 1
  1. 1.Laboratory of Computer Science (LIMOS), UMR CNRS 6158Blaise Pascal UniversityAubiere Cedex
  2. 2.Laboratory for Industrial Systems OptimizationUniversity of Technology of TroyesTroyes CedexFrance

Personalised recommendations