2025/06/05 by Pengbo Zhu, Zhu, Pengbo, Giancarlo Ferrari‐Trecate +3
Engineering · #FOS: Electrical engineering #Systems and Control (eess.SY) #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods #Vehicular Ad Hoc Networks (VANETs) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2506.04968
openalex publication_date 2025/06/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
Ride-pooling services, such as UberPool and Lyft Shared Saver, enable a single vehicle to serve multiple customers within one shared trip. Efficient path-planning algorithms are crucial for improving the performance of such systems. For partially occupied vehicles with available capacity, we introduce a novel routing algorithm designed to maximize the likelihood of picking up additional passengers while serving the current passengers to their destination. Unlike traditional methods that group passengers and vehicles based on predefined time windows, our algorithm allows for immediate responses to passenger requests. Our approach optimizes travel time while dynamically considering passenger demand and coordinating with other vehicles. Formulated as an integer linear programming (ILP) problem, our method is computationally efficient and suitable for real-time applications. Simulation results demonstrate that our proposed method can significantly enhance service quality.