Abstract
Estimating the route choice patterns for transit passengers is important to improve service reliability. The size and composition of a route choice set affects the choice model estimation and passenger flow calculations for urban rail transit (URT) networks. With the existing threshold decision method, there will be omissions or excess routes in the generated route set, which lead to a significant deviation in passenger flow assignments. This paper proposes a data-driven approach to calibrate the travel time thresholds when generating reasonable route choice sets. First, an automatic fare collection (AFC) data-driven framework is established to more accurately calibrate and dynamically update travel time thresholds with changes in the URT system. The framework consists of four steps: data preprocessing, origin–destination-based threshold calculation, cluster analysis-based calibration, and calibrated result output and update. Second, the proposed approach is applied to the Bei**g subway as a case study, and several promising results are analyzed that allow the optimization of existing travel time thresholds. The obtained results help in the estimation of route choice behavior to validate current rail transit assignment models. This study is also applicable for other rail transit networks with AFC systems to record passenger passage times at both entry and exit gates.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Akiva, M., Bergman, M.J., Daly, A.J., Ramaswamy, R.: Modeling inter-urban route choice behaviour. Paper presented at 9th international symposium on transportation and traffic theory, Utrecht (1984)
Ben-Elia, E., Pace, R.D., Bifulco, G.N., Shiftan, Y.: The impact of travel information’s accuracy on route-choice. Transp. Res. Part C Emerg. Technol. 26, 146–159 (2013). https://doi.org/10.1016/j.trc.2012.07.001
Bovy, P.H.L.: On modelling route choice sets in transportation networks: a synthesis. Transp. Rev. 29(1), 43–68 (2009). https://doi.org/10.1080/01441640802078673
Bovy, P.H.L., Hoogendoorn-Lanser, S.: Modelling travel route choice behaviour in multi-modal transport networks. Transportation 32(4), 341–368 (2005). https://doi.org/10.1007/s11116-004-7963-2
Breunig, M.M., Kriegel, H.-P., Ng, R.T., Sander, J.: LOF: identifying density-based local outliers. ACM SIGMOD Rec. 29(2), 93–104 (2000)
Coldren, G.M., Koppelman, F.S.: Modeling the competition among air-travel itinerary shares: GEV model development. Transp. Res. Part. A Policy Pract. 39(4), 345–365 (2005). https://doi.org/10.1016/j.tra.2004.12.001
Daganzo, C.F., Sheffi, Y.: On stochastic models of traffic assignment. Transp. Sci. 11, 253–274 (1977). https://doi.org/10.1287/trsc.11.3.253
De La Barra, T., Perez, B., Anez, J.: Multidimensional path search and assignment. Paper presented at 21th PTRC summer annul meeting, Washington, D.C. (1993)
Dial, R.B.: Transit pathfinder algorithm. Highw. Res. Board 205, 67–85 (1967)
Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E., Han J, Fayyad U (eds.) Proceedings of the ACM 2nd International Conference on Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, CA (1996)
Friedrich, M., Hofsaess, I., Wekeck, S.: Timetable-based transit assignment using branch and bound techniques. Transp. Res. Rec. J. Transp. Res. Board 1752, 100–107 (2001). https://doi.org/10.3141/1752-14
Kato, H., Kaneko, Y., Inoue, M.: Comparative analysis of transit assignment: evidence from urban railway system in the Tokyo metropolitan area. Transportation 37(5), 775–799 (2010). https://doi.org/10.1007/s11116-010-9295-8
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (2009)
Liu, G.Y.: Research on ticket income distribution problem in urban rail transit system network. M.S. thesis, Central South University, Changsha (2011)
Liu, Y.L., Bunker, J., Ferreira, L.: Transit users’ route-choice modeling in transit assignment: a review. Transp. Rev. 30(6), 753–769 (2010). https://doi.org/10.1080/01441641003744261
Lo, S.M., Fang, Z.: A spatial-grid evacuation model for buildings. J. Fire Sci. 18, 376–394 (2000). https://doi.org/10.1177/073490410001800503
Lu, Y.L., He, J.Z., An, J., Miao, G.J.: Research on rules for eliminating outliers and its application to target prediction. Command Control Simul. 33, 98–102 (2011)
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA (1967)
McLachlan, G.J., Krishnan, T.: The EM Algorithm and Extensions. Wiley, New York (2007)
Nguyen, S., Pallottino, S.: Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 37(2), 176–186 (1988). https://doi.org/10.1016/0377-2217(88)90327-X
Pelletier, M.P., Trépanier, M., Morency, C.: Smart card data use in public transit: a literature review. Transp. Res. Part C Emerg. Technol. 19(4), 557–568 (2011). https://doi.org/10.1016/j.trc.2010.12.003
Prato, C.G.: Route choice modeling: past, present and future research directions. J. Choice Model. 2(1), 65–100 (2009)
Prato, C.G., Bekhor, S.: Applying branch and bound technique to route choice set generation. Transp. Res. Rec. J. Transp. Res. Board 1985, 19–28 (2006). https://doi.org/10.3141/1985-03
Ramming, M.S.: Network knowledge and route choice. PhD thesis, Massachusetts Institute of Technology, Boston (2002)
Ravindra, K.A., Magnanti, T.L., Orlin, B.J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Ren, H., Long, J., Gao, Z., Orenstein, P.: Passenger assignment model based on common route in congested transit networks. J. Transp. Eng. 138(12), 1484–1494 (2012). https://doi.org/10.1061/(ASCE)TE.1943-5436.0000464
Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492–1496 (2014). https://doi.org/10.1126/science.1242072
Sheffi, Y., Powell, W.B.: An algorithm for the equilibrium assignment problem with random link times. Networks 12(2), 191–207 (1982). https://doi.org/10.1002/net.3230120209
Shier, R.D.: On algorithms for finding the k shortest paths in a network. Networks 9(3), 195–214 (1979). https://doi.org/10.1002/net.3230090303
Su, J.: Research on the passenger flow assignment in urban rail transit. M.S. thesis, Bei**g Jiaotong University, Bei**g (2009)
Swait, J., Ben-Akiva, M.E.: Incorporating random constraints in discrete models of choice set generation. Transp. Res. Part B Methodol. 21(2), 91–102 (1987). https://doi.org/10.1016/0191-2615(87)90009-9
Van Der Waerden, P., Borgers, A., Timmermans, H.: Choice set composition in the context of pedestrian’s route choice modeling. Paper presented at the 2004 annual meeting of transportation research board, Washington, D.C. (2004)
Van Der Zijpp, N.J., Fiorenzo Catalano, S.: Path enumeration by finding the constrained K-shortest paths. Transp. Res. Part B Methodol. 39(6), 545–563 (2005). https://doi.org/10.1016/j.trb.2004.07.004
Van Der Zijpp, N.J., Fiorenzo Catalano, S.: An algorithm for finding the K-acyclic shortest paths with logical constraints and its application to the route enumeration problem. Paper presented at the 2002 annual meeting of transportation research board, Washington, D.C. (2002)
Wardrop, J.G.: Some theoretical aspects of road traffic research. Inst. Civ. Eng. Proc. 1, 325–362 (1952)
Xu, R.H., Luo, Q., Gao, P.: Research on the Clearing Method of Bei**g ACC on Urban Mass Transit. Tongji University, Shanghai (2007)
Yao, E.J., **, F.L., Hu, Q.W., Zhang, Y.S., Yang, Y.: Analysis of route choice behavior of urban rail passengers considering transfer thresholds. J. Southwest Jiaotong Univ. 52(3), 639–645 (2017)
Zhu, W., Xu, R.H.: Generating route choice sets with operation information on metro networks. J. Traffic Transp. Eng. 3(3), 243–252 (2016). https://doi.org/10.1016/j.jtte.2016.05.001
Acknowledgements
The study was financially supported by the National Natural Science Foundation of China (71701152), the Research Program of Science and Technology Commission in Shanghai (18510745800), and the Fundamental Research Funds for the Central Universities of China (22120180067). The authors wish to acknowledge Bei**g Metro Co., Ltd, for providing basic data during the research. The authors also thank the three anonymous referees for their helpful comments and valuable suggestions that substantially improved the content and composition of this work.
Author information
Authors and Affiliations
Contributions
All the authors have contributed to the design of the study, conduct of the research, and writing the manuscript. All the authors gave final approval for publication.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhu, W., Fan, Wl., Wahaballa, A.M. et al. Calibrating travel time thresholds with cluster analysis and AFC data for passenger reasonable route generation on an urban rail transit network. Transportation 47, 3069–3090 (2020). https://doi.org/10.1007/s11116-019-10040-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11116-019-10040-8