Spider Monkey Optimization to Solve Traveling Salesman Problem

Traveling Salesman Problem (TSP) is the most well-known combinatorial optimization real-world problem. TSP is also very popular to check proficiency in any newly developed optimization method. In addition, the optimization methods, which are developed for other tasks (e. g., numerical optimization), also test their proficiency in TSP. This study investigates a new technique to solve TSP based on a recently developed optimization technique stimulated through the foraging conduct of spider monkeys. Standard Spider Monkey Optimization (SMO) is established for numerical optimization which has six phases and each one has a different purpose. In this study, SMO is modified and updated to solve TSP; and Swap Operators (SOs), and Swap Sequence (SS) are considered to adapt SMO for TSP. In the…