{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:46Z","timestamp":1759847566774,"version":"3.37.3"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T00:00:00Z","timestamp":1537833600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00186-018-0649-x","type":"journal-article","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T07:01:24Z","timestamp":1537858884000},"page":"281-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for non-linear and stochastic resource constrained shortest path"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-4947","authenticated-orcid":false,"given":"Axel","family":"Parmentier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,25]]},"reference":[{"key":"649_CR1","unstructured":"9th dimacs implementation challenge, shortest paths (2006). \n                    http:\/\/www.dis.uniroma1.it\/challenge9\/\n                    \n                  . Accessed 7 Dec 2016"},{"issue":"2","key":"649_CR2","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 (2015) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp Sci 50(2):608\u2013626","journal-title":"Transp Sci"},{"key":"649_CR3","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcroft JE (1974) The design and analysis of computer algorithms. Pearson Education India, Chennai"},{"issue":"3","key":"649_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner P, Delbaen F, Eber JM, Heath D (1999) Coherent measures of risk. Math Finance 9(3):203\u2013228","journal-title":"Math Finance"},{"issue":"2","key":"649_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"RC Backhouse","year":"1975","unstructured":"Backhouse RC, Carr\u00e9 BA (1975) Regular algebra applied to path-finding problems. IMA J Appl Math 15(2):161\u2013186","journal-title":"IMA J Appl Math"},{"key":"649_CR6","unstructured":"Bast H, Delling D, Goldberg A, M\u00fcller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck R (2014) Route planning in transportation networks"},{"issue":"4","key":"649_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J Beasley","year":"1989","unstructured":"Beasley J, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(4):379\u2013394","journal-title":"Networks"},{"key":"649_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman R (1958) On a routing problem. Q Appl Math 16:87\u201390","journal-title":"Q Appl Math"},{"issue":"3","key":"649_CR9","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"DJ Bertsimas","year":"1992","unstructured":"Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper Res 40(3):574\u2013585","journal-title":"Oper Res"},{"issue":"2","key":"649_CR10","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"DJ Bertsimas","year":"1996","unstructured":"Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper Res 44(2):286\u2013304","journal-title":"Oper Res"},{"key":"649_CR11","volume-title":"Lattices and ordered algebraic structures","author":"TS Blyth","year":"2005","unstructured":"Blyth TS (2005) Lattices and ordered algebraic structures, vol 1. Springer, Berlin"},{"key":"649_CR12","unstructured":"Bogerding M (2013) Kissfft library. \n                    http:\/\/sourceforge.net\/projects\/kissfft\/\n                    \n                  . Accessed 16 Feb 2017"},{"key":"649_CR13","unstructured":"Bornd\u00f6rfer R, Gr\u00f6tschel M, L\u00f6bel A (2001) Scheduling duties by adaptive column generation. Technischer Bericht 01\u201302, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (ZIB), Berlin. \n                    http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.28.5053"},{"issue":"4","key":"649_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/net.20247","volume":"52","author":"WM Carlyle","year":"2008","unstructured":"Carlyle WM, Royset JO, Kevin Wood R (2008) Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4):256\u2013270","journal-title":"Networks"},{"issue":"3","key":"649_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","volume":"7","author":"BA Carr\u00e9","year":"1971","unstructured":"Carr\u00e9 BA (1971) An algebra for network routing problems. IMA J Appl Math 7(3):273\u2013294","journal-title":"IMA J Appl Math"},{"issue":"3","key":"649_CR16","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","volume":"198","author":"TS Chang","year":"2009","unstructured":"Chang TS, Wan Y, Ooi WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur J Oper Res 198(3):748\u2013759","journal-title":"Eur J Oper Res"},{"issue":"1","key":"649_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/atr.5670390104","volume":"39","author":"A Chen","year":"2005","unstructured":"Chen A, Ji Z (2005) Path finding under uncertainty. J Adv Transp 39(1):19\u201337","journal-title":"J Adv Transp"},{"issue":"2","key":"649_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s11067-012-9175-1","volume":"13","author":"BY Chen","year":"2013","unstructured":"Chen BY, Lam WH, Sumalee A, Li Q, Shao H, Fang Z (2013) Finding reliable shortest paths in road networks under uncertainty. Netw Spat Econ 13(2):123\u2013148","journal-title":"Netw Spat Econ"},{"key":"649_CR19","doi-asserted-by":"crossref","unstructured":"Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on principles of programming languages. ACM, New York, pp 238\u2013252","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"649_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","volume":"82","author":"P Cousot","year":"1979","unstructured":"Cousot P, Cousot R (1979) Constructive versions of Tarski\u2019s fixed point theorems. Pac J Math 82(1):43\u201357","journal-title":"Pac J Math"},{"key":"649_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to lattices and order","author":"BA Davey","year":"2002","unstructured":"Davey BA, Priestley HA (2002) Introduction to lattices and order. Cambridge University Press, Cambridge"},{"issue":"1\u20134","key":"649_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1016075431943","volume":"108","author":"A Silva De","year":"2001","unstructured":"De Silva A (2001) Combining constraint programming and linear programming on an example of bus driver scheduling. Ann Oper Res 108(1\u20134):277\u2013291","journal-title":"Ann Oper Res"},{"issue":"3","key":"649_CR23","first-page":"191","volume":"26","author":"M Desrochers","year":"1988","unstructured":"Desrochers M, Soumis F (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR Inf Syst Oper Res 26(3):191\u2013212","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"1","key":"649_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"issue":"3","key":"649_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3):135\u2013153","journal-title":"Networks"},{"issue":"1","key":"649_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/trsc.19.1.75","volume":"19","author":"A Eiger","year":"1985","unstructured":"Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transp Sci 19(1):75\u201384","journal-title":"Transp Sci"},{"issue":"2","key":"649_CR27","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"issue":"1","key":"649_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1013613701606","volume":"8","author":"T Fahle","year":"2002","unstructured":"Fahle T, Junker U, Karisch SE, Kohl N, Sellmann M, Vaaben B (2002) Constraint programming based column generation for crew assignment. J Heuristics 8(1):59\u201381","journal-title":"J Heuristics"},{"issue":"3\u20134","key":"649_CR29","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11067-006-9287-6","volume":"6","author":"Y Fan","year":"2006","unstructured":"Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6(3\u20134):333\u2013344","journal-title":"Netw Spat Econ"},{"issue":"3","key":"649_CR30","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216\u2013229","journal-title":"Networks"},{"key":"649_CR31","volume-title":"A survey of sequential and systolic algorithms for the algebraic path problem","author":"E Fink","year":"1992","unstructured":"Fink E (1992) A survey of sequential and systolic algorithms for the algebraic path problem. University of Waterloo, Faculty of Mathematics"},{"key":"649_CR32","unstructured":"Flajolet A, Blandin S, Jaillet P (2014) Robust adaptive routing under uncertainty. arXiv preprint \n                    arXiv:1408.3374"},{"issue":"3","key":"649_CR33","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8(3):399\u2013404","journal-title":"Can J Math"},{"issue":"4","key":"649_CR34","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.17.4.583","volume":"17","author":"H Frank","year":"1969","unstructured":"Frank H (1969) Shortest paths in probabilistic graphs. Oper Res 17(4):583\u2013599","journal-title":"Oper Res"},{"issue":"8","key":"649_CR35","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/S0191-2615(00)00019-9","volume":"35","author":"L Fu","year":"2001","unstructured":"Fu L (2001) An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transp Res Part B Methodol 35(8):749\u2013765","journal-title":"Transp Res Part B Methodol"},{"issue":"7","key":"649_CR36","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","volume":"32","author":"L Fu","year":"1998","unstructured":"Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transp Res Part B Methodol 32(7):499\u2013516","journal-title":"Transp Res Part B Methodol"},{"key":"649_CR37","volume-title":"Graphs, dioids and semirings: new models and algorithms","author":"M Gondran","year":"2008","unstructured":"Gondran M, Minoux M (2008) Graphs, dioids and semirings: new models and algorithms, vol 41. Springer, Berlin"},{"issue":"3","key":"649_CR38","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/opre.1120.1136","volume":"61","author":"CE Gounaris","year":"2013","unstructured":"Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper Res 61(3):677\u2013693","journal-title":"Oper Res"},{"issue":"2","key":"649_CR39","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10288-009-0101-4","volume":"7","author":"S Gualandi","year":"2009","unstructured":"Gualandi S, Malucelli F (2009) Constraint programming-based column generation. 4OR 7(2):113\u2013137","journal-title":"4OR"},{"key":"649_CR40","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-33558-7_24","volume-title":"Principles and practice of constraint programming","author":"S Gualandi","year":"2012","unstructured":"Gualandi S, Malucelli F (2012) Resource constrained shortest paths with a super additive objective function. In: Milano M (ed) Principles and practice of constraint programming. Springer, Berlin, pp 299\u2013315"},{"issue":"3","key":"649_CR41","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1287\/trsc.20.3.182","volume":"20","author":"RW Hall","year":"1986","unstructured":"Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transp Sci 20(3):182\u2013188","journal-title":"Transp Sci"},{"issue":"4","key":"649_CR42","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"GY Handler","year":"1980","unstructured":"Handler GY, Zang I (1980) A dual algorithm for the constrained shortest path problem. Networks 10(4):293\u2013309","journal-title":"Networks"},{"issue":"2","key":"649_CR43","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"issue":"3","key":"649_CR44","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A","volume":"31","author":"I Ioachim","year":"1998","unstructured":"Ioachim I, Gelinas S, Soumis F, Desrosiers J (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31(3):193\u2013204","journal-title":"Networks"},{"issue":"1","key":"649_CR45","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","volume":"30","author":"S Irnich","year":"2008","unstructured":"Irnich S (2008) Resource extension functions: properties, inversion, and generalization to segments. OR Spectr 30(1):113\u2013148","journal-title":"OR Spectr"},{"key":"649_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Shortest path problems with resource constraints","author":"S Irnich","year":"2005","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Springer, Berlin"},{"issue":"3","key":"649_CR47","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S Irnich","year":"2006","unstructured":"Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k-cycle elimination for \n                    \n                      \n                    \n                    $$k \\ge 3$$\n                    \n                      \n                        \n                          k\n                          \u2265\n                          3\n                        \n                      \n                    \n                  . INFORMS J Comput 18(3):391\u2013406","journal-title":"INFORMS J Comput"},{"issue":"1","key":"649_CR48","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 (2016) Routing optimization under uncertainty. Oper Res 64(1):186\u2013200","journal-title":"Oper Res"},{"issue":"2","key":"649_CR49","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"HC Joksch","year":"1966","unstructured":"Joksch HC (1966) The shortest route problem with constraints. J Math Anal Appl 14(2):191\u2013197","journal-title":"J Math Anal Appl"},{"issue":"1","key":"649_CR50","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TITS.2006.869596","volume":"7","author":"H Jula","year":"2006","unstructured":"Jula H, Dessouky M, Ioannou PA (2006) Truck route planning in nonstationary stochastic networks with time windows at customer locations. IEEE Trans Intell Transp Syst 7(1):51\u201362","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"649_CR51","doi-asserted-by":"crossref","unstructured":"Junker U, Karisch SE, Kohl N, Vaaben B, Fahle T, Sellmann M (1999) A framework for constraint programming based column generation. In: International conference on principles and practice of constraint programming. Springer, Berlin, pp 261\u2013274","DOI":"10.1007\/978-3-540-48085-3_19"},{"issue":"1","key":"649_CR52","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl N, Desrosiers J, Madsen OB, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transp Sci 33(1):101\u2013116","journal-title":"Transp Sci"},{"key":"649_CR53","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.endm.2010.05.065","volume":"36","author":"S Kosuch","year":"2010","unstructured":"Kosuch S, Lisser A (2010) Stochastic shortest path problem with delay excess penalty. Electron Notes Discrete Math 36:511\u2013518","journal-title":"Electron Notes Discrete Math"},{"key":"649_CR54","unstructured":"Larsen J (1999) Parallelization of the vehicle routing problem with time windows. Ph.D. Thesis, Technical University of Denmark, Department of Informatics and Mathematical Modeling"},{"issue":"1","key":"649_CR55","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","volume":"4","author":"DJ Lehmann","year":"1977","unstructured":"Lehmann DJ (1977) Algebraic structures for transitive closure. Theor Comput Sci 4(1):59\u201376","journal-title":"Theor Comput Sci"},{"issue":"1","key":"649_CR56","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ijpe.2010.01.013","volume":"125","author":"X Li","year":"2010","unstructured":"Li X, Tian P, Leung SC (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125(1):137\u2013145","journal-title":"Int J Prod Econ"},{"issue":"9","key":"649_CR57","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/358172.358406","volume":"26","author":"RP Loui","year":"1983","unstructured":"Loui RP (1983) Optimal paths in graphs with stochastic or multidimensional weights. Commun ACM 26(9):670\u2013676","journal-title":"Commun ACM"},{"issue":"1","key":"649_CR58","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.cor.2012.07.008","volume":"40","author":"L Lozano","year":"2013","unstructured":"Lozano L, Medaglia AL (2013) On an exact method for the constrained shortest path problem. Comput Oper Res 40(1):378\u2013384","journal-title":"Comput Oper Res"},{"key":"649_CR59","unstructured":"Mazmanyan L, Trietsch D, Baker K (2009) Stochastic traveling salesperson models with safety time. Tech. rep., Working paper"},{"issue":"4","key":"649_CR60","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0305-0548(76)90017-4","volume":"3","author":"PB Mirchandani","year":"1976","unstructured":"Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4):347\u2013355","journal-title":"Comput Oper Res"},{"issue":"3","key":"649_CR61","first-page":"321","volume":"7","author":"M Mohri","year":"2002","unstructured":"Mohri M (2002) Semiring frameworks and algorithms for shortest-distance problems. J Autom Lang Comb 7(3):321\u2013350","journal-title":"J Autom Lang Comb"},{"issue":"3","key":"649_CR62","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1287\/trsc.30.3.220","volume":"30","author":"I Murthy","year":"1996","unstructured":"Murthy I, Sarkar S (1996) A relaxation-based pruning technique for a class of stochastic shortest path problems. Transp Sci 30(3):220\u2013236","journal-title":"Transp Sci"},{"issue":"11\u2013part\u20132","key":"649_CR63","doi-asserted-by":"publisher","first-page":"S125","DOI":"10.1287\/mnsc.44.11.S125","volume":"44","author":"I Murthy","year":"1998","unstructured":"Murthy I, Sarkar S (1998) Stochastic shortest path problems with piecewise-linear concave utility functions. Manag Sci 44(11\u2013part\u20132):S125\u2013S136","journal-title":"Manag Sci"},{"issue":"1","key":"649_CR64","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1177\/0361198106196400121","volume":"1964","author":"Y Nie","year":"2006","unstructured":"Nie Y, Fan Y (2006) Arriving-on-time problem: discrete algorithm that ensures convergence. Transp Res Rec J Transp Res Board 1964(1):193\u2013200","journal-title":"Transp Res Rec J Transp Res Board"},{"key":"649_CR65","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-12535-5_41","volume-title":"Large-scale scientific computing","author":"E Nikolova","year":"2010","unstructured":"Nikolova E (2010) High-performance heuristics for optimization in stochastic traffic engineering problems. In: Lirkov I, Margenov S, Wisniewski J (eds) Large-scale scientific computing. Springer, Berlin, pp 352\u2013360"},{"key":"649_CR66","doi-asserted-by":"crossref","unstructured":"Nikolova E, Kelner JA, Brand M, Mitzenmacher M (2006) Stochastic shortest paths via quasi-convex maximization. In: Algorithms\u2013ESA 2006. Springer, Berlin, pp 552\u2013563","DOI":"10.1007\/11841036_50"},{"key":"649_CR67","unstructured":"Parmentier A (2016) Algorithms for shortest path and airline problems. Ph.D. Thesis, \u00c9cole des Ponts Paristech, Universit\u00e9 Paris Est"},{"key":"649_CR68","unstructured":"Parmentier A, Meunier F (2017) Aircraft routing and crew pairing: updated algorithms at air France. arXiv preprint \n                    arXiv:1706.06901"},{"key":"649_CR69","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1090\/dimacs\/040\/18","volume":"40","author":"WB Powell","year":"1998","unstructured":"Powell WB, Chen ZL (1998) A generalized threshold algorithm for the shortest path problem with time windows. DIMACS Ser Discrete Math Theor Comput Sci 40:303\u2013318","journal-title":"DIMACS Ser Discrete Math Theor Comput Sci"},{"issue":"4","key":"649_CR70","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","volume":"36","author":"G Righini","year":"2009","unstructured":"Righini G, Salani M (2009) Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput Oper Res 36(4):1191\u20131203","journal-title":"Comput Oper Res"},{"issue":"1\u20134","key":"649_CR71","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"LM Rousseau","year":"2004","unstructured":"Rousseau LM, Gendreau M, Pesant G, Focacci F (2004) Solving VRPTWS with constraint programming based column generation. Ann Oper Res 130(1\u20134):199\u2013216","journal-title":"Ann Oper Res"},{"issue":"2","key":"649_CR72","first-page":"216","volume":"249","author":"B Roy","year":"1959","unstructured":"Roy B (1959) Transitivit\u00e9 et connexit\u00e9. C R Hebd Seances Acad Sci 249(2):216\u2013218","journal-title":"C R Hebd Seances Acad Sci"},{"issue":"9","key":"649_CR73","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1057\/palgrave.jors.2602465","volume":"59","author":"R Russell","year":"2008","unstructured":"Russell R, Urban T (2008) Vehicle routing with soft time windows and erlang travel times. J Oper Res Soc 59(9):1220\u20131228","journal-title":"J Oper Res Soc"},{"key":"649_CR74","doi-asserted-by":"crossref","unstructured":"Sabran G, Samaranayake S, Bayen AM (2014) Precomputation techniques for the stochastic on-time arrival problem. In: ALENEX. SIAM, Philodelphia, pp 138\u2013146","DOI":"10.1137\/1.9781611973198.13"},{"issue":"1","key":"649_CR75","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.trc.2011.05.009","volume":"20","author":"S Samaranayake","year":"2012","unstructured":"Samaranayake S, Blandin S, Bayen A (2012) A tractable class of algorithms for reliable routing in stochastic networks. Transp Res Part C Emerg Technol 20(1):199\u2013217","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"7","key":"649_CR76","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.trb.2006.12.001","volume":"41","author":"L Santos","year":"2007","unstructured":"Santos L, Coutinho-Rodrigues J, Current JR (2007) An improved solution algorithm for the constrained shortest path problem. Transp Res Part B Methodol 41(7):756\u2013771","journal-title":"Transp Res Part B Methodol"},{"issue":"4","key":"649_CR77","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/trsc.28.4.309","volume":"28","author":"RA Sivakumar","year":"1994","unstructured":"Sivakumar RA, Batta R (1994) The variance-constrained shortest path problem. Transport Sci 28(4):309\u2013316","journal-title":"Transport Sci"},{"issue":"5","key":"649_CR78","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170701745378","volume":"40","author":"I Sungur","year":"2008","unstructured":"Sungur I, Ord\u00f3nez F, Dessouky M (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans 40(5):509\u2013523","journal-title":"IIE Trans"},{"issue":"3","key":"649_CR79","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 (2014) 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","journal-title":"Eur J Oper Res"},{"key":"649_CR80","doi-asserted-by":"crossref","unstructured":"Tsaggouris G, Zaroliagis C (2004) Non-additive shortest paths. In: European symposium on algorithms. Springer, Berlin, pp 822\u2013834","DOI":"10.1007\/978-3-540-30140-0_72"},{"key":"649_CR81","volume-title":"Linear and combinatorial optimization in ordered algebraic structures","author":"U Zimmermann","year":"1981","unstructured":"Zimmermann U (1981) Linear and combinatorial optimization in ordered algebraic structures. Elsevier, Amsterdam"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0649-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-018-0649-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0649-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T15:22:08Z","timestamp":1570720928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-018-0649-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,25]]},"references-count":81,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s00186-018-0649-x","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2018,9,25]]},"assertion":[{"value":"16 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}