Spotted Hyena Optimizer - An Approach to Travelling Salesman Problems.

The traveling salesman problem (TSP) is a well-known NP problem. Its main objective is to find a shortest close trip that visits all given cities, once for each. In this paper, we present an approach to Travelling Salesman Problems (TSPs) using a novel swarm-based algorithm named Spotted Hyena Optimizer (SHO). The algorithm is inspired by the social relationship between spotted hyenas and their collaborative behavior. Experimental results with four benchmark datasets in TSPLIB (Burma14, Bays29, Att48, and Berlin52) indicated that SHO algorithm could provide optimal solutions to TSPs. Even in some cases, it outperforms other metaheuristic algorithms such as GA, ACO, and PSO.