ABSTRACT The Traveling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optimal solutions. One of the variants of the TSP is the Generalized TSP (GTSP), where the TSP is considered as a special case which makes the GTSP harder to solve. We propose in this paper a new memetic algorithm based on the well-known Breakout Local Search (BLS) metaheuristic to provide good solutions for GTSP instances. Our approach is competitive compared to other recent memetic algorithms proposed for the GTSP and gives at the same time some improvements to BLS to reduce its runtime.

中文翻译：

---

一种基于局部突围搜索的广义旅行商问题的模因算法

摘要 旅行商问题 (TSP) 是最流行的组合优化问题之一。它可以解决各种各样的应用程序，但也因其难以找到最佳解决方案而受到广泛欢迎。TSP 的一种变体是广义 TSP (GTSP)，其中 TSP 被视为一种特殊情况，这使得 GTSP 更难求解。我们在本文中提出了一种基于著名的突破局部搜索 (BLS) 元启发式的新模因算法，以为 GTSP 实例提供良好的解决方案。与最近为 GTSP 提出的其他模因算法相比，我们的方法具有竞争力，同时对 BLS 进行了一些改进以减少其运行时间。