An integrated firefly algorithm for the optimization of constrained engineering design problems.

As a nature-inspired metaheuristic method, the firefly algorithm (FA) arises more attentions in academic and engineering fields. However, too much attraction in FA's global attraction model leads to low computational efficiency, and the stochastic model with fixed randomization parameter is hard to balance the exploitation and exploration of the algorithm. Thus, FA still needs improvement to deal with complex engineering problems. An integrated firefly algorithm (IFA) that combines two novel attractive models with a new stochastic model is proposed to improve the standard FA. Firstly, the attractive model and stochastic model of standard FA are investigated through theoretical analysis and numerical experiments. And the factors that affect the computational efficiency and accuracy of FA are revealed. Based on the analysis results, two new fitness-based update formulas for attractiveness parameter are constructed to avoid the invalidation. The proposed virtual attractive model and global best attractive model can reduce the computation complexity and enhance the exploitation ability. Moreover, an adaptive strategy is presented for the stochastic model to achieve a better balance between exploitation and exploration. The nonlinearly decreased model for the update of parameter α can adjust the population diversity through the iteration and ensure the convergence. Additionally, an adaptive penalty function method is developed to handle the constraints effectively. Then, the initial parameters are tested, and the best initial parameters corresponding to the optimal performance of IFA are obtained. The proposed algorithm is evaluated by CEC2015 hybrid composition and a set of classical functions. The numerical experimental results show that the proposed techniques can enhance the solution accuracy and accelerate the convergence speed. Finally, IFA and other metaheuristic algorithms are applied to solve five engineering design optimization problems with mixed variables and multiple constraint conditions. The results indicate that IFA with adaptive penalty function needs fewer fitness evaluations and costs less computational time to obtain the optimal solutions. Furthermore, it exhibits better accuracy and robustness than other algorithms. [ABSTRACT FROM AUTHOR]