Robust matching-integrated vehicle rebalancing in ride-hailing with uncertain demand

被引:49
作者
Guo, Xiaotong [1 ]
Caros, Nicholas S. [1 ]
Zhao, Jinhua [2 ]
机构
[1] MIT, Dept Civil & Environm Engn, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] MIT, Dept Urban Studies & Planning, 77 Massachusetts Ave, Cambridge, MA 02139 USA
关键词
Ride-hailing; Vehicle  rebalancing; Robust optimization; Demand uncertainty; OPTIMIZATION; EQUILIBRIUM; SYSTEM;
D O I
10.1016/j.trb.2021.05.015
中图分类号
F [经济];
学科分类号
02 ;
摘要
ABS T R A C T With the rapid growth of the mobility-on-demand (MoD) market in recent years, ride-hailing companies have become an important element of the urban mobility system. There are two critical components in the operations of ride-hailing companies: driver-customer matching and vehicle rebalancing. In most previous literature, each component is considered separately, and performances of vehicle rebalancing models rely on the accuracy of future demand predictions. To better immunize rebalancing decisions against demand uncertainty, a novel approach, the matching-integrated vehicle rebalancing (MIVR) model, is proposed in this paper to incorporate driver-customer matching into vehicle rebalancing problems to produce better rebalancing strategies. The MIVR model treats the driver-customer matching component at an aggregate level and minimizes a generalized cost including the total vehicle miles traveled (VMT) and the number of unsatisfied requests. For further protection against uncertainty, robust optimization (RO) techniques are introduced to construct a robust version of the MIVR model. Problem-specific uncertainty sets are designed for the robust MIVR model. The proposed MIVR model is tested against two benchmark vehicle rebalancing models using real ride-hailing demand and travel time data from New York City (NYC). The MIVR model is shown to have better performances by reducing customer wait times compared to benchmark models under most scenarios. In addition, the robust MIVR model produces better solutions by planning for demand uncertainty compared to the non-robust (nominal) MIVR model.
引用
收藏
页码:161 / 189
页数:29
相关论文
共 52 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]   Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles [J].
Al-Kanj, Lina ;
Nascimento, Juliana ;
Powell, Warren B. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (03) :1088-1106
[3]   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
[4]  
[Anonymous], 2019, TLC Trip Record Data
[5]   Coordinating Supply and Demand on an On-Demand Service Platform with Impatient Customers [J].
Bai, Jiaru ;
So, Kut C. ;
Tang, Christopher S. ;
Chen, Xiqun ;
Wang, Hai .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2019, 21 (03) :556-570
[6]   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
[7]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[8]   Robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Nemirovski, A .
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) :1-13
[9]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[10]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53