http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Qiao Shimeng,Yu Helong,Heidari Ali Asghar,El-Saleh Ayman A,Cai Zhennao,Xu Xingmei,Mafarja Majdi,Chen Huiling 한국CDE학회 2022 Journal of computational design and engineering Vol.9 No.5
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 (WOA) 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 thes WDNMWOA has better convergence accuracy and strong optimization ability than the original WOA.
Su Hang,Zhao Dong,Yu Fanhua,Heidari Ali Asghar,Xu Zhangze,Alotaibi Fahd S,Mafarja Majdi,Chen Huiling 한국CDE학회 2023 Journal of computational design and engineering Vol.10 No.1
As science and technology advance, more engineering-type problems emerge. Technology development has likewise led to an increase in the complexity of optimization problems, and the need for new optimization techniques has increased. The swarm intelligence optimization algorithm is popular among researchers as a flexible, gradient-independent optimization method. The cuckoo search (CS) algorithm in the population intelligence algorithm has been widely used in various fields as a classical optimization algorithm. However, the current CS algorithm can no longer satisfy the performance requirements of the algorithm for current optimization problems. Therefore, in this paper, an improved CS algorithm based on a crossover optimizer (CC) and decentralized foraging (F) strategy is proposed to improve the search ability and the ability to jump out of the local optimum of the CS algorithm (CCFCS). Then, in order to verify the performance of the algorithm, this paper demonstrates the performance of CCFCS from six perspectives: core parameter setting, balance analysis of search and exploitation, the impact of introduced strategies, the impact of population dimension, and comparison with classical algorithms and similar improved algorithms. Finally, the optimization effect of CCFCS on real engineering problems is tested by five classic cases of engineering optimization. According to the experimental results, CCFCS has faster convergence and higher solution quality in the algorithm performance test and maintains the same excellent performance in engineering applications.