Non-myopic Matching and Rebalancing in Large-Scale On-Demand Ride-Pooling Systems Using Simulation-Informed Reinforcement Learning
Farnoosh Namdarpour, Joseph Y. J. Chow

TL;DR
This paper introduces a simulation-informed reinforcement learning approach for ride-pooling systems that considers long-term effects, leading to improved service rates, reduced wait times, and significant fleet size reductions compared to myopic policies.
Contribution
It extends existing ride-hailing RL frameworks to ride-pooling by embedding simulation for non-myopic decision-making and proposes a rebalancing policy for idle vehicles.
Findings
Non-myopic policy increases service rate by up to 8.4%.
Reduces fleet size by over 25% while maintaining performance.
Rebalancing cuts wait time by 27.3% and in-vehicle time by 12.5%.
Abstract
Ride-pooling, also known as ride-sharing, shared ride-hailing, or microtransit, is a service wherein passengers share rides. This service can reduce costs for both passengers and operators and reduce congestion and environmental impacts. A key limitation, however, is its myopic decision-making, which overlooks long-term effects of dispatch decisions. To address this, we propose a simulation-informed reinforcement learning (RL) approach. While RL has been widely studied in the context of ride-hailing systems, its application in ride-pooling systems has been less explored. In this study, we extend the learning and planning framework of Xu et al. (2018) from ride-hailing to ride-pooling by embedding a ride-pooling simulation within the learning mechanism to enable non-myopic decision-making. In addition, we propose a complementary policy for rebalancing idle vehicles. By employing n-step…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
