The Journal of The Korea Institute of Intelligent Transport Systems (한국ITS학회 논문지)

The Korea Institute of Intelligent Transport Systems (한국ITS학회)
권호 표지
DOI QR코드

DOI QR Code

Transportation Card Based Optimal M-Similar Paths Searching for Estimating Passengers' Route Choice in Seoul Metropolitan Railway Network

수도권 도시철도망 승객이동경로추정을 위한 교통카드기반 최적 M-유사경로 구축방안

  • 이미영 (국토연구원 국토계획.지역연구본부)
  • Received : 2016.12.19
  • Accepted : 2017.02.17
  • Published : 2017.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

The Seoul metropolitan transportation card's high value lies in its recording of total population movements of the public transit system. In case of recorded information on transit by bus, even though route information utilized by each passenger is accurate, the lack of passenger transfer information of the urban railway makes it difficult to estimate correct routes taken by each passenger. Therefore, pinpointing passenger path selection patterns arising in the metropolitan railway network and using this as part of a path movement estimation model is essential. This research seeks to determine that features of passenger movement routes in the urban railway system is comprised of M-similar routes with increasing number of transfer reflected as additional costs. In order to construct the path finding conditions, an M-similar route searching method is proposed, embedded with non additive path cost which appears through inclusion of the stepwise transportation parameter. As well, sensitivity of the M-similar route method based on transportation card records is evaluated and a stochastic trip assignment model using M-similar path finding is constructed. From these, link trip and transfer trip results between lines of the Seoul metropolitan railway are presented.

수도권 교통카드는 대중교통인구 이동에 대한 기록을 간직하고 있는 전수화 자료로서 가치가 높다. 교통카드에 기록된 정보는 버스통행의 경우 승객의 이동에 대한 정확한 정보를 담고 있으나, 도시철도는 역사의 진출입 단말기 정보만 기록되어 환승을 포함한 경로정보를 파악하기 어렵다. 수도권 도시철도망에서 나타나는 승객의 경로선정 특성을 파악하여 이동 경로추정을 위한 방안으로 활용하는 것이 필요하다. 본 연구는 수도권 도시철도의 승객이동 경로가 갖는 특징으로 M-유사경로와 환승회수의 증가를 추가적인 비용으로 고려한다고 검토하였다. 경로탐색조건을 구축하기 위해 계단형 환승계수가 도입된 비가산성 통행비용에 대하여 M-경로탐색기법을 제안하였다. 교통카드기록을 대상으로 수도권 도시철도 역간 경로의 민감도를 거시적으로 검토하였으며, M-경로탐색기법을 확률적 통행배정모형으로 구축하여 수도권 도시철도의 링크통행량, 노선간 환승통행량의 결과를 도출하였다.

Keywords

References

  1. Azevedo J. A., Costa M. E. O. S., Madeira J. J. E. R. S. and Martins E. Q. V.(1993), "An Algorithm from the Ranking of Shortest Paths," European Journal of Operational Research, vol. 69, pp.97-106. https://doi.org/10.1016/0377-2217(93)90095-5
  2. Bellman R.(1957), Princeton University Press, Princeton, New Jersey, "Dynamic Programming".
  3. Gabriel S. and Bernstein D.(1997), "The Traffic Equilibrium Problem with Nonadditive Path Costs," Transportation Science, vol. 20, no. 5, pp.337-348.
  4. Lee M. and Sohn J.(2016), "Estimating Transfer Trips in Seoul Metropolitan Urban Railway Network-Using Transportation Car," The Journal of The Korea Institute of Intelligent Transport Systems, vol. 15, no. 6, pp.36-46. https://doi.org/10.12815/kits.2016.15.6.036
  5. Lee M.(2015), Korea Research institute of human settlements. Analysis of Transit Passenger Movement within Seoul-Gyeonggi-Incheon Area using Transportation Card Data.
  6. Lee M., Sohn J. and Cho C.(2016), "Constructing Transfer Data in Seoul Metropolitan Urban Railway Using Transportation Card," The Journal of The Korea Institute of Intelligent Transport Systems, vol. 15, no. 4, pp.33-43. https://doi.org/10.12815/kits.2016.15.4.033
  7. Martins E. Q. V.(1984), "An Algorithm for Ranking Paths that May Contain Cycles," European Journal of Operational Research, vol. 18, pp.123-130. https://doi.org/10.1016/0377-2217(84)90269-8
  8. Shier R. D.(1979), "On Algorithm from Finding the K Shortest Paths in A Network," Networks, vol. 9, pp.195-214. https://doi.org/10.1002/net.3230090303
  9. Shin S.(2004), "Finding the First K Shortest Loopless Paths in A Transportation Network," Journal of Korean Society of Transportation, vol. 22, no. 6, pp.121-131.
  10. Shin S.(2013), The Seoul Institute, Research for Allocation of Connected Fare and Construction of Daily Allocation System for the Seoul Metropolitan Intercity / Urban Railway Organizations.
  11. Shin S., Baek N. and Nam D.(2016), "A Heuristic Optimal Path Search Considering Cumulative Transfer Functions," The Journal of The Korea Institute of Intelligent Transport Systems, vol. 15 pp.60-67. https://doi.org/10.12815/kits.2016.15.3.060
  12. Sohn J.(2015), "Dynamic Passenger-Trip Assignment Model of Urban Railway Using Seoul-Incheon-Gyeonggi's Transportation Card," Journal of the Korean Society of Civil Engineers, vol. 36, no. 1, pp.105-114. https://doi.org/10.12652/Ksce.2016.36.1.0105
  13. Yen J. Y.(1971), "Finding the K Shortest Loopless Paths in A Network," Management Science, vol. 17, pp.711-715.