Application of discrete fourier transform to find reliable shortest paths

Transportation Research Record

Volumn , Issue 2263, 2011, Pages 82-91

  Wu, Xing ^a   Nie, Yu ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; CONVOLUTION; DISCRETE FOURIER TRANSFORMS; DYNAMIC PROGRAMMING; GRAPH THEORY; TRAVEL TIME;

COMPLEXITY ANALYSIS; CONVOLUTION METHODS; DISCRETIZATIONS; NUMERICAL EXPERIMENTS; PATH TRAVEL TIME; SHORT-PATH; THEORETICAL COMPLEXITY; TIME BUDGET; TRAVEL TIME DISTRIBUTIONS;

NUMERICAL METHODS;

EID: 84863296488     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2263-10     Document Type: Article

References (20)

1. Traffic Congestion and Reliability: Trends and Advanced Strategies for Congestion Mitigation. Technical report. FHWA, U.S. Department of Transportation, 2005.
2. Frank, H. Shortest Paths in Probabilistic Graphs. Operations Research, Vol. 17, No. 4, 1969, pp. 583-599.
3. Mirchandani, P. B. Shortest Distance and Reliability of Probabilistic Networks. Computers and Operations Research, Vol. 3, No. 4, 1976, pp. 347-355.
4. Hall, P. Travel Outcome and Performance: The Effect of Uncertainty on Accessibility. Transportation Research Part B: Methodological, Vol. 17, No. 4, 1983, pp. 275-290.
5. Lo, H. K., and Y. K. Tung. Network with Degradable Links: Capacity Analysis and Design. Transportation Research Part B: Methodological, Vol. 37, No. 4, 2003, pp. 345-363.
6. Sigal, C. E., A. Alan, B. Pritsker, and J. J. Solberg. The Stochastic Shortest Route Problem. Operations Research, Vol. 28, No. 5, 1980, pp. 1122-1129.
7. Loui, R. P. Optimal Paths in Graphs with Stochastic or Multidimensional Weights. Communications of the Association for Computing Machinery, Vol. 26, No. 9, 1983, pp. 670-676.
8. Mirchandani, P., and H. Soroush. Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions. Transportation Science, Vol. 21, No. 3, 1987, pp. 133-152.
9. Yu, G., and J. Yang. On the Robust Shortest Path Problem. Computers and Operations Research, Vol. 25, No. 6, 1998, pp. 457-468.
10. Bertsimas, D., and M. Sim. Robust Discrete Optimization and Network Flow. Mathematical Programming Series B, Vol. 98, No. 1-3, 2003, pp. 49-71.
11. Wu, X., and Y. Nie. Modeling Heterogeneous Risk-Taking Behavior in Route Choice. 19th International Symposium on Transportation and Traffic Theory, forthcoming.
12. Nie, Y., and X. Wu. The Shortest Path Problem Considering On-Time Arrival Probability. Transportation Research Part B: Methodological, Vol. 43, No. 6, 2009, pp. 597-613.
13. Miller-Hooks, E. Optimal Routing in Time-Varying, Stochastic Networks: Algorithms and Implementations. PhD thesis. Department of Civil Engineering, University of Texas at Austin, 1997.
14. Bard, J., and J. Bennett. Arc Reduction and Path Preference in Stochastic Acyclic Networks. Management Science, Vol. 37, No. 2, 1991, pp. 198-215.
15. Wu, X., and Y. Nie. Implementation Issues for the Reliable A Priori Shortest Path Problem. In Transportation Research Record: Journal of the Transportation Research Board, No. 2091, Transportation Research Board of the National Academics, Washington, D.C., 2009, pp. 51-60.
16. Nie, Y., X. Wu, P. Nelson, and J. Dillenburg. Reliable Route Guidance: A Case Study from Chicago. Transportation Research Part A: Policy and Practice, under review.
17. Cormen, T., C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, Mass., 2001.
18. Bracewell, R. The Fourier Transform and Its Applications, 3rd ed. McGraw-Hill, Boston, Mass., 2000.
19. Ng, M., and T. Waller. A Computationally Efficient Methodology to Characterize Travel Time Reliability Using the Fast Fourier Transform. Transportation Research Part B: Methodological, Vol. 44, No. 10, 2010, pp. 1202-1219.
20. Cooley, J. W., and J. W. Tukey. An Algorithm for the Machine Calculation of Complex Fourier Series. Mathematics of Computation, Vol. 19, No. 90, 1965, pp. 297-301.