A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem

Published: 2022/08/16, Updated: 2023/02/22

Branch and Cut Algorithms, Combinatorial Optimization, Meta Heuristics biased random-key genetic algorithms, branch-and-cut, q-learning, traveling salesman problem Short URL: https://optimization-online.org/?p=19948

Abstract.

Citation

Chaves et al., A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem. Submitted to …