Advertisement

Analyzing a Unified Ant System for the VRP and Some of Its Variants

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

Abstract

In this paper we analyze the application of an Ant System to different vehicle routing problems. More specifically, we study the robustness of our Unified Ant System by evaluating its performance on four different problem classes within the domain of vehicle routing.

Keywords

Solution Quality Vehicle Rout Problem Vehicle Rout Problem With Time Window Insertion Algorithm Springer LNCS 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Toth, P. and Vigo, D. (Eds.): The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications, Philadelphia (2002)Google Scholar
  2. 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–522zbMATHCrossRefGoogle Scholar
  3. 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–147CrossRefGoogle Scholar
  4. 5.
    Bräysy, O. and Gendreau, M.: Metaheuristics for the Vehicle Routing Problem with Time Windows. Sintef Technical Report STF42 A01025 (2001)Google Scholar
  5. 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–224Google Scholar
  6. 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–109zbMATHCrossRefGoogle Scholar
  7. 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–59zbMATHCrossRefGoogle Scholar
  8. 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–1173zbMATHCrossRefGoogle Scholar
  9. 10.
    Cordeau, J. F., Gendreau, M., Laporte, G.: A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Networks 30 (1997) 105–119zbMATHCrossRefGoogle Scholar
  10. 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–142Google Scholar
  11. 12.
    Bonabeau, E., Dorigo, M. and Theraulaz, G.: Swarm Intelligence. Oxford University Press, New York (1999)zbMATHGoogle Scholar
  12. 13.
    Gutjahr, W. J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters. 82 (2002) 145–153zbMATHCrossRefMathSciNetGoogle Scholar
  13. 14.
    Solomon, M. M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research. 35 (1987) 254–265zbMATHMathSciNetGoogle Scholar
  14. 15.
    Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research. 41 (1993) 421–451zbMATHCrossRefGoogle Scholar
  15. 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–38zbMATHMathSciNetGoogle Scholar
  16. 17.
    Christofides, N., Mingozzi, A. and Toth, P.: The vehicle routing problem. In: Christofides, N. et al. (Eds.): Combinatorial Optimization. Wiley, Chicester (1979)Google Scholar
  17. 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)Google Scholar
  18. 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–280CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Marc Reimann
    • 1
  • Karl Doerner
    • 1
  • Richard F. Hartl
    • 1
  1. 1.Institute of Management ScienceUniversity of ViennaViennaAustria

Personalised recommendations