CoChat

MOSMA: Multi-Objective Slime Mould Algorithm Based on Elitist Non-Dominated Sorting

Open access
Premkumar, Manoharan, Jangir, Pradeep, Sowmya, Ravichandran, Alhelou, Hassan Haes, Heidari, Ali Asghar, Chen, Huiling · 2021 · IEEE Access
Cited by 233

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

Abstract

This paper proposes a multi-objective Slime Mould Algorithm (MOSMA), a multi-objective variant of the recently-developed Slime Mould Algorithm (SMA) for handling the multi-objective optimization problems in industries. Recently, for handling optimization problems, several meta-heuristic and evolutionary optimization techniques have been suggested for the optimization community. These methods tend to suffer from low-quality solutions when evaluating multi-objective optimization (MOO) problems than addressing the objective functions of identifying Pareto optimal solutions’ accurate estimation and increasing the distribution throughout all objectives. The SMA method follows the logic gained from the oscillation behaviors of slime mould in the laboratory experiments. The SMA algorithm shows a powerful performance compared to other well-established methods, and it is designed by incorporating the optimal food path using the positive-negative feedback system. The proposed MOSMA algorithm employs the same underlying SMA mechanisms for convergence combined with an elitist non-dominated sorting approach to estimate Pareto optimal solutions. As a posteriori method, the multi-objective formulation is maintained in the MOSMA, and a crowding distance operator is utilized to ensure increasing the coverage of optimal solutions across all objectives. To verify and validate the performance of MOSMA, 41 different case studies, including unconstrained, constrained, and real-world engineering design problems are considered. The performance of the MOSMA is compared with Multiobjective Symbiotic-Organism Search (MOSOS), Multi-objective Evolutionary Algorithm Based on Decomposition (MOEA/D), and Multiobjective Water-Cycle Algorithm (MOWCA) in terms of different performance metrics, such as Generational Distance (GD), Inverted Generational Distance (IGD), Maximum Spread (MS), Spacing, and Run-time. The simulation results demonstrated the superiority of the proposed algorithm in realizing high-quality solutions to all multi-objective problems, including linear, nonlinear, continuous, and discrete Pareto optimal front. The results indicate the effectiveness of the proposed algorithm in solving complicated multi-objective problems. This research will be backed up with extra online service and guidance for the paper’s source code athttps://premkumarmanoharan.wixsite.com/mysiteandhttps://aliasgharheidari.com/SMA.html. Also, the source code of SMA is shared with the public athttps://aliasgharheidari.com/SMA.html.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/access.2020.3047936

Cites

64 of 64 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 64 references

Cited by

See all 233

Metadata

Authors
Premkumar, M., Jangir, P., Sowmya, R., Alhelou, H. H., Heidari, A. A., & Chen, H.
Venue
IEEE Access
Published
2021
Volume
9
Pages
3229-3248
ISSN
2169-3536 (ISSN-L)
OpenAlex
W3115290671
Cited by
233
References
64
FWCI
15.01
Type
journal article
Language
en
Open access
gold

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: MOSMA: Multi-Objective Slime Mould Algorithm Based on Elitist Non-Dominated Sorting. https://app.cochat.ai/papers/10.1109/access.2020.3047936
The paper
Premkumar, M., Jangir, P., Sowmya, R., Alhelou, H. H., Heidari, A. A., & Chen, H. (2021). MOSMA: Multi-Objective Slime Mould Algorithm Based on Elitist Non-Dominated Sorting. IEEE Access. https://doi.org/10.1109/access.2020.3047936

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.