Implementation issues for the reliable a priori shortest path problem

Transportation Research Record

Volumn , Issue 2091, 2009, Pages 51-60

  Wu, Xing ^a   Nie, Yu Marco ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

COMPUTATIONAL PERFORMANCE; CONVOLUTION INTEGRALS; DISCRETIZATION SCHEME; IMPLEMENTATION STRATEGIES; LABEL-CORRECTING; LARGE-SCALE APPLICATIONS; NONDETERMINISTIC POLYNOMIAL; SHORTEST PATH PROBLEM; SOLUTION TECHNIQUES; STOCHASTIC NETWORKS;

STOCHASTIC SYSTEMS;

EID: 76149088736     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2091-06     Document Type: Article

References (35)

1. Hall, R. W. The Fastest Path Through a Network with Random Time-Dependent Travel Time. Transportation Science, Vol.20, 1986, pp. 182-188.
2. Andreatta, G., and L. Romeo. Stochastic Shortest Paths with Recourse. Networks, Vol.18, 1988, pp. 193-204.
3. Polychronopoulos, G. H., and J. N. Tsitsiklis. Stochastic Shortest Path Problems with Recourse. Networks, Vol.27, 1996, pp. 133-143.
4. Cheung, R. K. Iterative Methods for Dynamic Stochastic Shortest Path Problems. Naval Research Logistics, Vol.45, 1998, pp. 769-789.
5. Fu, L., and L. R. Rilett. Expected Shortest Paths in Dynamic and Stochastic Traffic Networks. Transportation Research, Part B, Vol.32, No.7, 1998, pp. 499-516.
6. Fu, L. An Adaptive Routing Algorithm for In-Vehicle Route Guidance Systems with Real-Time Information. Transportation Research, Part B, Vol.35, No.8, 2001, pp. 749-765.
7. Miller-Hooks, E. D., and H. S. Mahmassani. Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Transportation Science, Vol.34, 2000, pp. 198-215.
8. Miller-Hooks, E. D. Adaptive Least-Expected Time Paths in Stochastic, Time-Varying Transportation and Data Networks. Networks, Vol.37, 2001, pp. 35-52.
9. Waller, S. T., and A. K. Ziliaskopoulos. On the Online Shortest Path Problem with Limited Arc Cost Dependencies. Networks, Vol.40, 2002, pp. 216-227.
10. Provan, J. S. A Polynomial-Time Algorithm to Find Shortest Paths with Recourse. Networks, Vol.41, 2003, pp. 115-125.
11. Fan, Y., R. Kalaba, and J. Moore. Shortest Paths in Stochastic Networks with Correlated Link Costs. Computers and Mathematics with Applications, Vol.49, 2005, pp. 1549-1564.
12. Gao, S., and I. Chabini. Optimal Routing Policy Problems in Stochastic Time-Dependent Networks. Transportation Research, Part B, Vol.40, No.2, 2006, pp. 93-122.
13. Frank, H. Shortest Paths in Probabilistic Graphs. Operations Research, Vol.17, 1969, pp. 583-599.
14. Mirchandani, P. B. Shortest Distance and Reliability of Probabilistic Networks. Computers and Operations Research, Vol.3, 1976, pp. 347-355.
15. Sigal, C. E., A. Alan, B. Pritsker, and J. J. Solberg. The Stochastic Shortest Route Problem. Operations Research, Vol.28, 1980, pp. 1122-1129.
16. Loui, R. P. Optimal Paths in Graphs with Stochastic or Multidimensional Weights. Communications of the ACM, Vol.26, 1983, pp. 670-676.
17. Markowitz, H. Portfolio Selection. Journal of Finance, Vol.7, 1952, pp. 77-91.
18. Eiger, A., P. B. Mirchandani, and H. Soroush. Path Preferences and Optimal Paths in Probabilistic Networks. Transportation Science, Vol.19, 1985, pp. 75-84.
19. Murthy, I., and S. Sarkar. A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems. Transportation Science, Vol.30, 1996, pp. 220-236.
20. Murthy, I. and S. Sarkar. Stochastic Shortest Path Problems with Piecewise Linear Concave Linear Functions. Management Science, Vol.44, 1998, pp. 125-136.
21. Yu, G., and J. Yang. On the Robust Shortest Path Problem. Computers and Operations Research, Vol.25, 1998, pp. 457-468.
22. Montemani, R., and L. Gambardella. An Exact Algorithm for the Robust Shortest Path Problem with Interval Data. Computers and Operations Research, Vol.31, 2004, pp. 1667-1680.
23. Bertsimas, D., and M. Sim. Robust Discrete Optimization and Network Flow. Mathematical Programming Series B, Vol.98, 2003, pp. 49-71.
24. Miller-Hooks, E. D., and H. S. Mahmassani. Least Possible Time Paths in Stochastic, Time-Varying Networks. Computers and Operations Research, Vol.25, 1998, pp. 1107-1125.
25. Miller-Hooks, E. Optimal Routing in Time-Varying, Stochastic Networks: Algorithms and Implementations. PhD thesis. Department of Civil Engineering, University of Texas, Austin, 1997.
26. Miller-Hooks, E. D., and H. S. Mahmassani. Path Comparisons for A Priori and Time-Adaptive Decisions in Stochastic, Time-Varying Networks. European Journal of Operational Research, Vol.146, 2003, pp. 67-82.
27. Bard, J., and J. Bennett. Arc Reduction and Path Preference in Stochastic Acyclic Networks. Management Science, Vol.37, No.2, 1991, pp. 198-215.
28. Nie, Y., and X. Wu. The Shortest Path Problem Considering On-Time Arrival Probability. Transportation Research, Part B, Vol.43, No.6, 2009, pp. 597-613.
29. Hansen, P. Bicriterion Path Problems. In Multiple Criteria Decision Making: Theory and Application (G. Fandel and T. Gal, eds.), Springer-Verlag, New York, 1979, pp. 109-127.
30. Fan, Y., and Y. Nie. Optimal Routing for Maximizing the Travel Time Reliability. Networks and Spatial Economics, Vol.3, No.3, 2006, pp. 333-344.
31. Nie, Y., and X. Wu. Reliable A Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies. In Proc., 18th International Symposium on Transportation and Traffic Theory, in press, 2009.
32. Hadar, J., and W. Russell. Rules for Ordering Uncertain Prospects. American Economic Review, Vol.59, 1969, pp. 25-34.
33. Fan, Y., R. Kalaba, and J. Moore. Arriving on Time. Journal of Optimization Theory and Applications, Vol.127, 2005, pp. 497-513.
34. Henig, M. I. The Shortest Path Problem with Two Objective Functions. European Journal of Operational Research, Vol.25, 1985, pp. 281-291.
35. Bar-Gera, H. Origin-Based Algorithm for the Traffic Assignment Problem. Transportation Science, Vol.36, 2002, pp. 398-417.