Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 160

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Hybrid slime mould algorithm with adaptive guided differential evolution algorithm for combinatorial and global optimization problems

Houssein, Essam H., Mahdy, Mohamed A., Blondin, Maude J., Shebl, Doaa, Mohamed, Waleed M. · 2021 · Expert Systems with Applications

Abstract

The Slime Mould Algorithm (SMA) is a recent metaheuristic inspired by the oscillation of slime mould. Similar to other original metaheuristic algorithms (MAs), SMA may suffer from drawbacks, such as being trapped in minimum local regions and improper balance between exploitation and exploration phases. To overcome these weaknesses, this paper proposes a hybrid algorithm: SMA combined to Adaptive Guided Differential Evolution Algorithm (AGDE) (SMA-AGDE). The AGDE mutation method is employed to enhance the swarm agents’ local search, increase the population’s diversity, and help avoid premature convergence. The SMA-AGDE’s performance is evaluated on the CEC’17 test suite, three engineering design problems - tension/compression spring, pressure vessel, and rolling element bearing - and two combinatorial optimization problems - bin packing and quadratic assignment. The SMA-AGDE is compared with three categories of optimization methods: 1) The well-studied MAs, i.e., Biogeography-Based Optimizer (BBO), Gravitational Search Algorithm (GSA), and Teaching Learning-Based Optimization (TLBO), 2) Recently developed MAs, i.e., Harris Hawks Optimization (HHO), Manta Ray Foraging optimization (MRFO), and the original SMA, and 3) High-performance MAs and among the best of IEEE CEC competition, i.e., Evolution Strategy with Covariance Matrix Adaptation (CMA-ES), and AGDE. The overall simulation results reveal that the SMA-AGDE ranked first among the compared algorithms, and so, over different function landscapes. Thus, the proposed SMA-AGDE is a promising optimization tool for global and combinatorial optimization problems and engineering design problems.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.eswa.2021.114689

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 160

Metadata

Authors
Houssein, E. H., Mahdy, M. A., Blondin, M. J., Shebl, D., & Mohamed, W. M.
Venue
Expert Systems with Applications
Publisher
Elsevier BV
Published
2021-07
Volume
174
Pages
114689
ISSN
0957-4174 (ISSN-L)
OpenAlex
W3133445295
Cited by
160
References
3
FWCI
11.47
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Hybrid slime mould algorithm with adaptive guided differential evolution algorithm for combinatorial and global optimization problems. https://app.cochat.ai/papers/10.1016/j.eswa.2021.114689
The paper
Houssein, E. H., Mahdy, M. A., Blondin, M. J., Shebl, D., & Mohamed, W. M. (2021). Hybrid slime mould algorithm with adaptive guided differential evolution algorithm for combinatorial and global optimization problems. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2021.114689

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.