A parallel branch-and-cut and an adaptive metaheuristic to solve the family traveling salesman problem
Carregando...
Data
2023
Autores
Chaves, Antonio Augusto [UNIFESP]
Vianna, Barbara Lessa [UNIFESP]
Silva, Tiago Tibúrcio da [UNIFESP]
Schenekemberg, Cleder Marcos [UNIFESP]
Orientadores
Tipo
Artigo
Título da Revista
ISSN da Revista
Título de Volume
Resumo
This paper addresses the Family Traveling Salesman Problem (FTSP), a variant of the Traveling Salesman Problem that group nodes into families. The goal is to select the best route by visiting only a subset of nodes from each family. We developed two methods to solve the FTSP: (i) a parallel branch- and-cut algorithm with an efficient local search procedure (P-B&C) to obtain an optimal solution, and (ii) an adaptive metaheuristic that combines the Biased Random-key Genetic Algorithm (BRKGA) with a reinforcement learning algorithm. In this case, the Q-Learning algorithm controls the parameters of the BRKGA during the evolutionary process. We perform computational experiments on a well-known benchmark dataset with 185 instances. Our P-B&C proves the optimal value for 179 instances, improving the best upper bounds in 19 open instances. The new local search component of the P-B&C finds the best upper bounds for 50% of instances. The BRKGA-QL finds the optimal solution in 131 instances, improving the best upper bounds in 21 open instances. Finally, we compare our results with the best results in the literature, and both methods show robustness and efficiency in solving the FTSP.