Zhang Zheng, Wang Xiangkun, Yue Yinggao
School of Information Engineering, Wenzhou Business College, Wenzhou 325035, China.
School of Intelligent Manufacturing and Electronic Engineering, Wenzhou University of Technology, Wenzhou 325035, China.
Biomimetics (Basel). 2024 Oct 1;9(10):595. doi: 10.3390/biomimetics9100595.
Swarm intelligence optimization methods have steadily gained popularity as a solution to multi-objective optimization issues in recent years. Their study has garnered a lot of attention since multi-objective optimization problems have a hard high-dimensional goal space. The black-winged kite optimization algorithm still suffers from the imbalance between global search and local development capabilities, and it is prone to local optimization even though it combines Cauchy mutation to enhance the algorithm's optimization ability. The heuristic optimization algorithm of the black-winged kite fused with osprey (OCBKA), which initializes the population by logistic chaotic mapping and fuses the osprey optimization algorithm to improve the search performance of the algorithm, is proposed as a means of enhancing the search ability of the black-winged kite algorithm (BKA). By using numerical comparisons between the CEC2005 and CEC2021 benchmark functions, along with other swarm intelligence optimization methods and the solutions to three engineering optimization problems, the upgraded strategy's efficacy is confirmed. Based on numerical experiment findings, the revised OCBKA is very competitive because it can handle complicated engineering optimization problems with a high convergence accuracy and quick convergence time when compared to other comparable algorithms.
近年来,群体智能优化方法作为解决多目标优化问题的一种手段,越来越受到人们的青睐。由于多目标优化问题存在难以处理的高维目标空间,其研究受到了广泛关注。黑翅鸢优化算法仍存在全局搜索和局部开发能力不平衡的问题,尽管它结合了柯西变异来提高算法的优化能力,但仍容易陷入局部最优。提出了一种将黑翅鸢与鱼鹰融合的启发式优化算法(OCBKA),该算法通过逻辑混沌映射初始化种群,并融合鱼鹰优化算法来提高算法的搜索性能,以此增强黑翅鸢算法(BKA)的搜索能力。通过CEC2005和CEC2021基准函数的数值比较,以及与其他群体智能优化方法和三个工程优化问题的解决方案进行对比,证实了升级策略的有效性。基于数值实验结果,改进后的OCBKA具有很强的竞争力,因为与其他同类算法相比,它能够以较高的收敛精度和较快的收敛时间处理复杂的工程优化问题。