A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-06-01
|
| Series: | Applied Artificial Intelligence |
| Online Access: | http://dx.doi.org/10.1080/08839514.2020.1730629 |