Abstract
The information needed to solve a vehicle routing problem may be not completely known ahead of time. Rather it may be dynamically revealed as time goes on. We consider a dynamic vehicle routing problem faced by a courier company where customer requests with service time windows arrive and have to be serviced on real time by a fleet of vehicles in movement. Differently from other dynamic routing problems motivated by the same courier service, we consider both pick-up and delivery requests and assume that customer requests cannot be refused but can be postponed to future shifts. A heuristic algorithm based on local search is proposed for the problem together with an illustrative example. Experimental analysis is in progress.
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
Bertsimas, D. /Van Ryzin, D. (1991): A stochastic and dynamic vehicle routing problem in the euclidean plane. Operations Research, 39:601–615.
Bertsimas, D. /Van Ryzin, D. (1993): Stochastic and dynamic vehicle routing in the euclidean plane with multiple capacitated vehicles. Operations Research, 41:60–76.
Gendreau, M. /Guertin, F. /Potvin, J. Y. /Taillard, E. (1999): Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33:381–390.
Gendreau, M. /Hertz, A. /Laporte, G. /Stan, M. (1998): A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research, 43:330–335.
Gendreau, M. /Potvin, J.Y. (1998): Dynamic vehicle routing and dispatching. In: T. G. Crainic and G. Laporte (eds.), Fleet Management and Logistics, Kluwer Academic Publishers, pp. 115–126.
Ghiani, G. / Guerriero, F. /Laporte, G. /Musmanno, R. 2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, 151:1–11.
Hertz, A. /Mittaz, M. (2001): A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science, 35:425–434.
Ichoua, S. /Gendreau, M. /Potvin, J.Y. (2000): Diversion issues in real-time vehicle dispatching. Transportation Science, 34:426–438.
Mladenovic, N. /Hansen P. (1997): Variable neighborhood search. Computers and Operations Research, 24:1097–1100.
Powell, W. (1988): A comparative review of alternative algorithms for the dynamic vehicle allocation problem. In: B. L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, North Holland, Amsterdam, pp. 249–291.
Psaraffcis, H. M. (1995): Dynamic vehicle routing: status and prospects. Annals of Operations Research, 61:143–164.
Savelsbergh, M. W. P. /Sol, M. (1998): DRIVE: dynamic routing of independent vehicles. Operations Research, 66:474–490.
Wolfler Calvo R. (2000): A new heuristic for the travelling salesman problem with time windows. Transportation Science, 34:113–124.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelelli, E., Mansini, R., Speranza, M.G. (2005). A Real-time Vehicle Routing Model for a Courier Service Problem. In: Fleischmann, B., Klose, A. (eds) Distribution Logistics. Lecture Notes in Economics and Mathematical Systems, vol 544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17020-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-17020-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22100-5
Online ISBN: 978-3-642-17020-1
eBook Packages: Business and EconomicsBusiness and Management (R0)