Multi-modal traffic assignment model and algorithm for an urban agglomeration considering entire travel process
XU Pu1,2()
1. School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China 2. China Railway Engineering Design and Consulting Group Co., Ltd., Beijing 100055, China
XU Pu. Multi-modal traffic assignment model and algorithm for an urban agglomeration considering entire travel process[J].Shandong Science, 2022, 35(1): 88-98.
JOURQUIN B, BEUTHE M. Transportation policy analysis with a geographic information system: The virtual network of freight transportation in Europe[J]. Transportation Research Part C: Emerging Technologies, 1996, 4(6):359-371. DOI: 10.1016/S0968-090X(96)00019-8.
doi: 10.1016/S0968-090X(96)00019-8
CHEN S K, PENG H Q, LIU S, et al. A multimodal hierarchical-based assignment model for integrated transportation networks[J]. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(6):130-135. DOI: 10.1016/S1570-6672(08)60093-8.
doi: 10.1016/S1570-6672(08)60093-8
[4]
SI B F, ZHONG M, GAO L, et al. Hierarchical network-based equilibrium model and algorithm for a mixed-traffic urban transport system[J]. Transportation Planning and Technology, 2012, 35(5):545-559. DOI: 10.1080/03081060.2012.693268.
doi: 10.1080/03081060.2012.693268
[5]
SHAN Q C, JIA L M, DONG H H. Design and application of public traffic transfer algorithm based on the logic network[C]// Proceeding of the 11th World Congress on Intelligent Control and Automation. Shenyang: IEEE, 2014: 3671-3676. DOI: 10.1109/WCICA.2014.7053327.
doi: 10.1109/WCICA.2014.7053327
[6]
LOZANO A, STORCHI G. Shortest viable path algorithm in multimodal networks[J]. Transportation Research Part A: Policy and Practice, 2001, 35(3):225-241. DOI: 10.1016/S0965-8564(99)00056-7.
doi: 10.1016/S0965-8564(99)00056-7
[7]
LOZANO A, STORCHI G. Shortest viable hyperpath in multimodal networks[J]. Transportation Research Part B: Methodological, 2002, 36(10):853-874. DOI: 10.1016/S0191-2615(01)00038-8.
doi: 10.1016/S0191-2615(01)00038-8