Evidence map›Paper›PMID 34531910›Full record

ArticleComputational intelligence and neuroscience2021

A Hybrid SSA and SMA with Mutation Opposition-Based Learning for Constrained Engineering Problems.

Shuang Wang, Qingxin Liu, Yuxiang Liu, Heming Jia, Laith Abualigah, Rong Zheng, Di Wu

Abstract read
In one paragraph

Article in Computational intelligence and neuroscience, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. A Modified Reptile Search Algorithm for Numerical Optimization Problems.Computational intelligence and neuroscience · 2022
    Article
  6. Article
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Shuang WangSchool of Information Engineering, Sanming University, Sanming 365004, China.ORCID https://orcid.org/0000-0001-5933-074X
Qingxin LiuSchool of Computer Science and Technology, Hainan University, Haikou 570228, China.ORCID https://orcid.org/0000-0002-3081-5185
Yuxiang LiuCollege of Physics and Information Engineering, Fuzhou University, Fuzhou 350108, China.
Heming JiaSchool of Information Engineering, Sanming University, Sanming 365004, China.ORCID https://orcid.org/0000-0002-4339-8464
Laith AbualigahFaculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan.
Rong ZhengSchool of Information Engineering, Sanming University, Sanming 365004, China.
Di WuSchool of Education and Music, Sanming University, Sanming 365004, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Based on Salp Swarm Algorithm (SSA) and Slime Mould Algorithm (SMA), a novel hybrid optimization algorithm, named Hybrid Slime Mould Salp Swarm Algorithm (HSMSSA), is proposed to solve constrained engineering problems. SSA can obtain good results in solving some optimization problems. However, it is easy to suffer from local minima and lower density of population. SMA specializes in global exploration and good robustness, but its convergence rate is too slow to find satisfactory solutions efficiently. Thus, in this paper, considering the characteristics and advantages of both the above optimization algorithms, SMA is integrated into the leader position updating equations of SSA, which can share helpful information so that the proposed algorithm can utilize these two algorithms' advantages to enhance global optimization performance. Furthermore, Levy flight is utilized to enhance the exploration ability. It is worth noting that a novel strategy called mutation opposition-based learning is proposed to enhance the performance of the hybrid optimization algorithm on premature convergence avoidance, balance between exploration and exploitation phases, and finding satisfactory global optimum. To evaluate the efficiency of the proposed algorithm, HSMSSA is applied to 23 different benchmark functions of the unimodal and multimodal types. Additionally, five classical constrained engineering problems are utilized to evaluate the proposed technique's practicable abilities. The simulation results show that the HSMSSA method is more competitive and presents more engineering effectiveness for real-world constrained problems than SMA, SSA, and other comparative algorithms. In the end, we also provide some potential areas for future studies such as feature selection and multilevel threshold image segmentation.

Indexed as

AlgorithmsComputer SimulationMutation

Identifiers

PMID34531910
PMCPMC8440113

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.