Journal of Heuristics

, Volume 15, Issue 5, pp 425–450

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


DOI: 10.1007/s10732-008-9072-4

Cite this article as:
Hertz, A., Schindl, D. & Zufferey, N. J Heuristics (2009) 15: 425. doi:10.1007/s10732-008-9072-4


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).


Car fleet managementGraph optimizationInteger linear programmingTabu search

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Département de Mathématiques et de Génie IndustrielÉcole PolytechniqueMontréalCanada
  2. 2.Faculté des Sciences Économiques et Sociales, Section des Hautes Études Commerciales (HEC)Université de GenèveGenèveSwitzerland