Browse > Article

Performance Evaluation for One-to-One Shortest Path Algorithms  

심충섭 ((주)디지웨이브)
김진석 (서울대학교 컴퓨터통계학과)
Abstract
A Shortest Path Algorithm is the method to find the most efficient route among many routes from a start node to an end node. It is based on Labeling methods. In Labeling methods, there are Label-Setting method and Label-Correcting method. Label-Setting method is known as the fastest one among One-to-One shortest path algorithms. But Benjamin[1,2] shows Label-Correcting method is faster than Label-Setting method by the experiments using large road data. Since Graph Growth algorithm which is based on Label-Correcting method is made to find One-to-All shortest path, it is not suitable to find One-to-One shortest path. In this paper, we propose a new One-to-One shortest path algorithm. We show that our algorithm is faster than Graph Growth algorithm by extensive experiments.
Keywords
One-to-One; Shortest Path Algorithm; Graph Growth; Label-Correcting;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 최재원, '시변 교통량을 고려한 차량 경로계획 시스템의 구현,' 공학석사 학위논문, 서울대학교 전기공학부 대학원, 2000
2 U. Pape, 'Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem,' Mathematical Programming, vol. 7, pp. 212-222, 1974   DOI
3 S. Pallottino, 'Shortest-Path Methods : Complexity, Interrelations and New Propositions,' Networks, vol. 14, pp. 257-267, 1984   DOI   ScienceOn
4 최기주, 'U-Turn을 포함한 가로망 표현 및 최단경로의 구현,' 대한교통학회지, vol. 13, no. 3, pp. 35-52, 1995   과학기술학회마을
5 노정현, 남궁성, '도시가로망에 적합한 최단경로탐색기법의 개발,' 대한국토도시계획학회지, vol. 30, no. 5, pp. 153-168, 1995   과학기술학회마을
6 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
7 E. W. Dijkstra, 'A Note on Two Problems in Connection with Graphs,' Numerische Mathematik, I, pp. 269-271, 1959   DOI
8 B. V. Cherkassky, A. V. Goldberg and T. Redzik, 'Shortest Paths Algorithms : Theory and Experimental Evaluation,' Mathematical Programming, vol. 73, no. 2, pp. 129-174, 1996   DOI
9 이석호역, '자료구조론,' 홍릉과학출판사, pp. 223-224, 1991
10 F. B. Zhan, 'Three Fastest Shortest Path Algorithms on Real Network : Data Structures and Procedures,' Journal of Geographic Information and Decision Analysis, vol. 1, no. 1, pp. 69-82, 1997