A quantum-behaved simulated annealing algorithm-based moth-flame optimization method

Abstract

This study develops an improved moth-flame optimization algorithm, which is a recently proposed optimizer based on moth behavior in nature. It has achieved favorable results in medical science, educational evaluation, and other fields. However, the convergence rate of the original moth-flame optimization algorithm is too fast in the running process, and it is prone to fall into local optimum, which leads to the failure to produce the high-quality optimal result. Accordingly, this paper proposes a reinforced technique for the moth-flame optimization algorithm. Firstly, the simulated annealing strategy is introduced into the moth-flame optimization algorithm to boost the advantage of the algorithm in the local exploitation process. Then, the idea of the quantum rotation gate is integrated to enhance the global exploration ability of the algorithm and ameliorate the diversity of the moth. These two steps maintain the relationship between exploitation and exploration as well as strengthen the performance of the algorithm in both phases. After that, the method is compared with ten well-regarded and ten alternative algorithms on benchmark functions to verify the effectiveness of the approach. Also, the Wilcoxon signed rank and Friedman assessment were performed to verify the significance of the proposed method against other counterparts. The simulation results reveal that the two introduced strategies significantly improve the exploration and exploitation capacity of moth-flame optimization algorithm. Finally, the algorithm is utilized to feature selection and two engineering problems, including pressure vessel design and multiple disk clutch brake problems. In these practical applications, the novel algorithm also achieves particularly notable results, which also illustrates that the algorithm is qualified is an effective auxiliary appliance in solving complex optimization problems.