Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Miller-Hooks, E. D. & Mahmassani, H. S. *TRANSPORTATION SCIENCE*, 34(2):198--215, May, 2000. Paper doi abstract bibtex We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e., in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms' computational performance as well as the properties of the solution.

@article{miller-hooks_least_2000,
title = {Least Expected Time Paths in Stochastic, {Time-Varying} Transportation Networks},
volume = {34},
url = {Miller-Hooks.2000.TS.pdf},
doi = {10.1287/trsc.34.2.198.12304},
abstract = {We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e., in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms' computational performance as well as the properties of the solution.
},
number = {2},
journal = {{TRANSPORTATION} {SCIENCE}},
author = {Elise D. {Miller-Hooks} and Hani S. Mahmassani},
month = may,
year = {2000},
keywords = {shortest {path,Stochastic} dynamic networks},
pages = {198--215}
}

Downloads: 0

{"_id":{"_str":"52014e06d40bcbb041000882"},"__v":3,"authorIDs":[],"author_short":["Miller-Hooks, E. D.","Mahmassani, H. S."],"bibbaseid":"millerhooks-mahmassani-leastexpectedtimepathsinstochastictimevaryingtransportationnetworks-2000","bibdata":{"bibtype":"article","type":"article","title":"Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks","volume":"34","url":"Miller-Hooks.2000.TS.pdf","doi":"10.1287/trsc.34.2.198.12304","abstract":"We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e., in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms' computational performance as well as the properties of the solution. ","number":"2","journal":"TRANSPORTATION SCIENCE","author":[{"firstnames":["Elise","D."],"propositions":[],"lastnames":["Miller-Hooks"],"suffixes":[]},{"firstnames":["Hani","S."],"propositions":[],"lastnames":["Mahmassani"],"suffixes":[]}],"month":"May","year":"2000","keywords":"shortest path,Stochastic dynamic networks","pages":"198--215","bibtex":"@article{miller-hooks_least_2000,\n\ttitle = {Least Expected Time Paths in Stochastic, {Time-Varying} Transportation Networks},\n\tvolume = {34},\n\turl = {Miller-Hooks.2000.TS.pdf},\n\tdoi = {10.1287/trsc.34.2.198.12304},\n\tabstract = {We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e., in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms' computational performance as well as the properties of the solution.\n\n},\n\tnumber = {2},\n\tjournal = {{TRANSPORTATION} {SCIENCE}},\n\tauthor = {Elise D. {Miller-Hooks} and Hani S. Mahmassani},\n\tmonth = may,\n\tyear = {2000},\n\tkeywords = {shortest {path,Stochastic} dynamic networks},\n\tpages = {198--215}\n}","author_short":["Miller-Hooks, E. D.","Mahmassani, H. S."],"key":"miller-hooks_least_2000","id":"miller-hooks_least_2000","bibbaseid":"millerhooks-mahmassani-leastexpectedtimepathsinstochastictimevaryingtransportationnetworks-2000","role":"author","urls":{"Paper":"http://www.its.uci.edu/~yangi/papers/Miller-Hooks.2000.TS.pdf"},"keyword":["shortest path","Stochastic dynamic networks"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.its.uci.edu/~yangi/papers/papers.bib","downloads":0,"keywords":["shortest path","stochastic dynamic networks"],"search_terms":["expected","time","paths","stochastic","time","varying","transportation","networks","miller-hooks","mahmassani"],"title":"Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks","year":2000,"dataSources":["pgD6jQvtzK6Hk25NF"]}