{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:55:52Z","timestamp":1776444952255,"version":"3.51.2"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71420107028"],"award-info":[{"award-number":["71420107028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1243-y","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T06:09:54Z","timestamp":1519366194000},"page":"263-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Routing optimization with time windows under uncertainty"],"prefix":"10.1007","volume":"175","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0938-5798","authenticated-orcid":false,"given":"Roberto","family":"Baldacci","sequence":"additional","affiliation":[]},{"given":"Melvyn","family":"Sim","sequence":"additional","affiliation":[]},{"given":"Jiafu","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"issue":"2","key":"1243_CR1","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/trsc.2014.0581","volume":"50","author":"Y Adulyasak","year":"2015","unstructured":"Adulyasak, Y., Jaillet, P.: Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp. Sci. 50(2), 608\u2013626 (2015)","journal-title":"Transp. Sci."},{"key":"1243_CR2","doi-asserted-by":"crossref","unstructured":"Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: Layered formulation for the robust vehicle routing problem with time windows. In: Lecture Notes in Computer Science. Springer, pp. 249\u2013260 (2012)","DOI":"10.1007\/978-3-642-32147-4_23"},{"issue":"3","key":"1243_CR3","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.cor.2012.10.002","volume":"40","author":"A Agra","year":"2013","unstructured":"Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3), 856\u2013866 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1243_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N Ascheuer","year":"2001","unstructured":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Program. 90(3), 475\u2013506 (2001)","journal-title":"Math. Program."},{"issue":"5","key":"1243_CR5","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1086\/591947","volume":"116","author":"RJ Aumann","year":"2008","unstructured":"Aumann, R.J., Serrano, R.: An economic index of riskiness. J. Polit. Econ. 116(5), 810\u2013836 (2008)","journal-title":"J. Polit. Econ."},{"issue":"3","key":"1243_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10287-009-0118-3","volume":"7","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A., Roberti, R.: An exact solution framework for a broad class of vehicle routing problems. Comput. Manag. Sci. 7(3), 229\u2013268 (2010)","journal-title":"Comput. Manag. Sci."},{"issue":"1","key":"1243_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1), 1\u20136 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1243_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2. SIAM, Philadelphia (2001)"},{"issue":"1\u20133","key":"1243_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1\u20133), 49\u201371 (2003)","journal-title":"Math. Program."},{"key":"1243_CR10","unstructured":"Bertsimas, D., Sim, M., Zhang, M.: A practically efficient approach for solving adaptive distributionally robust linear optimization problems. Manag. Sci. (2017, Forthcoming)"},{"issue":"1","key":"1243_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/mnsc.1080.0929","volume":"55","author":"DB Brown","year":"2009","unstructured":"Brown, D.B., Sim, M.: Satisficing measures for analysis of risky positions. Manag. Sci. 55(1), 71\u201384 (2009)","journal-title":"Manag. Sci."},{"issue":"1","key":"1243_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance-constrained programming. Manag. Sci. 6(1), 73\u201379 (1959)","journal-title":"Manag. Sci."},{"issue":"1","key":"1243_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0605004","volume":"5","author":"A Claus","year":"1984","unstructured":"Claus, A.: A new formulation for the travelling salesman problem. SIAM J. Algebr. Discrete Methods 5(1), 21\u201325 (1984)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"1243_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"1","key":"1243_CR15","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1287\/ijoc.1100.0432","volume":"24","author":"S Dash","year":"2012","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A., Tramontani, A.: A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1), 132\u2013147 (2012)","journal-title":"INFORMS J. Comput."},{"key":"1243_CR16","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Madsen, O.B., Ropke, S.: Chapter 5: The vehicle routing problem with time windows. In: Vehicle Routing: Problems, Methods, and Applications, 2nd edn. Society for Industrial & Applied Mathematics (SIAM), pp. 119\u2013159 (2014)","DOI":"10.1137\/1.9781611973594.ch5"},{"issue":"1","key":"1243_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2015.07.027","volume":"249","author":"F Errico","year":"2016","unstructured":"Errico, F., Desaulniers, G., Gendreau, M., Rei, W., Rousseau, L.M.: A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur. J. Oper. Res. 249(1), 55\u201366 (2016a)","journal-title":"Eur. J. Oper. Res."},{"key":"1243_CR18","doi-asserted-by":"crossref","unstructured":"Errico, F., Desaulniers, G., Gendreau, M., Rei, W., Rousseau, L.M.: The vehicle routing problem with hard time windows and stochastic service times. Eur. J. Transp. Logist. 1\u201329 (2016)","DOI":"10.1016\/j.ejor.2015.07.027"},{"issue":"3","key":"1243_CR19","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1287\/opre.45.3.488","volume":"45","author":"ML Fisher","year":"1997","unstructured":"Fisher, M.L., J\u00f6rnsten, K.O., Madsen, O.B.: Vehicle routing with time windows: two optimization algorithms. Oper. Res. 45(3), 488\u2013492 (1997)","journal-title":"Oper. Res."},{"key":"1243_CR20","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Jabali, O., Rei, W.: Chapter 8: Stochastic vehicle routing problems. In: MOS-SIAM Series on Optimization, Society for Industrial and Applied Mathematics, pp. 213\u2013239 (2014)","DOI":"10.1137\/1.9781611973594.ch8"},{"issue":"3","key":"1243_CR21","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/opre.1120.1136","volume":"61","author":"CE Gounaris","year":"2013","unstructured":"Gounaris, C.E., Wiesemann, W., Floudas, C.A.: The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3), 677\u2013693 (2013)","journal-title":"Oper. Res."},{"issue":"9","key":"1243_CR22","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1080\/07408170802165880","volume":"40","author":"D Gupta","year":"2008","unstructured":"Gupta, D., Denton, B.: Appointment scheduling in health care: challenges and opportunities. IIE Trans. 40(9), 800\u2013819 (2008)","journal-title":"IIE Trans."},{"issue":"1","key":"1243_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02868641","volume":"14","author":"K Isii","year":"1962","unstructured":"Isii, K.: On sharpness of tchebycheff-type inequalities. Ann. Inst. Stat. Math. 14(1), 185\u2013197 (1962)","journal-title":"Ann. Inst. Stat. Math."},{"issue":"1","key":"1243_CR24","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1287\/opre.2015.1462","volume":"64","author":"P Jaillet","year":"2016","unstructured":"Jaillet, P., Qi, J., Sim, M.: Routing optimization under uncertainty. Oper. Res. 64(1), 186\u2013200 (2016)","journal-title":"Oper. Res."},{"issue":"6","key":"1243_CR25","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1287\/opre.26.6.1033","volume":"26","author":"EPC Kao","year":"1978","unstructured":"Kao, E.P.C.: A preference order dynamic program for a stochastic traveling salesman problem. Oper. Res. 26(6), 1033\u20131045 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"1243_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/trsc.37.1.69.12820","volume":"37","author":"AS Kenyon","year":"2003","unstructured":"Kenyon, A.S., Morton, D.P.: Stochastic vehicle routing with random travel times. Transp. Sci. 37(1), 69\u201382 (2003)","journal-title":"Transp. Sci."},{"issue":"4","key":"1243_CR27","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009)","journal-title":"Transp. Sci."},{"issue":"3","key":"1243_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G Laporte","year":"1992","unstructured":"Laporte, G., Louveaux, F., Mercure, H.: The vehicle routing problem with stochastic travel times. Transp. Sci. 26(3), 161\u2013170 (1992)","journal-title":"Transp. Sci."},{"issue":"9","key":"1243_CR29","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1057\/jors.2011.136","volume":"63","author":"C Lee","year":"2011","unstructured":"Lee, C., Lee, K., Park, S.: Robust vehicle routing problem with deadlines and travel time\/demand uncertainty. J. Oper. Res. Soc. 63(9), 1294\u20131306 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"1243_CR30","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17(4), 969\u2013996 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1243_CR31","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin, D., Contardo, C., Desaulniers, G., Uchoa, E.: New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J. Comput. 29(3), 489\u2013502 (2017a)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1243_CR32","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin, D., Pessoa, A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. Math. Program. Comput. 9(1), 61\u2013100 (2017b)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1243_CR33","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/opre.1060.0353","volume":"55","author":"I Popescu","year":"2007","unstructured":"Popescu, I.: Robust mean-covariance solutions for stochastic optimization. Oper. Res. 55(1), 98\u2013112 (2007)","journal-title":"Oper. Res."},{"issue":"2","key":"1243_CR34","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/mnsc.2015.2353","volume":"63","author":"J Qi","year":"2016","unstructured":"Qi, J.: Mitigating delays and unfairness in appointment systems. Manag. Sci. 63(2), 566\u2013583 (2016)","journal-title":"Manag. Sci."},{"key":"1243_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000)","journal-title":"J. Risk"},{"key":"1243_CR36","unstructured":"Scarf, H., Arrow, K., Karlin, S.: A min\u2013max solution of an inventory problem. In: Studies in the Mathematical Theory of Inventory and Production, vol. 10, pp. 201\u2013209 (1958)"},{"issue":"3","key":"1243_CR37","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.1090.0746","volume":"58","author":"CT See","year":"2010","unstructured":"See, C.T., Sim, M.: Robust approximation to multiperiod inventory management. Oper. Res. 58(3), 583\u2013594 (2010)","journal-title":"Oper. Res."},{"issue":"6","key":"1243_CR38","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1287\/opre.29.6.1234","volume":"29","author":"M Sniedovich","year":"1981","unstructured":"Sniedovich, M.: Technical note\u2014analysis of a preference order traveling salesman problem. Oper. Res. 29(6), 1234\u20131237 (1981)","journal-title":"Oper. Res."},{"issue":"3","key":"1243_CR39","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.ejor.2013.05.024","volume":"236","author":"D Ta\u015f","year":"2014","unstructured":"Ta\u015f, D., Gendreau, M., Dellaert, N., van Woensel, T., de Kok, A.: Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236(3), 789\u2013799 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1243_CR40","volume-title":"Vehicle Routing: Problems, Methods, and Applications","year":"2014","unstructured":"Toth, P., Vigo, D. (eds.): Vehicle Routing: Problems, Methods, and Applications, 2nd edn. Society for Industrial & Applied Mathematics (SIAM), Philadelphia (2014)","edition":"2"},{"key":"1243_CR41","doi-asserted-by":"crossref","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and decomposition of integer programs. In: 50 Years of Integer Programming 1958\u20132008, pp. 431\u2013502 (2010)","DOI":"10.1007\/978-3-540-68279-0_13"},{"issue":"2\u20133","key":"1243_CR42","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24(2\u20133), 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"1243_CR43","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1287\/opre.2014.1314","volume":"62","author":"W Wiesemann","year":"2014","unstructured":"Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358\u20131376 (2014)","journal-title":"Oper. Res."},{"key":"1243_CR44","unstructured":"Xin, L., Goldberg, D.A., Shapiro, A.: Time (in) consistency of multistage distributionally robust inventory models with moment constraints. arXiv preprint \n                    arXiv:1304.3074\n                    \n                   (2013)"},{"key":"1243_CR45","doi-asserted-by":"crossref","unstructured":"Zhen, J., den Hertog, D., Sim, M.: Adjustable robust optimization via Fourier\u2013Motzkin elimination. Oper. Res. (2017, Forthcoming)","DOI":"10.1287\/opre.2017.1714"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1243-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,19]],"date-time":"2020-01-19T00:07:29Z","timestamp":1579392449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1243-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1243"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1243-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"14 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}