Abstract
Real-time decision problems are playing an increasingly important role in the economy due to advances in communication and information technologies that now allow realtime information to be quickly obtained and processed (Séguin et al., 1997). Among these, dynamic vehicle routing and dispatching problems have emerged as an intense area of research in the operations research community. Numerous examples may be found in Haines and Wolfe (1982), Powell, Jaillet and Odoni (1995) and Psaraftis (1995). In these problems, a set of vehicles is routed over a particular time horizon (typically, a day) while new service requests are occuring in real-time. With each new request, the current solution may be reconfigured to better service the new request, as well as those already assigned to a route.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Badeau P., M. Gendreau, F. Guertin, J.Y. Potvin and E.D. Taillard. (1997). A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Transportation Research, 5C:109–122.
Bausch D.O., G.G. Brown and D. Ronen. (1995). Consolidating and Dispatching Truck Shipments of Mobil Heavy Petroleum Products. Interfaces, 25:1–17.
Bell, W., L.M. Dalberto, M.L. Fisher, A.J. Greenfield, R. Jaikumar, P. Kedia, R.G. Mack and P.J. Prutzman. (1983). Improving the Distribution of Industrial Gases with an Online Computerized Routing and Scheduling Optimizer. Interfaces, 13: 4–23.
Bertsimas, D.J. and G. Van Ryzin. (1991). A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Operations Research, 39:601–615.
Bertsimas, D.J. and G. Van Ryzin. (1993). Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane with Multiple Capacitated Vehicles. Operations Research, 41:60–76.
Brown, G.G. and G.W. Graves. (1981). Real-Time Dispatch of Petroleum Tank Trucks. Management Science, 31:764–772.
Brown, G.G., C.J. Ellis, G.W. Graves and D. Ronen. (1987). Real-Time Wide Area Dispatching of Mobil Tank Trucks. Interfaces, 17:107–120.
Dror, M., M. Ball and B.L. Golden. (1986). A Computational Comparison of Algorithms for the Inventory Routing Problem. Annals of Operations Research, 4:3–23.
Dror, M. and W.B. Powell, editors. (1993). Special Issue on Stochastic and Dynamic Models in Transportation. Operations Research, 41:1–235.
Federgruen, A. and D. Simchi-Levi. (1995). Analysis of Vehicle Routing and Inventory-Routing Problems. In M.O. Ball, T.L. Magnanti, C.L. Monmaand G.L. Nemhauser, editors, Network Routing, pages 297–373, North-Holland: Amsterdam.
Gendreau, M., F. Guertin, J.Y. Potvin and R. Séguin. (1998). Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-Ups and Deliveries. Report CRT-98-10, Centre de recherche sur les transports, Université de Montréal.
Gendreau, M., F. Guertin, J.Y. Potvin and E. Taillard. (1996). Tabu Search for Real-Time Vehicle Routing and Dispatching. Technical Report CRT-96-47, Centre de recherche sur les transports, Université de Montréal.
Glover, F. (1996). Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. Discrete Applied Mathematics, 65:223–253.
Haines, G.H. and R.N. Wolfe. (1982). Alternative Approaches to Demand Responsive Scheduling Algorithms. Transportation Research, 16A:43–54.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press: Ann Arbor.
Jaw, J.J., A.R. Odoni, H.N. Psaraftis and N.H.M. Wilson. (1986). A Heuristic Algorithm for the Multi-Vehicle Advance Request Dial-a-Ride Problem with Time Windows. Transportation Research, 20B:243–257.
Madsen, O.B.G., H.F. Ravn and J.M. Rygaard. (1995). A Heuristic Algorithm for a Dial-A-Ride Problem with Time Windows, Multiple Capacities and Multiple Objectives. Annals of Operations Research, 60:193–208.
Madsen, O.B.G., K. Tosti and J. Vœlds. (1995). A Heuristic Method for Dispatching Repair Men. Annals of Operations Research, 61:213–226.
Minkoff, A.S. (1993). A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching. Operations Research, 41:77–90.
Papastavrou, J.D. and M.R. Swihart. (1997). A Stochastic and Dynamic Model for the Single-Vehicle Pick-up and Delivery Problem. Working Paper, School of Industrial Engineering, Purdue University.
Powell, W.B. (1988). A Comparative Review of Alternative Algorithms for the Dynamic Vehicle Allocation Problem. In B.L. Golden and A.A. Assad, editors, Vehicle Routing: Methods and Studies, pages 297–373, North-Holland: Amsterdam.
Powell, W.B., P. Jaillet and A. Odoni. (1995). Stochastic and Dynamic Networks and Routing. In M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, editors, Network Routing, pages 141–295, North-Holland: Amsterdam.
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.
Psaraftis, H.N. (1988). Dynamic Vehicle Routing Problems. In B.L. Golden and A.A. Assad, editors, Vehicle Routing: Methods and Studies, pages 223–248, North-Holland: Amsterdam.
Psaraftis, H.N. (1995). Dynamic Vehicle Routing: Status and Prospects. Annals of Operations Research, 61:143–164.
Rego, C. and C. Roucairol. (1996). A Parallel Tabu Search Algorithm using Ejection Chains for the Vehicle Routing Problem. In I.H. Osman and J.P. Kelly, editors, Meta-Heuristics: Theory and Applications, pages 223–248, Kluwer: Boston.
Rochat, Y. and E.D. Taillard. (1995). Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, 1:147–167.
Roy, S., J.M. Rousseau, G. Lapalme and J. Ferland. (1984). Routing and Scheduling of Transportation Services for the Disabled: Summary Report. Technical Report CRT-473A, Centre de recherche sur les transports, Université de Montréal.
Rumelhart, D.E. and J.L. McClelland. (1986). Parallel Distributed Processing: Explorations in the Micro structure of Cognition. The MIT Press: Cambridge, MA.
Séguin, R., J.Y. Potvin, M. Gendreau., T.G. Crainic and P. Marcotte. (1997). Real-Time Decision Problems: An Operational Research Perspective. Journal of the Operational Research Society, 48:162–174.
Shen, Y., J.Y. Potvin, J.M. Rousseau and S. Roy. (1995). A Computer Assistant for Vehicle Dispatching with Learning Capabilities. Annals of Operations Research, 61:189–211.
Solomon, M.M. (1987). Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254–265.
Taillard, E.D. (1993). Parallel Iterative Search Methods for Vehicle Routing Problems. Networks, 23:661–673.
Taillard, E.D., P. Badeau, M. Gendreau, F. Guertin and J.Y. Potvin. (1997). A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science, 31:170–186.
Thompson, P.M. and H.N. Psaraftis. (1993). Cyclic Transfer Algorithms for MultiVehicle Routing and Scheduling Problems. Operations Research, 41:935–946.
Wilson, N.H.M., J.M. Sussman, H.K. Wang and B.T. Higonnet. (1971). Scheduling Algorithms for Dial-a-Ride Systems. Urban Systems Laboratory Report USL TR-70-13, Massachusetts Institute of Technology.
Wilson, N.H.M. and H. Weissberg. (1976). Advanced Dial-A-Ride Algorithms Research Project: Final Report. Technical Report R-76-20, Department of Civil Engineering, Massachusetts Institute of Technology.
Wilson, N.H.M. and N.H. Colvin. (1977). Computer Control of the Rochester Dial-A-Ride System. Technical Report R-77-30, Department of Civil Engineering, Massachusetts Institute of Technology.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gendreau, M., Potvin, JY. (1998). Dynamic Vehicle Routing and Dispatching. In: Crainic, T.G., Laporte, G. (eds) Fleet Management and Logistics. Centre for Research on Transportation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5755-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5755-5_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7637-8
Online ISBN: 978-1-4615-5755-5
eBook Packages: Springer Book Archive