Near-Optimal Emission-Aware Online Ride Assignment Algorithm for Peak Demand Hours
Ali Zeynali, Mahsa Sahebdel, Noman Bashir, Ramesh K. Sitaraman, Mohammad Hajiesmaili

TL;DR
This paper presents LARA, an online ride assignment algorithm that reduces emissions and wait times during peak demand by dynamically adjusting rider-driver distance limits, with proven near-optimality and strong empirical results.
Contribution
LARA is the first emission-aware ride assignment algorithm with both theoretical guarantees and demonstrated empirical effectiveness during peak demand.
Findings
Up to 34% reduction in carbon emissions.
Up to 50% decrease in rider wait times.
Effective during peak demand periods.
Abstract
Ridesharing has experienced significant global growth over the past decade and is becoming an integral component of modern transportation systems. However, despite their benefits, ridesharing platforms face fundamental inefficiencies that contribute to negative environmental impacts. A prominent source of such inefficiency is the deadhead miles. This issue becomes especially severe during high-demand periods, when the volume of ride requests exceeds the available driver supply, leading to suboptimal rider-to-driver assignments, longer deadhead trips, and increased emissions. Although limiting these unproductive miles can reduce emissions, doing so may increase passenger wait times due to limited driver availability, thereby degrading the overall service experience. In this paper, we introduce LARA, an online rider-to-driver assignment algorithm that dynamically adjusts the maximum…
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 · Electric Vehicles and Infrastructure · Transportation Planning and Optimization
