The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty

References

• Adulyasak Y, Jaillet P (2015) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transportation Sci. 50(2):608–626.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
• Ascheur N, Fischetti M, Grötschel M (2001) Solving the asymmetric traveling salesman problem with time windows by branch-and-cut. Math. Programming Ser. A 90(May):475–506.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Christofides N (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming Ser. A 115(October):351–385.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2012) New state space relaxations for solving the traveling salesman problem with time windows. INFORMS J. Comput. 24(3):356–371.Link, Google Scholar
• Ben-Tal A, Nemirovski A (1999) Robust solutions to uncertain programs. Oper. Res. Lett. 25(1):1–13.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming Ser. A 88(September):411–424.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming Ser. B 98(September):49–71.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Chardy M, Klopfenstein O (2012) Handling uncertainties in vehicle routing problems through data preprocessing. Transportation Res. Part E: Logist. Transportation Rev. 48(3):667–683.Crossref, Google Scholar
• Chassein A, Dokka T, Goerigk M (2019) Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. 274(2):671–686.Crossref, Google Scholar
• Dalmeijer K, Spliet R (2018) A branch-and-cut algorithm for the time window assignment vehicle routing problem. Comput. Oper. Res. 89(January):140–152.Crossref, Google Scholar
• Dash S, Günlük O, Lodi A, Tramontani A (2010) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1):132–147.Link, Google Scholar
• da Silva RF, Urrutia S (2010) A general VNS heuristic for the traveling salesman problem with time windows. Discrete Optim. 7(4):203–211.Crossref, Google Scholar
• Gendreau M, Jabali O, Rei W (2016) 50th Anniversary invited article: Future research directions in stochastic vehicle routing. Transportation Sci. 50(4):1163–1173.Link, Google Scholar
• Gendreau M, Hertz A, Laporte G, Stan M (1998) A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. 46(3):330–335.Link, 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
• Han J, Lee C, Park S (2014) A robust scenario approach for the vehicle routing problem with uncertain travel times. Transportation Sci. 48(3):373–390.Link, Google Scholar
• Hu C, Lu J, Liu X, Zhang G (2018) Robust vehicle routing problem with hard time windows under demand and travel time uncertainty. Comput. Oper. Res. 94(June):139–153.Crossref, Google Scholar
• Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper. Res. 64(1):186–200.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(September):1294–1306.Crossref, Google Scholar
• Munari P, Moreno A, De La Vega J, Alem D, Gondzio J, Morabito R (2019) The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method. Transportation Sci. 53(4):1043–1066.Link, Google Scholar
• Ohlmann JW, Thomas BW (2007) A compressed-annealing heuristic for the traveling salesman problem with time windows. INFORMS J. Comput. 19(1):80–90.Link, Google Scholar
• Pessoa AA, Di Puglia Pugliese L, Guerriero F, Poss M (2015) Robust constrained shortest path problems under budgeted uncertainty. Networks 66(2):98–111.Crossref, Google Scholar
• Pessoa AA, Poss M, Sadykov R, Vanderbeck F (2018) Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Technical Report Cadernos do LOGIS 2018-1, Universidade Federal Fluminense, Rio de Janeiro, Brazil.Google Scholar
• Poss M (2013) Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(March):75–92.Google Scholar
• Poss M (2014) Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237(3):836–845.Crossref, Google Scholar
• Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Internat. J. Production Res. 54(1):215–231.Crossref, Google Scholar
• Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5):1154–1157.Link, Google Scholar
• Subramanyam A, Repoussis PP, Gounaris CE (2020) Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty. INFORMS J. Comput. ePub ahead of print January 16, https://doi.org/10.1287/ijc.2019.0923.Google Scholar
• Tadayon B, Smith JC (2015) Algorithms and complexity analysis for robust single-machine scheduling problems. J. Scheduling 18(December):575–592.Crossref, Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Ye M, Bartolini E, Schneider M (2020) A generalized variable neighborhood search heuristic for the robust traveling salesman problem. Working Paper DPO-2020-01, RWTH Aachen University, Aachen, Germany.Google Scholar
• Zhang Y, Baldacci R, Sim M, Tang J (2019) Routing optimization with time windows under uncertainty. Math. Programming Ser. A 175(May):263–305.Crossref, Google Scholar
• Zhang Y, Zhang Z, Lim A, Sim M (2020) Robust data-driven vehicle routing with time windows. Oper. Res. Forthcoming.Google Scholar