{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:46:34Z","timestamp":1780544794847,"version":"3.54.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0305-0548(98)00027-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:08:45Z","timestamp":1027598925000},"page":"1107-1125","source":"Crossref","is-referenced-by-count":83,"title":["Least possible time paths in stochastic,time-varying networks"],"prefix":"10.1016","volume":"25","author":[{"given":"Elise D.","family":"Miller-Hooks","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hani S.","family":"Mahmassani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(98)00027-6_BIB1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1287\/opre.17.4.583","article-title":"Shortest paths in probabilistic graphs","volume":"17","author":"Frank","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.3230160303","article-title":"Shortest paths in networks with exponentially distributed arc lengths","volume":"16","author":"Kulkarni","year":"1986","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/net.3230230305","article-title":"Shortest paths in stochastic networks with arc lengths having discrete distributions","volume":"23","author":"Corea","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB4","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1287\/opre.28.5.1122","article-title":"The stochastic shortest route problem","volume":"28","author":"Sigal","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB5","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/358172.358406","article-title":"Optimal paths in graphs with stochastic or multidimensional weights","volume":"26","author":"Loui","year":"1983","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/trsc.19.1.75","article-title":"Path preferences and optimal paths in probabilistic networks","volume":"19","author":"Eiger","year":"1985","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0305-0548(85)90034-6","article-title":"Optimal paths in probabilistic networks: a case with temporary preferences","volume":"12","author":"Mirchandani","year":"1985","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB8","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/opre.7.5.646","article-title":"Application of technique for research and development program evaluation","volume":"7","author":"Malcolm","year":"1959","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB9","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/opre.12.3.460","article-title":"Critical path analyses via chance constrained and stochastic programming","volume":"12","author":"Charnes","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB10","doi-asserted-by":"crossref","unstructured":"Van Slyke, R., Monte Carlo Methods and the PERT Problem. Rand Research Memorandum, RM-3367-PR, 1963","DOI":"10.1287\/opre.11.5.839"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB11","unstructured":"Miller-Hooks, E. and Mahmassani, H., On the generation of nondominated paths in stochastic, time-varying networks, Proceedings of TRISTAN III (Triennial Symposium on Transportation Analysis), 1998, in press"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.20.3.182","article-title":"The fastest path through a network with random time-dependent travel times","volume":"20","author":"Hall","year":"1986","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB13","unstructured":"Miller-Hooks, E., Optimal routing in time-varying, stochastic networks: algorithms and implementations, Ph.D. thesis, Department of Civil Engineering, University of Texas at Austin, 1997"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB14","first-page":"1","article-title":"Fastest paths in time-dependent networks for intelligent vehicle highway systems applications","volume":"1","author":"Kaufman","year":"1993","journal-title":"IVHS Journal"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB15","first-page":"94","article-title":"Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications","volume":"1408","author":"Ziliaskopoulos","year":"1993","journal-title":"Transportation Research Record"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB16","unstructured":"Ahuja, R., Magnanti, T. and Orlin, J., Network Flows. Prentice-Hall, NJ, Chap. 5, 1993"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Quarterly Applied Mathematics"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB18","unstructured":"Miller-Hooks, E. and Mahmassani, H., Path comparisons for a priori and time-adaptive route choice in stochastic, time-dependent networks, working paper, 1998"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB19","unstructured":"Ziliaskopoulos, A., Design and implementation of some k shortest path algorithms with application to intelligent vehicle highway systems. Master's Report, The University of Texas at Austin, 1992"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB20","unstructured":"Ziliaskopoulos, A., Optimum path algorithms on multidimensional networks: analysis and design, implementation and computational experience. Ph.D. thesis, Department of Civil Engineering, University of Texas at Austin, 1994"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB21","unstructured":"Ahuja, R., Network flows. In Handbooks in Operations Research and Management Science. Vol. 1, Optimization, ed. G. Nemhauser, A. Kan and M. Todd. North-Holland, New York, 1989"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB22","first-page":"1106","article-title":"New polynomial shortest path algorithms and their computational attributes","volume":"31","author":"Glover","year":"1985","journal-title":"Medical Science"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB23","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","article-title":"Implementation and efficiency of Moore-algorithms for the shortest route problem","volume":"7","author":"Pape","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230140206","article-title":"Shortest-path methods: complexity, interrelations and new propositions","volume":"14","author":"Pallottino","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(98)00027-6_BIB25","doi-asserted-by":"crossref","unstructured":"Gallo, G. and Pallottino, S., Shortest path methods: a unifying approach. In Mathematical Programming Study 26. North-Holland, Amsterdam, 1986, 38\u201364","DOI":"10.1007\/BFb0121087"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054898000276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054898000276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:59:44Z","timestamp":1556672384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054898000276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0305054898000276"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(98)00027-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}