Analyzing a unified ant system for the VRP and some of its variants

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

Volumn 2611, Issue , 2003, Pages 300-310

  Reimann, Marc ^a   Doerner, Karl ^a   Hartl, Richard F ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ANT SYSTEMS; VEHICLE ROUTING PROBLEMS;

AMPHIBIOUS VEHICLES;

EID: 33750912627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36605-9_28     Document Type: Article

References (19)

1. Toth, P. and Vigo, D. (Eds.): The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications, Philadelphia (2002)
2. Cordeau, J. F., Gendreau, M., Laporte, G., Potvin, J. Y. and Semet, F.: A guide to vehicle routing heuristics. Journal of the Operational Research Society 53 (5) (2002) 512-522
3. http://www.top.sintef.no/
4. Reimann, M., Doerner, K., Hartl, R. F.: Insertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows. In: Dorigo, M. et al. (Eds.): Ant Algorithms, Springer LNCS 2463, Berlin/Heidelberg (2002) 135-147
5. Bräysy, O. and Gendreau, M.: Metaheuristics for the Vehicle Routing Problem with Time Windows. Sintef Technical Report STF42 A01025 (2001)
6. Toth, P. and Vigo, D.: VRP with Backhauls. In Toth, P. and Vigo, D. (Eds.): The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications, Philadelphia (2002) 195-224
7. Gelinas, S., Desrochers, M., Desrosiers, J. and Solomon, M. M.: A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research. 61 (1995) 91-109
8. Duhamel, C., Potvin, J. Y. and Rousseau, J. M.: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows. Transportation Science. 31 (1997) 49-59
9. Gendreau, M., Laporte, G., Musaraganyi, C. Taillard, E. D.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operation Research 26 (1999) 1153-1173
10. Cordeau, J. F., Gendreau, M., Laporte, G.: A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Networks 30 (1997) 105-119
11. Colorni, A., Dorigo, M. and Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F. and Bourgine, P. (Eds.): Proc. Europ. Conf. Artificial Life. Elsevier, Amsterdam (1991) 134-142
12. Bonabeau, E., Dorigo, M. and Theraulaz, G.: Swarm Intelligence. Oxford University Press, New York (1999)
13. Gutjahr, W. J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters. 82 (2002) 145-153
14. Solomon, M. M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research. 35 (1987) 254-265
15. Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research. 41 (1993) 421-451
16. Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: A new rank based version of the ant system: a computational study. Central European Journal of Operations Research 7(1) (1999) 25-38
17. Christofides, N., Mingozzi, A. and Toth, P.: The vehicle routing problem. In: Christofides, N. et al. (Eds.): Combinatorial Optimization. Wiley, Chicester (1979)
18. Jacobs-Blecha, C., Goetschalckx, M.: The vehicle routing problem with backhauls: properties and solution algorithms. Technical Report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia (1992)
19. Jozefowiez, N., Semet, F. and Talbi, E.: Parallel and Hybrid Models for Multiobjective Optimization: Application to the Vehicle Routing Problem. In Guervos, J. M. et al. (Eds.): Parallel Problem Solving from Nature - PPSN VII, Springer LNCS 2439, Berlin/Heidelberg (2002) 271-280