Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.04968 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909639432470528 |
|---|---|
| author | Zhu, Pengbo Ferrari-Trecate, Giancarlo Geroliminis, Nikolas |
| author_facet | Zhu, Pengbo Ferrari-Trecate, Giancarlo Geroliminis, Nikolas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_04968 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | En Route Path-planning for Partially Occupied Vehicles in Ride-pooling Systems Zhu, Pengbo Ferrari-Trecate, Giancarlo Geroliminis, Nikolas Systems and Control 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. |
| title | En Route Path-planning for Partially Occupied Vehicles in Ride-pooling Systems |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2506.04968 |