Train Operation Diagram–Based Equilibrium Model for an Urban Rail Transit Network with Transfer Constraints
Publication: Journal of Transportation Engineering, Part A: Systems
Volume 146, Issue 11
Abstract
For urban rail transit (URT) operation and management, it is important to accurately estimate the spatial and temporal passenger flow distribution spreading all over the network. Unfortunately, a literature review shows that the existing simulation-based methods and dynamic assignment methods are not able to satisfactorily achieve the goal. Therefore, this paper proposes a train operation diagram–based equilibrium model to estimate the spatial and temporal passenger flow distribution in a URT network. First, a space-time URT network is constructed based on the train operation diagram, and then an equilibrium passenger flow assignment model is proposed for a URT system. Factors including travel time, transfer time, in-train congestion, and station congestion are considered. An improved shortest-path algorithm for the space-time URT network is presented, in which the transfer constraints are fully considered. Finally, the proposed model and algorithm are verified and analyzed by using a numerical example and are also demonstrated in the Beijing URT network. The proposed model, which is based on the train operation diagram and with the consideration of transfer constraints, is beneficial to estimating passenger flow within a URT network and to managing URT.
Get full access to this article
View all available purchase options and get full access to this article.
Data Availability Statement
All data, models, and code generated or used during the study appear in the published article.
Acknowledgments
The research is funded by the National Key Research and Development Program of China (No. 2018YFB1601300) and National Natural Science Foundation of China (Nos. 71571013, 71871010, 71210001, and 71621001).
References
Alfa, A. S., and M. Chen. 1995. “Temporal distribution of public transport demand during the peak period.” Eur. J. Oper. Res. 83 (1): 137–153. https://doi.org/10.1016/0377-2217(93)E0311-K.
Anez, J., T. De La Barra, and B. Perez. 1996. “Dual graph representation of transportation networks.” Transp. Res. Part B: Methodol. 30 (3): 209–216. https://doi.org/10.1016/0191-2615(95)00024-0.
Cominetti, R., and J. Correa. 2001. “Common-lines and passenger assignment in congested transit networks.” Transp. Sci. 35 (3): 250–267. https://doi.org/10.1287/trsc.35.3.250.10154.
de Cea, J., and E. Fernandez. 1993. “Transit assignment for congested public transport systems: An equilibrium model.” Transp. Sci. 27 (2): 133–147. https://doi.org/10.1287/trsc.27.2.133.
Guo, Z., and N. Wilson. 2004. “Assessment of the transfer penalty for transit trips: A GIS-based disaggregate modeling approach.” Transp. Res. Rec. 1872 (1): 10–18. https://doi.org/10.3141/1872-02.
Guo, Z., and N. Wilson. 2007. “Modeling effects of transit system transfers on travel behavior: Case of commuter rail and subway in downtown Boston, Massachusetts.” Transp. Res. Rec. 2006 (1): 11–20. https://doi.org/10.3141/2006-02.
Hamdouch, Y., H. W. Ho, A. Sumalee, and G. Wang. 2011. “Schedule-based transit assignment model with vehicle capacity and seat availability.” Transp. Res. Part B: Methodol. 45 (10): 1805–1830. https://doi.org/10.1016/j.trb.2011.07.010.
Hamdouch, Y., and S. Lawphongpanich. 2008. “Schedule-based transit assignment model with travel strategies and capacity constraints.” Transp. Res. Part B: Methodol. 42 (7–8): 663–684. https://doi.org/10.1016/j.trb.2007.11.005.
Hamdouch, Y., W. Y. Szeto, and Y. Jiang. 2014. “A new schedule-based transit assignment model with travel strategies and supply uncertainties.” Transp. Res. Part B: Methodol. 67 (Sep): 35–67. https://doi.org/10.1016/j.trb.2014.05.002.
Hickman, M. D., and D. H. Bernstein. 1997. “Transit service and path choice models in stochastic and time-dependent networks.” Transp. Sci. 31 (2): 129–146. https://doi.org/10.1287/trsc.31.2.129.
Kato, H., Y. Kaneko, and M. Inoue. 2010. “Comparative analysis of transit assignment: Evidence from urban railway system in the Tokyo metropolitan area.” Transportation 37 (5): 775–799. https://doi.org/10.1007/s11116-010-9295-8.
Kurauchi, F., M. G. H. Bell, and J. D. Schmöcker. 2003. “Capacity constrained transit assignment with common lines.” J. Math. Modell. Algorithms 2 (4): 309–327. https://doi.org/10.1023/B:JMMA.0000020426.22501.c1.
Kusakabe, T., T. Iryo, and Y. Asakura. 2010. “Estimation method for railway passengers’ train choice behavior with smart card transaction data.” Transportation 37 (5): 731–749. https://doi.org/10.1007/s11116-010-9290-0.
Li, T., H. Sun, J. Wu, and D.-H. Lee. 2020. “Household residential location choice equilibrium model based on reference-dependent theory.” J. Urban Plann. Dev. 146 (1): 04019024. https://doi.org/10.1061/(ASCE)UP.1943-5444.0000534.
Lin, Z., M. Q. Jiang, J. F. Liu, and B. F. Si. 2012. “Improved logit model and method for urban rail transit network assignment.” [In Chinese]. J. Transp. Syst. Eng. Inf. Technol. 12 (6): 145–151.
Liu, R., R. Pendyala, and S. Polzin. 1997. “Assessment of intermodal transfer penalties using stated preference data.” Transp. Res. Rec. 1607 (1): 74–80. https://doi.org/10.3141/1607-11.
Marcotte, P., S. Nguyen, and A. Schoeb. 2004. “A strategic flow model of traffic assignment in static capacitated networks.” Oper. Res. 52 (2): 191–212. https://doi.org/10.1287/opre.1030.0091.
Nguyen, S., and S. Pallottino. 1988. “Equilibrium traffic assignment for large scale transit networks.” Eur. J. Oper. Res. 37 (2): 176–186. https://doi.org/10.1016/0377-2217(88)90327-X.
Nguyen, S., S. Pallottino, and F. Malucelli. 2001. “A modeling framework for passenger assignment on a transport network with timetables.” Transp. Sci. 35 (3): 238–249. https://doi.org/10.1287/trsc.35.3.238.10152.
Nielsen, O. A. 2000. “A stochastic transit assignment model considering differences in passengers utility functions.” Transp. Res. Part B: Methodol. 34 (5): 377–402. https://doi.org/10.1016/S0191-2615(99)00029-6.
Nielsen, O. A. 2004. “A large scale stochastic multi-class schedule-based transit model with random coefficients: Implementation and algorithms.” In Schedule-based dynamic transit modeling: Theory and applications, 53–77. Boston: Springer.
Nielsen, O. A., and R. D. Frederiksen. 2007. “Large-scale schedule-based transit assignment–Further optimisation of the solution algorithms.” In Schedule-based modeling of transportation networks, 119–140. Boston: Springer.
Nuzzolo, A., U. Crisalli, A. Comi, and F. Sciangula. 2007. “A schedule-based mode-service choice model for the assessment of the competition between air transport and high-speed services.” In Proc., 11th World Conf. on Transportation Research. Oakland, CA: Univ. of California.
Nuzzolo, A., U. Crisalli, and L. Rosati. 2012. “A schedule-based assignment model with explicit capacity constraints for congested transit networks.” Transp. Res. Part C: Emerging Technol. 20 (1): 16–33. https://doi.org/10.1016/j.trc.2011.02.007.
Nuzzolo, A., F. Russo, and U. Crisalli. 2001. “A doubly dynamic schedule-based assignment model for transit networks.” Transp. Sci. 35 (3): 268–285. https://doi.org/10.1287/trsc.35.3.268.10149.
Özuysal, M., G. Tayfur, and S. Tanyel. 2012. “Passenger flows estimation of light rail transit (LRT) system in Izmir Turkey using multiple regression and ANN methods.” Promet–Traffic Transp. 24 (1): 1–14. https://doi.org/10.7307/ptt.v24i1.264.
Papola, N., F. Filippi, G. Gentile, and L. Meschini. 2009. “Schedule-based transit assignment: A new dynamic equilibrium model with vehicle capacity constraints.” In Schedule-based modeling of transportation networks: Theory and applications, 145–170. New York: Springer.
Patriksson, M. 2015. The traffic assignment problem: Models and methods. Mineola, NY: Dover.
Poon, M. H., S. C. Wong, and C. O. Tong. 2004. “A dynamic schedule-based model for congested transit networks.” Transp. Res. Part B: Methodol. 38 (4): 343–368. https://doi.org/10.1016/S0191-2615(03)00026-2.
Reddy, A., A. Lu, S. Kumar, V. Bashmakov, and S. Rudenko. 2009. “Entry-only automated fare-collection system data used to infer ridership, rider destinations, unlinked trips, and passenger miles.” Transp. Res. Rec. 2110 (1): 128–136. https://doi.org/10.3141/2110-16.
Schmöcker, J. D., M. G. Bell, and F. Kurauchi. 2008. “A quasi-dynamic capacity constrained frequency-based transit assignment model.” Transp. Res. Part B: Methodol. 42 (10): 925–945. https://doi.org/10.1016/j.trb.2008.02.001.
Sheffy, Y. 1985. Urban transportation networks: Equilibrium analysis with mathematical programming methods. Upper Saddle River, NJ: Prentice Hall.
Si, B., L. Fu, J. Liu, S. Shiravi, and Z. Gao. 2016. “A multi-class transit assignment model for estimating transit passenger flows—A case study of Beijing subway network.” J. Adv. Transp. 50 (1): 50–68. https://doi.org/10.1002/atr.1309.
Si, B., M. Zhong, X. Yang, and Z. Gao. 2011. “Urban transit assignment model based on augmented network with in-vehicle congestion and transfer congestion.” J. Syst. Sci. Syst. Eng. 20 (2): 155–172. https://doi.org/10.1007/s11518-011-5159-9.
Slavin, H. 2009. “Using automated fare collection data, GIS, and dynamic schedule queries to improve transit data and transit assignment model.” In Vol. 46 of Schedule-based modeling of transportation networks, 1–18. Boston: Springer.
Spiess, H., and M. Florian. 1989. “Optimal strategies: A new assignment model for transit networks.” Transp. Res. Part B: Methodol. 23 (2): 83–102. https://doi.org/10.1016/0191-2615(89)90034-9.
Sun, Y., and P. M. Schonfeld. 2016. “Schedule-based rail transit path-choice estimation using automatic fare collection data.” J. Transp. Eng. 142 (1): 04015037. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000812.
Sun, Z., P. Hao, X. J. Ban, and D. Yang. 2015. “Trajectory-based vehicle energy/emissions estimation for signalized arterials using mobile sensing data.” Transp. Res. Part D: Transp. Environ. 34 (Jan): 27–40. https://doi.org/10.1016/j.trd.2014.10.005.
Tian, Q., and H. J. Huang. 2007. “Commuting equilibria on a mass transit system with capacity constraints.” In Proc., Transportation and Traffic Theory, 360–383. Oxford, UK: Elsevier.
Tong, C., and A. Richardson. 1984. “A comupter model for finding the time-dependent minimum path in a transit system with fixed schedules.” J. Adv. Transp. 18 (2): 145–161. https://doi.org/10.1002/atr.5670180205.
Tong, C., and S. Wong. 1998. “A schedule-based dynamic assignment model for transit networks.” J. Adv. Transp. 33 (3): 371–388. https://doi.org/10.1002/atr.5670330307.
Tong, C., and S. Wong. 1999. “A stochastic transit assignment model using a dynamic schedule-based network.” Transp. Res. Part B: Methodol. 33 (2): 107–121. https://doi.org/10.1016/S0191-2615(98)00030-7.
Wilson, N. H. M., J. Zhao, and A. Rahbee. 2009. “The potential impact of automated data collection systems on urban public transport planning.” In Schedule-based modeling of transportation networks: Theory and applications, 75–99. Boston: Springer.
Wu, J., H. Sun, Z. Gao, L. Han, and B. Si. 2014. “Risk-based stochastic equilibrium assignment model in augmented urban railway network.” J. Adv. Transp. 48 (4): 332–347. https://doi.org/10.1002/atr.218.
Wu, J. H., Y. Chen, and M. Florian. 1998. “The continuous dynamic network loading problem: A mathematical formulation and solution method.” Transp. Res. Part B: Methodol. 32 (3): 173–187. https://doi.org/10.1016/S0191-2615(97)00023-4.
Wu, J. H., M. Florian, and P. Marcotte. 1994. “Transit equilibrium assignment: A model and solution algorithms.” Transp. Sci. 28 (3): 193–203. https://doi.org/10.1287/trsc.28.3.193.
Yao, X. M., B. M. Han, D. D. Yu, and H. Ren. 2017. “Simulation-based dynamic passenger flow assignment modeling for a schedule-based transit network.” Discrete Dyn. Nat. Soc. 2017 (1752): 1–15.
Zhu, W., W. Wang, and Z. Huang. 2017. “Estimating train choices of rail transit passengers with real timetable and automatic fare collection data.” J. Adv. Transp. 2017: 1–12. https://doi.org/10.1155/2017/5824051.
Information & Authors
Information
Published In
Copyright
© 2020 American Society of Civil Engineers.
History
Received: Oct 10, 2019
Accepted: Jun 4, 2020
Published online: Aug 20, 2020
Published in print: Nov 1, 2020
Discussion open until: Jan 20, 2021
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.