The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지

Shortest Path-Finding Algorithm using Multiple Dynamic-Range Queue(MDRQ)

다중 동적구간 대기행렬을 이용한 최단경로탐색 알고리즘

  • 김태진 ((주)모토로라 코리아 테크놀러지 센터-CDMA 소프트웨어팀) ;
  • 한민홍 (고려대학교 산업공학과)
  • Published : 2001.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

Keywords

References

  1. Narsingh Dco and Chi yin Pang. 'Shortest-Path Algorithms : Taxonomy and Annotation,' Networks 14, pp. 275-323, 1984 https://doi.org/10.1002/net.3230140208
  2. B. V. Cherkassky, A. V. Goldberg and T. Radzik, 'Shortest paths algorithms : Theory and experimental evaluation,' Mathematical Programming 73, pp. 129-174, 1996 https://doi.org/10.1007/BF02592101
  3. E. W. Dijkstra, 'A note on two problems in connection with graphs.' Numerical Mathematics 1. pp.269-271, 1959 https://doi.org/10.1007/BF01386390
  4. R. Bellman, 'On a routing problem,' Quaterly Applied Mathematics 16, pp.87-90, 1958
  5. L. R. Ford Jr., Network flow theory, Rand Co., pp.293, 1956
  6. Floyd, R. W., 'Algorithm 97 : Shortest path,' Communications of ACM 5, pp.345, 1962 https://doi.org/10.1145/367766.368168
  7. M. L. Fredman and R. E.Tarjan. 'Fibonacci heaps and their uses in improved network optimization algorithms,' Journal of the ACM 34, pp.596-615, 1987 https://doi.org/10.1145/28869.28874
  8. 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, 9, pp.215-248, 1979 https://doi.org/10.1002/net.3230090304
  9. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein, 'Buckets, Heaps, Lists and Monotone Priority Queues,' SIAM Journal on Computing 28, pp.1326-1346, 1999 https://doi.org/10.1137/S0097539796313490
  10. Pape, U., 'Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem,' Mathematical Programming. 7, pp.212-222, 1974 https://doi.org/10.1007/BF01585517
  11. Pallottino, S., 'Shortest-Path Methods : Complexity, Interrelations and New Propositions,' Networks. 14, pp.257-267, 1984 https://doi.org/10.1002/net.3230140206
  12. F. Glover, D. Klingman and N. Phillips, 'A New Polynomial Bounded Shortest Path Algorithm,' Operations Research Vol.33, pp.65-73, 1985
  13. Johnson, D. B., 'Efficient special purpose priority queues,' Proceedings of the 15th Annual Allerton Conference on Communication, Control and Computing, pp.1-7, 1977
  14. R. B. Dial, 'Algorithm 360 : Shortest path forest with topological ordering,' Communications of the ACM 12, pp.632-633, 1969 https://doi.org/10.1145/363269.363610