Summary
In this paper we analyze the Dynamic Multi-Period Routing Problem (DMPRP), where a fleet of uncapacitated vehicles has to satisfy customers’ pick-up requests. The service of each customer can take place the day the request is issued or the day after. At the beginning of a day a set of requests are already known and have to be served during the day. Additional requests may arrive during the day while the vehicles are traveling. In this context we perform different types of analysis, each one characterized by the comparison of alternative management policies. The first analysis compares a policy which decides, at the time the request is issued, whether to accept or reject it to a policy that accepts all the requests and decides, at a later time, which ones to forward to a back-up service company. The second evaluates the advantages of a collaborative service policy where a fleet of vehicles is managed by a unique decision maker with respect to a policy where the same vehicles are managed independently. Finally, in the last analysis a policy where each new request is taken into account as soon as it is issued is compared to a policy where all the requests issued during a day are analyzed at the end of the day. Extensive computational results evaluating the number of lost requests and the distance traveled provide interesting insights.
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
E. Angelelli, N. Bianchessi, R. Mansini, and M.G. Speranza. Short term strategies for a dynamic multi-period routing problem. Quaderno di ricerca n. 278, Dipartimento Metodi Quantitativi, UniversitĂ degli Studi di Brescia, 2007, to appear on Transportation Research Part C.
E. Angelelli, M.W.P. Savelsbergh, and M.G. Speranza. Competitive analysis for dynamic multi-period uncapacitated routing problems. Networks, 49:308–317, 2007.
E. Angelelli, M.W.P. Savelsbergh, and M.G. Speranza. Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Operations Research Letters, 35:713–721, 2007.
M. Gendreau, F. Guertin, J-Y. Potvin, and E. Taillard. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science, 33:381–390, 1999.
G. Ghiani, F. Guerriero, G. Laporte, and R. Musmanno. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, 151:1–11, 2003.
S. Ichoua, M. Gendreau, and J-Y Potvin. Diversion issues in real-time vehicle dispatching. Transportation Science, 34:426–438, 2000.
O.B.G. Madsen, H.F. Ravn, and J.M. Rygaard. A heuristic algorithm for a dialride problem with time windows, multiple capacities and multiple objectives. Annals of Operations Research, 60:193–208, 1995.
S. Mitrović-Minić, R. Krishnamurti, and G. Laporte. The double-horizon heuristic for the dynamic pickup and delivery problem with time windows. Transportation Research Part B, 38:669–685, 2004.
S. Mitrović-Minić and G. Laporte. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B, 38:635–655, 2004.
H.N. Psaraftis. Dynamic vehicle routing: Status and prospects. Annals of Operations Research, 61:143–164, 1995.
H.N. Psaraftis. Dynamic vehicle routing problems. In B.L. Golden and A.A. Assad, editors, Vehicle Routing: Methods and Studies, pages 223–248. Elsevier Science, Amsterdam, 1998.
M.W.P. Savelsbergh and M. Sol. Drive: Dynamic routing of independent vehicles. Operations Research, 46:474–490, 1998.
J. Yang, P. Jaillet, and H. Mahmassani. Real-time multivehicle truckload pickup and delivery problems. Transportation Science, 38:135–148, 2004.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelelli, E., Bianchessi, N., Mansini, R., Speranza, M.G. (2009). Management Policies in a Dynamic Multi Period Routing Problem. In: Nunen, J., Speranza, M., Bertazzi, L. (eds) Innovations in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems, vol 619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92944-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-92944-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92943-7
Online ISBN: 978-3-540-92944-4
eBook Packages: Business and EconomicsBusiness and Management (R0)