Hybrid Meta-heuristics for the Traveling Car Renter Salesman Problem

Brenner Humberto Ojeda Rios, Junior Cupe Casquina, Hossmell Hernan Velasco Añasco, Alfredo Paz-Valderrama

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The Traveling Car Renter Problem (CaRS) is a generalization of the classic Traveling Salesman Problem (TSP), where the tour of visits can be broken down into contiguous paths that can be traveled with different rental cars. The objective is to determine the Hamiltonian circuit that has a final minimum cost, considering the penalty paid for each vehicle change on tour. The penalty is the cost of returning the car to the city where it was rented. CaRS is classified as an NP-hard problem. The research focuses on hybrid procedures that combine meta-heuristics and methods based on Linear Programming to deal with CaRS. The hybridized algorithms are scientific algorithms (ScA), variable neighborhood descent (VND), adaptive local search procedure (ALSP), and a new ALSP variant called iterative adaptive local search procedure (IALSP). The following techniques are proposed to deal with the CaRS: ScA+ALSP, ScA+IALSP, and ScA+VND+IALSP. A mixed integer programming model is proposed for the CaRS, which is used in ALSP and IALSP. Nonparametric tests are used to compare the algorithms in a set of instances in the literature.

Original languageEnglish
Title of host publicationLearning and Intelligent Optimization - 15th International Conference, LION 15, 2021, Revised Selected Papers
EditorsDimitris E. Simos, Panos M. Pardalos, Ilias S. Kotsireas
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages15
ISBN (Print)9783030921200
StatePublished - 2021
Event15th International Conference on Learning and Intelligent Optimization, LION 15 2021 - Virtual, Online
Duration: 20 Jun 202125 Jun 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12931 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Conference on Learning and Intelligent Optimization, LION 15 2021
CityVirtual, Online

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.


  • Mathematical programming
  • Metaheuristics
  • Traveling car renter problem


Dive into the research topics of 'Hybrid Meta-heuristics for the Traveling Car Renter Salesman Problem'. Together they form a unique fingerprint.

Cite this