A Self-Adaption Butterfly Optimization Algorithm for Numerical Optimization Problems

Abstract

For shortcomings of poor exploaration and parameter complexities of the butterfly optimization algorithm, an improved butterfly optimization algorithm based the self-adaption method (SABOA) was proposed to extremely enhance the searching accuracy and the iteration capability. SABOA has advantages of having fewer parameters, the simple algorithm structure, and the strong precision. First, a new fragrance coefficient was added to the basic butterfly optimization algorithm. Then, new iteration and updating strategies were introduced in global searching and local searching phases. Finally, this paper tested different optimization problems including low-high functions and constrained problems, and the obtained results were compared with other well-known algorithms, this paper also drew various mathematical statistics figures to comprehensively analyze searching performances of the proposed algorithms. The experimental results show that SABOA can get less number of function evaluations compared to other considered algorithms, which illustrates that SABOA has great searching balance, large exploration, and high iterative speed.

Keywords

• Butterfly optimization algorithm
• global optimization
• constrained problem