대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제32권3호
  • /
  • Pages.226-235
  • /
  • 2006
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

복수 경로 탐색을 위한 휴리스틱 알고리즘에 대한 연구

Heuristic Algorithm for Searching Multiple Paths

  • 신용욱 (한국과학기술원 산업공학과) ;
  • 양태용 (한국과학기술원 산업공학과) ;
  • 백원장 (코리아 텔레매틱스)
  • 발행 : 2006.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Telematics is expected to be one of the fastest growing businesses in information technology area. It may create a new emerging market in industry related to automotive, telecommunications, and information services. Especially vehicle navigation service is considered as a killer application among telematics service applications. The current vehicle navigation service typically recommends a single path that is based on the traveling time or distance from the origin to the destination. The system provides two options for users to choose either via highway or via any road. Since the traffics and road conditions of big cities are very complicated and dynamic, the demand of multi-path guidance system is increasing in telematics market. The multi-path guidance system should allow drivers to choose a path based on their individual preferences such as traveling time, distance, or route familiarity. Using the Lawler's algorithm, it is possible to find multiple paths; however, due to the lengthy computational time, it is not suitable for the real-time services. This study suggests a computationally feasible and efficient heuristic multiple paths finding algorithm that is reliable for the real-time vehicle navigation services.

키워드

참고문헌

  1. Bellman, R. and Kabala, R. (1960), On kth best policies, Journal of SIAM, 8, 582-585
  2. Brander, A. W. and Sinclair, M. C. (1995), A comparative study of k-shortest path algorithms, In : Proc. 11th UK Performance Engineering Workshop for Computer and Telecommunications Systems
  3. Eppstein, D. (1994), Finding the K shortest paths, In : Proc. 35th IEEE Symp, Foundations of Computer Science (FOCS_94), 154-165
  4. Eppstein, D. (1998), Finding the K shortest paths, SIAM Journal Computing, 28(2), 652-673 https://doi.org/10.1137/S0097539795290477
  5. Goldberg, A. and Harrelson, C. (2005), Computing the Shortest Path: A* Search Meets Graph Theory, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 156-165
  6. Fox, B. L. (1978), Data structures and computer science techniques in operation research, Operations Research, 26, 686-717 https://doi.org/10.1287/opre.26.5.686
  7. Hadjiconstantinou, E. and Christofides, N. (1999), An efficient implementation of an algorithm for finding k shortest simple paths, Networks, 34, 88-101 https://doi.org/10.1002/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1
  8. Hoffman, W. and Pavley, R. (1959), A method for the solution of the nth best path problem, Journal of the Association for Computing Machinery (ACM), 6, 506-514 https://doi.org/10.1145/320998.321004
  9. Katoh, N., Ibaraki, T., and Mine, H. (1982), An efficient algorithm for k shortest simple paths, Networks, 12, 411-427 https://doi.org/10.1002/net.3230120406
  10. Lawler, E. L. (1976), Combinatorial Optimization : Networks and Matroids, Holt, Rinehart & Winston, New York
  11. Pohl, I. (1971), Bi-directional Search, Machine Intelligence, 6, 127-140
  12. Shier, D. R. (1976), Iterative methods for determining the K shortest paths in a network, Networks, 6, 205-229 https://doi.org/10.1002/net.3230060303
  13. Shier, D. R. (1979), On algorithms for finding the Kvshortest paths in a network, Networks, 9, 195-214 https://doi.org/10.1002/net.3230090303
  14. Schnabel, W. and Lohse, D. (1997), Grundlagen der Strassen- Verkehrstechnik under Verkehrsplanung, Baud 2, neue bearb, Aufl.-1997, Verlag fur Bauwesen Gmhh, Berlin
  15. Song, J. H. (2004), Introduction to Telematics, Hongneung Chulpansa, Seoul, Korea, 3-8
  16. Van der Zijpp, N. J. and Fiorenzo Catalano (2005), Path enumeration by finding the constrained K-shortest paths, Transportation Research Part B, 39, 545-563 https://doi.org/10.1016/j.trb.2004.07.004
  17. Yen, J. Y. (1971), Finding the K shortest loop less paths in a network, Management Science, 17, 712-716 https://doi.org/10.1287/mnsc.17.11.712