{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:50:48Z","timestamp":1742917848746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319493961"},{"type":"electronic","value":"9783319493978"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49397-8_9","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T06:20:42Z","timestamp":1478672442000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs"],"prefix":"10.1007","author":[{"given":"Dajian","family":"Li","sequence":"first","affiliation":[]},{"given":"Paul","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Orkun","family":"Karabasoglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"issue":"3","key":"9_CR1","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, J., Heath, D.: Coherent measures of risk. Mathe. Finan. 9(3), 203\u2013228 (1999)","journal-title":"Mathe. Finan."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks (2015). arXiv:1504.05140v1","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.insmatheco.2005.08.003","volume":"38","author":"N B\u00e4uerle","year":"2006","unstructured":"B\u00e4uerle, N., M\u00fcller, A.: Stochastic orders and risk measures: Consistency and bounds. Math. Econ. 38, 132\u2013148 (2006)","journal-title":"Math. Econ."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"D Bertsekas","year":"1991","unstructured":"Bertsekas, D., Tsitsiklis, J.: An analysis of stochastic shortest paths problems. Math. Oper. Res. 16, 580\u2013595 (1991)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/15472450.2013.806851","volume":"18","author":"BY Chen","year":"2014","unstructured":"Chen, B.Y., Lam, W.H.K., Sumalee, A., Li, Q., Tam, M.L.: Reliable shortest path problems in stochastic time-dependent networks. J. Intell. Transp. Syst. 18(2), 177\u2013189 (2014)","journal-title":"J. Intell. Transp. Syst."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117\u2013139. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02094-0_7"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S Dreyfus","year":"1969","unstructured":"Dreyfus, S.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33483-2","volume-title":"Modelling Extremal Events for Insurance and Finance","author":"P Embrechts","year":"1997","unstructured":"Embrechts, P., Kluppelberg, C., Mikosch, T.: Modelling Extremal Events for Insurance and Finance. Springer, Berlin (1997)"},{"key":"9_CR11","unstructured":"Ford, L.J.: Network flow theory. Technical report, Rand Corporation (1956)"},{"issue":"4","key":"9_CR12","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. Oper. Res. 17(4), 583\u2013599 (1969)","journal-title":"Oper. Res."},{"issue":"7","key":"9_CR13","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, L.: Expected shortest paths in dynamic and stochastic traffic networks. Transp. Res. Part B: Methodol. 32(7), 499\u2013516 (1998)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Gavriel, C., Hanasusanto, G., Kuhn, D.: Risk-averse shortest path problems. In: IEEE 51st Annual Conference on Decision and Control, pp. 2533\u20132538 (2012)","DOI":"10.1109\/CDC.2012.6426188"},{"key":"9_CR15","unstructured":"Goldberg, A., Harrelson, C.: Computing the shortest path: A* meets graph theory. In: SODA, pp. 156\u2013165 (2005)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Cybern."},{"key":"9_CR17","volume-title":"Value-at-Risk: The New Benchmark for Managing Financial Risk","author":"P Jorion","year":"2006","unstructured":"Jorion, P.: Value-at-Risk: The New Benchmark for Managing Financial Risk. McGraw-Hill, New York (2006)"},{"issue":"1","key":"9_CR18","first-page":"1","volume":"1","author":"D Kaufman","year":"1993","unstructured":"Kaufman, D., Smith, R.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. J. Intell. Transp. Syst. 1(1), 1\u201311 (1993)","journal-title":"J. Intell. Transp. Syst."},{"key":"9_CR19","unstructured":"Moore, E.F.: The shortest path through a maze. In: Proceedings of the International Symposium on the Theory of Switching, pp. 285\u2013292 (1959)"},{"key":"9_CR20","volume-title":"Theory of Games and Economic Behavior","author":"J von Neumann","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"issue":"6","key":"9_CR21","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. Transp. Res. Part B: Methodol. 43(6), 597\u2013613 (2009)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0377-2217(98)00167-2","volume":"116","author":"W Ogryczak","year":"1999","unstructured":"Ogryczak, W., Ruszczynski, A.: From stochastic dominance to mean-risk models: semideviations as risk measures. Eur. J. Oper. Res. 116, 33\u201350 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607\u2013625 (1990)","journal-title":"J. ACM"},{"key":"9_CR24","unstructured":"Parmentier, A., Meunier, F.: Stochastic shortest paths and risk measures. In: arXiv preprint (2014)"},{"issue":"4","key":"9_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.jda.2007.08.003","volume":"7","author":"S Peyer","year":"2009","unstructured":"Peyer, S., RautenBach, D., Vygen, J.: A generalization of Dijkstra\u2019s shortest path algorithm with applications to VLSI routing. J. Discret. Algorithms 7(4), 377\u2013390 (2009)","journal-title":"J. Discret. Algorithms"},{"key":"9_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (1994)"},{"key":"9_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-2182-8","volume-title":"Generalized Expected Utility Theory: The Rank-dependent Model","author":"J Quiggin","year":"1993","unstructured":"Quiggin, J.: Generalized Expected Utility Theory: The Rank-dependent Model. Kluwer Academic Publishers, Berlin (1993)"},{"key":"9_CR28","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Upper Saddle River (2003)","edition":"2"},{"key":"9_CR29","volume-title":"The Foundations of Statistics","author":"L Savage","year":"1954","unstructured":"Savage, L.: The Foundations of Statistics. Wiley, Hoboken (1954)"},{"key":"9_CR30","volume-title":"Stochastic Orders and Their Applications","author":"M Shaked","year":"1994","unstructured":"Shaked, M., Shanthikumar, J.: Stochastic Orders and Their Applications. Academic Press, New York (1994)"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1287\/opre.28.5.1122","volume":"28","author":"C Sigal","year":"1980","unstructured":"Sigal, C., Pritsker, A., Solberg, J.: The stochastic shortest route problem. Oper. Res. 28, 1122\u20131129 (1980)","journal-title":"Oper. Res."},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2307\/1911158","volume":"55","author":"M Yaari","year":"1987","unstructured":"Yaari, M.: The dual theory of choice under risk. Econometrica 55, 95\u2013115 (1987)","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","Multi-disciplinary Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49397-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:47:51Z","timestamp":1710344871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49397-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319493961","9783319493978"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49397-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"10 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIWAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Multi-disciplinary Trends in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"miwai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}