Chaotic Moth Swarm Algorithm

Abstract

Moth Swarm Algorithm (MSA) is one of the newest developed nature-inspired heuristics for optimization problem. Nevertheless MSA has a drawback which is slow convergence. Chaos is incorporated into MSA to eliminate this drawback. In this paper, ten chaotic maps have been embedded into MSA to find the best numbers of prospectors for increase the exploitation of the best promising solutions. The proposed method is applied to solve the well-known seven benchmark test functions. Simulation results show that chaotic maps can improve the performance of the original MSA in terms of the convergence speed. At the same time, sinusoidal map is the best map for improving the performance of MSA significantly.