Polynomial Variance and Adaptive Weight Optimization for Aquila Algorithm
To address the problem that the basic Aquila algorithm has low convergence accuracy and is prone to fall into local optimum,by introducing a polynomial variance perturbation strategy in the global search phase and an adaptive weight optimization strategy in the local exploitation phase,the local exploration ability of Aquila is improved.A Tent chaos mapping is introduced to initialize the population and increase the population diversity,and a dynamic transformation probability strategy is introduced to balance the weight of global exploration and local exploitation,so the Aquila algorithm with polynomial variance and adaptive weight optimization is proposed.The basic Aquila algorithm,Harris Hawks algorithm,Gray Wolf algorithm,Whale algorithm,and Seagull algorithm are used for comparison,and 9 benchmark test functions and 2 engineering optimization problems are used to verify the improved algorithm's optimization-seeking performance.The results show that the improved algorithm achieves better optimization-seeking results on most of the test functions and outperforms most of the comparison algorithms in engineering optimization problems.It is proved that the improved algorithm has faster convergence speed and accuracy,and achieves good results in engineering applications.