ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem

TL;DR

This paper introduces ReOpt, an algorithm with a quality guarantee for solving the static relocation problem in carsharing systems, ensuring efficient redistribution of vehicles to maintain station balance.

Contribution

It presents a novel combinatorial algorithm with proven approximation guarantees for the static relocation problem in urban carsharing systems.

Findings

Provides approximation factors for different scenarios

Demonstrates effectiveness of the algorithm in system balancing

Addresses a key operational challenge in carsharing systems

Abstract

In a carsharing system, a fleet of cars is distributed at stations in an urban area, customers can take and return cars at any time and station. For operating such a system in a satisfactory way, the stations have to keep a good ratio between the numbers of free places and cars in each station. This leads to the problem of relocating cars between stations, which can be modeled within the framework of a metric task system. In this paper, we focus on the Static Relocation Problem, where the system has to be set into a certain state, outgoing from the current state. We present a combinatorial approach and provide approximation factors for several different situations.