Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines

References

• Adulyasak Y, Cordeau J-F, Jans R (2013) Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103–120.Link, Google Scholar
• Agra A, Christiansen M, Figueiredo R, Hvattum LM, Poss M, Requejo C (2013) The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3):856–866.Crossref, Google Scholar
• Applegate D, Bixby R, Chvátal V, Cook W (2011) Concorde TSP solver. Accessed January 15, 2014, http://www.tsp.gatech.edu/concorde.html.Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Bertsimas DJ, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas DJ, Brown D, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Birge JR (1982) The value of the stochastic solution in stochastic linear programs with fixed recourse. Math. Programming 24(1):314–325.Crossref, Google Scholar
• Birge JR, Louveaux FV (2011) Two-stage recourse problems. Introduction to Stochastic Programming, Oper. Res. Financial Engrg. (Springer, New York), 181–263.Crossref, Google Scholar
• Brown DB, Sim M (2009) Satisficing measures for analysis of risky positions. Management Sci. 55(1):71–84.Link, Google Scholar
• Campbell AM, Thomas BW (2008) Probabilistic traveling salesman problem with deadlines. Transportation Sci. 42(1):1–21.Link, Google Scholar
• Campbell AM, Thomas BW (2009) Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Comput. Oper. Res. 36(4):1231–1248.Crossref, Google Scholar
• Carlsson JG, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper. Res. 61(3):727–744.Link, Google Scholar
• Fischetti M, Toth P, Vigo D (1994) A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Oper. Res. 42(5):846–859.Link, Google Scholar
• Fukasawa R, Longo H, Lysgaard J, de Aragão MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3):491–511.Crossref, Google Scholar
• Gendreau M, Laporte G, Séguin R (1996) Stochastic vehicle routing. Eur. J. Oper. Res. 88(1):3–12.Crossref, Google Scholar
• Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3):677–693.Link, Google Scholar
• Jaillet P (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6):929–936.Link, Google Scholar
• Jaillet P, Qi J, Sim M (2014) Routing optimization under uncertainty. Working paper, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21(1):123–136.Link, Google Scholar
• Kenyon SA, Morton DP (2003) Stochastic vehicle routing with random travel times. Transportation Sci. 37(1):69–82.Link, Google Scholar
• Lam S-W, Ng TS, Sim M, Song J-H (2013) Multiple objectives satisficing under uncertainty. Oper. Res. 61(1):214–227.Link, Google Scholar
• Lambert V, Laporte G, Louveaux F (1993) Designing collection routes through bank branches. Comput. Oper. Res. 20(7):783–791.Crossref, Google Scholar
• Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3):161–170.Link, Google Scholar
• Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time/demand uncertainty. J. Oper. Res. Soc. 63(9):1294–1306.Crossref, Google Scholar
• Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. Int. J. Prod. Econom. 125(1):137–145.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• Montemanni R, Barta J, Mastrolilli M, Gambardella LM (2007) The robust traveling salesman problem with interval data. Transportation Sci. 41(3):366–381.Link, Google Scholar
• Padberg M, Sung T-Y (1991) An analytical comparison of different formulations of the travelling salesman problem. Math. Programming 52(1–3):315–357.Crossref, Google Scholar
• Roberti R, Toth P (2012) Models and algorithms for the asymmetric traveling salesman problem: An experimental comparison. EURO J. Transportation Logist. 1(1–2):113–133.Crossref, Google Scholar
• Russell RA, Urban TL (2008) Vehicle routing with soft time windows and Erlang travel times. J. Oper. Res. Soc. 59(9):1220–1228.Crossref, Google Scholar
• Scarf H, Arrow KJ, Karlin S (1958) A min–max solution of an inventory problem. Stud. Math. Theory Inventory Production 10:201–209.Google Scholar
• Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Management Sci. 47(10):1396–1407.Link, Google Scholar
• Sungur I, Ren Y, Ordónez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44(2):193–205.Link, Google Scholar
• Taş D, Dellaert N, van Woensel T, de Kok T (2013) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40(1):214–224.Crossref, Google Scholar
• Toth P, Vigo D (2001) An overview of vehicle routing problems. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM, Philadelphia), 1–26.Google Scholar
• Tropp JA (2012) User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4):389–434.Crossref, Google Scholar
• Verweij B, Ahmed S, Kleywegt AJ, Nemhauser G, Shapiro A (2003) The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24(2–3):289–333.Crossref, Google Scholar