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 条
  • [41] Parallel Tabu search heuristics for the dynamic multi-vehicle Dial-a-Ride problem
    Attanasio, A
    Cordeau, JF
    Ghiani, G
    Laporte, G
    PARALLEL COMPUTING, 2004, 30 (03) : 377 - 387
  • [42] Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
    André L. S. Souza
    Marcella Bernardo
    Puca H. V. Penna
    Jürgen Pannek
    Marcone J. F. Souza
    Optimization Letters, 2022, 16 : 355 - 374
  • [43] Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
    Souza, Andre L. S.
    Bernardo, Marcella
    Penna, Puca H. V.
    Pannek, Jurgen
    Souza, Marcone J. F.
    OPTIMIZATION LETTERS, 2022, 16 (01) : 355 - 374
  • [44] Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
    Gschwind, Timo
    Irnich, Stefan
    TRANSPORTATION SCIENCE, 2015, 49 (02) : 335 - 354
  • [45] A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
    Coslovich, Luca
    Pesenti, Raffaele
    Ukovich, Walter
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (03) : 1605 - 1615
  • [46] An Incentive Based Dynamic Ride-Sharing System for Smart Cities
    Bakibillah, Abu Saleh Md
    Paw, Yi Feng
    Kamal, Md Abdus Samad
    Susilawati, Susilawati
    Tan, Chee Pin
    SMART CITIES, 2021, 4 (02): : 532 - 547
  • [47] A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking
    Minshi Chen
    Jianxun Chen
    Peng Yang
    Shengcai Liu
    Ke Tang
    Multimedia Tools and Applications, 2021, 80 : 30775 - 30787
  • [48] A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking
    Chen, Minshi
    Chen, Jianxun
    Yang, Peng
    Liu, Shengcai
    Tang, Ke
    MULTIMEDIA TOOLS AND APPLICATIONS, 2021, 80 (20) : 30775 - 30787
  • [49] Application of Large Neighborhood Search method in solving a dynamic dial-a-ride problem with money as an incentive
    Adawiyah, R.
    Satria, Y.
    Burhan, H.
    INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2019, 1218
  • [50] A Spatio-temporal Based Parallel Insertion Algorithm for Solving Dial-A-Ride Problem
    Guo, Jingmei
    Liu, Chao
    26TH CHINESE CONTROL AND DECISION CONFERENCE (2014 CCDC), 2014, : 3257 - 3261