Memetic Computing

, Volume 4, Issue 2, pp 89–108 | Cite as

Memetic algorithm for the Traveling Car Renter Problem: an experimental investigation

  • Marco César Goldbarg
  • Paulo Henrique Asconavieta
  • Elizabeth Ferreira Gouvêa Goldbarg
Regular Research Paper


The Traveling Car Renter Problem (CaRS) is a generalization of the Traveling Salesman Problem where the tour can be decomposed into contiguous paths that are travelled by different rented cars. When a car is rented in a city and delivered in another, the renter must pay a fee to return the car to its home city. Given a graph G and cost matrices associated to cars available for rent, the problem consists in determining the minimum cost Hamiltonian cycle in G, considering also the cost paid to deliver a car in a city different from the one it was rented. The latter cost is added to the cost of the edges in the cycle. This paper describes the general problem and some related variants. Two metaheuristic approaches are proposed to deal with CaRS: GRASP hybridized with Variable Neighborhood Descent and Memetic Algorithm. A set of benchmark instances is proposed for the new problem which is utilized on the computational experiments. The algorithms are tested on a set of 40 Euclidean and non-Euclidean instances.


Traveling Car Renter Problem Memetic algorithm GRASP Variable neighborhood search 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amdeberhan T, Manna D, Moll VH (2008) The 2-adic valuation of Stirling numbers. Exp Math 17(1): 69–82MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Applegate DL, Bixby R, Chvátal V, Cook W (1995) Finding Cuts in the TSP, DIMACS technical Report 95-05, Rutgers University.
  3. 3.
    Applegate DL, Bixby R, Chvátal V, Cook W (2006) The traveling salesman problem: a computational study. Princeton University Press, PrincetonMATHGoogle Scholar
  4. 4.
    Car Rental (2008) Web Page.
  5. 5.
    Car (2008) Car Rental Business, Global Strategic Business Report Global Industry Analysts, Inc., 278.
  6. 6.
    Conover WJ (2001) Practical nonparametric statistics. 3rd edn. Wiley, New YorkGoogle Scholar
  7. 7.
    Conrad C, Perlut A (2006) Enterprise Rent-A-Car Hits New Billion-Dollar Revenue Mark for 3rd Consecutive Year, Enterprise rent-a-car. http// Scholar
  8. 8.
    Edelstein M, Melnyk M (1977) The pool control system. Interfaces 8(1): 21–36CrossRefGoogle Scholar
  9. 9.
    Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6: 109–133MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Földesi P, Botzheim J (2010) Modeling of loss aversion in solving fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. Memetic Comput. 2: 259–271CrossRefGoogle Scholar
  11. 11.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New YorkMATHGoogle Scholar
  12. 12.
    Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, Series: Combinatorial Optimization. Kluwer Academic Publishers, DordrechtGoogle Scholar
  13. 13.
    Hertz A, Schindl D, Zufferey N (2009) A solution method for a car fleet management problem with maintenance constraints. J Heurist 5: 425–450CrossRefGoogle Scholar
  14. 14.
    Johnson DS, McGeoh LA (2002) Experimental analysis of heuristics for the STSP. In: Guttin G, Punnen A (eds) The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht, pp 369–443Google Scholar
  15. 15.
    Krarup J (1975) The peripatetic salesman and some related unsolved problems. In: Combinatorial Programming Methods and Applications. Reidel, Dordrecht, pp 173–178Google Scholar
  16. 16.
    Krasnogor N, Smith JE (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans Evol Comput 9(5): 474–488CrossRefGoogle Scholar
  17. 17.
    Le MN, Ong Y-S, Jin Y, Sendhoff B (2009) Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memetic Comput 1: 175–190CrossRefGoogle Scholar
  18. 18.
    Lia Z, Taob F (2010) On determining optimal fleet size and vehicle transfer policy for a car rental company. Comput Oper Res 37: 341–350CrossRefGoogle Scholar
  19. 19.
    Mars-Proietti L (2007) Encyclopedia of global industries, 4th edn. Grey House Publishing, New YorkGoogle Scholar
  20. 20.
    Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097–1100MathSciNetMATHCrossRefGoogle Scholar
  21. 21.
    Montemanni R, Barta J, Mastrolilli M, Gambardella LM (2007) The robust traveling salesman problem with interval data. Transp Sci 41(3): 366–381CrossRefGoogle Scholar
  22. 22.
    Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithm. caltech concurrent computation program. California Institute of Technology, USAGoogle Scholar
  23. 23.
    Moscato P, Cotta C (2010) A modern introduction to memetic algorithms. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, international series in operations research & management science, vol 146. Springer, Berlin, pp 141–183Google Scholar
  24. 24.
    Pachon JE, Iakovou B, Ip C, Aboudi R (2003) A synthesis of tactical fleet planning models for the car rental industry. IIE Trans 35(9): 907–916CrossRefGoogle Scholar
  25. 25.
    Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math Program Ser B 94: 343–359MathSciNetMATHCrossRefGoogle Scholar
  26. 26.
  27. 27.
    Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics, international series in operations research & management science, vol 57. Kluwer Academic Publishers, Dordrecht, pp 141–183Google Scholar
  28. 28.
    Resende MGC, Ribeiro CC (2010) Greedy randomized adaptive search procedures: advances and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, international series in operations research & management science, vol 146. Springer, Berlin, pp 283–320Google Scholar
  29. 29.
    Russel R (1977) An effective heuristic for the m-tour traveling salesman problem with some side conditions. Oper Res 25: 517–524CrossRefGoogle Scholar
  30. 30.
    Taillard E, Waelti P, Zuber J (2008) Few statistical tests for proportions comparison. Eur J Oper Res 185: 1336–1350MATHCrossRefGoogle Scholar
  31. 31.
    Xiong Y, Golden B, Wasil E (2007) The Colorful Traveling Salesman Problem. In: Extending the horizons: advances in computing, optimization, and decision technologies, Operations Research/Computer Science Interfaces Series 37, Springer, USA, pp 115–123Google Scholar
  32. 32.
    Yang Y, Jin W, Hao X (2008) Car rental logistics problem: a review of literature. IEEE International Conference on Service Operations and Logistics, and Informatics. IEEE/SOLI 2008, vol 2, pp 2815–2819Google Scholar
  33. 33.
    Yang Y, Jin W, Hao X (2009) Dynamic pool segmentation model and algorithm in the car rental industry. J Comput 4(12): 202–1208Google Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  • Marco César Goldbarg
    • 1
  • Paulo Henrique Asconavieta
    • 1
    • 2
  • Elizabeth Ferreira Gouvêa Goldbarg
    • 1
  1. 1.Universidade Federal do Rio Grande do NorteNatalBrazil
  2. 2.Instituto Federal de Educação, Ciência e Tecnologia Sul-rio-grandensePelotasBrazil

Personalised recommendations