Moth-flame optimization algorithm based on adaptive weight and simulated annealing

Abstract

Moth-flame optimization algorithm has the demerit of being easily trapped in local optimum. To solve this problem, an improved algorithm ASMFO is proposed in this paper. Adaptive weight can be automatically changed so that the algorithm can get a greater search scope in the early stage and the precision of the optimal solution can be increased in the later stage of the algorithm. Moreover, the simulated annealing method is employed to accept new solutions with a certain probability, which can further alleviate the problem that MFO is easy to fall into local optimum and will also enhance the global search ability of MFO algorithm. The experimental results show that the improved algorithm is superior to other optimization algorithms in the convergence precision and the stability.