Development of User Customized Path Finding Algorithm for Public Transportation Information

대중교통 정보제공을 위한 맞춤형 경로탐색 알고리즘 개발

  • Received : 2008.04.11
  • Accepted : 2008.04.30
  • Published : 2008.05.31


Mass transit information can contribute many benefits to users. Especially, transportation information technology is developing highly with information technology in Korea recently. Hereafter, it is expected to give customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithm in public transportation networks including travel and transfer attributes. In this research, constraints are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding condition arbitrarily is proposed by making the maximum value as variables. In this study, transfer frequency, total travel time, seat confirmation, transfer time and travel time become constraint condition based on k path finding algorithm considering service time constraint condition. Moreover, case study about user customized transfer information is performed in Seoul and metropolitan subway networks.


Supported by : 건설교통부


  1. 신성일(2004), 교통망에 적합한 비루프 경로 탐색 알고리즘, 대한교통학회지, 대한교통학회, 제22권 6호, pp. 121-131
  2. 신성일, 노현수(2004) 링크비루프 최적경로 탐색 알고리즘과 복합대중교통망에의 활용, 교통정책연구, 제11권, pp. 83-103
  3. 조종석(2006) 출발시간제약이 존재하는 동적 복합교통망의 K최소 시간경로탐색, 대한교통학회지, 대한교통학회, pp. 167-176
  4. Azevedo J. A., Costa M. E. O. S., Madeira J.J.E.R.S., Martins E.Q.V. (1993), An algorithm from the ranking of shortest paths, European Journal of Operational Research, Vol. 69, pp. 97-106
  5. De Cea. J. and Fernndez, J.E. (1993) Transit assignment for congested public transport systems: an equilibrium model, Transportation Science, Vol. 27
  6. Lee, M. (2004) Transportation Network Models and Algorithms Considering Directional Delay and Prohibition for Intersection Movement, Ph.D. Dissertation, University of Wisconsin Madison
  7. Lozano, A. and Storchi, G. (2001) Shortest viable path algorithm in multimodal networks, Transportation Research A, Vol. 35, No. 3, pp. 225-241