TY - JOUR
T1 - Integrated vehicle assignment and routing for system-optimal shared mobility planning with endogenous road congestion
AU - Liu, Jiangtao
AU - Mirchandani, Pitu
AU - Zhou, Xuesong
N1 - Funding Information:
This paper is supported by National Science Foundation – United States under Grant No. CMMI 1663657 “Collaborative Research: Real-time Management of Large Fleets of Self-Driving Vehicles Using Virtual Cyber Tracks”. The comments from two anonymous reviewers are greatly appreciated. The work presented in this paper remains the sole responsibility of the authors.
Publisher Copyright:
© 2020
PY - 2020/8
Y1 - 2020/8
N2 - Ride-sharing services, that have been growing in recent years with the start of network service companies, will be further enhanced by the recently emerging trend of applications for autonomous vehicles for future traveler mobility. One fundamental question that transportation managers should address is how to capture the endogenous traffic patterns involving the new and uncertain elements facing future transportation planning and management. By concentrating on one ideal system optimal (SO) scenario, in which (i) all vehicles are autonomous, or can be centrally guided and (ii) all passengers’ pickup/drop-off trip requests can be given at the beginning, this paper aims to integrate travel demand, vehicle supply, and limited infrastructure. Available ride-shared and autonomous vehicles, from different (real/virtual) depots, can be optimally assigned to satisfy passengers’ trip requests, while considering the endogenous congestion in capacitated networks. A number of decomposition approaches are adopted in this research. Focusing on this primal problem, we propose an arc-based vehicle-based integer linear programming model in space-time-state (STS) networks, which is solved by Dantzig-Wolfe decomposition. From the perspective of dynamic traffic assignment, a space-time-state (STS) path-based flow-based linear programming model is also provided as an approximation according to the mapping information between vehicle and passenger, and between a vehicle and the space-time arc in each STS path in our priori-generated column pool. Finally, numerical experiments are performed to demonstrate our decomposition approaches and their computation efficiency. From our preliminary experiments, we have a few interesting observations: (i) without considering road congestion, the network performance/efficiency could be overestimated; (ii) passengers’ required pickup and drop-off time windows could be a buffer to mitigate road congestion, without impacting system performance; (iii) the ride-sharing service could reduce the total transportation system cost under centralized control.
AB - Ride-sharing services, that have been growing in recent years with the start of network service companies, will be further enhanced by the recently emerging trend of applications for autonomous vehicles for future traveler mobility. One fundamental question that transportation managers should address is how to capture the endogenous traffic patterns involving the new and uncertain elements facing future transportation planning and management. By concentrating on one ideal system optimal (SO) scenario, in which (i) all vehicles are autonomous, or can be centrally guided and (ii) all passengers’ pickup/drop-off trip requests can be given at the beginning, this paper aims to integrate travel demand, vehicle supply, and limited infrastructure. Available ride-shared and autonomous vehicles, from different (real/virtual) depots, can be optimally assigned to satisfy passengers’ trip requests, while considering the endogenous congestion in capacitated networks. A number of decomposition approaches are adopted in this research. Focusing on this primal problem, we propose an arc-based vehicle-based integer linear programming model in space-time-state (STS) networks, which is solved by Dantzig-Wolfe decomposition. From the perspective of dynamic traffic assignment, a space-time-state (STS) path-based flow-based linear programming model is also provided as an approximation according to the mapping information between vehicle and passenger, and between a vehicle and the space-time arc in each STS path in our priori-generated column pool. Finally, numerical experiments are performed to demonstrate our decomposition approaches and their computation efficiency. From our preliminary experiments, we have a few interesting observations: (i) without considering road congestion, the network performance/efficiency could be overestimated; (ii) passengers’ required pickup and drop-off time windows could be a buffer to mitigate road congestion, without impacting system performance; (iii) the ride-sharing service could reduce the total transportation system cost under centralized control.
KW - Alternating Direction Method of Multipliers (ADMM)
KW - Autonomous vehicle routing
KW - Column pool
KW - Dantzig-Wolfe decomposition
KW - Endogenous congestion
KW - Shared mobility
UR - http://www.scopus.com/inward/record.url?scp=85085731694&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85085731694&partnerID=8YFLogxK
U2 - 10.1016/j.trc.2020.102675
DO - 10.1016/j.trc.2020.102675
M3 - Article
AN - SCOPUS:85085731694
SN - 0968-090X
VL - 117
JO - Transportation Research Part C: Emerging Technologies
JF - Transportation Research Part C: Emerging Technologies
M1 - 102675
ER -