Skip to main content
SpringerLink
Log in

Parallel Ant Systems for the Capacitated Vehicle Routing Problem

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004)

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

Abstract

In this paper we first provide a thorough performance comparison of the three main Ant Colony Optimization (ACO) paradigms for the Vehicle Routing Problem (VRP), namely the Rank based Ant System, the Max-Min Ant System and the Ant Colony System. Based on the results of this comparison we then implement a parallelization strategy to increase computational efficiency and study the effects of increasing the number of processors.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  MathSciNet  Google Scholar 

  2. Bullnheimer, B., Kotsis, G., Strauss, C.: Parallelization Strategies for the Ant System. In: Leone, R., et al. (eds.) High Performance Algorithms and Software in Nonlinear Optimization, pp. 87–100. Kluwer, Dordrecht (1998)

    Google Scholar 

  3. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., et al. (eds.) Combinatorial Optimization, Wiley, Chicester (1979)

    Google Scholar 

  4. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)

    Article  Google Scholar 

  5. Croes, G.A.: A method for solving Traveling Salesman Problems. Operations Research 6, 791–801 (1958)

    Article  MathSciNet  Google Scholar 

  6. Delisle, P., Krajecki, M., Gravel, M., Gagne, C.: Parallel implementation of an ant colony optimization metaheuristic with OpenMP. In: Proceedings of the 3rd European Workshop on OpenMP (EWOMP 2001), Barcelona, Spain, September 8–12 (2001)

    Google Scholar 

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

    Article  Google Scholar 

  8. Dorigo, M., Stuetzle, T.: The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 251–285. Kluwer, Dordrecht

    Google Scholar 

  9. Florian, M., Gendreau, M.: Applications of parallel computing in transportation. Parallel Computing 27, 1521–1522 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  11. Gendreau, M., Laporte, G., Potvin, Y.: Metaheuristics for the vehicle routing problem. GERAD Report G-98-52, University of Montreal, Canada (1999)

    Google Scholar 

  12. Merkle, D., Middendorf, M.: Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays. Genetic Programming and Evolvable Machines 3(4), 345–361 (2002)

    Article  MATH  Google Scholar 

  13. Middendorf, M., Reischle, F., Schmeck, H.: Multi Colony Ant Algorithms. Journal of Heuristics 8, 305–320 (2002)

    Article  MATH  Google Scholar 

  14. MPI: MPI: A message-passing interface standard version 1.1 MPI Forum (1995)

    Google Scholar 

  15. Ralphs, T.K.: Parallel branch and cut for capacitated vehicle routing. Parallel Computing 29, 607–629 (2003)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Reimann, M., Stummer, M., Doerner, K.: A Savings based Ant System for the Vehicle Routing Problem. In: Langdon, W.B., et al. (eds.) Proceedings of GECCO 2002, pp. 1317–1325. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  18. Stuetzle, T., Hoos, H.: The Max-Min Ant System and Local Search for Combinatorial Optimization Problems. In: Voss, S., et al. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Dordrecht (1998)

    Google Scholar 

  19. Stuetzle, T.: Parallelization Strategies for Ant Colony Optimization. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 722–731. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Talbi, E.-G., Roux, O., Fonlupt, C., Robillard, D.: Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer Systems 17, 441–449 (2001)

    Article  MATH  Google Scholar 

  21. Jozefowiez, N., Semet, F., Talbi, E.-G.: Parallel and Hybrid Models for Multiobjective Optimization: Application to the Vehicle Routing Problem. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 271–280. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science, University of Vienna, Bruenner Strasse 72, A-1210, Vienna, Austria

    Karl F. Doerner, Richard F. Hartl, Guenter Kiechle & Marc Reimann

  2. Institute for Software Science, University of Vienna, Liechtensteinstrasse 22, A-1090, Vienna, Austria

    Maria Lucka

  3. Institute for Operations Research, Swiss Federal Institute of Technology Zurich, Clausiusstrasse 47, CH-8092, Zurich, Switzerland

    Marc Reimann

Authors
  1. Karl F. Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard F. Hartl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guenter Kiechle
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maria Lucka
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marc Reimann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SAP AG, Neurottstr. 16, 69190, Walldorf, Germany

    Jens Gottlieb

  2. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/1861, 1040, Vienna, Austria

    Günther R. Raidl

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Doerner, K.F., Hartl, R.F., Kiechle, G., Lucka, M., Reimann, M. (2004). Parallel Ant Systems for the Capacitated Vehicle Routing Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24652-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21367-3

  • Online ISBN: 978-3-540-24652-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation