The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA.
The whale optimizer is a popular metaheuristic algorithm, which has the problems of weak global exploration, easy falling into local optimum, and low optimization accuracy when searching for the optimal solution. To solve these problems, this paper proposes an enhanced whale optimization algorithm based on the worst individual disturbance (WD) and neighborhood mutation search (NM), named WDNMWOA, which employed WD to enhance the ability to jump out of local optimum and global exploration, adopted NM to enhance the possibility of individuals approaching the optimal solution. The superiority of WDNMWOA is demonstrated by representative IEEE CEC2014, CEC2017, CEC2019, and CEC2020 benchmark functions and four engineering examples. The experimental results show that the WDNMWOA has better convergence accuracy and strong optimization ability than the original WOA.
Harris hawks optimization has been a popular swarm intelligence algorithm in recent years. In order to improve the local exploitation ability of the algorithm and improve the problem of slow convergence speed, an enhanced Harris hawks optimization algorithm based on Laplace crossover and random replacement strategy is proposed. This variant uses two optimization mechanisms. Firstly, Laplace crossover is added to enhance the exploitation ability of the algorithm. At the same time, the random replacement strategy is introduced into the original algorithm, which accelerates the convergence speed. The basic functions, IEEE CEC2011 and IEEE CEC2017 functions are used for algorithms comparison, balance diversity analysis, and high-dimensional experiments to verify the superiority of the algorithm proposed in this paper. The experimental results show that the improved algorithm has the advantages of strong optimization ability, high convergence accuracy, and fast convergence speed. The algorithm has solved five engineering design problems using these advantages and can effectively deal with constraint problems.
Moth-flame optimization is a typical meta-heuristic algorithm, but it has the shortcomings of low-optimization accuracy and a high risk of falling into local optima. Therefore, this paper proposes an enhanced moth-flame optimization algorithm named HMCMMFO, which combines the mechanisms of hybrid mutation and chemotaxis motion, where the hybrid-mutation mechanism can enhance population diversity and reduce the risk of stagnation. In contrast, chemotaxis-motion strategy can better utilize the local-search space to explore more potential solutions further; thus, it improves the optimization accuracy of the algorithm. In this paper, the effectiveness of the above strategies is verified from various perspectives based on IEEE CEC2017 functions, such as analyzing the balance and diversity of the improved algorithm, and testing the optimization differences between advanced algorithms. The experimental results show that the improved moth-flame optimization algorithm can jump out of the local-optimal space and improve optimization accuracy. Moreover, the algorithm achieves good results in solving five engineering-design problems and proves its ability to deal with constrained problems effectively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.