Abstract
This study addresses the problem of determining the most reliable time-adaptive strategy on a stochastic and time-dependent transportation network. The reliability is measured as a conic combination of the mean and standard-deviation of travel time and is termed robust-cost. The stochastic time-dependent network is represented as a directed acyclic hypergraph, where the time-adaptive strategies correspond to the hyperpaths. This representation transforms the problem to that of determining the hyperpath with the least robust-cost on the constructed hypergraph. The minimum robust-cost strategy problem is difficult to solve because of the non-linear objective function. Consequently, the solution procedures commonly adopted in the literature —that are based on substrategy optimality and substrategy non-dominance —are not applicable to this problem. In this light, we propose a novel bounds-based iterative algorithm that determines the minimum robust-cost strategy on the stochastic and time-dependent networks. This algorithm needs to determine the least and K-best strategies in the second moment of travel time, for which an efficient procedure is also proposed. The algorithm is shown to be exact and exhibit parameterically polynomial behavior; computational tests were performed to demonstrate its efficiency. Further, tests showed that the minimum robust-cost strategy compromises little in terms of the mean travel time (0.2%–2.9%) —compared to least expected travel time strategy— with significant reduction in travel time variability (6.2%–29.8%).
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Bates J, Polak J, Jones P, Cook A (2001) The valuation of reliability for personal travel. Trans Res Part E 37(2):191–229
Carrion C, Levinson D (2012) Value of travel time reliability: A review of current evidence. Trans Res Part A: Policy Pract 46(4):720–741
Chen A, Zhou Z (2010) The α-reliable mean-excess traffic equilibrium model with stochastic travel times. Trans Res Part B: Methodol 44(4):493–513
Chen BY, Lam WH, Sumalee A, Li Q, Shao H, Fang Z (2013) Finding reliable shortest paths in road networks under uncertainty. Netw Spat Econ 13(2):123–148
Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6(3):333–344
Fu L, Rilett L (1998) Expected shortest paths in dynamic and stochastic traffic networks. Trans Res Part B: Methodol 32:499–516
Gallo G, Longo G, Pallottino S (1993) Directed hypergraphs and applications. Discret Appl Math 42:177–201
Gao S (2005) Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. PhD thesis, Massachusetts Institute of Technology
Gao S, Chabini I (2002) Best routing policy problem in stochastic time-dependent networks. Trans Res Rec: J Trans Res Board 1783:188–196
Gao S, Chabini I (2006) Optimal routing policy problems in stochastic time-dependent networks. Trans Res Part B: Methodol 40(2):93–122
Hall R (1986) The fastest path through a network with random time-dependent travel times. Trans Sci 20(3):182–188
Huang H, Gao S (2012) Optimal paths in dynamic networks with dependent random link travel times. Trans Res Part B 46(5):579–598
Khani A, Boyles SD (2015) An exact algorithm for the mean?standard deviation shortest path problem. Transportation Research Part B: Methodological
Li Q, Nie Y, Vallamsundar S, Lin J, Homem-de Mello T (2016) Finding efficient and environmentally friendly paths for risk-averse freight carriers. Netw Spat Econ 16(1):255–275
Mahmassani HS, Hou T, Dong J (2012) Characterizing travel time variability in vehicular traffic networks. Trans Res Rec: J Trans Res Board 2315:141–152
Miller-Hooks E (2001) Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37(1):35–52
Miller-Hooks ED, Mahmassani HS (2000) Least expected time paths in stochastic , time-varying transportation networks. Trans Sci 34(2):198–215
Nie Y, Wu X (2009) Shortest path problem considering on-time arrival probability. Trans Res Part B 43(6):597–613
Nie Y, Wu X, Homem-de Mello T (2012) Optimal path problems with second-order stochastic dominance constraints. Netw Spat Econ 12(4):561–587
Nielsen LR (2003) Route Choice in Stochastic Time-Dependent Networks. PhD thesis, University of Aarhus, Denmark
Nielsen LR, Andersen KA, Pretolani D (2005) Finding the k shortest hyperpaths. Comput Oper Res 32(6):1477–1497
Nielsen LR, Andersen KA, Pretolani D (2014) Ranking paths in stochastic time-dependent networks. Eur J Oper Res 236(3):903–914
Polychronopoulos GH, Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Networks 27:133–143
Prakash AA, Srinivasan K (2014) Sample-based algorithm to determine minimum robust cost path with correlated link travel times. Trans Res Rec: J Trans Res Board 2467:110–119
Prakash AA, Srinivasan K (2015) Optimal reliability path problem on networks with random and correlated link travel times: Bilevel formulation and solution procedure. Trans Res Rec: J Trans Res Board 2497:54–62
Prakash AA, Srinivasan K (2016) Pruning algorithms to determine reliable paths on networks with random and correlated link travel times. Transportation Science, in press
Pretolani D (2000) A directed hypergraph model for random time dependent shortest paths. Eur J Oper Res 123(2):315–324
Sen S, Pillai R, Joshi S, Rathi A (2001) A mean-variance model for route guidance in advanced traveler information systems. Trans Sci 35(1):37–49
Seshadri R, Srinivasan K (2010) Algorithm for determining most reliable travel time path on network with normally distributed and correlated link travel times. Trans Res Rec: J Trans Res Board 2196(1):83–92
Shahabi M, Unnikrishnan A, Boyles SD (2013) An outer approximation algorithm for the robust shortest path problem. Trans Res Part E: Logist Trans Rev 58:52–66
Srinivasan K, Prakash AA, Seshadri R (2014) Finding most reliable paths on networks with correlated and shifted log–normal travel times. Trans Res Part B: Methodol 66:110–128
Trozzi V, Gentile G, Kaparias I, Bell MG (2015) Effects of countdown displays in public transport route choice under severe overcrowding. Netw Spat Econ 15(3):823–842
Xing T, Zhou X (2011) Finding the most reliable path with and without link travel time correlation: A lagrangian substitution based approach. Trans Res Part B 45(10):1660–1679
Yang L, Zhou X (2014) Constraint reformulation and a lagrangian relaxation-based solution algorithm for a least expected time path problem. Trans Res Part B: Methodol 59:22–44
Yen JY (1971) Finding the K shortest loopless paths in a network. Manag Sci 17(11):712–716
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Prakash, A.A., Srinivasan, K.K. Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation. Netw Spat Econ 17, 809–840 (2017). https://doi.org/10.1007/s11067-017-9345-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11067-017-9345-2