Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem

Transportation Research Part B: Methodological

Volumn 59, Issue , 2014, Pages 22-44

  Yang, Lixing ^a   Zhou, Xuesong ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b Arizona State University   (United States)

Author keywords

A priori least expected time path; Branch and bound algorithm; Lagrangian relaxation; Time dependent traffic network

Indexed keywords

COMPUTATIONAL EFFICIENCY; GRADIENT METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; STOCHASTIC SYSTEMS; TRAVEL TIME;

APPROXIMATE OPTIMAL SOLUTIONS; BRANCH-AND-BOUND ALGORITHMS; EXPECTED TIME; INTEGER PROGRAMMING MODELS; LAGRANGIAN MULTIPLIERS; LAGRANGIAN RELAXATION; TRAFFIC NETWORKS; TRAVEL TIME CORRELATIONS;

BRANCH AND BOUND METHOD;

ALGORITHM; HEURISTICS; LAGRANGIAN ANALYSIS; LINEAR PROGRAMING; STOCHASTICITY; TRAFFIC MANAGEMENT; TRAVEL TIME;

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

References (40)

1. Birge, J.R., 1995. Current Trends in Stochastic Programming Computation and Applications. Technical Report, University of Michigan.
2. Chen A., Ji Z. Path finding under uncertainty. Journal of Advanced Transportation 2005, 39(1):19-37.
3. Chen P., Nie Y. Bicriterion shortest path problem with a general nonadditive cost. Transportation Research Part B 2013, 57(1):419-435.
4. Chiu Y.C., Huynh N. Location configuration design for dynamic message signs under stochastic incident ATIS and scenarios. Transportation Research Part C 2007, 15(1):33-50.
5. Fu L. An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transportation Research Part B 2001, 35(8):749-765.
6. Fu L., Rilett L.R. Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B 1998, 32(7):499-516.
7. Gao S., Chabini I. Optimal routing policy problems in stochastic time-dependent networks. Transportation Research Part B 2006, 40(2):93-122.
8. Guignard M. Lagrangian relaxation. TOP 2003, 11(2):151-228.
9. Guignard M., Kim S. Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Mathematical Programming 1987, 39(2):215-218.
10. Hall R.W. The fastest path through a network with random time-dependent travel times. Transportation Science 1986, 20(3):182-188.
11. Hickman M.D., Bernstein D.H. Transit service and path choice models in stochastic and time-dependent networks. Transportation Science 1997, 31(2):129-146.
12. Huang H., Gao S. Optimal paths in dynamic networks with dependent random link travel times. Transportation Research Part B 2012, 46(5):579-598.
13. Liu B. Theory and Practice of Uncertain Programming 2002, Physica-Verlag, Heidelberg.
14. Mahmassani, H.S., Hawas, Y., Abdelghani, K., Abdelfatah, A., Chiu, Y.C., Kang, Y., 1998. DYNASMART-X, Volume II: Analytical and Algorithmic Aspects. Technical Report ST067-85. Center for Transportation Research, The University of Texas at Austin, USA.
15. Miller, E.D., Mahmassani, H.S., Ziliaskopoulos, A., 1994. Path search techniques for transportation networks with time-dependent, stochastic arc costs. In: Proceedings of IEEE International Conference on Systems, Man and Cybernetics: Humans, Information and Technology, San Antonio, TX.
16. Miller-Hooks, E.D., 1997. Optimal Routing in Time-varying, Stochastic Network: Algorithms and Implementations. Ph.D. Dissertation, University of Texas at Austin, USA.
17. Miller-Hooks E. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 2001, 37(1):35-52.
18. Miller-Hooks E.D., Mahmassani H.S. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 2000, 34(2):198-215.
19. Miller-Hooks E., Mahmassani H. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. European Journal of Operational Research 2003, 146(1):67-82.
20. Mukherjee A., Hansen M. A dynamic stochastic model for the single airport ground holding problem. Transportation Science 2007, 41(4):444-456.
21. Nie Y., Wu X. Shortest path problem considering on-time arrival probability. Transportation Research Part B 2009, 43(6):597-613.
22. 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, Hong Kong, China.
23. Nielsen, L.R., 2003. Route Choice in Stochastic Time-dependent Networks. Ph.D. Dissertation, University of Aarhus, Denmark.
24. Pallottino S., Scutella M.G. Shortest path algorithms in transportation models: classical and innovative aspects. Equilibrium and Advanced Transportation Modelling 1997, Kluwer, Boston. P. Marcotte, S. Nguyen (Eds.).
25. Pretolani D. A directed hypergraph model for random time dependent shortest paths. European Journal of Operational Research 2000, 123(2):315-324.
26. Richetta O., Odoni A.R. Dynamic solution to the ground holding problem in air traffic control. Transportation Research Part A 1994, 28(3):167-185.
27. Samaranayake, S., Blandin, S., Bayen, A., 2011. A tractable class of algorithms for reliable routing in stochastic networks. In: Proceedings of the 19th International Symposium on Transportation and Traffic Theory, Berkeley, USA.
28. Shapiro A., Dentcheva D., Ruszczynshi A. Lectures on Stochastic Programming: Modeling and Theory 2009, SIAM-Society for Industrial and Applied Mathematics, Philadelphia.
29. Sivakumar R.A., Batta R. The variance-constrained shortest path problem. Transportation Science 1994, 28(4):309-316.
30. Smith, K., Smith, B., 2001. Forecasting the Clearance Time of Freeway Accidents. Research Report, Center for transportation studies, University of Virginia, Charlottesville, VA.
31. Sun L., Gu W., Mahmassani H. Estimation of expected travel time using the method of moment. Canadian Journal of Civil Engineering 2011, 38(2):154-165.
32. Varaiya P. California's performance measurement system: improving freeway efficiency through transportation intelligence. TR News 2002, 218:18-24.
33. Wellman, M.P., Ford, M., Larson, K., 1995. Path planning under time-dependent uncertainty. In: Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, Montreal, Canada.
34. Wu X., Nie Y. Implementation issues for the reliable a priori shortest path problem. Transportation Research Record 2009, 2091(2):51-60.
35. Wu Q., Hartley J., Al-Dabass D. Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network. International Journal of Simulation 2005, 6(7-8):53-60.
36. Xie C., Waller S.T. Parametric search and problem decomposition for approximating Pareto-optimal paths. Transportation Research Part B 2012, 46(8):1043-1067.
37. Xing T., Zhou X. Finding the most reliable path with and without link travel time correlation: a Lagrangian substitution based approach. Transportation Research Part B 2011, 45(10):1660-1679.
38. Xing T., Zhou X. Reformulation and solution algorithms for absolute and percentile robust shortest path problems. IEEE Transactions on Intelligent Transportation Systems 2013, 14(2):943-954.
39. Yang B., Miller-Hooks E. Adaptive routing considering delays due to signal operations. Transportation Research Part B 2004, 38(5):385-413.
40. Ziliaskopoulos, A., Mahmassani, H.S., 1992. Design and implementation of a shortest path algorithm with time-dependent arc costs. In: Proceedings of the 5th Advanced Technology Conference, Washington, DC, USA.