Can dynamic ride-sharing reduce traffic congestion?

被引:58
作者
Alisoltani, Negin [1 ,2 ]
Leclercq, Ludovic [1 ]
Zargayouna, Mahdi [2 ]
机构
[1] Univ Gustave Eiffel, Univ Lyon, LICIT, ENTPE, F-69518 Lyon, France
[2] Univ Gustave Eiffel, COSYS GRETTIA, IFSTTAR, F-77454 Marne La Vallee, France
基金
欧洲研究理事会;
关键词
Dynamic ride-sharing; Traffic congestion; Trip-based MFD; Optimal fleet management; DELIVERY PROBLEM; TIME WINDOWS; PICK-UP; OPTIMIZATION; ASSIGNMENT; SERVICES; DEMAND; DRIVER;
D O I
10.1016/j.trb.2021.01.004
中图分类号
F [经济];
学科分类号
02 ;
摘要
Can dynamic ride-sharing reduce traffic congestion? In this paper we show that the answer is yes if the trip density is high, which is usually the case in large-scale networks but not in medium-scale networks where opportunities for sharing in time and space become rather limited. When the demand density is high, the dynamic ride-sharing system can significantly improve traffic conditions, especially during peak hours. Sharing can compensate extra travel distances related to operating a mobility service. The situation is entirely different in small and medium-scale cities when trip shareability is small, even if the ride-sharing system is fully optimized based on the perfect demand prediction in the near future. The reason is simple, mobility services significantly increase the total travel distance, and sharing is simply a means of combating this trend without eliminating it when the trip density is not high enough. This paper proposes a complete framework to represent the functioning of the ride-sharing system and multiple steps to tackle the curse of dimensionality when solving the problem. We address the problem for two city scales in order to compare different trip densities. A city scale of 25 km(2) with a total market of 11,235 shareable trips for the medium-scale network and a city scale of 80 km(2) with 205,308 demand for service vehicles for the large-scale network over a 4-hour period with a rolling horizon of 20 minutes. The solutions are assessed using a dynamic trip-based macroscopic simulation to account for the congestion effect and dynamic travel times that may influence the optimal solution obtained with predicted travel times. This outperforms most previous studies on optimal fleet management that usually consider constant and fully deterministic travel time functions. (C) 2021 The Author(s). Published by Elsevier Ltd.
引用
收藏
页码:212 / 246
页数:35
相关论文
共 49 条
  • [1] Optimization for dynamic ride-sharing: A review
    Agatz, Niels
    Erera, Alan
    Savelsbergh, Martin
    Wang, Xing
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) : 295 - 303
  • [2] Dynamic ride-sharing: A simulation study in metro Atlanta
    Agatz, Niels A. H.
    Erera, Alan L.
    Savelsbergh, Martin W. P.
    Wang, Xing
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (09) : 1450 - 1464
  • [3] A Sequential Clustering Method for the Taxi-Dispatching Problem Considering Traffic Dynamics
    Alisoltani, Negin
    Zargayouna, Mahdi
    Leclercq, Ludovic
    [J]. IEEE INTELLIGENT TRANSPORTATION SYSTEMS MAGAZINE, 2020, 12 (04) : 169 - 181
  • [4] Cross-comparison of convergence algorithms to solve trip-based dynamic traffic assignment problems
    Ameli, Mostafa
    Lebacque, Jean-Patrick
    Leclercq, Ludovic
    [J]. COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2020, 35 (03) : 219 - 240
  • [5] A general equilibrium model for transportation systems with e-hailing services and flow congestion
    Ban, Xuegang
    Dessouky, Maged
    Pang, Jong-Shi
    Fan, Rong
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 129 : 273 - 304
  • [6] Large-scale constrained clustering for rationalizing pickup and delivery operations
    Bard, Jonathan F.
    Jarrah, Ahmad I.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2009, 43 (05) : 542 - 561
  • [7] A multi-period dial-a-ride problem with driver consistency
    Braekers, Kris
    Kovacs, Attila A.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2016, 94 : 355 - 377
  • [8] Estimating the environmental benefits of ride-sharing: A case study of Dublin
    Caulfield, Brian
    [J]. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2009, 14 (07) : 527 - 531
  • [9] Solving the first-mile ridesharing problem using autonomous vehicles
    Chen, Shukai
    Wang, Hua
    Meng, Qiang
    [J]. COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2020, 35 (01) : 45 - 60
  • [10] Chung S.H., 2020, COMPUT IND ENG