Automated taxis' dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times

被引:75
|
作者
Liang, Xiao [1 ]
Correia, Goncalo Homem de Almeida [1 ]
An, Kun [2 ,3 ]
van Arem, Bart [1 ]
机构
[1] Delft Univ Technol, Dept Transport & Planning, Delft, Netherlands
[2] Tongji Univ, Coll Transportat Engn, Shanghai, Peoples R China
[3] Monash Univ, Inst Transport Studies, Dept Civil Engn, Melbourne, Vic, Australia
关键词
Automated vehicles; Dial-a-ride problem; Dynamic travel time; Rolling horizon; Ride-sharing; Lagrangian relaxation; DEMAND; SYSTEM; OPTIMIZATION; LOCATION; VEHICLES;
D O I
10.1016/j.trc.2020.01.024
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
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.
引用
收藏
页码:260 / 281
页数:22
相关论文
共 50 条
  • [1] Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive
    Santos, Douglas O.
    Xavier, Eduardo C.
    EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (19) : 6728 - 6737
  • [2] The electric vehicle dial-a-ride problem: Integrating ride-sharing and time-of-use electricity pricing
    Dong, Huichang
    Luo, Zhixing
    Huang, Nan
    Hu, Hongjian
    Qin, Hu
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2025, 194
  • [3] STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Wong, K. I.
    TRANSPORTATION AND THE ECONOMY, 2005, : 551 - 559
  • [4] Dynamic programming based metaheuristics for the dial-a-ride problem
    Ritzinger, Ulrike
    Puchinger, Jakob
    Hartl, Richard F.
    ANNALS OF OPERATIONS RESEARCH, 2016, 236 (02) : 341 - 358
  • [5] Dynamic programming based metaheuristics for the dial-a-ride problem
    Ulrike Ritzinger
    Jakob Puchinger
    Richard F. Hartl
    Annals of Operations Research, 2016, 236 : 341 - 358
  • [6] Hybrid and approximate algorithms for the dial-a-ride problem with adaptive ride times considering different service strategies
    Fahmy, Sherif A.
    ENGINEERING OPTIMIZATION, 2023, 55 (08) : 1263 - 1277
  • [7] WAITING STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Yuen, C. W.
    Wong, K. I.
    Han, Anthony F.
    TRANSPORTATION SYSTEMS: ENGINEERING & MANAGEMENT, 2007, : 277 - 277
  • [8] Waiting strategies for the dynamic dial-a-ride problem
    Yuen, C. W.
    Wong, K. I.
    Han, Anthony F.
    INTERNATIONAL JOURNAL OF ENVIRONMENT AND SUSTAINABLE DEVELOPMENT, 2009, 8 (3-4) : 314 - 329
  • [9] Model and Algorithm Considering Time-Varying Travel Times to Solve Static Multidepot Dial-a-Ride Problem
    Kim, Taehyeong
    Haghani, Ali
    TRANSPORTATION RESEARCH RECORD, 2011, (2218) : 68 - 77
  • [10] The multi-vehicle dial-a-ride problem with interchange and perceived passenger travel times
    Gkiotsalitis, K.
    Nikolopoulou, A.
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2023, 156