{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:01:46Z","timestamp":1760079706815,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642394072"},{"type":"electronic","value":"9783642394089"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39408-9_11","type":"book-chapter","created":{"date-parts":[[2013,6,12]],"date-time":"2013-06-12T02:45:07Z","timestamp":1371005107000},"page":"142-157","source":"Crossref","is-referenced-by-count":8,"title":["Maximizing the Probability of Arriving on Time"],"prefix":"10.1007","author":[{"given":"Ananya","family":"Christman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao","family":"Cassamano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"B.C. Dean","year":"2004","unstructured":"Dean, B.C.: Algorithms for Minimum-Cost Path in Time-Dependent Networks with Waiting Policies. Networks\u00a044, 41\u201346 (2004)","journal-title":"Networks"},{"key":"11_CR2","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, P.B., Soroush, H.: Path Preferences and Optimal Paths in Probabilistic Networks. Transportation Science\u00a019, 75\u201384 (1985)","journal-title":"Transportation Science"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.camwa.2004.07.028","volume":"49","author":"Y. Fan","year":"2005","unstructured":"Fan, Y., Kalaba, R., Moore, J.: Shortest Paths in Stochastic Networks with Correlated Link Costs. Computers and Mathematics with Applications\u00a049, 1549\u20131564 (2005)","journal-title":"Computers and Mathematics with Applications"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10957-005-7498-5","volume":"127","author":"Y. Fan","year":"2005","unstructured":"Fan, Y., Kalaba, R., Moore, J.: Arriving on Time. Journal of Optimization Theory and Applications\u00a0127(3), 497\u2013513 (2005)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.17.4.583","volume":"17","author":"H. Frank","year":"1969","unstructured":"Frank, H.: Shortest Paths in Probabilistic Graphs. Operations Research\u00a017, 583\u2013599 (1969)","journal-title":"Operations Research"},{"issue":"7","key":"11_CR6","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., Rillet, L.: Expected Shortest Paths in Dynamic and Stochastic Traffic Networks. Transportation Research\u00a032(7), 499\u2013516 (1998)","journal-title":"Transportation Research"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.trc.2011.09.007","volume":"21","author":"S. Gao","year":"2011","unstructured":"Gao, S., Huang, H.: Real-Time Traveler Information for Optimal Adaptive Routing in Stochastic Time-Dependent Networks. Transportation Research Part C\u00a021, 196\u2013213 (2011)","journal-title":"Transportation Research Part C"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/358172.358406","volume":"26","author":"R.P. Loui","year":"1983","unstructured":"Loui, R.P.: Optimal Paths in Graphs with Stochastic or Multidimensional Weights. Communications of the ACM\u00a026, 670\u2013676 (1983)","journal-title":"Communications of the ACM"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/mnsc.44.11.S125","volume":"44","author":"I. Murthy","year":"1998","unstructured":"Murthy, I., Sarkar, S.: Stochastic Shortest Path Problems with Piecewise Linear Concave Utility Functions. Management Science\u00a044, 125\u2013136 (1998)","journal-title":"Management Science"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.trb.2009.01.008","volume":"43","author":"Y. Nie","year":"2009","unstructured":"Nie, Y., Wu, X.: Shortest Path Problem Considering On-Time Arrival Probability. Transportation Research Part B\u00a043, 597\u2013613 (2009)","journal-title":"Transportation Research Part B"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0167-6377(91)90005-A","volume":"10","author":"G.H. Polychronopoulos","year":"1991","unstructured":"Polychronopoulos, G.H., Tsitsiklis, J.N.: Stochastic Shortest Path Problems with Recourse. Operations Research Letters\u00a010, 329\u2013334 (1991)","journal-title":"Operations Research Letters"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1287\/opre.28.5.1122","volume":"28","author":"E.H. Sigal","year":"1980","unstructured":"Sigal, E.H., Pritsker, A.A.B., Solberg, J.J.: The Stochastic Shortest Route Problem. Operations Research\u00a028, 1122\u20131129 (1980)","journal-title":"Operations Research"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.10049","volume":"40","author":"S. Waller","year":"2002","unstructured":"Waller, S., Ziliaskopoulos, A.: On the Online Shortest Path Problem with Limited Arc Cost Dependencies. Networks\u00a040(4), 216\u2013227 (2002)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Analytical and Stochastic Modeling Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39408-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T20:20:10Z","timestamp":1676319610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39408-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642394072","9783642394089"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39408-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}