Discrete swallow swarm optimization algorithm for travelling salesman problem

Abstract

Swallow Swarm Optimization is a new metaheuristic of swarm intelligence based algorithm appeared by Neshat in 2013 in the continuous case. This optimization algorithm inspired by the intelligent behaviors of swallows. In This paper, we provide an adaptation of the swallow swarm optimization (SSO) to solve the famous traveling salesman problem (TSP), as one of the known combinatorial optimization problems. In order to test the performance of the algorithm described herein, we resolve a set of benchmark instances from TSPLIB library. The results obtained demonstrate that DSSO is performant than other metaheuristics methods.