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. Traveling 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 behavior 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.

Drone scheduling for construction site surveillance

“…Model (Branam, Arcaro, & Adeli, 2019), but they do not guarantee global optimality. Another approach is to use metaheuristics, such as neural networks (Adeli & Karim, 1997;Rokibul Alam, Siddique, & Adeli, 2019), spider monkey optimization (Akhand, Ayon, Shahriyar, Siddique, & Adeli, 2020), and particle swarm optimization (Hossain, Akhand, Shuvo, Siddique, & Adeli, 2019), but these methods do not even guarantee local optimality. A final approach is to develop tailored methods (Meng, Wang, & Lee, 2015;Wang, Zhang, & Qu, 2018), and we adopt this approach.…”

Dynamic Multi-Role Adaptive Collaborative Ant Colony Optimization for Robot Path Planning

“…Content may change prior to final publication. [28] 2019 [29] 2019 [30] 2018 [31] 2018 [32] 2020 [33] 2020 [34] eil51 It can be seen from Table.11, compared with other bionic algorithms, the MRCACO algorithm can find better solutions in most TSP instances.…”

Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem

“…The improved Lin–Kernigham algorithm called LKH was introduced by Helsgaun [ 18 ]; this algorithm provided the best solution reported thus far for the World TSP instance containing 1,904,711 vertices [ 19 ]. Different metaheuristic methods for the TSP also emerged using various principles such as ant colony optimization (ACO) [ 20 ], particle swarm optimization (PSO) [ 21 ], simulated annealing [ 22 ], genetic algorithms [ 23 ], and others [ 24 ], as well as their combinations [ 25 , 26 , 27 ].…”