Discrete Spider Monkey Optimization for Travelling Salesman Problem

Abstract Meta-heuristic algorithms inspired by biological species have become very popular in recent years. Collective intelligence of various social insects such as ants, bees, wasps, termites, birds, fish, has been investigated to develop a number of meta-heuristic algorithms in the general domain of swarm intelligence (SI). The developed SI algorithms are found effective in solving different optimization tasks. Travelling Salesman Problem (TSP) is the combinatorial optimization problem where a salesman starting from a home city travels all the other cities and returns to home city in the shortest possible path. TSP is a popular problem due to the fact that the instances of TSP can be applied to solve real-world problems, implication of which turns TSP into a standard test bench for performance evaluation of new algorithms. Spider Monkey Optimization (SMO) is a recent addition to SI algorithms based on the social behaviour of spider monkeys. SMO implicitly adopts grouping and regrouping for the interactions to improve solutions; such multi-population approach is the motivation of this study to develop an effective method for TSP. This paper presents an effective variant of SMO to solve TSP called discrete SMO (DSMO). In DSMO, every spider monkey represents a TSP solution where Swap Sequence (SS) and Swap Operator (SO) based operations are employed, which enables interaction among monkeys in obtaining the optimal TSP solution. The SOs are generated using the experience of a specific spider monkey as well as the experience of other members (local leader, global leader, or a randomly selected spider monkey) of the group. The performance and effectiveness of the proposed method have been verified on a large set of TSP instances and the outcomes are compared to other well-known methods. Experimental results demonstrate the effectiveness of the proposed DSMO for solving TSP.