A Hybrid Butterfly Optimization Algorithm for Numerical Optimization Problems
Open Access
- 1 January 2021
- journal article
- research article
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2021 (1) , 7981670
Abstract
The butterfly optimization algorithm (BOA) is a swarm‐based metaheuristic algorithm inspired by the foraging behaviour and information sharing of butterflies. BOA has been applied to various fields of optimization problems due to its performance. However, BOA also suffers from drawbacks such as diminished population diversity and the tendency to get trapped in local optimum. In this paper, a hybrid butterfly optimization algorithm based on a Gaussian distribution estimation strategy, called GDEBOA, is proposed. A Gaussian distribution estimation strategy is used to sample dominant population information and thus modify the evolutionary direction of butterfly populations, improving the exploitation and exploration capabilities of the algorithm. To evaluate the superiority of the proposed algorithm, GDEBOA was compared with six state‐of‐the‐art algorithms in CEC2017. In addition, GDEBOA was employed to solve the UAV path planning problem. The simulation results show that GDEBOA is highly competitive.Keywords
Funding Information
- National Natural Science Foundation of China (62101590, 62176214, 2020JQ-481, 2019JQ-014)
This publication has 47 references indexed in Scilit:
- Artificial algae algorithm (AAA) for nonlinear global optimizationApplied Soft Computing, 2015
- Monarch butterfly optimizationNeural Computing and Applications, 2015
- Grey Wolf OptimizerAdvances in Engineering Software, 2014
- Water cycle algorithm – A novel metaheuristic optimization method for solving constrained engineering optimization problemsComputers & Structures, 2012
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- GSA: A Gravitational Search AlgorithmInformation Sciences, 2009
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter OptimizationJournal of Heuristics, 2008
- Evolutionary programming made fasterIEEE Transactions on Evolutionary Computation, 1999
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Optimization by Simulated AnnealingScience, 1983