Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Transportation Research Part E: Logistics and Transportation Review
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.