Browse > Article
http://dx.doi.org/10.12815/kits.2017.16.2.01

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

Lee, Mee young (Korea Research Institute for Human Settlements)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.16, no.2, 2017 , pp. 1-12 More about this Journal
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.
Keywords
Transportation Card; Seoul Metropolitan Railway Network; M-Similar Paths; eneralized Cost; Stepwise Transportation Parameter;
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
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.   DOI
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.   DOI
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.   DOI
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.   DOI
8 Shier R. D.(1979), "On Algorithm from Finding the K Shortest Paths in A Network," Networks, vol. 9, pp.195-214.   DOI
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.   DOI
12 Yen J. Y.(1971), "Finding the K Shortest Loopless Paths in A Network," Management Science, vol. 17, pp.711-715.
13 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.   DOI