Summary
This chapter is motivated by the study of a real-world application on blood delivery. The Austrian Red Cross (ARC), a non-profit organization, is in charge of delivering blood to hospitals on their request. To reduce their operating costs through higher flexibility, the ARC is interested in changing the policy of delivering blood products. Therefore it wants to provide two different types of service: an urgent service which delivers the blood within one day and the other, regular service, within two days. Obviously the two services come at different prices.
We formalize this problem as a stochastic problem, with the objective to minimize the average long-run delivery costs, knowing the probabilities governing the requests of service. To solve real instances of our problem in a reasonable time, we propose three heuristic procedures whose core routine is an Ant Colony Optimization (ACO) algorithm, which differ from each other by the rule implemented to select the regular blood orders to serve immediately. We compare the three heuristics on both a set of real-world data and on a set of randomly generated synthetic data.
Computational results show the viability of our approach.
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
Andreatta, G., Lulli, G.: A multi-period TSP with stochastic regular and urgent demands. European Journal of Operational Research 185, 122–132 (2008)
Angelelli, E., Savelsbergh, M.W.P., Speranza, M.G.: Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Operations Research Letters 35, 713–721 (2007)
Angelelli, E., Savelsbergh, M.W.P., Speranza, M.G.: Competitive analysis for dynamic multi-period uncapacitated routing problems. Networks 49, 308–317 (2005)
Bullnheimer, B., Hartl, R.F., Strauss, Ch.: A new rank based version of the ant system: A computational study. Central European Journal of Operations Research 7, 25–38 (1999)
Butler, M., Williams, H.P., Yarrow, L.A.: The two-period travelling salesman problem applied to milk collection in Ireland. Computational Optimization and Applications 7, 291–306 (1997)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)
Doerner, K.F., Gutjahr, W.J., Hartl, R.F., Lulli, G.: A probabilistic two-day delivery vehicle routing problem. In: The Fifth Symposium on Transportation Analysis (TRISTAN V), Preprints, Le Gosier, Guadeloupe, French West Indies, June 13–18 (2004)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Gendreau, M., Laporte, G., Seguin, R.: Stochastic vehicle routing. European Journal of Operational Research 88, 3–12 (1996)
Hemmelmayr, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P.: Delivery strategies for blood products supplies. OR Spectrum (to appear, 2008)
Powell, W.B., Jaillet, P., Odoni, A.R.: Stochastic and dynamic networks and routing. In: Ball, M.O., et al. (eds.) Handbook in Operations Research and Management Science, vol. 8: Network Routing, pp. 141–296. Elsevier, Amsterdam (1995)
Puterman, M.L.: Markov Decision Processes. Wiley, Chichester (1994)
Reimann, M., Stummer, M., Doerner, K.F.: A savings based ant system for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), July 2002, pp. 1317–1325. Morgan Kaufmann, San Francisco (2002)
Reimann, M., Doerner, K.F., Hartl, R.F.: D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31, 563–591 (2004)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Doerner, K.F., Gutjahr, W.J., Hartl, R.F., Lulli, G. (2008). Stochastic Local Search Procedures for the Probabilistic Two-Day Vehicle Routing Problem. In: Fink, A., Rothlauf, F. (eds) Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management. Studies in Computational Intelligence, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69390-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-69390-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69024-5
Online ISBN: 978-3-540-69390-1
eBook Packages: EngineeringEngineering (R0)