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 条
  • [31] Optimal Matching Problem for Ride-Sharing Considering Users’ Schedule Rearrangement
    Hiroshi Shimamoto
    International Journal of Intelligent Transportation Systems Research, 2020, 18 : 391 - 399
  • [32] A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
    Berbeglia, Gerardo
    Cordeau, Jean-Francois
    Laporte, Gilbert
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (03) : 343 - 355
  • [34] An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem
    Chassaing, M.
    Duhamel, C.
    Lacomme, P.
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 48 : 119 - 133
  • [35] Efficient Feasibility Testing and Scheduling for Dial-a-ride Problem with Time-dependent Travel Time
    Quo, Jingmei
    Liu, Chao
    Yan, Junye
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 4543 - 4546
  • [36] The Dial-A-Ride Problem considering the in-vehicle crowding inconvenience due to COVID-19
    Gkiotsalitis, Konstantinos
    2021 IEEE INTELLIGENT TRANSPORTATION SYSTEMS CONFERENCE (ITSC), 2021, : 3746 - 3751
  • [37] Optimisation for the Ride-Sharing Problem: a Complexity-based Approach
    Simonin, Gilles
    O'Sullivan, Barry
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 831 - 836
  • [38] The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
    Xiang, Zhihai
    Chu, Chengbin
    Chen, Haoxun
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (02) : 534 - 551
  • [39] Solving a selective dial-a-ride problem with logic-based Benders decomposition
    Riedler, Martin
    Raidl, Guenther
    COMPUTERS & OPERATIONS RESEARCH, 2018, 96 : 30 - 54
  • [40] Dial-a-Ride Problem with Users' Accept/Reject Decisions Based on Service Utilities
    Dong, Xiaotong
    Rey, David
    Waller, S. Travis
    TRANSPORTATION RESEARCH RECORD, 2020, 2674 (10) : 55 - 67