MOSMA: Multi-Objective Slime Mould Algorithm Based on Elitist Non-Dominated Sorting
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053 · cited 2×
“Some of the most popular algorithms in EMOO are the Non-dominated Sorting Genetic Algorithm (NSGA) [44], Multi-objective PSO (MOPSO) [49], and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) [67].”
MethodGenetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237 · cited 1×
“A well-known principle, called No Free Lunch theory, has claimed in this regard that there is no single algorithm to solve optimization problems altogether [33].”
BackgroundMuiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036 · cited 3×
“This work focuses on a posteriori algorithm by proposing the multi-objective version of a recently-proposed metaheuristic called Slime Mould Optimizer (SMA) 1 algorithm [34].”
BackgroundMethodInfluentialSelf-citationMultiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543 · cited 2×
“Many decomposition-based algorithms are reported, and the following are the three optimizers adopting the proposed MOEA/D [67], MOMH/D [55], decomposition-based archiving approach [56], and Dynamic interval multi-objective optimization problems [57].”
MethodScalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841 · cited 1×
“Many decomposition-based algorithms are reported, and the following are the three optimizers adopting the proposed MOEA/D [67], MOMH/D [55], decomposition-based archiving approach [56], and Dynamic interval multi-objective optimization problems [57].”
MethodThe weighted sum method for multi-objective optimization: new insights
Marler, R. T., & Arora, J. S. (2010) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-009-0460-7 · Cited by 1,841 · cited 1×
“From detailed literature, it is observed that priori methods are faced with specific problems in tackling multi-objective difficulties, trapped in local optima, having high computational time, and problems emerging from priori method structures [41].”
Background
Cited by
A Comprehensive Review on Multi-objective Optimization Techniques: Past, Present and Future
Sharma, S., & Kumar, V. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09778-9 · Cited by 455
Hu, J., Gui, W., Heidari, A. A., Cai, Z., Liang, G., Chen, H., & Pan, Z. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.107761 · Cited by 197
Self-citation
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
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.