Improved sandcat swarm optimization algorithm for solving global optimum problems

计算机科学 数学优化 群体行为 多群优化 元启发式 优化算法 群体智能 最优化问题 算法 粒子群优化 数学 人工智能
作者
Heming Jia,Jinrui Zhang,Honghua Rao,Laith Abualigah
出处
期刊:Artificial Intelligence Review [Springer Science+Business Media]
卷期号:58 (1) 被引量:9
标识
DOI:10.1007/s10462-024-10986-x
摘要

The sand cat swarm optimization algorithm (SCSO) is a metaheuristic algorithm proposed by Amir Seyyedabbasi et al. SCSO algorithm mimics the predatory behavior of sand cats, which gives the algorithm a strong optimized performance. However, as the number of iterations of the algorithm increases, the moving efficiency of the sand cat decreases, resulting in the decline of search ability. The convergence speed of the algorithm gradually decreases, and it is easy to fall into local optimum, and it is difficult to find a better solution. In order to improve the search and movement efficiency of the sand cat, and enhance the global optimization ability and convergence performance of the algorithm, an improved sand cat Swarm Optimization (ISCSO) algorithm was proposed. In ISCSO algorithm, we propose a low-frequency noise search strategy and a spiral contraction walking strategy according to the habit of sand cat, and add random opposition-based learning and restart strategy. The frequency factor was used to control the search direction of the sand cat, and the spiral contraction hunting was carried out, which effectively improved the randomness of the population, expanded the search range of the algorithm, enhanced the moving efficiency of the sand cat, and accelerated the convergence speed of the algorithm. We use 23 standard benchmark functions and IEEE CEC2014 benchmark functions to compare ISCSO with 10 algorithms, and prove the effectiveness of the improved strategy. Finally, ISCSO was evaluated using five constrained engineering design problems. In the results of these problems, using ISCSO has 3.08%, 0.23%, 0.37%, 22.34%, 1.38% improvement compared with the original algorithm respectively, which proves the effectiveness of the improved strategy in practical application problems. The source code website for ISCSO is https://github.com/Ruiruiz30/ISCSO-s-code.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
小蚊子完成签到,获得积分10
2秒前
2秒前
4秒前
4秒前
4秒前
CodeCraft应助WD_COMMITS采纳,获得10
5秒前
LYCORIS完成签到,获得积分10
6秒前
树阴照水发布了新的文献求助10
7秒前
温柔摩托发布了新的文献求助10
7秒前
打打应助英勇水云采纳,获得10
9秒前
10秒前
10秒前
11秒前
12秒前
樂le发布了新的文献求助10
13秒前
英俊的铭应助夜信采纳,获得10
13秒前
molihuakai应助祝新竹采纳,获得10
14秒前
奋斗幻姬发布了新的文献求助10
16秒前
16秒前
17秒前
深情安青应助花椰菜采纳,获得10
17秒前
活力向梦完成签到 ,获得积分10
18秒前
壮观源智完成签到,获得积分20
18秒前
18秒前
韩琳发布了新的文献求助10
20秒前
DDDD完成签到,获得积分10
20秒前
20秒前
CodeCraft应助尹欣鹤采纳,获得10
20秒前
xh应助稳如老狗采纳,获得10
21秒前
赚钱养宝钏完成签到 ,获得积分10
21秒前
怕孤单的幼萱完成签到,获得积分10
21秒前
22秒前
22秒前
22秒前
英勇水云发布了新的文献求助10
22秒前
22秒前
22秒前
22秒前
www发布了新的文献求助10
23秒前
高分求助中
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 1000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The fast track to determining transfer functions of linear circuits: The student guide 500
Römisch-Germanische Forschungen 500
Electric machines: theory, operating applications, and controls 500
The Analytical and Numerical Solution of Electric and Magnetic Fields 500
When Is Two-Stage Sample Robust Optimization Asymptotically Optimal? 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7602854
求助须知:如何正确求助?哪些是违规求助? 9178899
关于积分的说明 19656853
捐赠科研通 7178252
什么是DOI,文献DOI怎么找? 3269095
关于科研通互助平台的介绍 2433276
邀请新用户注册赠送积分活动 2262941