Parameter Analysis of a Bee-Inspired Algorithm to Solve the Traveling Salesman Problem

Thiago A. S. Masutti and Leandro N. de Castro

Keywords

Optimization, Natural Computing, Swarm Intelligence, Traveling Salesman Problem

Abstract

The Traveling Salesman Problem (TSP) is extensively used to test new algorithms that tackle combinatorial optimiza-tion problems. Bee inspired algorithms are receiving a con-siderable attention from the Swarm Intelligence field. This paper presents the TSPoptBees, a bee inspired algorithm to solve the TSP. A vast discussion is made in regards to the parameter analysis of the proposed algorithm, showing trends on varying certain parameters and proposing default values for them. The quality is assessed using instances from the TSPLIB and the results show the algorithm is able to provide good quality solutions.

Important Links:

Go Back