<HashMap><database>biostudies-literature</database><scores/><additional><omics_type>Unknown</omics_type><submitter>Wu S</submitter><pubmed_abstract>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 simulates 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 optimal values and insufficient exploitation. This paper proposes a Gaussian barebone mutation 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,</pubmed_abstract><journal>Artificial intelligence review</journal><pagination>1-37</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC9853503</full_dataset_link><repository>biostudies-literature</repository><pubmed_title>Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures.</pubmed_title><pmcid>PMC9853503</pmcid><pubmed_authors>Kuang F</pubmed_authors><pubmed_authors>Wu S</pubmed_authors><pubmed_authors>Chen H</pubmed_authors><pubmed_authors>Zhang S</pubmed_authors><pubmed_authors>Heidari AA</pubmed_authors></additional><is_claimable>false</is_claimable><name>Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures.</name><description>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 simulates 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 optimal values and insufficient exploitation. This paper proposes a Gaussian barebone mutation 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,</description><dates><release>2023-01-01T00:00:00Z</release><publication>2023 Jan</publication><modification>2025-04-26T07:51:33.476Z</modification><creation>2025-04-06T12:25:52.374Z</creation></dates><accession>S-EPMC9853503</accession><cross_references><pubmed>36694615</pubmed><doi>10.1007/s10462-022-10370-7</doi></cross_references></HashMap>