Reinforcement learning driven moth‐flame optimisation algorithm for solving numerical optimisation problems

Abstract

AbstractMoth‐flame optimisation (MFO) algorithm has received a lot of attention recently, due to its simple structure and easy coding. Researchers have demonstrated that the original MFO algorithm suffers from the drawbacks of insufficient variety, slow convergence speed, and readily sliding into local optimum, which are brought about by the imbalance between local and global search. Reinforcement learning driven moth‐flame optimisation (RLMFO) algorithm is designed to correct these issues. Opposition learning is employed to broaden the variety of the initial population. Reinforcement learning is introduced to direct the local and global search process of the algorithm. A strategy pool containing Gaussian mutation (GM), Cauchy mutation (CM), Lévy mutation (LM), and elite strategy (ES) is created to hold strategies with various functions. RLMFO is verified on the benchmark test suite in CEC 2017. RLMFO performs better than cutting‐edge algorithms according to experimental findings.