Skip to main content

An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem

  • Conference paper
Ant Colony Optimization and Swarm Intelligence (ANTS 2004)

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

Abstract

In this paper, a new Ant System approach to the Period Vehicle Routing Problem (PVRP) is presented. In PVRP, visit days have to be assigned to customers in order to find efficient routes over the period. We suggest a new technique for defining the initial solution and a novel strategy to update the pheromone trails that is especially suited for solving large scale problems. An illustrative example for a waste collection system involving 202 localities in the municipality of Viseu, Portugal, demonstrates the effectiveness of the model.

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

Access this chapter

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. Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4, 65–94 (1974)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank based version of the ant system: a computational study. Working Paper No.1,SFB Adaptative Information Systems and Modelling in Economics and Management Science, Vienna (1997)

    Google Scholar 

  4. Chao, I.M., Golden, B.L., Wasil, E.A.: An improved heuristic for the period vehicle routing problem. Networks 26, 25–44 (1995)

    Article  MATH  MathSciNet  Google Scholar 

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

  6. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F., Bourgine, P. (eds.) Proc.Europ. Conf. Artificial Life, pp. 134–142. Elsevier, Amsterdam (1992)

    Google Scholar 

  7. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  MATH  Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  9. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics - Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  10. Doerner, K.F., Gronalt, M., Hartl, R.F., Reimann, M.: Optimizing pickup and delivery operations in a hub network with ant systems. POM Working Paper 02/2000, University of Vienna, Vienna, Austria (2000)

    Google Scholar 

  11. Osman, H.: Metastrategy simulated annealing and tabu search algorithms for vehicle routing problem. Annals of Opertations Research 41, 412–451 (1993)

    Google Scholar 

  12. Reimann, M., Stummer, M., Doerner, K.: A savings based ant system for the vehicle routing problem. In: Proc. of the Genetic and Evolutionary Computation Conference, pp. 1317–1362 (2002)

    Google Scholar 

  13. Russell, R.A., Gribbin, D.: A multiphase approach to the period routing problem. Networks 21, 747–765 (1991)

    Article  MATH  Google Scholar 

  14. Vianna, D., Ochi, L., Drummond, L.: A parallel hybrid evolutionary metaheuristic for the period vehicle routing problem. In: Proc. IPDPS (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matos, A.C., Oliveira, R.C. (2004). An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28646-2_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22672-7

  • Online ISBN: 978-3-540-28646-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics