TY - JOUR
T1 - Modeling the capacity of multimodal and intermodal urban transportation networks that incorporate emerging travel modes
AU - Du, Muqing
AU - Zhou, Jiankun
AU - Chen, Anthony
AU - Tan, Heqing
N1 - Funding Information:
This research is supported by the Natural Science Foundation of China (No. 71801079 ), the Fundamental Research Funds for the Central Universities (No. B200202079 ), the Research Grants Council of the Hong Kong Special Administrative Region (PolyU 15222221 and PolyU 15221922 ) , the Hong Kong Scholars Program (YZ3Y), and the Smart Cities Research Institute at the Hong Kong Polytechnic University (CDA9).
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/12
Y1 - 2022/12
N2 - Given the increasing prevalence of new urban transport modes such as ridesharing, e-hailing, and combined transport, it is essential to evaluate their effects on the capacity of transportation networks. Hence, this paper develops a novel transportation network capacity model to capture the travel behaviors of inter-multimodal mobility in an urban transportation system that incorporates emerging travel modes. The novel model is formulated as a bi-level programming problem, in which the lower-level model is a combined modal split and traffic assignment (CMSTA) problem based on mathematical programming. The CMSTA problem adopts the cross-nested logit model to account for intermodal travel behavior in the modal split phase and the path-sized logit model to account for route overlap in the traffic assignment phase. Moreover, the logit-based trip distribution model is used to capture the dispatch of the e-hailing traffic flow and the matching of ridesharing drivers with passengers. Besides, we consider flow interactions (e.g., cars and buses sharing the same link) in the road network. We customize a solution framework for solving this novel model that adopts the recently developed fast path-based algorithm with the Barzilai–Borwein stepsize strategy to efficiently solve the CMSTA problem, and derive a sensitivity analysis-based (SAB) algorithm to solve the entire bi-level programming problem. The effectiveness of the novel model is verified in numerical experiments that demonstrate the effects of intermodal transportation, e-hailing, and ridesharing on the capacity of a multimodal transportation network.
AB - Given the increasing prevalence of new urban transport modes such as ridesharing, e-hailing, and combined transport, it is essential to evaluate their effects on the capacity of transportation networks. Hence, this paper develops a novel transportation network capacity model to capture the travel behaviors of inter-multimodal mobility in an urban transportation system that incorporates emerging travel modes. The novel model is formulated as a bi-level programming problem, in which the lower-level model is a combined modal split and traffic assignment (CMSTA) problem based on mathematical programming. The CMSTA problem adopts the cross-nested logit model to account for intermodal travel behavior in the modal split phase and the path-sized logit model to account for route overlap in the traffic assignment phase. Moreover, the logit-based trip distribution model is used to capture the dispatch of the e-hailing traffic flow and the matching of ridesharing drivers with passengers. Besides, we consider flow interactions (e.g., cars and buses sharing the same link) in the road network. We customize a solution framework for solving this novel model that adopts the recently developed fast path-based algorithm with the Barzilai–Borwein stepsize strategy to efficiently solve the CMSTA problem, and derive a sensitivity analysis-based (SAB) algorithm to solve the entire bi-level programming problem. The effectiveness of the novel model is verified in numerical experiments that demonstrate the effects of intermodal transportation, e-hailing, and ridesharing on the capacity of a multimodal transportation network.
KW - Barzilai–Borwein stepsize
KW - Cross-nested logit
KW - E-hailing
KW - Multimodal and intermodal
KW - Ridesharing
KW - Transportation network capacity
UR - http://www.scopus.com/inward/record.url?scp=85140987740&partnerID=8YFLogxK
U2 - 10.1016/j.tre.2022.102937
DO - 10.1016/j.tre.2022.102937
M3 - Journal article
AN - SCOPUS:85140987740
SN - 1366-5545
VL - 168
JO - Transportation Research Part E: Logistics and Transportation Review
JF - Transportation Research Part E: Logistics and Transportation Review
M1 - 102937
ER -