Automated taxis' dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times. (March 2020)

• Record Type: Journal Article
• Authors: Liang, Xiao; Correia, Gonçalo Homem de Almeida; An, Kun; van Arem, Bart
• Is Part Of: Transportation research. Volume 112(2020)
• Page Start: 260
• Page End: 281
• Publication Date: 2020-03
• Subjects: Automated vehicles -- Dial-a-ride problem -- Dynamic travel time -- Rolling horizon -- Ride-sharing -- Lagrangian relaxation; Transportation -- Periodicals; Transportation -- Technological innovations -- Periodicals; 388.011
• DOI: 10.1016/j.trc.2020.01.024
• Languages: English
• ISSNs: 0968-090X

Abstract

Highlights: An optimization model is formulated to maximize the automated taxi system's profit. The effect of traffic congestion is considered in automated taxis' dial-a-ride problem. A customized Lagrangian relaxation algorithm can solve the model for hard instances. Ride-sharing contributes more served requests and less delay. The automated taxis' service quality is sensitive to the delay penalty. Abstract: In this paper, we study the dial-a-ride problem of ride-sharing automated taxis (ATs) in an urban road network, considering the traffic congestion caused by the ATs. This shared automated mobility system is expected to provide a seamless door-to-door service for urban travellers, much like what the existing transportation network companies (TNC) do, but with decreased labour cost and more flexible relocation operations due to the vehicles' automation. We propose an integer non-linear programming (INLP) model that optimizes the routing of the ATs to maximize the system profit, depending on dynamic travel times, which are a non-linear function of the ATs' flows. It is important to involve traffic congestion in such a routing problem since for a growing number of ATs circulating in the city their number will lead to delays. The model is embedded within a rolling horizon framework, which divides a typical day into several horizons to deal with the real-time travel demand. In each horizon, the routing model is solved with the demand at that interval and assuring the continuity of the trips between horizons. Nevertheless, each horizon model is hard to solve given its number of constraints and decision variables. Therefore, we propose a solution approach based on a customized Lagrangian relaxation algorithm, which allows identifying a near-optimal solution for this difficult problem. Numerical experiments for the city of Delft, The Netherlands, are used to demonstrate the solution quality of the proposed algorithm as well as obtaining insights about the AT system performance. Results show that the solution algorithm can solve the proposed model for hard instances. Ride-sharing makes the AT system more capable to provide better service regarding delay time and the number of requests that can be attended by the system. The delay penalty on the profit objective function is an effective control parameter on guaranteeing the service quality while maintaining system profitability.