Search Results (4)

From collective intelligence to evolutionary computation and machine learning, symmetry can be leveraged to enhance algorithm performance, streamline computational procedures, and elevate solution quality. Grasping and leveraging symmetry can give rise to more resilient, scalable, and understandable algorithms. In view of the flaws of the original Sailfish Optimization Algorithm (SFO), such as low convergence precision and a propensity to get stuck in local optima, this paper puts forward an Osprey and Cauchy Mutation Integrated Sailfish Optimization Algorithm (OCSFO). The enhancements are mainly carried out in three aspects: (1) Using the Logistic map to initialize the sailfish and sardine populations. (2) In the first stage of the local development phase of sailfish individual position update, adopting the global exploration strategy of the Osprey Optimization Algorithm to boost the algorithm’s global search capability. (3) Introducing Cauchy mutation to activate the sailfish and sardine populations during the prey capture stage. Through the comparative analysis of OCSFO and seven other swarm intelligence optimization algorithms in the optimization of 23 classic benchmark test functions, as well as the Wilcoxon rank-sum test, it is evident that the optimization speed and convergence precision of OCSFO have been notably improved. To confirm the practicality and viability of the OCSFO algorithm, it is applied to solve the optimization problems of piston rods, three-bar trusses, cantilever beams, and topology. Through experimental analysis, it can be concluded that the OCSFO algorithm has certain advantages in solving practical optimization problems. Full article

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. Full article

In recent years, swarm intelligence optimization methods have been increasingly applied in many fields such as mechanical design, microgrid scheduling, drone technology, neural network training, and multi-objective optimization. In this paper, a multi-strategy particle swarm optimization hybrid dandelion optimization algorithm (PSODO) is proposed, which is based on the problems of slow optimization speed and being easily susceptible to falling into local extremum in the optimization ability of the dandelion optimization algorithm. This hybrid algorithm makes the whole algorithm more diverse by introducing the strong global search ability of particle swarm optimization and the unique individual update rules of the dandelion algorithm (i.e., rising, falling and landing). The ascending and descending stages of dandelion also help to introduce more changes and explorations into the search space, thus better balancing the global and local search. The experimental results show that compared with other algorithms, the proposed PSODO algorithm greatly improves the global optimal value search ability, convergence speed and optimization speed. The effectiveness and feasibility of the PSODO algorithm are verified by solving 22 benchmark functions and three engineering design problems with different complexities in CEC 2005 and comparing it with other optimization algorithms. Full article

In wireless sensor networks, each sensor node has a finite amount of energy to expend. The clustering method is an efficient way to deal with the imbalance in node energy consumption. A topology optimization technique for wireless sensor networks based on the Cauchy variation optimization crow search algorithm (CM-CSA) is suggested to address the issues of rapid energy consumption, short life cycles, and unstable topology in wireless sensor networks. At the same time, a clustering approach for wireless sensor networks based on the enhanced Cauchy mutation crow search algorithm is developed to address the issue of the crow algorithm’s sluggish convergence speed and ease of falling into the local optimum. It utilizes the Cauchy mutation to improve the population’s variety and prevent settling for the local optimum, as well as to broaden the range of variation and the capacity to carry out global searches. When the leader realizes he is being followed, the discriminative probability is introduced to improve the current person’s location update approach. According to the simulation findings, the suggested CM-CSA algorithm decreases the network’s average energy consumption by 66.7%, 50%, and 33.3% and enhances its connectivity performance by 52.9%, 37.6%, and 23.5% when compared to the PSO algorithm, AFSA method, and basic CSA algorithm. Full article