Abstract
This paper studies the vehicle routing problem with time windows where travel times are uncertain and belong to a predetermined polytope. The objective of the problem is to find a set of routes that services all nodes of the graph and that are feasible for all values of the travel times in the uncertainty polytope. The problem is motivated by maritime transportation where delays are frequent and must be taken into account. We present an extended formulation for the vehicle routing problem with time windows that allows us to apply the classical (static) robust programming approach to the problem. The formulation is based on a layered representation of the graph, which enables to track the position of each arc in its route. We test our formulation on a test bed composed of maritime transportation instances.
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.
Similar content being viewed by others
References
Ascheuer, N., Fischetti, M., Grötschel, M.: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2), 69–79 (2000)
Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36, 250–269 (2002)
Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust optimization. Princeton University Press (2009)
Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Operations Research Letters 25, 1–13 (1999)
Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Review 53, 464–501 (2011)
Bertsimas, D., Sim, M.: The price of robustness. Operations Research 52, 35–53 (2004)
Chardy, M., Klopfenstein, O.: Handling uncertainties in vehicle routing problems through data preprocessing. Transportation Research Part E: Logistics and Transportation Review 48(3), 667–683 (2012)
Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime Transportation. In: Handbooks in Operations Research and Management Science, vol. 14, pp. 150–168. Elsevier Science Publishers, North-Holland (2007)
Desaulniers, G., Desrosiers, J., Spoorendonk, S.: The Vehicle Routing Problem with Time Windows: State-of-the-Art Exact Solution Methods. John Wiley & Sons, Inc. (2010)
Godinho, M.T., Gouveia, L., Magnanti, T.L.: Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optimization 5(2), 350–372 (2008)
Golden, B., Raghavan, S., Wasil, E.A.: The vehicle routing problem: latest advances and new challenges. Operations Research/Computer Science Interfaces Series, vol. 43. Springer (2008)
Gouveia, L.: Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J. on Computing 10, 180–188 (1998)
Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Computers & OR 35(7), 2307–2330 (2008)
Kallehauge, B., Boland, N., Madsen, O.B.G.: Path inequalities for the vehicle routing problem with time windows. Networks 49(4), 273–293 (2007)
Kallehauge, B., Larsen, J., Madsen, O.B.G., Solomon, M.M.: Vehicle routing problem with time window. In: Column Generation. Springer (2005)
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7, 326–329 (1960)
Ordónez, F.: Robust vehicle routing. TUTORIALS in Oprations Research, 153–178 (2010)
Russell, R., Urban, T.: Vehicle routing with soft time windows and erlang travel times. Journal of the Operational Research Society 59, 1220–1228 (2008)
Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research 21, 1154–1157 (1973)
Suite, F.X.O.: Xpress-Optimizer reference manual. Tech. Rep. Release 22.01 (2011)
Sungur, I., Ordóñez, F., Dessouky, M.: A robust optimization approach for the capacitated vehicle routing. IIE Transactions 40(5), 509–523 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agra, A., Christiansen, M., Figueiredo, R., Magnus Hvattum, L., Poss, M., Requejo, C. (2012). Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-32147-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32146-7
Online ISBN: 978-3-642-32147-4
eBook Packages: Computer ScienceComputer Science (R0)