Applying ant colony optimization to the capacitated arc routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 420-421

  Doerner, Karl F ^a   Hartl, Richard F ^a   Maniezzo, Vittorio ^b   Reimann, Marc ^c  

^a UNIVERSITY OF VIENNA   (Austria)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

FLEET OPERATIONS; NETWORK ROUTING; SWARM INTELLIGENCE; VEHICLE ROUTING;

CAPACITATED ARC ROUTING PROBLEM; FLEET OF VEHICLES; OPTIMIZATION PROBLEMS; SET OF CUSTOMERS; VEHICLE ROUTING PROBLEM;

ANT COLONY OPTIMIZATION;

EID: 77049122577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_45     Document Type: Conference Paper

References (2)

1. R. Baldacci and V. Maniezzo. Exact methods based on node routing formulations for arc routing problems. Technical Report ULBCS-2004-10, Department of Computer Science, University of Bologna, 2004.
2. K. Doerner, R. Hartl, V. Maniezzo, and M. Reimann. An ant system metaheuristic for the capacitated arc routing problem. In Proceedings of the Fifth Metaheuristics International Conference (MIC 2003). 2003.