Nos tutelles


Nos partenaires

Accueil > Publications > Thèses > Archives Thèses > Thèses 2015 - 2016

WEGENER Jan-Thierry

Redéploiement en convois de flottes de véhicules partagés

Mardi 26 juillet 2016 - 14 h 00 - ISIMA

Carsharing is a modern way of car rental, attractive to customers who make
only occasional use of a car on demand. In a carsharing system, a fleet of
cars is distributed at specified stations in an urban area, customers can
take a car at any time and station and return it at any time and station,
provided that there is a car available at the start station and a free
place at the destination station. To ensure the latter, customers have to
book their demands in advance. For operating such a system in a
satisfactory way, the stations have to keep a good ratio between the total
number of places and the number of cars in each station, in order to serve
as many requests as possible. This leads to the problem of balancing the
load of the stations, called Relocation Problem : an operator has to
monitor the load and to decide when and how to move cars from "overfull"
stations to "underfull" ones.
We consider an innovative carsharing system, where the cars are partly
autonomous, which allows to build wireless convoys of cars leaded by a
special vehicle, such that the whole convoy is moved by only one driver.
This setting is similar to bikesharing, where trucks can simultaneously
move several bikes during the relocation process.
In this thesis, we address the dynamic and static aspects of the
Relocation Problem. The "Dynamic Relocation Problem" describes the
situation when cars can be moved between stations during the working hours
in order to satisfy the needs of the customers. Hereby, the operator has
to make decisions dynamically according to the current situation. In the
"Static Relocation Problem" we assume that there is no (or only little)
interaction by customers with the system.
This situation occurs when the carsharing system is prepared for the next
day, i.e., the relocation process is performed during the night.
We model the Relocation Problem in the framework of a metric task system.
Afterwards, we theoretically analyze both problems and give strategies to
solve them. Finally, we perform some computational experiments to examine
the applicability of the presented algorithms in practice.