A dynamic adaptive firefly algorithm with globally orientation

This paper proposes a dynamic adaptive firefly algorithm to overcome the disadvantages of the standard firefly algorithm, to improve the convergence rate and solution precision, and to avoid the premature algorithm trapping at the local extreme. It has a global-oriented moving mechanism and can dynamically adjust the step size and attractiveness. First, through the adaptive deviation degree strategy of optimal distance combining with the Gaussian distribution, it optimizes the fixed step-factor to balance the exploration and excavation capabilities of the algorithm and improves the diversity of the population. Second, minimum attractiveness is introduced to the algorithm, and is adaptively changed with the number of iterations, which can avoid random walk due to lack of traction between fireflies. Finally, this paper improves the mobility mechanism based on the position of the current optimal firefly. It enables firefly move with global orientation and also expands the sharing of information between fireflies to improve the overall evolutionary optimization performance of the algorithm. Theoretical analysis proves the convergence and time complexity of the improved algorithm. The simulation results of several test functions and engineering constraint optimization problems show that the improved algorithm has better solution performance, and clearly improves the convergence speed and solution accuracy. (C) 2020 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.