Snake Optimization Algorithm Augmented by Adaptive t-Distribution Mixed Mutation and Its Application in Energy Storage System Capacity Optimization.

Abstract

To address the drawbacks of the traditional snake optimization method, such as a random population initialization, slow convergence speed, and low accuracy, an adaptive t-distribution mixed mutation snake optimization strategy is proposed. Initially, Tent-based chaotic mapping and the quasi-reverse learning approach are utilized to enhance the quality of the initial solution and the population initialization process of the original method. During the evolution stage, a novel adaptive t-distribution mixed mutation foraging strategy is introduced to substitute the original foraging stage method. This strategy perturbs and mutates at the optimal solution position to generate new solutions, thereby improving the algorithm's ability to escape local optima. The mating mode in the evolution stage is replaced with an opposite-sex attraction mechanism, providing the algorithm with more opportunities for global exploration and exploitation. The improved snake optimization method accelerates convergence and improves accuracy while balancing the algorithm's local and global exploitation capabilities. The experimental results demonstrate that the improved method outperforms other optimization methods, including the standard snake optimization technique, in terms of solution robustness and accuracy. Additionally, each improvement technique complements and amplifies the effects of the others.