TSPoptBees: A Bee-Inspired Algorithm to Solve the Traveling Salesman Problem
Thiago A. S. Masutti, Leandro Nunes de Castro · 2016
The Traveling Salesman Problem (TSP) is a combinatorial optimization problem widely used to test new heuristics. Bee-inspired algorithms are receiving great attention from the Swarm Intelligence field due to their capability of providing good solutions in reasonable time to complex problems. This paper takes the optBees, a bee-inspired algorithm used for continuous optimization, and proposes the necessary modifications to solve the TSP, generating the TSPoptBees. The proposed algorithm is evaluated using benchmark instances and the results are compared to other similar works from the literature.