Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Book cover Applications of Evolutionary Computing (EvoWorkshops 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2611))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Toth, P. and Vigo, D. (Eds.): The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications, Philadelphia (2002)

    Google Scholar 

  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

    Article  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  4. Bräysy, O. and Gendreau, M.: Metaheuristics for the Vehicle Routing Problem with Time Windows. Sintef Technical Report STF42 A01025 (2001)

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Cordeau, J. F., Gendreau, M., Laporte, G.: A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Networks 30 (1997) 105–119

    Article  MATH  Google Scholar 

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

    Google Scholar 

  11. Bonabeau, E., Dorigo, M. and Theraulaz, G.: Swarm Intelligence. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  12. Gutjahr, W. J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters. 82 (2002) 145–153

    Article  MATH  MathSciNet  Google Scholar 

  13. Solomon, M. M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research. 35 (1987) 254–265

    MATH  MathSciNet  Google Scholar 

  14. Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research. 41 (1993) 421–451

    Article  MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Management Science, University of Vienna, Brünnerstrasse 72, A-1210, Vienna, Austria

    Marc Reimann, Karl Doerner & Richard F. Hartl

Authors
  1. Marc Reimann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karl Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard F. Hartl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, University of Parma, Parco Area delle Scienze 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  2. Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Colin G. Johnson

  3. Dept. of Information and Communications Technologies Faculty of Computer Science, University of A Coruña, A Coruña, CP 15071, Spain

    Juan J. Romero Cardalda

  4. Dept. of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Elena Marchiori

  5. Schol of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, RG6 6AY, UK

    David W. Corne

  6. AnimatLab, 8 rue du capitaine Scott, 75015, Paris, France

    Jean-Arcady Meyer  & Agnès Guillot  & 

  7. SAP AG, Neurottstrasse 16, 69190, Walldorf, Germany

    Jens Gottlieb

  8. Parallel Computing and Complex Systems Group, University of Leipzig, Augustusplatz 10/11, 04109, Leipzig, Germany

    Martin Middendorf

  9. Algorithms and Data Structures Group Institute of Computer Graphics, Vienna University of Technology, Favoritenstrasse 9-11/186, 1040, Vienna, Austria

    Günther R. Raidl

  10. School of Computing, Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reimann, M., Doerner, K., Hartl, R.F. (2003). Analyzing a Unified Ant System for the VRP and Some of Its Variants. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-36605-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00976-4

  • Online ISBN: 978-3-540-36605-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation