Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Ant Algorithms

ANTS 2002: Ant Algorithms pp 135–148Cite as

Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows

  • Conference paper
  • First Online:

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

Abstract

In this paper we present and analyze the application of an Ant System to the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). At the core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the algorithm as well as a comparison with a custom made heuristic for the problem.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

  2. Costa, D. and Hertz, A.: Ants can colour graphs. Journal of the Operational Research Society 48(3) (1997) 295–305

    Article  MATH  Google Scholar 

  3. Stützle, T. and Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In: Corne, D. et al. (Eds.): NewIdeas in Optimization. Mc Graw-Hill, London (1999) 33–50

    Google Scholar 

  4. Dorigo, M. and Gambardella, L. M.: Ant Colony System: A cooperative learning approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1) (1997) 53–66

    Article  Google Scholar 

  5. Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: A newrank based version of the ant system: a computational study. Central European Journal of Operations Research 7(1) (1999) 25–38

    MATH  MathSciNet  Google Scholar 

  6. Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319–328

    Article  MATH  MathSciNet  Google Scholar 

  7. Reimann, M., Stummer, M. and Doerner, K.: A Savings based Ant System for the Vehicle Routing Problem. to appear in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  8. Gambardella, L. M., Taillard, E. and Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D. et al. (Eds.): NewIdeas in Optimization. McGraw-Hill, London (1999) 63–73

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Le Louarn, F. X., Gendreau, M. and Potvin, J. Y.: GENI Ants for the Travelling Salesman Problem. CRT Research Report, Montreal (2001)

    Google Scholar 

  11. Gendreau, M., Hertz, A. and Laporte, G.: NewInsertion and Postoptimization Procedures for the Travelling Salesman Problem. Operations Research. 40 (1992) 1086–1094

    MATH  MathSciNet  Google Scholar 

  12. Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman & Co., NewY ork (1979)

    MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

  16. Gelinas, S., Desrochers, M., Desrosiers, J. and Solomon, M. M.: A newbranc hing strategy for time constrained routing problems with application to backhauling. Annals of Operations Research. 61 (1995) 91–109

    Article  MATH  Google Scholar 

  17. Thangiah, S. R., Potvin, J. Y. and Sun, T.: Heuristic approaches to Vehicle Routing with Backhauls and Time Windows. Computers and Operations Research. 23 (1996) 1043–1057

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

  21. Doerner, K. F., Hartl, R.F., and Reimann, M.: Are CompetANTS competent for problem solving-the case of a transportation problem. POM Working Paper 01/2001 (2001)

    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. IRIDIA, Université de Bruxelles, CP 194/6 Avenue Franklin D. Roosevelt 50, 1050, Brussels, Belgium

    Marco Dorigo , Gianni Di Caro  & Michael Sampels ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reimann, M., Doerner, K., Hartl, R.F. (2002). Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45724-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44146-5

  • Online ISBN: 978-3-540-45724-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation