Journal of Korean Society of Transportation (대한교통학회지)

Korean Society of Transportation (대한교통학회)
권호 표지

A Coarse Grid Method for the Real-Time Route Search in a Large Network

복잡한 대규모의 도로망에서 실시간 경로 탐색을 위한 단계별 세분화 방법

  • 김성인 (고려대학교 산업시스템정보공학과) ;
  • 김현기 (교통개발연구원)
  • Published : 2004.01.01
Download PDF
⟨ Previous Next ⟩

Abstract

The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

복잡한 대규모의 도로망에서 방대한 정보를 분석하여 실시간으로 최적 경로를 탐색해야 하는 경로 안내 시스템에서는 탐색 효율이 필수적이다. 리를 위하여 많은 연구들이 탐색 대상이 되는 노드와 링크의 수를 줄이려고 노력해왔다. 이 논문에서는 일부 영역만이 탐색으로 함수의 최적값을 찾는 단계별 세분화 방법(Coarse Grid Method)의 원리를 도로망에 응용한ㄴ다. 처음에는 간선 도로망, 다음에는 주요 도로망, 그 다음에는 세부 도로망 등으로 그 대상을 단계적으로 세분화함으로써 동시에 수많은 노드들간의 경로를 찾는 기존 방법에서의 탐색시간을 단축한다. 이 시스템을 우리나라 전국 규모의 충분히 세분화된 실제 도로망에 적용하여 시스템의 효율성, 실용성과 실시간 운영 가능성을 경로의 탐색 시간, 경로의 적합성 등에서 입증한다.

Keywords

References

  1. 김영찬 . 김태용(2001). '검지자료합성을 통한 도시 간선도로 실시간 통행시간 추정모형,' 대한교통학회지, 제19권 제6호, 대한교통학회. pp.171-182
  2. 김태진 . 한민홍(2001). '중앙집중형 도로교통정보 시스템에서 다중경로탐색 알고리즘', 대한교통학회지, 제19권 제6호, 대한교통학회. pp.183-194
  3. 장인성 . 문형수( 2001). '유전자 알고리즘을 이용한 도시도로망에서의 첨단 여행자 정보시스템 운영계획, 대한교통학회지, 제 19권 제4호, 대한교통학회, pp.85-96
  4. Adler. J. L., and Blue. V. J. (2002). 'A Cooperative Multi-agent Transportation Management and Route Guidance System,' Transportation Research. Part C. Emerging Technologies, VoL 10. pp.433-454 https://doi.org/10.1016/S0968-090X(02)00030-X
  5. Ahuja. R. K., Magnanti. T. L. and Orlin. J. B. (1993). Network Flows. Prentice Hall
  6. Backhouse, R. C., van den Ei,inde, J. P. H. W. and van Gasteren, A. J. M. (1994), Calculating Path Algorithms, Science of Computer Programming, Vol.22. pp.3-19 https://doi.org/10.1016/0167-6423(94)90005-1
  7. Blewett, W. J. and Hu. T. C. (1997), 'Tree Decomposition Algorithm for Large Networks.' Networks, Vol.7. pp.289-296 https://doi.org/10.1002/net.3230070402
  8. Choi, G. S., Seo, K. S. and Park, J. J. (2002). 'Using Evolution Program to Develop Effective Search Method for Alternative Routes,' Journal of Korea Society of Transportation. Vol.20, No.2, pp.71-79
  9. Chou, Y.-L.. Romei,in , H. E. and Smith, R. L. (1998). 'Approximating Shortest Paths in Large-scale Networks with an Application to Intelligent Transportation Systems.' INFORMS Journal on Computing. Vol.10. No.2, pp.163-179 https://doi.org/10.1287/ijoc.10.2.163
  10. Deflorio, F. P. (2003). 'Evaluation of a React ive Dynamic Route Guidance Strategy,' Transportation Research. Part C, Emerging Technologies. Vol.11, No.5, pp.375-388 https://doi.org/10.1016/S0968-090X(03)00031-7
  11. Fu, L. (2001). 'An Adaptive Routing Algorithm for In-vehicle Route Guidance Systems with Real-time Information,' Transportation Research Part B, Methodological. Vol.35. pp.749-765 https://doi.org/10.1016/S0191-2615(00)00019-9
  12. Gallo, G. and Pallottino, S. (1988), 'Shortest Path Algorithms,' Annals of Operations Research, Vol.13, pp.3-79
  13. Giarratano, J. and Riley. G. (1998), Expert Systems. Principles and Programming, PWS Publishing Company
  14. Han. Y.. Pan, V. Y. and Reif. J. H. (1997). Efficient Parallel Algorithm for Computing All Pair Shortest Paths in Di rected Graphs. Algorithmica , Vol.17. pp.399-415. https://doi.org/10.1007/BF02523680
  15. Hounsell, N. B. and Ishtiaq , S. (1997), 'Journey Time Forecasting for Dynamic Route Guidance Systems in Incident Conditions.' International Journal of Forecasting, Vol.13, pp.33-42 https://doi.org/10.1016/S0169-2070(96)00698-X
  16. Hu. T. C. (1968), 'A Decomposition Algorithm for Shortest Paths in a Network,' Operations Research, Vol.16. pp.91-102 https://doi.org/10.1287/opre.16.1.91
  17. Hu, T. C. and Torres, W. T. (1969). 'Shortcut in the Decomposition Algorithm for Shortest Paths in a Network' IBM Journal of Research and Development. Vo1.13. pp.387-390. https://doi.org/10.1147/rd.134.0387
  18. Kaysi. I., Ben-Akiva, M. and Koutsopoulos. H. (1993), 'Integrated Approach to Vehicle Routing and Congestion Prediction for Real-time Driver Guidance,' Transportation Research Record. Issue 1408. pp.66-74
  19. Kim. S. I. & Kim, H. (2002). 'Design and Implementation of an Intelligent System for Real-time Route Guidance,' IE Interface, Vol.15. No.4, pp.374-381.
  20. Lee, C. (1994), 'A Multiple-Path Routing Strategy for Vehicle Route Guidance Systems, Transportation Research: Part C, Vol.2. No.3 , pp.185-195 https://doi.org/10.1016/0968-090X(94)90008-6
  21. Liu. B. (1997). 'Route Finding by Using Knowledge about the Road Network,' IEEE Transactions on Systems, and Cybernetics - Part A: Systems and Humans, Vol.27, No.4, pp .436-448 https://doi.org/10.1109/3468.594911
  22. Lysgaard, J. (1995), 'A Two-phase Shortest Path Algorithm for Networks with Node Coordinates,' European Journal of Operational Research. Vol.87, pp.368-374 https://doi.org/10.1016/0377-2217(94)00152-3
  23. Mills , G. (1966), 'A Decomposition Algorithm for the Shortest-route Problem,' Operations Research, Vol.14. pp.279-291 https://doi.org/10.1287/opre.14.2.279
  24. Namkoong, S., Rho, J. H. and Choi. J. U. (1998). 'Development of the Tree-based ink Labeling Algorithm for Optimal Path-finding in Urban Transportation Networks,' Mathematical and Computer Modelling. Vol.27, pp.51-65
  25. Nemhauser, G. L. (1966). Introduction to Dynamic Programrning. John Wiley & Sons, Inc
  26. Nemhauser, G. L. (1988). Integer and Combinatorial Optimization, John Wiley & Sons. Inc
  27. Noto, M. and Sato , H. (2000), 'A Method for the Shortest Search by Extended Di.ikstra Algorithm,' IEEE International Conference on Systems, Man, and Cybernetics , Vol.3, pp.2316-2320
  28. Park, C.-K., Sung, K., Doh, S. and Park, S. (2001), 'Finding a Path in the Hierarchical Road Networks,' 2001 IEEE Intelligent Transportation Systems Proceedings. pp.936-942
  29. Romeijn, H. E. and Smith, R. L. (1999), Parallel Algorithms for Solving Aggregated Shortest-path Problems,' Computers and Operations Research, Vol.26, pp.941-953 https://doi.org/10.1016/S0305-0548(99)00029-5
  30. Sanders, B. A. (2001), 'The Shortest Path in Parallel' Information Processing Letters. Vol.77. pp.213-217 https://doi.org/10.1016/S0020-0190(00)00203-9
  31. Sen, A., Soot, S., Thakuriah, P. and Condie, H. (1998), 'Estimation of Static Travel Times in a Dynamic Route Guidance System - II,' Mathematical and Computer Modelling, Vol.27. pp.67-85 https://doi.org/10.1016/S0895-7177(98)00052-1
  32. Sen, A. and Thakuriah, P. (1995), 'Estimation of Static Travel Times in a Dynamic Route Guidance System, Mathematical and Computer Modelling, Vol.22, pp.83-101
  33. Shapiro, J., Waxman, J. and Nir, D. (1992), 'Level Graphs and Approximate Shortest Path Algorithms,' Networks. Vol.22, pp.691 -717 https://doi.org/10.1002/net.3230220707
  34. Thakuriah, P. and Sen, A. (1996), 'Quality of Information Given by Advanced Traveler Information Systems, Transportation Research: Part C, Vol.4, No.5, pp.249-266 https://doi.org/10.1016/S0968-090X(97)82900-2
  35. Wahle, J., Annen, O., Schuster, C.. Neubert, L, and Schreckenberg, M. (2001), 'A Dynamic Route Guidance System Based on Real Traffic Data,' European Journal of Operational Research , Vol.13. pp.302-308
  36. Yu, G. and Yang, J. (1998), 'On the Robust Path Problem,' Computers and Operations Research, Vol.25, No.6, pp.457-468 https://doi.org/10.1016/S0305-0548(97)00085-3
  37. Zhan, F. B. and Noon, C. E. (1998), 'Shortest Path Algorithms: An Evaluation Using Real Road Networks,' Transportation Science, Vol.32, No.1. pp.65-73 https://doi.org/10.1287/trsc.32.1.65
  38. Ziliaskopoulos, A., Kotzinos, D. and Mahmassani, H. S. (1997), 'Design and Implementation of Parallel Time-dependent Least Time Path Algorithms for Intelligent Transportation Systems Applications,' Transportation Research: Part C, Vol.5, No.2, pp.95-107 https://doi.org/10.1016/S0968-090X(97)00004-1
  39. Ziliaskopoulos, A. and Mahmassani, H. S. (1993),, 'Time-dependent, Shortest-path Algorithm for Real-time Intelligent Vehicle Highway System Applications.' Transportation Research Record, Issue 1408. pp.94-100