A Ranking-Based Optimization Algorithm for the Vehicle Relocation Problem in Car Sharing Services
Piotr Szwed, Pawe{\l} Skrzynski, Jaros{\l}aw W\k{a}s

TL;DR
This paper introduces a ranking-based optimization algorithm for vehicle repositioning in car-sharing services, improving efficiency by 8-20% compared to baseline methods using real-world data.
Contribution
It presents a novel fast ranking-based algorithm for vehicle relocation that considers demand patterns and trip durations, outperforming baseline and exact optimization methods.
Findings
Average improvement of 8.44% over baseline
Up to 19.6% improvement with exact MIP solver
Performance gains of 3-10% depending on workforce size
Abstract
The paper addresses the Vehicle Relocation Problem in free-floating car-sharing services by presenting a solution focused on strategies for repositioning vehicles and transferring personnel with the use of scooters. Our method begins by dividing the service area into zones that group regions with similar temporal patterns of vehicle presence and service demand, allowing the application of discrete optimization methods. In the next stage, we propose a fast ranking-based algorithm that makes its decisions on the basis of the number of cars available in each zone, the projected probability density of demand, and estimated trip durations. The experiments were carried out on the basis of real-world data originating from a major car-sharing service operator in Poland. The results of this algorithm are evaluated against scenarios without optimization that constitute a baseline and compared…
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 · Vehicle Routing Optimization Methods · Sharing Economy and Platforms
