Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

Transportation Research Part B: Methodological

Volumn 45, Issue 10, 2011, Pages 1660-1679

  Xing, Tao ^a   Zhou, Xuesong ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

Lagrangian relaxation method; Path travel time reliability; Reliable route; Shortest path algorithm

Indexed keywords

COST FUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; NUMBER THEORY; QUALITY OF SERVICE; RELIABILITY; STATISTICS; TRAFFIC CONTROL; TRANSPORTATION; TRANSPORTATION ROUTES;

LAGRANGIAN RELAXATION METHOD; PATH TRAVEL TIME; RELIABLE ROUTE; SAMPLING-BASED METHOD; SHORTEST PATH ALGORITHMS; SHORTEST PATH PROBLEM; SUB-GRADIENT ALGORITHM; TRANSPORTATION SYSTEM;

TRAVEL TIME;

ALGORITHM; CORRELATION; ESTIMATION METHOD; LAGRANGIAN ANALYSIS; OPTIMIZATION; SAMPLING; SPATIAL ANALYSIS; TRANSPORTATION SYSTEM; TRAVEL TIME;

CALIFORNIA; UNITED STATES;

EID: 80455164690     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2011.06.004     Document Type: Article

References (29)

1. Agrawal, S., Ding, Y., Saberi, A., Ye, Y., 2010. Price of Correlations in Stochastic Optimization, Working Paper. (accessed 02.06.11). http://www.stanford.edu/~shipra/Publications/POC.pdf.
2. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flow: Theory, Algorithms and Applications 1993, Prentice Hall, NJ, p. 93-156 (Chapters 4 and 5).
3. Ashok K., Ben-Akiva M. Dynamic origin-destination matrix estimation and prediction for real-time traffic management systems. Proceedings of the 12th International Symposium on Transportation 1993, Elsevier. C. Daganzo (Ed.).
4. Bertsekas D.P. Nonlinear Programming 1999, Athena Scientific, Cambridge, MA, p. 223-241 (Chapter 2.3).
5. Boyles, S.D., Waller, S.T., 2007. Online routing with nonlinear disutility functions with arc cost dependencies. Presented at the Sixth Triennial Symposium on Transportation Analysis (TRISTAN VI), Phuket, Thailand.
6. Cambridge Systematics, 2005. Traffic Congestion and Reliability: Trends and Advanced Strategies for Congestion Mitigation. Report for Federal Highway Administration, Washington, DC. (accessed 02.06.11). http://www.ops.fhwa.dot.gov/congestion_report/congestion_report_05.pdf.
7. Fan Y.Y., Kalaba R.E., Moore J.E. Arriving on time. Journal of Optimization Theory and Applications 2005, 127(3):497-513.
8. Fan Y.Y., Kalaba R.E., Moore J.E. Shortest paths in stochastic networks with correlated link costs. Computers and Mathematics with Applications 2005, 49(9-10):1549-1564.
9. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 1981, 27(1):1-18.
10. Gabriel S.A., Bernstein D. Nonadditive shortest paths: subproblems in multi-agent competitive network models. Computational & Mathematical Organization Theory 2000, 6(1):29-45.
11. Guignard M., Kim S. Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Mathematical Programming 1987, 39(2):215-228.
12. Handler G.Y., Zang I. A dual algorithm for the constrained shortest path problem. Networks 1980, 10(4):293-309.
13. Henig M.I. The shortest path problem with two objective functions. European Journal of Operational Research 1986, 25(2):281-291.
14. Joernsten K., Naesberg M. A new Lagrangian relaxation approach to the generalized assignment problem. European Journal of Operational Research 1986, 27(3):313-323.
15. Larsson T., Migdalas A., Ronnqvist M. A Lagrangean heuristic for the capacitated concave minimum cost network flow problem. European Journal of Operational Research 1994, 78(1):116-129.
16. Miller-Hooks E.D., Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 2000, 34(2):198-215.
17. Nedic, A., 2002. Subgradient methods for convex minimization. Ph.D. Dissertation, Massachusetts Institute of Technology.
18. Nie Y., Wu X. Shortest path problem considering on-time arrival probability. Transportation Research Part B 2009, 43(6):597-613.
19. Nie, Y., Wu, X., 2009b. Reliable a priori shortest path problem with limited spatial and temporal dependencies. In: Proceedings of the 18th International Symposium on Transportation and Traffic Theory, pp. 169-196.
20. Noland R.B., Polak J.W. Travel time variability: a review of theoretical and empirical issues. Transportation Reviews 2002, 122(1):39-54.
21. Noland R.B., Small K.A., Koskenoja P.M., Chu X. Simulating travel reliability. Regional Science and Urban Economics 1998, 28(5):535-564.
22. Prato C.G. Route choice modeling: past, present and future research directions. Journal of Choice Modelling 2009, 2(1):65-100.
23. Scott, K., Bernstein, D., 1997. Solving a best path problem when the value of time function is nonlinear. Preprint 980976 of the Transportation Research Board.
24. Sen S., Pillai R., Joshi S., Rathi A.K. A mean-variance model for route guidance in advanced traveler information systems. Transportation Science 2001, 35(1):37-49.
25. Sivakumar R.A., Batta R. The variance-constrained shortest path problem. Transportation Science 1994, 28(4):309-316.
26. Small K.A. The scheduling of consumer activities: work trips. American Economic Review 1982, 72(3):467-479.
27. Tsaggouris, G., Zaroliagis, C., 2004. Nonadditive Shortest Paths, Algorithms - ESA 2004, LNCS 3221, Springer-Verlag, p. 822-834.
28. Zhou X., Mahmassani H.S. A structural state space model for real-time traffic origin-destination demand estimation and prediction in a day-to-day learning framework. Transportation Research Part B 2007, 41(8):823-840.
29. Zhou X., Mahmassani H.S., Zhang K. Dynamic micro-assignment modeling approach for integrated multimodal urban corridor management. Transportation Research Part C 2008, 16(2):167-186.