Moth-flame Optimization Algorithm Based on Chaotic Initialization and Gaussian Mutation
摘要
Moth-flame optimization algorithm (MFO) has some drawbacks in solving optimization problems, such as low precision and high possibility of being trapped in local optimum. A modified MFO algorithm based on chaotic initialization and Gaussian mutation is proposed. Firstly, the cube chaotic map is used to initialize the moth population, which makes the moth more evenly distributed in the search space. Then, Gaussian mutation is adopted to disturb a few poor individuals to enhance the ability of escaping the local optimum. Finally, Archimedes curve is introduced to expand the search scope and strength the exploration ability in the unknown field. A series of experiments are carried out on CEC14 test function set and 21 extensible Benchmark functions. Compared with standard moth-flame optimization algorithm, genetic algorithm, artificial bee colony algorithm, particle swarm algorithm, differential evolution algorithm, flower pollination algorithm, and butterfly optimization algorithm, the results demonstrate that the proposed algorithm is strengthened in obtaining solutions with better quality and convergence.