Browse > Article
http://dx.doi.org/10.12815/kits.2012.11.5.038

Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks  

Kim, Taehyeong (한국건설기술연구원 첨단교통연구실)
Kim, Taehyung (한국교통연구원 교통시스템통합기술개발실)
Park, Bum-Jin (한국건설기술연구원 첨단교통연구실)
Kim, Hyoungsoo (한국건설기술연구원 첨단교통연구실)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.11, no.5, 2012 , pp. 38-45 More about this Journal
Abstract
Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.
Keywords
Time dependent shortest path problem; one-to-one shortest path; Dijkstra's algorithm; Graph growth algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. E. Bellman, "On a Routing Problem", Quart. Applied. Math., vol. 16, pp.87-90, 1958.   DOI
2 E. W. Dijkstra, "A Note on Two Problems in Connection with Graphs", Numeriche Mathmatik, vol 1, pp.269-271, 1959.   DOI   ScienceOn
3 R. B. Dial, F. Glover, D. Karney, and D. Klingman, "A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees", Networks, vol. 9, pp.215-248, 1979.   DOI   ScienceOn
4 S. Pallottino, "Shortest-Path Methods: Complexity, Interrelations and New Propositions", Networks, vol. 14, pp.257-267, 1984.   DOI   ScienceOn
5 G. Gallo, and S. Pallottino, "Shortest Path Algorithms", Annals of Operations Research, vol. 13, pp.3-79, 1988.
6 T. Kim and A. Haghani, "Model and Algorithm Considering Time-Varying Travel Times to Solve Static Multidepot Dial-a-Ride Problem", Transportation Research Record, no. 2218, pp.68-77, 2011.
7 T. Kim, Model and Algorithm for Solving Real Time Dial-a-Ride Problem, Ph. D. Dissertation, University of Maryland, 2011.
8 F. B. Zhan, and C. E. Noon, "A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths", Journal of Geographic Information and Decision Analysis, vol. 4, no. 2, pp.1-11, 2000.
9 B. V. Cherkassky, A. V. Goldberg, and T. Radzik, Shortest Paths Algorithms: Theory and Experimental Evaluation, Technical Report 93-1480, Computer Science Department, Stanford University, 1993.
10 F. B. Zhan, and C. E. Noon, "Shortest Path Algorithms: An Evaluation Using Real Road Networks", Transportation Science, vol. 32, no. 1, pp.65-73, 1998.   DOI   ScienceOn
11 이미영, 박제진, 정점례, 박동주, "사용자 맞춤형 대중교통 경로정보제공을 위한 다계층의 다목적 경로탐색기법 연구", 한국ITS학회논문지, 제7권, 제3호, pp.1-4, 2008. 6.
12 K. L. Cooke, and E. Halsey, "The shortest route through a network with time-dependent inter-nodal transit times", Journal of Mathematical Analysis and Applications, vol. 14, pp.493-498, 1966.   DOI
13 A. Orda and R. Rom, "Shortest-Path and Minimum- Delay Algorithms in Networks with Time-Dependent Edge-Length", Journal of the ACM, vol. 37, pp.607-625, 1990.   DOI
14 A. K. Ziliaskopoulos, and H. S. Mahmassani, "Time-Dependent Shortest Path Algorithm for Real-Time Intelligent Vehicle Highway System Applications", Transportation Research Record no. 1408, pp.94-104, 1993.
15 K. Sung, M. G. H. Bell, M. Seong, and S. Park, "Shortest Paths in a Network with Time-Dependent Flow Speeds", European Journal of Operational Research, vol. 121, no. 1, pp.32-39, 2000.
16 S. Ichoua, M. Gendreau, and J.-Y. Potvin, "Vehicle Dispatching with Time-Dependent Travel Times", European Journal of Operational Research, vol. 144, no. 2, pp.379-396, 2003.   DOI   ScienceOn
17 F. B. Zhan, "Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures", Journal of Geo-graphic Information and Decision Analysis, vol. 1, no. 1, pp.69-82, 1997.
18 심충섭, 김진석, "One-to-One 최단경로 알고리즘의 성능 평가", 정보과학회논문지: 시스템 및 이론, 제29권 제11호, pp.634-639, 2002. 12.
19 Bar-gera, H., http://www.bgu.ac.il/-bargera/tntp/, Accessed, 2011년 8월 접속.