UNIGE document Scientific Article
previous document  unige:26168  next document
add to browser collection

A solution method for a car fleet management problem with maintenance constraints

Hertz, Alain
Schindl, David
Published in Journal of Heuristics. 2009, vol. 15, p. 425-450
Abstract The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given fleet of cars in order to satisfy requests from customers asking for some type of cars for a given time period. When requests exceed the stock of available cars, the company can either offer better cars than those requested, subcontract some requests to other providers, or buy new cars to enlarge the available stock. Moreover, the cars have to go through a maintenance process at a regular basis, and there is a limited number of workers that are available to perform these maintenances. The problem of satisfying all customer requests at minimum cost is known to be NP-hard. We propose a solution technique that combines two tabu search procedures with algorithms for the shortest path, the graph coloring and the maximum weighted independent set problems. Tests on benchmark instances used for the ROADEF’99 challenge give evidence that the proposed algorithm outperforms all other existing methods (thirteen competitors took part to this contest).
Keywords Car fleet managementGraph optimizationInteger linear programmingTabu search
Full text
Article (Published version) (475 Kb) - document accessible for UNIGE members only Limited access to UNIGE
(ISO format)
HERTZ, Alain, SCHINDL, David, ZUFFEREY, Nicolas. A solution method for a car fleet management problem with maintenance constraints. In: Journal of Heuristics, 2009, vol. 15, p. 425-450. https://archive-ouverte.unige.ch/unige:26168

311 hits

0 download


Deposited on : 2013-02-04

Export document
Format :
Citation style :