Advertisement

Planned Route Optimization For Real-Time Vehicle Routing

  • Soumia Ichoua1
  • Michel Gendreau
  • Jean-Yves Potvin
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 38)

Abstract

This paper reviews and classifies the work done in the field of dynamic vehicle routing. We focus, in particular, on problems where the uncertainty comes from the occurrence of new requests. Problem-solving approaches are investigated in contexts where consolidation of multiple requests onto the same vehicle is allowed and addressed through the design of planned routes. Starting with pure myopic approaches, we then review in later sections the issues of diversion and anticipation of future requests

Keywords

real-time vehicle routing planned routes diversion anticipation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. Angelelli, E., Mansini, R., and Speranza, M. G., 2004, A real-time vehicle routing model for a courier service problem, in: Distribution Logistics: Advanced Solutions to Practical Problems, Lecture Notes in Economics and Mathematical Systems 544, B. Fleischmann and A. Klose, eds., Springer, Berlin, pp. 87-104.Google Scholar
  2. Attanasio, A., Cordeau, J.-F., Ghiani, G., and Laporte, G., 2004, Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem, Parallel Computing 30: 377-387.CrossRefGoogle Scholar
  3. Bausch, D. O., Brown, G., and Ronen, D., 1995, Consolidating and dispatching truck shipments of heavy petroleum products, Interfaces 25: 1-17.Google Scholar
  4. Bell, W., Dalberto, L., Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Mack, R., and Prutzman, P., 1983, Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces 13: 4–23.Google Scholar
  5. Bent, R., and Van Hentenryck, P., 2004, Scenario-based planning for partially dynamic vehicle routing with stochastic customers, Operations Research 52: 977-987.CrossRefGoogle Scholar
  6. Bent, R., and Van Hentenryck, P., 2003, Dynamic vehicle routing with stochastic requests, Technical Report CS-03-10, Department of Computer Science, Brown University, Providence, U.S.A.Google Scholar
  7. Bertsimas, D. J., and Van Ryzin, G., 1991, A stochastic and dynamic vehicle routing problem in the Euclidean plane, Operations Research 39: 601-615.Google Scholar
  8. Bertsimas, D. J., and Van Ryzin, G., 1993, Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles, Operations Research 41: 60-76.Google Scholar
  9. Branke, J., Middendorf, M., Noeth, G., and Dessouky, M., 2005, Waiting strategies for dynamic vehicle routing, Transportation Science 39: 298-312.CrossRefGoogle Scholar
  10. Brown G., Ellis, C., Graves, G., and Ronen, D., 1987, Real time wide area dispatch of Mobil tank trucks”, Interfaces 17: 107-120.Google Scholar
  11. Caramia, M., Italiano, G. F., Oriolo, G., Pacifici, A., and Perugia, A., 2002, Routing a fleet of vehicles for dynamic combined pick-up and delivery services, in: Operations Research Proceedings 2001, P. Chamoni, R. Leisten, A. Martin, J. Minnemann and H. Stadtler, eds., Springer, Berlin, pp. 3-8.Google Scholar
  12. Cordeau, J.-F., and Laporte, G., 2003, A tabu search for the static multi-vehicle dial-a-ride problem, Transportation Research B 37: 579-594.CrossRefGoogle Scholar
  13. Cordeau, J.-F., Laporte, G., Potvin, J.-Y., and Savelsbergh, M. W. P., 2004, Transportation on demand, Technical Report CRT-2004-25, Centre de recherche sur les transports, Montreal, Canada, 2004 (forthcoming in: Transportation, Handbooks in Operations Research and Management Science, C. Barnhart and G. Laporte, eds., North-Holland, Amsterdam).Google Scholar
  14. Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F., 1995, Time constrained routing and scheduling, in: Network Routing, Handbooks in Operations Research and Management Science 8, M. O. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser, eds., North-Holland, Amsterdam, pp. 35-140.Google Scholar
  15. Fisher, M. L., Greenfield, A. J., Jaikumar R., and Kedia, P., 1982, Real-time scheduling of a bulk-delivery fleet: Practical application of a Lagrangian relaxation, Report 82-10-11, Decision Sciences Department, University of Pennsylvania, Philadelphia, U.S.A.Google Scholar
  16. Gambardella, L. M., Rizzoli, A. E., Oliverio, F., Casagrande, N., Donati, A. V., Montemanni, R., and Lucibello, E., 2003, Ant colony optimization for vehicle routing in advanced logistic systems, in: International Workshop on Modelling and Applied Simulation, Bergeggi, Italy, pp. 3-9.Google Scholar
  17. Gendreau, M., Guertin, F., Potvin, J.-Y., and Séguin, R., 1998, Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries, Technical Report CRT-98-10, Centre de recherche sur les transports, Montreal, Canada (forthcoming in Transportation Research C).Google Scholar
  18. Gendreau, M., Guertin, F., Potvin, J.-Y., and Taillard, É. D., 1999, Parallel tabu search for real-time vehicle routing and dispatching, Transportation Science 33: 381-390.Google Scholar
  19. Gendreau, M., and Potvin, J.-Y., 1998, Dynamic vehicle routing and dispatching, in: Fleet Management and Logistics, T. G. Crainic and G. Laporte, eds., Kluwer, Boston, pp. 115-126.Google Scholar
  20. Gendreau, M., and Potvin, J.-Y., eds., 2004, Transportation Science 38: 397-487 (special issue on real-time fleet management).Google Scholar
  21. Ghiani, G., Guerriero, F., Laporte, G., and Musmanno, R., 2003, Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies, European Journal of Operational Research 151: 1-11.CrossRefGoogle Scholar
  22. Glover, F., 1996, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Applied Mathematics 65: 223-253.CrossRefGoogle Scholar
  23. Ichoua, S., Gendreau, M., and Potvin, J.-Y., 2000, Diversion issues in real-time vehicle dispatching, Transportation Science 34: 426-438.CrossRefGoogle Scholar
  24. Ichoua, S., 2001, Problèmes de gestion de flottes de véhicules en temps réel, Ph.D. Thesis, Département d’informatique et de recherche opérationnelle, Université de Montréal, Montreal, Canada.Google Scholar
  25. Ichoua, S., Gendreau, M., and Potvin, J.-Y., 2006, Exploiting knowledge about future demands for real-time vehicle dispatching, Transportation Science 40: 211-225.CrossRefGoogle Scholar
  26. Kilby, P., Prosser, P., and Shaw, P., 1998, Dynamic VRPs: A study of scenarios, Technical Report APES-06-1998, University of Strathclyde, Glasgow, UK.Google Scholar
  27. Krumke, S. O., Rambau, J., and Torres, L. M., 2002, Real-time dispatching of guided and unguided automobile service units with soft time windows, in: Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 2461, pp. 637-648.Google Scholar
  28. Larsen, A., 2000, The dynamic vehicle routing problem, Ph.D. Thesis, Report IMM-PHD-2000-73, Department of Mathematical Modeling, Technical University of Denmark, Lyngby, Denmark.Google Scholar
  29. Larsen, A., Madsen, O. B. G., and Solomon, M. M., 2002, Partially dynamic vehicle routing – Models and algorithms, Journal of the Operational Research Society 53: 637-646.CrossRefGoogle Scholar
  30. Madsen, O. B .G., Ravn, H. F., and Rygaard, J. M., 1995a, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Annals of Operations Research 60: 193-208.CrossRefGoogle Scholar
  31. Madsen, O. B. G., Tosti, K., and Vaelds, J., 1995b, A heuristic method for dispatching repair men, Annals of Operations Research 61: 213-226.CrossRefGoogle Scholar
  32. Mitrović-Minić S., and Laporte, G., 2004, Waiting strategies for the dynamic pickup and delivery problem with time windows, Transportation Research B 38: 635‐655.CrossRefGoogle Scholar
  33. Mitrović-Minić S., Krishnamurti, R., and Laporte, G., 2004, Double-horizon based heuristics for the dynamic pickup and delivery Problem with time windows, Transportation Research B 38: 669-685.CrossRefGoogle Scholar
  34. Montemanni, R., Gambardella, L. M., Rizzoli, A. E, and Donati, A. V., 2005, Ant colony system for a dynamic vehicle routing problem, Journal of Combinatorial Optimization 10: 327-343.CrossRefGoogle Scholar
  35. Powell, W. B., Jaillet, P. and Odoni, A. R., 1995, Stochastic and dynamic networks and routing, in: Network Routing, Handbooks in Operations Research and Management Science 8, M. O. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser, eds., Elsevier, Amsterdam, pp. 141-295.Google Scholar
  36. Psaraftis, H. N., 1995, Dynamic vehicle routing: Status and prospects, Annals of Operations Research 61:143-164.CrossRefGoogle Scholar
  37. Psaraftis, H. N., 1988, Dynamic vehicle routing problems, in: Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad, eds., North-Holland, Amsterdam, pp. 223-248.Google Scholar
  38. Psaraftis, H. N., 1983, An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows, Transportation Science 17: 351-357.CrossRefGoogle Scholar
  39. Psaraftis, H. N., 1980, A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science 14: 130-154.Google Scholar
  40. Psaraftis, H. N., Orlin, J. B, Bienstock, D., and Thompson, P. M., 1985, Analysis and solution algorithms of sealift routing and scheduling problems: Final report, Working Paper 1700-85, Sloan School of Management, MIT, Cambridge, U.S.A.Google Scholar
  41. Regan, A. C., Mahmassani, H. S., and Jaillet, P., 1995, Improving efficiency of commercial vehicle operations using real-time information: Potential uses and assignment strategies, Transportation Research Record 1493: 188-197.Google Scholar
  42. Rivard, R., 1981, Construction des parcours des véhicules et des horaires des chauffeurs pour le transport des personnes handicapées, Technical Report CRT-240, Centre de recherche sur les transports, Montreal, Canada.Google Scholar
  43. Rochat, Y., and Taillard, É. D., 1995, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1: 147-167.CrossRefGoogle Scholar
  44. Rousseau, J.-M., and Roy, S., 1988, RAO - Répartition assistée par ordinateur: La description du prototype, Technical Report CRT-564, Centre de recherche sur les transports, Montreal, Canada.Google Scholar
  45. Roy, S., Rousseau, J.-M., Lapalme, G., and Ferland, J. A., 1984, Routing and scheduling for the transportation of disabled persons: The algorithm, Technical Report CRT-412, Centre de recherche sur les transports, Montreal, Canada.Google Scholar
  46. Savelsbergh, M., and Sol, M., 1998, DRIVE: Dynamic routing of independent vehicles, Operations Research 46: 474-490.Google Scholar
  47. Séguin, R., Potvin, J.-Y., Gendreau, M., Crainic, T. G., and Marcotte, P., 1997, Real-time decision problems: An operational research perspective, Journal of the Operational Research Society 48: 162-174.CrossRefGoogle Scholar
  48. Swihart, M. R., and Papastavrou, J. D., 1999, A stochastic and dynamic model for the single-vehicle pick-up and delivery Problem, European Journal of Operational Research 114: 447-464.CrossRefGoogle Scholar
  49. Van Hemert, J. I., and La Poutré, J. A., 2004, Dynamic routing problems with fruitful regions: Models and evolutionary computation, in: Parallel Problem Solving from Nature VIII, X. Yao, E. K. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós, J. A. Bullinaria, J. Rowe, P. Tiňo, A. Kabán, and H.-P. Schwefel, eds., Springer, Berlin, pp. 690-699, 2004.Google Scholar
  50. Wilson, N. H. M., and Colvin, N. H., 1977, Computer control of the Rochester dial-a-ride system, Technical Report R77-30, Department of Civil Engineering, MIT, Cambridge, U.S.A.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Soumia Ichoua1
    • 1
  • Michel Gendreau
    • 2
  • Jean-Yves Potvin
    • 2
  1. 1.Département d’opérations et systèmes de décisions and Centre de recherche sur lestechnologies de l’organisation réseauPavillon Palasis-Prince, Université LavalQuébecCanada
  2. 2.Département d’informatique et de recherche opérationnelle and Centre de recherche sur les transportsUniversité de MontréalMontréalCanada

Personalised recommendations