Improving ridesplitting services using optimization procedures on a shareability network: A case study of Chengdu

被引:31
作者
Tu, Meiting [1 ,2 ]
Li, Ye [1 ]
Li, Wenxiang [1 ]
Tu, Minchao [3 ]
Orfila, Olivier [2 ]
Gruyer, Dominique [2 ]
机构
[1] Tongji Univ, Coll Transportat Engn, Key Lab Rd & Traff Engn, Minist Educ, 4800 Caoan Rd, Shanghai 201804, Peoples R China
[2] IFSTTAR, Lab LIVIC, 25 Alle Marronniers, F-78000 Versailles, France
[3] Changan Univ, Sch Automobile, Xian, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Ridesplitting; Ridesourcing; Shareability network; Policy implications; A-RIDE PROBLEM; TAXI; TIME; ALGORITHM; SHARE;
D O I
10.1016/j.techfore.2019.119733
中图分类号
F [经济];
学科分类号
02 ;
摘要
Ridesourcing services play a crucial role in metropolitan transportation systems and aggravate urban traffic congestion and air pollution. Ridesplitting is one possible way to reduce these adverse effects and improve the transport efficiency, especially during rush hours. This paper aims to explore the potential of ridesplitting during peak hours using empirical ridesourcing data provided by DiDi Chuxing, which contains complete datasets of ridesourcing orders in the city of Chengdu, China. A ridesplitting trip identification algorithm based on a shareability network is developed to quantify the potential of ridesplitting. Then, we evaluate the gap between the potential and actual scales of ridesplitting. The results show that the percentage of potential cost savings can reach 18.47% with an average delay of 4.76 min, whereas the actual percentage is 1.22% with an average delay of 9.86 min. The percentage of shared trips can be increased from 7.85% to 90.69%, and the percentage of time savings can reach 25.75% from 2.38%. This is the first investigation of the gap between the actual scale and the potential of ridesplitting on a city scale. The proposed ridesplitting algorithm can not only bring benefits on a city level but also take passenger delays into consideration. The quantitative benefits could encourage transportation management agencies and transportation network companies to develop sensible policies to improve the existing ridesplitting services.
引用
收藏
页数:9
相关论文
共 45 条
[1]  
Alexander LP., 2015, Proc. UrbComp, V5, P1
[2]   On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment [J].
Alonso-Mora, Javier ;
Samaranayake, Samitha ;
Wallar, Alex ;
Frazzoli, Emilio ;
Rus, Daniela .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2017, 114 (03) :462-467
[3]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[4]   An exact method for the car pooling problem based on Lagrangean column generation [J].
Baldacci, R ;
Maniezzo, V ;
Mingozzi, A .
OPERATIONS RESEARCH, 2004, 52 (03) :422-439
[5]   A THEORY OF THE ALLOCATION OF TIME [J].
BECKER, GS .
ECONOMIC JOURNAL, 1965, 75 (299) :493-517
[6]   Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots [J].
Braekers, Kris ;
Caris, An ;
Janssens, Gerrit K. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 :166-186
[7]   How do companies organize nascent markets? The BlaBlaCar case in the inter-city shared mobility market [J].
Casprini, Elena ;
Di Minin, Alberto ;
Paraboschi, Andrea a .
TECHNOLOGICAL FORECASTING AND SOCIAL CHANGE, 2019, 144 :270-281
[8]   Exploring impacts of on-demand ridesplitting on mobility via real-world ridesourcing data and questionnaires [J].
Chen, Xiaowei ;
Zheng, Hongyu ;
Wang, Ze ;
Chen, Xiqun .
TRANSPORTATION, 2021, 48 (04) :1541-1561
[9]   Understanding ridesplitting behavior of on-demand ride services: An ensemble learning approach [J].
Chen, Xiqun ;
Zahiri, Majid ;
Zhang, Shuaichao .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2017, 76 :51-70
[10]   The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method [J].
Cortes, Cristian E. ;
Matamala, Martin ;
Contardo, Claudio .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (03) :711-724