Identifying multiple reasonable alternative routes: Efficient vector labeling approach

Transportation Research Record

Volumn , Issue 1783, 2002, Pages 111-118

  Park, Dongjoo ^a   Sharma, Shyam Lal ^a   Rilett, Laurence R ^b   Chang, Myungsoon ^c  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

^b TEXAS A AND M UNIVERSITY SYSTEM   (United States)

^c Hanyang University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INFORMATION ANALYSIS; MATHEMATICAL MODELS; SENSITIVITY ANALYSIS;

TRANSPORTATION NETWORKS;

TRANSPORTATION;

EID: 0036962042     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1783-14     Document Type: Article

References (20)

1. Rilett, L. R. Modeling of TRATEK's Dynamic Route Guidance Logic Using the INTEGRATION Model. Ph.D. thesis. Queen's University, Kingston, Ontario, Canada, 1992.
2. Ben-Akiva, M., A. Palma, and I. Kaysi. Dynamic Network Models and Driver Information Systems. Transportation Research, Vol. 25A, No. 5, 1991, pp. 251-266.
3. Lee, C.-K. A Multiple-Path Routing Strategy for Vehicle Route Guidance Systems. Transportation Research, Vol. 2C, No. 3, 1994, pp. 185-195.
4. Dial, R. B. A Probabilistic Multipath Traffic Assignment Model Which Obviates Path Enumeration. Transportation Research, Vol. 5, 1971, pp. 83-111.
5. Daganzo, C. F., and Y. Sheffi. On Stochastic Models of Traffic Assignment. Transportation Science, Vol. 11, No. 3, 1977, pp. 253-274.
6. Jayakrishnan, R., H. S. Mahmassani, and T. Hu. An Evaluation Tool for Advanced Traffic Information and Management Systems in Urban Networks. Transportation Research, Vol. 2C, No. 2, 1994, pp. 129-147.
7. Hellinga, B. Dynamic Synthetic Origin-Destination Matrix Estimation. Ph.D. thesis. Queen's University, Kingston, Ontario, Canada, 1995.
8. Shier, D. R. On Algorithms for Finding the K-Shortest Paths in a Network. Networks, Vol. 9, 1979, pp. 195-214.
9. Yen, J. Y. Finding the K Shortest Loopless Paths in a Network. Management Science, Vol. 17, No. 11, 1971, pp. 712-716.
10. Scott, K., G. Pabon-Jimenez, and D. Bernstein. Finding Alternatives to the "Best" Path. Presented at the 76th Annual Meeting of the Transportation Research Board, Washington, D.C., 1997.
11. Park, D., and L. R. Rilett. Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach. In Transportation Research Record 1607, TRB, National Research Council, Washington, D.C., 1997, pp. 31-37.
12. Aneja, Y. P., V. Aggarwal, and K. P. K. Nair. Shortest Chain Subject to Side Constraints. Networks, Vol. 13, 1983, pp. 295-302.
13. Park, D. Multiple Path Based Vehicle Routing in Dynamic and Stochastic Transportation Networks. Ph.D. dissertation. Texas A&M University, College Station, 1998.
14. Warburton, A. Exact and Approximate Solution of Multiple Objective Shortest Path Problems. Working Paper 83-74. Faculty of Administration, University of Ottawa, Canada, 1983.
15. Park, D., and L. R. Rilett. The Multi-Criteria Optimal Path Problem for Real-Time In-Vehicle Routing. Submitted to Transportation Science (2001).
16. Handler, G. Y., and I. Zhang. A Dual Algorithm for the Constrained Shortest Path Problem. Networks, Vol. 10, 1980, pp. 293-310.
17. Dijkstra, E. W. Note on Two Problems in Connection with Graphs. Numerical Mathematics, Vol. 1, 1959, pp. 269-271.
18. Philips, D. T., and A. Garcia-Diaz. Fundamentals of Network Analysis. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1981.
19. Current, J. R., C. S. Revelle, and J. L. Cohon. The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks. Transportation Science, Vol. 21, No. 3, 1987, pp. 188-197.
20. Cascetta, E., A. Nuzzolo, F. Russo, and A. Vitetta. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems: Specification and Some Calibration Results for Interurban Networks. In Transportation and Traffic Theory: Proceedings of the 13th International Symposium on Transportation and Traffic Theory, Pergamon Press, New York City, 1996, pp. 697-711.