Abstract
Transportation networks are subject to a large degree of uncertainty due to traveler behavior, recurring congestion, capacity variability (construction zones, traffic incidents), variation in demands, etc.. resulting in unstable and unpredictable trip travel times. This has led to an emphasis on travel time reliability as a key determinant of route choice and an important measure of system performance, thus motivating research on optimizing travel time reliability on such stochastic networks. In this context, this work proposes an algorithm to compute the path of minimum robust cost (defined as a weighted combination of mean squared and variance of path travel time) on a network with stochastic and correlated link travel times.The proposed approach involves transforming the robust cost objective to a link separable or sum of squares form. Based on this formulation, a related multiple objective optimization problem is defined, and it is shown that the optimal robust cost path must lie in the non-dominated solution set of the multiple objective problem. Thus, a label correcting procedure for the multicriteria shortest path problem is applied to compute the non-dominated set and hence, the path of minimum robust cost. In addition, a new criterion of dominance is proposed (permutation invariant non-dominance or PIND) to reduce the size of the non-dominated path set while maintaining optimality with respect to the robust path problem. An approximate label correcting type procedure is developed to compute this reduced path set. Empirical experiments on a real-world network indicate that the PIND path set is significantly smaller than the corresponding ND set (between 60% and 95% on tested networks). In addition, computational tests on synthetic networks of size up to 1,500 nodes (7,500 links) demonstrate the efficiency of the proposed heuristic (computational time < 35 s) in computing the path of minimum robust cost on sparse/moderately dense (links to nodes ratio < 5) networks of size less than 500 nodes. The study also underscores the role of variability, correlations, and risk attitudes on benefits obtained from minimizing robust cost, and the suboptimality of the independence assumption.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Andreatta G, Romeo L (1988) Stochastic shortest paths with recourse. Networks 18(3):193–204.
Bates J, Polak J, Jones P, Cook A (2001) The valuation of reliability for personal travel. Transp Res E 37:191–229.
Chen A, Ji Z (2005) Path finding under uncertainty. J Adv Transp 39(1):19–37.
Cheung RK (1998) Iterative methods for dynamic stochastic shortest path problems. Naval Res Log 45(8):769–789.
Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transp Sci 19(1):75–84.
Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6:333–344.
Fan YY, Kalaba RE, Moore JE (2005) Shortest paths in stochastic networks with correlated link costs. Comput Math Appl 49:1549–1564.
Frank H (1969) Shortest paths in probabilistic graphs. Oper Res 17(4):583–599
Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transp Res B 32(7):499–516.
Gao S (2005) Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. Ph.D. Dissertation, Massachusetts Institute of Technology
Guerriero F, Musmanno R (2001) Label correcting methods to solve multicriteria shortest path problems. J Optim Theory Appl 111(3):589–613.
Hall R (1986) The fastest path through a network with random time-dependent travel times. Transp Sci 20(3):182–188.
Li R (2004) Examining travel time variability using AVI data. CIATR report
Loui P (1983) Optimal paths in graphs with stochastic or multidimensional weights. Commun ACM 26:670–676.
Maher M, Zhang YL (2000) Route choice to maximize the probability of arrival within a specified time. In: Bell MGH, Cassir C (eds) Reliability of transport networks. Research Studies Press, Baldock, Hertfordshire, England.
Martins EDQV, Paixa JMP, Rosa MS, Santos JLE (2003) The determination of the path with minimum-cost norm value. Networks 41(4):184–196.
Miller-Hooks ED (2001) Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37(1): 35–52.
Miller-Hooks ED, Mahmassani HS (1998a) Least possible time paths in stochastic, time-varying networks. Comput Oper Res 25(2):1107–1125.
Miller-Hooks ED, Mahmassani HS (2002) Least expected time paths in stochastic, time-varying transportation networks. Transp Sci 34:198–215.
Miller-Hooks ED, Mahmassani HS (2003) Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. Eur J Oper Res 146(2):67–82.
Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4):347–355.
Mirchandani PB, Soroush H (1985) Optimal paths in probabilistic networks: a case with temporary preferences. Comput Oper Res 12:365–381.
Montemanni R, Gambardella L (2004) An exact algorithm for the robust shortest path problem with interval data. Comput Oper Res 31(10):1667–1680.
Murthy I, Sarkar S (1997) A relaxation-based pruning technique for a class of stochastic shortest path problems. Transp Sci 30(3):220–236.
Nie Y(Marco), Wu X(2009) Shortest path problem considering on-time arrival probability/ Transp Res B 43:597–613
Polychronopoulos GH, Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Networks 27(2):133–143.
Provan JS (2003) A polynomial-time algorithm to find shortest paths with recourse. Networks 41(2):115–125.
Sen S, Pillai R, Joshi S, Rathi A (2001) A mean-variance model for route guidance in advanced traveler information systems. Transp Sci 35(1):37–49.
Sigal CE, Pritsker AAB, Solberg JJ (1980) The stochastic shortest route problem. Oper Res 28(5):1122–1129.
Sivakumar R, Batta R (1994) The variance-constrained shortest path problem. Transp Sci 28(4):309–316.
Tu H, Van Lint J, Van Zuylen HJ (2007) Impact of traffic flow on travel time variability of freeway corridors. Transp Res Rec: J Transp Res Board, Issue No. 1993:59–66
Waller ST, Ziliaskopoulos AK (2002) On the online shortest path problem with limited arc cost dependencies. Networks 40(4):216–227.
Yu G, Yang J (1998) On the robust shortest path problem. Comput Oper Res 25(6):457–468.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this paper
Cite this paper
Seshadri, R., Srinivasan, K.K. (2012). An Algorithm for the Minimum Robust Cost Path on Networks with Random and Correlated Link Travel Times. In: Levinson, D., Liu, H., Bell, M. (eds) Network Reliability in Practice. Transportation Research, Economics and Policy. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0947-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0947-2_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-0946-5
Online ISBN: 978-1-4614-0947-2
eBook Packages: Business and EconomicsEconomics and Finance (R0)