Multi-party ride-matching problem in the ride-hailing market with bundled option services

Abstract As demands for convenient and comfortable mobility grow, transportation network companies (TNCs) begin to diversify the ride-hailing services they offer. Modes that are offered now include ride-pooling (RP), non-ride-pooling (NP), and a third “bundled” option, which combines RP and NP. This emerging bundled option allows riders to be served via either RP or NP mode, whichever becomes available first. This paper examines the added complexity that a ride-hailing service platform faces when it introduces a third bundled option. Incorporating the predicted pooling information in the near future, a ride-matching problem is dedicated to matching vehicles with riders under various scenarios over a number of matching iterations. We formulate the multi-period ride-matching problem using an integer linear programming model with multiple objectives and to make dispatching decisions based on certain matching criteria. The complexity of the problem requires resolution via a two-stage Kuhn-Munkres (2-KM) algorithm, whose robustness is verified by computational tests. Some interesting insights are obtained: (1) how the bundled option impacts system performance metrics depends on whether the supply is sufficient or not; (2) there is an optimal value of the criterion of the maximum pickup time that maximizes the ride-pooling time savings.

[1]  Paolo Santi,et al.  Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing , 2022 .

[2]  Aravind Srinivasan,et al.  Allocation Problems in Ride-sharing Platforms , 2017, AAAI.

[3]  Zhe Xu,et al.  A Deep Value-network Based Approach for Multi-Driver Order Dispatching , 2019, KDD.

[4]  Jun Wang,et al.  Efficient Ridesharing Order Dispatching with Mean Field Multi-Agent Reinforcement Learning , 2019, WWW.

[5]  R. Jayakrishnan,et al.  A Real-Time Algorithm to Solve the Peer-to-Peer Ride-Matching Problem in a Flexible Ridesharing System , 2017 .

[6]  Jieping Ye,et al.  On the supply curve of ride-hailing systems , 2019 .

[7]  Eduardo C. Xavier,et al.  Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem , 2013, IJCAI.

[8]  Christos G. Cassandras,et al.  Optimal Assignments in Mobility-on-Demand Systems Using Event-Driven Receding Horizon Control , 2020 .

[9]  Lei Chen,et al.  Auction-Based Order Dispatch and Pricing in Ridesharing , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[10]  Michael Lees,et al.  A Partition-Based Match Making Algorithm for Dynamic Ridesharing , 2015, IEEE Transactions on Intelligent Transportation Systems.

[11]  Satish V. Ukkusuri,et al.  Optimal assignment and incentive design in the taxi group ride problem , 2017 .

[12]  Amy R. Ward,et al.  Dynamic Matching for Real-Time Ride Sharing , 2020 .

[13]  Xiqun Chen,et al.  Understanding ridesplitting behavior of on-demand ride services: An ensemble learning approach , 2017 .

[14]  Zhe Xu,et al.  Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach , 2018, KDD.

[15]  Andrew M Amey.  Real-time ridesharing : exploring the opportunities and challenges of designing a technology-based rideshare trial for the MIT community , 2010 .

[16]  Hai Yang,et al.  Pricing and equilibrium in on-demand ride-pooling markets , 2020 .

[17]  Andrea Simonetto,et al.  Real-time city-scale ridesharing via linear assignment problems , 2019, Transportation Research Part C: Emerging Technologies.

[18]  Jintao Ke,et al.  Optimizing matching time interval and matching radius in on-demand ride-sourcing markets , 2020 .

[19]  Jieping Ye,et al.  Optimizing Online Matching for Ride-Sourcing Services with Multi-Agent Deep Reinforcement Learning , 2019, ArXiv.

[20]  Xing Wang,et al.  Stable Matching for Dynamic Ride-Sharing Systems , 2014, Transp. Sci..

[21]  Jieping Ye,et al.  Optimizing Taxi Carpool Policies via Reinforcement Learning and Spatio-Temporal Mining , 2018, 2018 IEEE International Conference on Big Data (Big Data).

[22]  Christos G. Cassandras,et al.  Optimization of Ride Sharing Systems Using Event-driven Receding Horizon Control , 2019, IFAC-PapersOnLine.

[23]  Chi-Chung Tao,et al.  Dynamic Taxi-Sharing Service Using Intelligent Transportation System Technologies , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

[24]  Jieping Ye,et al.  Deep Reinforcement Learning with Knowledge Transfer for Online Rides Order Dispatching , 2018, 2018 IEEE International Conference on Data Mining (ICDM).

[25]  Patrick Jaillet,et al.  Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications , 2019, Oper. Res..

[26]  Chunfeng Cui,et al.  Solving large-scale assignment problems by Kuhn-Munkres algorithm , 2016 .

[27]  Ali Haghani,et al.  Real-Time Rideshare Matching Problem , 2010 .

[28]  Jieping Ye,et al.  Predicting origin-destination ride-sourcing demand with a spatio-temporal encoder-decoder residual multi-graph convolutional network , 2019, Transportation Research Part C: Emerging Technologies.

[29]  R. Jayakrishnan,et al.  Dynamic Shared‐Taxi Dispatch Algorithm with Hybrid‐Simulated Annealing , 2016, Comput. Aided Civ. Infrastructure Eng..

[30]  Michael G.H. Bell,et al.  The Optimal Dispatching of Taxis under Congestion: a Rolling Horizon Approach , 2006 .

[31]  Emilio Frazzoli,et al.  On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.

[32]  Guoliang Li,et al.  An Efficient Ride-Sharing Framework for Maximizing Shared Route , 2018, IEEE Transactions on Knowledge and Data Engineering.

[33]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

[34]  Dawn B. Woodard,et al.  Dynamic pricing and matching in ride‐hailing platforms , 2019, Naval Research Logistics (NRL).

[35]  Hassan Artail,et al.  The shared-taxi problem: Formulation and solution methods , 2014 .

[36]  George S. Tombras,et al.  A Framework for Dynamic Car and Taxi Pools with the Use of Positioning Systems , 2009, 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.

[37]  Yafeng Yin,et al.  Surge pricing and labor supply in the ride-sourcing market , 2018, Transportation Research Part B: Methodological.

[38]  Hai Wang,et al.  Multi-Objective Online Ride-Matching , 2019, SSRN Electronic Journal.

[39]  Yu Zheng,et al.  T-share: A large-scale dynamic taxi ridesharing service , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).