{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T04:13:21Z","timestamp":1697343201693},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T00:00:00Z","timestamp":1292976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2011,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this article, we present a stochastic shortest path problem that we refer to as the Most Likely Path Problem (MLPP). We demonstrate that optimal solutions to the MLPP are not composed of optimal subpaths, which limits the computational tractability of exact solution methods. On series\u2010parallel networks, we produce analytical bounds for the MLPP's optimality indices, the probabilities of given paths in the network being shortest, and compute these bounds efficiently via numerical integration. These bounds can also be used independently of the MLPP to gain further understanding for paths of interest that are identified by other stochastic shortest path frameworks, e.g., robust shortest paths or expected shortest paths. Additionally, we present a heuristic method that uses dynamic programming and ordinal optimization to identify an MLP on series\u2010parallel networks. Our computational study shows our bounds to be tight in a majority of test networks and shows our heuristic to be both efficient and highly accurate for identifying an MLP in all test networks. \u00a9 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 68\u201380 2011<\/jats:p>","DOI":"10.1002\/net.20416","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T23:17:46Z","timestamp":1293059866000},"page":"68-80","source":"Crossref","is-referenced-by-count":3,"title":["The most likely path on series\u2010parallel networks"],"prefix":"10.1002","volume":"58","author":[{"given":"Daniel","family":"Reich","sequence":"first","affiliation":[]},{"given":"Leo","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,12,22]]},"reference":[{"key":"e_1_2_12_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.10.1360"},{"key":"e_1_2_12_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-H"},{"key":"e_1_2_12_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.37.2.198"},{"key":"e_1_2_12_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(89)90016-6"},{"key":"e_1_2_12_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0396-4"},{"key":"e_1_2_12_7_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1048"},{"key":"e_1_2_12_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.3.207"},{"key":"e_1_2_12_9_2","first-page":"51","article-title":"Independent and dependent percolation","volume":"6","author":"Chayes J. T.","year":"1999","journal-title":"Probability Theory Appl, IAS\/Park City Math Ser"},{"key":"e_1_2_12_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/24.510811"},{"key":"e_1_2_12_11_2","volume-title":"Combinatorial Optimization","author":"Cook W. J.","year":"1998"},{"key":"e_1_2_12_12_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.19.1.75"},{"key":"e_1_2_12_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.14.5.335"},{"key":"e_1_2_12_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01651330"},{"key":"e_1_2_12_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.4.583"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.002"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01797280"},{"key":"e_1_2_12_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.01.008"},{"key":"e_1_2_12_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.10112"},{"key":"e_1_2_12_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"e_1_2_12_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/358172.358406"},{"key":"e_1_2_12_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.08.002"},{"key":"e_1_2_12_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.4.782"},{"key":"e_1_2_12_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-4754(79)90007-7"},{"key":"e_1_2_12_25_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1122"},{"key":"e_1_2_12_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00097-2"},{"key":"e_1_2_12_27_2","doi-asserted-by":"crossref","unstructured":"J.Valdes R. E.Tarjan E. L.Lawler The recognition of series parallel digraphs Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing Atlanta Georgia United States(1979) 1\u201312.","DOI":"10.1145\/800135.804393"},{"key":"e_1_2_12_28_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.1.106"},{"key":"e_1_2_12_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00085-3"},{"key":"e_1_2_12_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00373-4"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20416","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T14:42:00Z","timestamp":1697294520000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,22]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["10.1002\/net.20416"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1002\/net.20416","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,22]]}}}