Sixth International Conference on Transportation Engineering
Passenger Flow Assignment of Urban Rail Transit under Networking Conditions
Publication: ICTE 2019
ABSTRACT
Under the background of network operation of urban rail transit, the mode of "seamless transfer" has brought new challenges to the operation and management of urban rail transit while bringing convenience to passengers. Establishing a reasonable model to truly reflect the passenger flow assignment of the rail transit network, which is of great significance for solving the problem of balanced operation and ticket income distribution of existing network and predicting the impact on the current passenger flow with new metro lines accessing. The crowding effect of passenger travel, transfer times, and other influence factors are fully considered in this paper based on the characteristics of urban rail transit system. The definition method of feasible path is proposed, and the equilibrium assignment model of passenger flow based on feasible paths is established, which is solved by Frank-Wolfe algorithm. This model embodies the choice psychology of minimizing passenger travel impedance, and reflects the actual situation of route diversification. The effectiveness of the model and algorithm is verified by an example of the partial rail transit network in Beijing.
Get full access to this chapter
View all available purchase options and get full access to this chapter.
ACKNOWLEDGEMENT
This research was supported by the National Natural Science Foundation (Project No.:U1734204), the People’s Republic of China.
REFERENCES
Boyce, D. E., Mahmassani, H. S., and Nagurney, A. (2010). “A retrospective on beckmann, mcguire and winsten's studies in the economics of transportation.” Papers in Regional Science, 84(1), 85-103.
Dial, R. B. (1967). “Transit pathfinder algorithm.”Highway Research Record,(205).
Dial, R. B. (1971). “A probabilistic multipath traffic assignment model which obviates path enumeration.” Transportation research, 5(2), 83-111.
Dijkstra, E. W. (1959). “A note on two problems in connexion with graphs.” Numerische mathematik, 1(1), 269-271.
Hoffman, W., and Pavley, R. (1959). “A method for the solution of the n th best path problem.” Journal of the ACM (JACM), 6(4), 506-514.
KONG, F. Y., and CHEN, X. F. (2007). “Stochastic user equilibrium model and algorithm for rail transit.”Journal of Chongqing Institute of Technology(Natural Science Edition).
LeBlanc, L. J., Morlok, E. K., and Pierskalla, W. P. (1975). “An efficient approach to solving the road network equilibrium traffic assignment problem.” Transportation research, 9(5), 309-318.
Leurent, F. M. (1997). “Curbing the computational difficulty of the logit equilibrium assignment model.” Transportation Research Part B: Methodological, 31(4), 315-326.
LIU, J. F., SUN, F. L., BAI, Y., and XU, J. (2009). “Passenger flow route assignment model and algorithm for urban rail transit network.” Journal of Transportation Systems Engineering and Information Technology, 9(2), 81-86.
SI, B. F., Zhang, H. Z., and GAO, Z. Y. (2009). “Improved dial's algorithm for logit-based stochastic traffic network assignment problem.” China Journal of Highway and Transport, 22(1), 78-83.
Spiess, H., and Florian, M. (1989). “Optimal strategies: A new assignment model for transit networks.” Transportation Research Part B: Methodological, 23(2), 83-102.
Wardrop, J. G. (1952). “Some theoretical aspects of road traffic research.” Proceedings of the institution of civil engineers, 1(3), 325-362.
WU, Q. B., CHEN, F., and LI, X. H. (2014). “Modeling and simulation of standing passengers' space comfort in subway carriage.” Journal of Transportation Systems Engineering and Information Technology, 14(05), 126-132.
Information & Authors
Information
Published In
ICTE 2019
Pages: 523 - 531
Editors: Xiaobo Liu, Ph.D., Southwest Jiaotong University, Qiyuan Peng, Ph.D., Southwest Jiaotong University, and Kelvin C. P. Wang, Ph.D., Oklahoma State University
ISBN (Online): 978-0-7844-8274-2
Copyright
© 2020 American Society of Civil Engineers.
History
Published online: Jan 13, 2020
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.