基于自适应 ｔ分布与动态权重的樽海鞘群算法.

Aiming at the shortcoming of salp swarm optimization algorithm such as low accuracy, slow convergence speed and easy to fall into local optimum, this paper proposed an adaptive t-distribution and dynamic weight salp swarm optimization algorithm. Firstly, the leader position update introduced the global search stage formula of butterfly optimization algorithm to enhance the global exploration ability. Secondly, the follower location update introduced an adaptive dynamic weighting factor to strengthen the guiding role of elite individuals, so as to enhance the local development ability. Finally, the adaptive t-distribution mutation strategy mutated the optimal individual in order to avoid the algorithm falling into local optimum. By solving 12 benchmark test functions, and according to comparison results of the mean value, standard deviation, solving success rate, Wilcoxon test and convergence curve, the proposed algorithm was superior to standard salp swarm algorithm, the compared other improved salp swarm algorithm and the compared other swarm intelligence algorithms. The results also show that it has a significant improvement in the optimization accuracy and convergence speed, and has the ability to jump out of local optimum. The experimental results verify the effectiveness of the proposed algorithm by applying it to find the lowest point of denitrification inlet concentration. [ABSTRACT FROM AUTHOR]