粒子群优化
水准点(测量)
计算机科学
人口
算法
早熟收敛
数学优化
局部搜索(优化)
维数(图论)
均方误差
趋同(经济学)
最优化问题
职位(财务)
人工智能
机器学习
数学
统计
人口学
大地测量学
财务
社会学
经济增长
纯数学
经济
地理
作者
Chuanjing Zhang,Huanlao Liu,Qunlong Zhou,Can Liu
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2023-01-01
卷期号:11: 13738-13753
被引量:12
标识
DOI:10.1109/access.2023.3240576
摘要
An improved hybrid grey wolf optimization algorithm (IHGWO) is proposed to solve the problem of population diversity, imbalance of exploration and development capabilities, and premature convergence. The algorithm benefits from particle swarm optimization and a dimension learning-based hunting search strategy. In the particle swarm algorithm search strategy, linear variable social learning and self-learning are introduced to improve the population’s ability to communicate information. The individual position, current iteration optimal position, and optimal population position of grey wolves are combined to update the individual position information, thus strengthening the communication between individuals and the population. In the dimension learning-based hunting search strategy, neighborhoods are built for each search member, and neighborhood members can share information, balance global and local searches, and maintain diversity. To validate the algorithm, 23 typical benchmark functions, CEC2022 benchmark functions, and engineering problem sinusoidal low-order-polynomial prediction of positioning error of numerical control machine tools are used to optimize the algorithm’s parameters. Results are compared with those from four other algorithms and analyzed using Friedman’s statistical test. Experimental and statistical tests reveal that the IHGWO algorithm has the best overall benchmark function rating, with an overall effectiveness of 87.23%. In the engineering parameter optimization problem, the mean square error, root mean square error, and goodness of fit of the prediction equation after IHGWO algorithm optimization are 95.3761, 9.7661, and 97.47%, respectively. These numerical values are superior to those of the compared algorithms, effectively demonstrating the comprehensive performance and applicability of the algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI