Real-Time Dispatching of Large-Scale Ride-Sharing Systems: Integrating Optimization, Machine Learning, and Model Predictive Control
Connor Riley, Pascal Van Hentenryck, Enpeng Yuan

TL;DR
This paper presents an integrated real-time dispatching framework for large-scale ride-sharing systems that combines advanced algorithms, machine learning demand prediction, and predictive control to significantly reduce passenger waiting times.
Contribution
It introduces a novel end-to-end system integrating dispatching algorithms, demand forecasting, and vehicle relocation optimization for large-scale ride-sharing.
Findings
Reduced average waiting times by about 30% overall.
Achieved up to 55% reduction in high-demand zones.
Effective in large-scale real-world scenarios.
Abstract
This paper considers the dispatching of large-scale real-time ride-sharing systems to address congestion issues faced by many cities. The goal is to serve all customers (service guarantees) with a small number of vehicles while minimizing waiting times under constraints on ride duration. This paper proposes an end-to-end approach that tightly integrates a state-of-the-art dispatching algorithm, a machine-learning model to predict zone-to-zone demand over time, and a model predictive control optimization to relocate idle vehicles. Experiments using historic taxi trips in New York City indicate that this integration decreases average waiting times by about 30% over all test cases and reaches close to 55% on the largest instances for high-demand zones.
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.
Taxonomy
TopicsTransportation and Mobility Innovations · Transportation Planning and Optimization · Smart Parking Systems Research
