{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T17:57:45Z","timestamp":1777917465267,"version":"3.51.4"},"reference-count":46,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:00:00Z","timestamp":1768694400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:00:00Z","timestamp":1768694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for solving RSPPs with non\u2010negatively correlated travel times and resource constraints. By building upon the flexibility of the pulse algorithm, our unified and exact algorithmic framework solves multiple variants of the RSPP: the \u2010reliable shortest path (\u2010RSP), the maximum probability of on\u2010time arrival (MPOAP) problem, and the shortest \u2010reliable path (S\u2010). We derive a bound on the reliability of path travel times and incorporate three pruning strategies: bounds, infeasibility, and dominance, leveraging properties of the normal distribution and non\u2010negative correlation structures. Computational experiments on large\u2010scale transportation networks (with up to 33\u2009113 nodes and 75\u2009379 arcs) demonstrate that the framework achieves a ten\u2010fold speed improvement over state\u2010of\u2010the\u2010art methods, highlighting its potential real\u2010world applications and extensions to related problems.<\/jats:p>","DOI":"10.1002\/net.70026","type":"journal-article","created":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T20:42:32Z","timestamp":1768768952000},"page":"372-389","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Exact Method for Reliable Shortest Path Problems With Correlation"],"prefix":"10.1002","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8006-1301","authenticated-orcid":false,"given":"Esteban","family":"Leiva","sequence":"first","affiliation":[{"name":"Centro para la Optimizaci\u00f3n y Probabilidad Aplicada (COPA), Departamento de Ingenier\u00eda Industrial Universidad de los Andes  Bogot\u00e1 Colombia"},{"name":"Departamento de Matem\u00e1ticas Universidad de los Andes  Bogot\u00e1 Colombia"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7937-318X","authenticated-orcid":false,"given":"Santiago","family":"Morales","sequence":"additional","affiliation":[{"name":"Department of Mathematics University of California  Davis California USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8770-2379","authenticated-orcid":false,"given":"Daniel","family":"Yam\u00edn","sequence":"additional","affiliation":[{"name":"Tepper School of Business Carnegie Mellon University  Pittsburgh Pennsylvania USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1529-0322","authenticated-orcid":false,"given":"Andr\u00e9s L.","family":"Medaglia","sequence":"additional","affiliation":[{"name":"Centro para la Optimizaci\u00f3n y Probabilidad Aplicada (COPA), Departamento de Ingenier\u00eda Industrial Universidad de los Andes  Bogot\u00e1 Colombia"}]}],"member":"311","published-online":{"date-parts":[[2026,1,18]]},"reference":[{"key":"e_1_2_11_2_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993"},{"key":"e_1_2_11_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_8"},{"key":"e_1_2_11_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2007.12.002"},{"key":"e_1_2_11_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.04.018"},{"key":"e_1_2_11_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0965\u20108564(02)00021\u20106"},{"key":"e_1_2_11_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2012.01.003"},{"key":"e_1_2_11_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2009.12.005"},{"issue":"1","key":"e_1_2_11_9_1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11750-021-00592-3","article-title":"On the Shortest \u03b1reliable Path Problem","volume":"29","author":"Corredor\u2010Montenegro D.","year":"2021","journal-title":"Top: Transactions in Operations Research"},{"key":"e_1_2_11_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.retrec.2015.04.002"},{"key":"e_1_2_11_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598\u2010020\u201068810\u20109"},{"key":"e_1_2_11_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21960"},{"key":"e_1_2_11_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.008"},{"key":"e_1_2_11_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/atr.5670390104"},{"key":"e_1_2_11_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11067\u2010012\u20109175\u20101"},{"key":"e_1_2_11_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.05.022"},{"key":"e_1_2_11_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2011.598133"},{"key":"e_1_2_11_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/atr.1408"},{"key":"e_1_2_11_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.01.008"},{"key":"e_1_2_11_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.4.583"},{"issue":"3","key":"e_1_2_11_21_1","first-page":"333","article-title":"Optimal Routing for Maximizing the Travel Time Reliability","volume":"6","author":"Nie Y.","year":"2006","journal-title":"Networks and Spatial Economics"},{"key":"e_1_2_11_22_1","doi-asserted-by":"publisher","DOI":"10.3141\/2196\u201009"},{"key":"e_1_2_11_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2023.0013"},{"key":"e_1_2_11_24_1","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/4586471"},{"key":"e_1_2_11_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113192"},{"key":"e_1_2_11_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2013.10.011"},{"key":"e_1_2_11_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.04.002"},{"key":"e_1_2_11_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2015.0668"},{"key":"e_1_2_11_29_1","series-title":"Transportation Research, Economics and Policy","first-page":"171","volume-title":"Network Reliability in Practice","author":"Ravi S.","year":"2011"},{"key":"e_1_2_11_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.12.011"},{"key":"e_1_2_11_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.04.006"},{"key":"e_1_2_11_32_1","doi-asserted-by":"publisher","DOI":"10.3141\/2390-04"},{"key":"e_1_2_11_33_1","doi-asserted-by":"publisher","DOI":"10.3141\/2497\u201006"},{"key":"e_1_2_11_34_1","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/3747632"},{"key":"e_1_2_11_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.22256"},{"key":"e_1_2_11_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590\u2010014\u20100742\u2010x"},{"key":"e_1_2_11_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.11.003"},{"key":"e_1_2_11_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.019"},{"key":"e_1_2_11_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0582"},{"key":"e_1_2_11_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21909"},{"key":"e_1_2_11_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105671"},{"key":"e_1_2_11_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/MITS.2023.3265309"},{"key":"e_1_2_11_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2012.01.005"},{"key":"e_1_2_11_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2011.06.004"},{"key":"e_1_2_11_45_1","unstructured":"Transportation Networks for Research Core Team \u201cTransportation Networks for Research \u201dhttps:\/\/github.com\/bstabler\/TransportationNetworks."},{"key":"e_1_2_11_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"e_1_2_11_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.12.001"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70026","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/net.70026","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T18:14:12Z","timestamp":1777659252000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.70026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,18]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10.1002\/net.70026"],"URL":"https:\/\/doi.org\/10.1002\/net.70026","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,18]]},"assertion":[{"value":"2024-11-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}