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

Generalized K Path Searching in Seoul Metropolitan Railway Network Considering Entry-Exit Toll  

Meeyoung Lee (National Economic Advisory Council)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.21, no.6, 2022 , pp. 1-20 More about this Journal
Abstract
The basic way to charge vehicles for using road and public transport networks is the entry-exit toll system. This system works by reading Hi-Pass and public transportation cards of the vehicles using card readers. However, the problems of navigating a route in consideration of entry-exit toll systems include the non-additive costs of enumerating routes. This problem is known as an NP-complete task that enumerates all paths and derives the optimal path. So far, the solution to the entry-exit toll system charging has been proposed in the form of transforming the road network. However, unlike in the public transport network where the cards are generalized, this solution has not been found in situations where network expansion is required with a transfer, multi-modes and multiple card readers. Hence, this study introduced the Link Label for a public transportation network composed of card readers in which network expansion is bypassed in selecting the optimal path by enumerating the paths through a one-to-one k-path search. Since the method proposed in this study constructs a relatively small set of paths, finding the optimal path is not burdensome in terms of computing power. In addition, the ease of comparison of sensitivity between paths indicates the possibility of using this method as a generalized means of deriving an optimal path.
Keywords
Entry-Exit Toll; Public Transit Network; Network Expansion; Link Label; One-to-One K-Path Search;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Lee, M., Baek, N., Moon, B. and Kang, W.(2005), "Finding the K Least Fare Routes In the Distance-Based Fare Policy", Journal of Korean Society of Transportation, vol. 23, no. 1, pp.103-114.
2 Lee, M., Park, J., Jeong, J. and Park, D.(2008), "A Multi-Objective Shortest Paths Finding Considering Multi-Class in A Multi-Modal Transit Network for Providing User-Customized Route Information", The Journal of the Korea Institute of Intelligent Transport Systems, vol. 7, no. 3, pp.1-14.
3 Lo, K. and Chen, A.(2000), "Traffic Equilibrium Problem with Route-specific Costs: Formulation and Algorithms", Transportation Research Part B, vol. 34, no. 6, pp.493-513.   DOI
4 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
5 Meng, Q., Lee, D. H., Cheu, R. L. and Yang, H.(2004), "Logit-Based Stochastic User Equilibrium Problem for Entry-Exit Toll Schemes", Journal of Transportation Engineering, vol. 130, no. 6, pp.805-813.   DOI
6 Moore, E. F.(1957), The Shortest Path through A Maze, Harvard University Press, Cambridge.
7 Scott, K. and Bernstein, D.(1997), Solving a Best Path Problem when the Value of Time Function is Nonlinear, preprint 980976 of the Transportation Research Board.
8 Shin, H.(2022), Estimating Revenues of Integrated Fare System for Seoul Metropolitan Public Transportation Using Smartcard Data, Doctoral Dissertation, Seoul National University.
9 Shin, S. and Baek, N.(2016), "A Logit Type of Public Transit Trip Assignment Model Considering Stepwise Transfer Coefficients", Journal of Korean Society of Transportation, vol. 34, no. 6, pp.570-579.   DOI
10 Shin, S.(2004), "Finding the First K Loopless Paths in A Transportation Network", Journal of Korean Society of Transportation, vol. 22, no. 6, pp.121-131.
11 Shin, S., Baek, N. and Nam, D.(2016), "A Heuristic Optimal Path Search Considering Cumulative Transfer Functions", Journal of Korean Society of Transportation, vol. 15, no. 3, pp.60-67.
12 Yang, H., Zhang, X. and Meng, Q.(2004), "Modeling Private Highways in Networks With Entry-Exit Based Toll Charges", Transportation Research B, vol. 38, pp.191-213.   DOI
13 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
14 Bernstein, D. and Gabriel, G.(1997), "Solving the Nonadditive Traffic Equilibrium Problem", In Pardalos, P. M., Wl Hearn, D. L. and Hager, W. W. eds. Network Optimization, Springer, New York, pp.72-102.
15 Dijkstra, E. W.(1959), "A Note on Two Problems in Connexion with Graphs", Numerishe Matematilk, vol. 1, pp.269-271.   DOI
16 Gabriel, S. and Bernstein, D.(1997), "The Traffic Equilibrium Problem With Nonadditive Path Costs", Transportation Science, vol. 20, no. 5, pp.337-348.   DOI
17 Gabriel, S. and Bernstein, D.(2000), "Nonadditive Shortest Paths: Sub-problem in Multi-agent Competitive Network Models", Computational and Mathematical Organization Theory, vol. 6, no. 1, pp.29-45.   DOI
18 Larsson, T., Lindberg, P., Patriksson, M. and Rydergren, C.(2002), "On Traffic Equilibrium Models with A Nonliner Time/Money Relation", In Patricsson M. and Labbe, M. eds. Transportation Planning-State of the Art, Publisher: Kluwer, pp.19-31.
19 Lee, M,, Kim, H., Park, D. and Shin, S.(2008), "A Link-Based Label Correcting Multi-Objective Shortest Paths Algorithm in Multi-Modal Transit Networks", Journal of Korean Society of Transportation, vol. 26, no. 1, pp.127-135.
20 Lee, M. and Lee, C.(2020), "An Application of a Link-Based Optimal Pathfinding Algorithm with the Integrated Transit Network from Smart Card Systems", KSCE(Korean Society of Civil Engineers) Journal of Civil Engineering, vol. 24, pp.3474-3487.   DOI
21 Lee, M. and Nam, D.(2019), "A Link-Label Based Node-to-Link Optimal Path Algorithm Considering Non Additive Path Cost", The Journal of the Korea Institute of Intelligent Transport Systems, vol. 18, no. 3, pp.91-99.
22 Lee, M.(2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Doctoral Dissertation, University of Wisconsin at Madison.
23 Lee, M.(2017), "Transportation Card Based Optimal M-Similar Paths Searching for Estimating Passengers' Route Choice in Seoul Metropolitan Railway Network", The Journal of The Korea Institute of Intelligent Transport Systems, vol. 16, no. 2, pp.1-12.   DOI
24 Lee, M.(2018), "Link Label Based Optimal Path Algorithm Considering Station Transfer Penalty-Focusing on A Smart Card Based Railway Network", Journal of the Korean Society of Civil Engineers, vol. 38, no. 6, pp.941-947.
25 Lee, M., Baek N., Nam, D. and Shin, S.(2004), "Finding a Minimum Fare Route in the Distance-Based Fare System", Journal of Korean Society of Transportation, vol. 22, no. 6, pp.101-108.