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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993), pp. 107–108
Edelstein, M., Melnyk, M.: The pool control system. Interfaces 8(1), 21–36 (1997)
Fink, A., Reiners, T.: Modeling and solving the short-term car rental logistics problem. Transp. Res. Part E Logist. Trans. Rev. 42, 272–292 (2006)
Geraghty, M.K., Johnson, E.: Revenue management saves national car rental. Interfaces 27(1), 107–127 (1997)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, San Diego (1980)
Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: An optimal solution for the channel-assignment problem. IEEE Trans. Comput. C 28, 807–810 (1979)
Kolen, A.W.J., Lenstra, J.K.: Combinatorics in operations research. In: Graham, R.L., Groetschel, M., Lovász, L. (eds.) Handbook of Combinatorics, pp. 1875–1910. North-Holland, Amsterdam (1995)
Kolen, A.W.J., Lenstra, J.K.L., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: A survey. Nav. Res. Logist. 54, 530–543 (2007)
Pachon, J.R., Iakovou, E., Ip, C., Aboudi, R.: A synthesis of tactical fleet planning models for the car rental industry. IIE Trans. 35, 907–916 (2003)
ROADEF Challenge: Description of the problem. http://www.prism.uvsq.fr/~vdc/ROADEF/CHALLENGES/1999/ (1999)
Shamir, R.: Advanced topics in Graph Algorithms. Technical Report, Har-Peled, S. (ed.), Tel Aviv University, Israel, pp. 111–113 (1994)
Silver, E.A., Pyke, D.F., Peterson, R.: Inventory Management and Production Planning and Scheduling. Wiley, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hertz, A., Schindl, D. & Zufferey, N. A solution method for a car fleet management problem with maintenance constraints. J Heuristics 15, 425–450 (2009). https://doi.org/10.1007/s10732-008-9072-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-008-9072-4