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 条
  • [21] Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
    Schilde, M.
    Doerner, K. F.
    Hartl, R. F.
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (12) : 1719 - 1730
  • [22] A scalable non-myopic dynamic dial-a-ride and pricing problem
    Sayarshad, Hamid R.
    Chow, Joseph Y. J.
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 81 : 539 - 554
  • [23] A new fuzzy logic approach to capacitated dynamic Dial-a-Ride problem
    Maalouf, Maher
    MacKenzie, Cameron. A.
    Radakrishnan, Sridhar
    Court, Mary
    FUZZY SETS AND SYSTEMS, 2014, 255 : 30 - 40
  • [24] Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
    Schilde, M.
    Doerner, K. F.
    Hartl, R. F.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (01) : 18 - 30
  • [25] An empirical study on travel patterns of internet based ride-sharing
    Dong, Yongqi
    Wang, Shuofeng
    Li, Li
    Zhang, Zuo
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 86 : 1 - 22
  • [26] Event-based models for the electric autonomous dial-a-ride problem
    Stallhofer, Verena
    Parragh, Sophie N.
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2025, 171
  • [27] Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
    Watel, Dimitri
    Faye, Alain
    THEORETICAL COMPUTER SCIENCE, 2018, 745 : 202 - 223
  • [28] Bimodal Cooperative Matching Algorithm for the Dynamic Ride-Sharing Problem
    Guo Y.
    Liu Y.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2022, 59 (07): : 1533 - 1552
  • [29] Online Rejected-Reinsertion Heuristics for Dynamic Multivehicle Dial-a-Ride Problem
    Luo, Ying
    Schonfeld, Paul
    TRANSPORTATION RESEARCH RECORD, 2011, (2218) : 59 - 67
  • [30] A dynamic ride-sharing system based on user experience
    Tan W.
    Long J.
    Lu X.
    Guo N.
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2020, 40 (01): : 210 - 218