arrow
返回

Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures

delete2023-01-20
delete14
delete
OA
AI
S
Shubiao Wu
A
Ali Asghar Heidari
Z
Zhang, Siyang
匡
匡芳君 (Fangjun Kuang) *
H
Huiling Chen *
DOI:10.1007/s10462-022-10370-7delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The slime mould algorithm (SMA) is a new meta-heuristic algorithm recently proposed. The algorithm is inspired by the foraging behavior of polycephalus slime moulds. It simu-lates the behavior and morphological changes of slime moulds during foraging through adaptive weights. Although the original SMA's performance is better than most swarm intelligence algorithms, it still has shortcomings, such as quickly falling into local opti-mal values and insufficient exploitation. This paper proposes a Gaussian barebone muta-tion enhanced SMA (GBSMA) to alleviate the original SMA's shortcomings. First of all, the Gaussian function in the Gaussian barebone accelerates the convergence while also expanding the search space, which improves the algorithm exploration and exploitation capabilities. Secondly, the differential evolution (DE) update strategy in the Gaussian bare-bone, using rand as the guiding vector. It also enhances the algorithm's global search per-formance to a certain extent. Also, the greedy selection is introduced on this basis, which prevents individuals from performing invalid position updates. In the IEEE CEC2017 test function, the proposed GBSMA is compared with a variety of meta-heuristic algorithms to verify the performance of GBSMA. Besides, GBSMA is applied to solve truss structure optimization problems. Experimental results show that the convergence speed and solution accuracy of the proposed GBSMA are significantly better than the original SMA and other similar products.
Keyword:
Slime mould algorithm
Gaussian barebone
Global optimization
Engineering optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

U
University of Tehran
学者数:
2.4W
论文数: 2.3W
被引数: 2.7W
W
Wenzhou University
学者数:
8.8K
论文数: 6.5K
被引数: 1.5W
引用论文

引用论文

Towards augmented kernel extreme learning models for bankruptcy prediction: Algorithmic behavior and comprehensive analysis
err2021-03-01
err230
PREAI
errZhang, Yanan; Liu, Renjing; Heidari, Ali Asghar; Wang, Xin; Chen, Ying; Wang, Mingjing; Chen, Huiling
err分享
err收藏
INFO: An efficient optimization algorithm based on weighted mean of vectorsINFO: 一种基于向量加权均值的高效优化算法
err2022-06-01
err483
PREAI
errAhmadianfar, Iman; Heidari, Ali Asghar; Noshadian, Saeed; Chen, Huiling; Gandomi, Amir H.
err分享
err收藏
Binary-coded extremal optimization for the design of PID controllers
err2014-08-01
err75
PREAI
errZeng, Guo-Qiang; Lu, Kang-Di; Dai, Yu-Xing; Zhang, Zheng-Jiang; Chen, Min-Rong; Zheng, Chong-Wei; Wu, Di; Peng, Wen-Wen
err分享
err收藏
学者 查看更多内容