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

A schedule-based Public Transit Routing Algorithm for Finding K-shortest Paths Considering Transfer Penalties  

Jeon, Inwoo (Dept. of Geoinformatics, Univ. of Seoul)
Nam, Hyunwoo (Dept. of Geoinformatics, Univ. of Seoul)
Jun, Chulmin (Dept. of Geoinformatics, Univ. of Seoul)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.17, no.3, 2018 , pp. 72-86 More about this Journal
Abstract
Schedule-based public transit routing algorithm computes a single route that calculated minimum travel time using the departure and arrival times for each stop according to vehicle operation plan. However, additional factors such as transfer resistance and alternative route choice are not reflected in the path finding process. Therefore, this paper proposes a improved RAPTOR that reflected transfer resistance and multi-path searching. Transfer resistance is applied at the time of transfer and different values can be set according to type of transit mode. In this study, we analyzed the algorithm's before and after results compared with actual route of passengers. It is confirmed that the proposed algorithm reflects the various route selection criteria of passengers.
Keywords
Public transit routing; Timetable; Transfer penalty; Multi-path;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Arbex R. O. and da Cunha C. B.(2015), "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research, vol. 81, pp.355-376.   DOI
2 Cionini A., D'Angelo G., D'Emidio M., Frigioni D., Giannakopoulou K., Paraskevopoulos A. and Zaroliagis C.(2014), "Engineering graph-based models for dynamic timetable information systems," In OASIcs-OpenAccess Series in Informatics, vol. 42, pp.46-61.
3 Delling D., Dibbelt J., Pajor T. and Werneck R. F.(2015), "Public transit labeling," In International Symposium on Experimental Algorithms, Springer, pp.273-285.
4 Delling D., Pajor T. and Werneck R. F.(2012), "Round-based public transit routing," Proceedings of the Meeting on Algorithm Engineering & Expermiments, Kyoto, Japan, pp.130-140.
5 Dibbelt J., Pajor T., Strasser B. and Wagner D.(2013), In International Symposium on Experimental Algorithms, Springer, pp.43-54.
6 Garcia-Martinez A., Cascajo R., Jara-Diaz S. R., Chowdhury S. and Monzon A.(2018), "Transfer penalties in multimodal public transport networks," Transportation Research Part A: Policy and Practice.
7 Guo J. and Jia L.(2017), "A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs," Journal of Algorithms & Computational Technology, vol. 11, no. 2, pp.170-177.   DOI
8 Hu X. and Chiu Y. C.(2015), "A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation," International Journal of Transportation Science and Technology, vol. 4, no. 4, pp.371-394.   DOI
9 Kim E. C. and Kim T. H.(2009), "K-path Algorithm for a Transfer of the Mobility Handicapped," Seoul Studies, vol. 10, no. 2, pp.147-159.
10 Kim E. J., Lee S. H., Cheon C. K. and Yu B. Y.(2017), "Development of the Algorithm of a Public Transportation Route Search Considering the Resistance Value of Traffic Safety and Environmental Index," The Korea Institute of Intelligent Transport Systems, vol. 16, no. 1, pp.78-89.   DOI
11 Madkour A., Aref W. G., Rehman F. U., Rahman M. A. and Basalamah S.(2017), A survey of shortest-path algorithms. arXiv preprint arXiv:1705.02044.
12 Park B. H. and Oh S. J.(2001), "Effects of Transfer Penalty in the Public Transit Assignment," Social Economy & Policy Studies, vol. 17, no. 2, pp.65-92.
13 Park H. C., Kim Y. S., Kang S. P. and Ko S. Y.(2012), "A Study of Diffenrence Between Intramodal and Intermodal Transfer Penalties," Proceedings of the KOR-KST Conference, vol. 66, pp.555-560.
14 Pyrga E., Schulz F., Wagner D. and Zaroliagis C.(2008), "Efficient models for timetable information in public transportation systems," Journal of Experimental Algorithmics, vol. 12, pp.1-39.
15 Strasser B. and Wagner D.(2014), "Connection scan accelerated," In 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, pp.125-137.
16 Wang S., Yang Y., Hu X., Li J. and Xu B.(2016), "Solving the K-shortest paths problem in timetable-based public transportation systems," Journal of Intelligent Transportation Systems, vol. 20, no. 5, pp.413-427.   DOI
17 Witt S.(2015), "Trip-Based Public Transit Routing," In Algorithms-ESA 2015, Berlin, Heidelberg, Springer, pp.1025-1036.
18 Yang S. J.(2017), A study on Route Choice Modeling in Rapid Transit Network Considering Transfer Penalty and Angular Cost, Master thesis, Korea National University of Transportation, Seoul, Korea.
19 Yoo G. S.(2015), "Transfer penalty estimation with transit trips from smartcard data in Seoul, Korea," KSCE Journal of Civil Engineering, vol. 19, no. 4, pp.1108-1116.   DOI
20 Yoo H.(2017), A Study for Improving the Convenience of Transfer in Urban Railway : Cases of the Airport Railroad, Master thesis, Korea National University of Transportation, Seoul, Korea.