Skip to main content

Fleet Organization Models for Online Vehicle Routing Problems

  • Chapter

Part of the Lecture Notes in Computer Science book series (TCCI,volume 7270)

Abstract

Online vehicle routing problems with time windows are highly complex problems for which different artificial intelligence techniques have been used. In these problems, the exclusive optimization of the conventional criteria (number of vehicles and total traveled distance) leads to the appearance of geographic areas and/or time periods that are not covered by any vehicle because of their low population density. The transportation demands in these zones either cannot be satisfied or need to mobilize new vehicles. We propose two agent-oriented models that propose a particular dynamic organization of the vehicles, with the objective to minimize the appearance of such areas. The first model relies on a spatial representation of the agents’ action zones, and the second model is grounded on the space-time representation of these zones. These representations are capable of maintaining an equilibrated distribution of the vehicles on the transportation network. In this paper, we experimentally show that these two means of distributing vehicles over the network provide better results than traditional insertion heuristics. They allow the agents to take their decisions while anticipating future changes in the environment.

Keywords

  • Vehicle Routing Problems
  • Multiagent Systems
  • Organization Models

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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. Solomon, M.: Algorithms for the vehicle routing and scheduling with time window constraints. Operations Research 15, 254–265 (1987)

    CrossRef  Google Scholar 

  2. Wooldridge, M., Jennings, N.R.: Intelligent agents: Theory and practice. Knowledge Engineering Review 10(2), 115–152 (1995)

    CrossRef  Google Scholar 

  3. Sycara, K.P.: Multiagent Systems. AI Magazine 19, 79–92 (1998)

    Google Scholar 

  4. Nagata, Y., Bräysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research 37, 724–737 (2010)

    CrossRef  MATH  Google Scholar 

  5. Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Operations Research 56, 497–511 (2008)

    CrossRef  MATH  Google Scholar 

  6. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403–2435 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Czech, Z.J., Czarnas, P.: A parallel simulated annealing for the vehicle routing problem with time windows. In: Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, pp. 376–383 (2002)

    Google Scholar 

  8. de Oliveira, H.C.B., Vasconcelos, G.C., Alvarenga, G.B.: A multi-start simulated annealing algorithm for the vehicle routing problem with time windows. In: Proceedings of the Ninth Brazilian Symposium on Neural Networks, p. 24. IEEE Computer Society, Washington, DC (2006)

    CrossRef  Google Scholar 

  9. Mester, D., Brysy, O.: Active guided evolution strategies for large scale vehicle routing problems with time windows. Computers & Operations Research 32, 1593–1614 (2005)

    CrossRef  Google Scholar 

  10. Gambardella, L.M., Taillard, E.D., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill, London (1999)

    Google Scholar 

  11. Barán, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: Applied Informatics, pp. 97–102 (2003)

    Google Scholar 

  12. Golden, B., Raghavan, S., Wasil, E.: The vehicle routing problem, latest advances and new challenges. Operations research/computer science interfaces, vol. 43. Springer (2008)

    Google Scholar 

  13. Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F., Cordeau, J.F.: The VRP with time windows. In: Vigo, D., Toth, P. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 157–193. SIAM (2002)

    Google Scholar 

  14. Gendreau, M., Guertin, F., Potvin, J.Y., Sguin, R.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C 14, 157–174 (2006)

    CrossRef  Google Scholar 

  15. Housroum, H., Hsu, T., Dupas, R., Goncalves, G.: A hybrid ga approach for solving the dynamic vehicle routing problem with time windows. In: Society, I.C. (ed.) Proceedings of the IEEE Conference on Information and Communication Technologies: from Theory to Applications, Damascus, Syria, pp. 3347–3352 (2006)

    Google Scholar 

  16. Madsen, O.B., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Operations Research 60, 193–208 (1995)

    MATH  Google Scholar 

  17. Fu, L., Teply, S.: On-line and off-line routing and scheduling of dial-a-ride paratransit vehicles. In: Computer-Aided Civil and Infrastructure Engineering, vol. 14, pp. 309–319. Blackwell Publishers, Oxford (1999)

    Google Scholar 

  18. Horn, M.E.: Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research C 10, 35–63 (2002)

    CrossRef  MathSciNet  Google Scholar 

  19. Diana, M.: The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services. Journal of Advanced Transportation 40, 23–46 (2006)

    CrossRef  Google Scholar 

  20. Thangiah, S.R., Shmygelska, O., Mennell, W.: An agent architecture for vehicle routing problems. In: Proceedings of the 2001 ACM Symposium on Applied Computing (SAC 2001), pp. 517–521. ACM Press, New York (2001)

    Google Scholar 

  21. Kohout, R., Erol, K.: In-Time agent-based vehicle routing with a stochastic improvement heuristic. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence (AAAI 1999/IAAI 1999), pp. 864–869. AAAI Press, Menlo Park (1999)

    Google Scholar 

  22. Fischer, K., Muller, J., Pischel, M., Schier, D.: A model for cooperative transportation scheduling. In: Lesser, V.R., Gasser, L. (eds.) Proceedings of the First International Conference on Multiagent Systems (ICMAS 1995), pp. 109–116. AAAI Press / MIT Press, Menlo Park, CA, USA (1995)

    Google Scholar 

  23. Smith, R.G.: The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Trans. on Comp. C-29, 1104–1113 (1980)

    CrossRef  Google Scholar 

  24. Zeddini, B.: Modèles d’Auto-Organisation Multi-Agent pour le problème du transport à la demande. PhD thesis, University of le Havre, Le Havre (France), 164 pages (2009) (in french)

    Google Scholar 

  25. Dial, R.B.: Autonomous dial-a-ride transit introductory overview. Transportation Research Part C: Emerging Technologies 3, 261–275(15) (1995)

    CrossRef  Google Scholar 

  26. Zargayouna, M.: Modèle et langage de coordination pour les systèmes multi-agents ouverts. Application au problème du transport à la demande. PhD thesis, University of Paris-Dauphine, Paris (France), 165 pages (2007) (in french)

    Google Scholar 

  27. Gendreau, M., Guertin, F., Potvin, J.Y., Taillard, E.D.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33, 381–390 (1999)

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zargayouna, M., Zeddini, B. (2012). Fleet Organization Models for Online Vehicle Routing Problems. In: Nguyen, N.T. (eds) Transactions on Computational Collective Intelligence VII. Lecture Notes in Computer Science, vol 7270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32066-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32066-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32065-1

  • Online ISBN: 978-3-642-32066-8

  • eBook Packages: Computer ScienceComputer Science (R0)