Reformulation and solution algorithms for absolute and percentile robust shortest path problems

IEEE Transactions on Intelligent Transportation Systems

Volumn 14, Issue 2, 2013, Pages 943-954

  Xing, Tao ^a   Zhou, Xuesong ^a  

^a University of Utah   (United States)

Author keywords

Algorithms; route guidance; traffic information systems; traffic planning

Indexed keywords

LAGRANGIAN RELAXATION; LINEAR PROGRAMMING PROBLEM; RELIABILITY GUARANTEE; REPRESENTATION SCHEMES; ROUTE GUIDANCE; SHORTEST PATH PROBLEM; TRAFFIC INFORMATION SYSTEMS; TRAFFIC PLANNING;

ALGORITHMS; TRAFFIC CONTROL; TRANSPORTATION ROUTES; TRAVEL TIME;

GRAPH THEORY;

EID: 84878718960     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2013.2250966     Document Type: Article

References (18)

1. "Traffic congestion and reliability: Trends and advanced strategies for congestion mitigation, " Fed. Highway Admin., Washington, DC, USA, Tech. Rep., Sep. 2005.
2. Y. Nie, "Multi-class percentile user equilibrium with flow-dependent stochasticity, " Trans. Res. Part B, Methodol., vol. 45, no. 10, pp. 1641-1659, Dec. 2011.
3. F. Ordonez and N. Stier-Moses, "Wardrop equilibria with risk-averse users, " Trans. Sci., vol. 44, no. 1, pp. 63-86, Feb. 2010.
4. D. Bertsimas and M. Sim, "Robust discrete optimization and network flows, "Math. Program. Ser. B, vol. 98, no. 1-3, pp. 49-71, Sep. 2003.
5. I. Murty and S. S. Her, "Solving min-max shortest path problems on a network, " Naval Res. Logist., vol. 39, no. 5, pp. 669-683, Aug. 1992.
6. M. E. Bruni and F. Guerriero, "An enhanced exact procedure for the absolute robust shortest path problem, " Int. Trans. Oper. Res., vol. 17, no. 2, pp. 207-220, Mar. 2010.
7. G. Yu and J. Yang, "On the robust shortest path problem, " Comput. Oper. Res, vol. 25, no. 6, pp. 457-468, Jun. 1998.
8. O. E. Karasan, M. C. Pinar, and H. Yaman, "The robust shortest path problem with interval data, " Working Paper.
9. R. Montemanni and L. M. Gambardella, "Robust shortest path problems with uncertain costs, " IDSIA /USI-SUPSI, Lugano, Switzerland, Rep. IDSIA-03-08, 2008.
10. Y. Y. Fan, R. E. Kalaba, and J. E. Moore, "Arriving on time, " J. Optimiz. Theory Appl., vol. 127, no. 3, pp. 497-513, Dec. 2005. (Pubitemid 41806937)
11. Y. Nie and X. Wu, "Shortest path problem considering on-time arrival probability, " Trans. Res. Part B, Methodol., vol. 43, no. 6, pp. 597-613, Jul. 2009.
12. C. E. Sigal, A. Alan, B. Pritsker, and J. J. Solberg, "The stochastic shortest route problem, " Oper. Res., vol. 28, no. 5, pp. 1122-1129, Sep. /Oct. 1980.
13. B. Y. Chen, W. H. Lam, A. Sumalee, and Z. L. Li, "Reliable shortest path finding in stochastic networks with spatial correlated link travel times, " Int. J. Geograph. Inf. Sci., vol. 26, no. 2, pp. 365-386, 2012.
14. Y. Chen, M. G. H. Bell, and K. Bogenberger, "Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system, " IEEE Trans. Intell. Transp. Syst., vol. 8, no. 1, pp. 14-20, Mar. 2007.
15. R. Seshadri and K. K. Srinivasan, "Algorithm for determining most reliable travel time path on network with normally distributed and correlated link travel times, " Trans. Res. Rec., vol. 2196, pp. 83-92, 2010.
16. K. Joernsten and M. Naesberg, "A new Lagrangian relaxation approach to the generalized assignment problem, " Eur. J. Oper. Res., vol. 27, no. 3, pp. 313-323, Dec. 1986.
17. T. Xing and X. Zhou, "Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach, " Trans. Res. Part B, Methodol., vol. 45, no. 10, pp. 1660-1679, Dec. 2011.
18. M. L. Fisher, "The Lagrangian relaxation method for solving integer programming problems, "Manage. Sci., vol. 27, no. 1, pp. 1-18, Jan. 1981.