Browse > Article
http://dx.doi.org/10.12652/Ksce.2018.38.6.0941

Link Label-Based Optimal Path Algorithm Considering Station Transfer Penalty - Focusing on A Smart Card Based Railway Network -  

Lee, Mee Young (Korea Research Institute for Human Settlements)
Publication Information
KSCE Journal of Civil and Environmental Engineering Research / v.38, no.6, 2018 , pp. 941-947 More about this Journal
Abstract
Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed.
Keywords
Ticket Gate ID; BigNode; Station transfer penalty; Link label-based path searching;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Choi, K. C. (1995). "Network representation schemes for U-TURN and implementation in the vine-based dijkstra shortest path algorithm." Journal of Korean Society of Transportation, Vol. 13, No. 3, pp. 35-52 (in Korean).
2 Gabriel, S. and Bernstein, D. (1997). "The traffic equilibrium problem with nonadditive path costs." Transportation Science, Vol. 20, No. 5, pp. 337-348.
3 Kirby, R. F. and Potts, R. B. (1969). "The minimum route problem for networks with turn penalties and prohibitions." Transportation Research 3, pp. 397-408.   DOI
4 Lee, M. Y. (2004). Transportation network models and algorithms considering directional delay and prohibitions for intersection movement. Ph.D. Thesis, University of Wisconsin at Madison.
5 Lee, M. Y. (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
6 Namgeung, S., Rho, J. H. and Choi, J. J. (1998). "Development of the tree-based path-finding in urban transportation networks." Mathl. Comput. Modelling, Vol. 27, No. 9-11, pp. 51-65.
7 Shin, S. I. and Baek, N. C. (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 (in Korean).   DOI