MOSMA: Multi-objective slime mold algorithm based on reference point non-dominated sorting
preprint
OA: closed
CC-BY-4.0
Abstract
Slime Mould Algorithm (SMA) has been widely noticed by researchers for its powerful multi-point search capability and simple and feasible structure, and many advanced versions of SMA have also been proposed. However, most existing methods focus on the single-objective research domain, and research on multi-objective SMA remains relatively scarce; moreover, the basic SMA lacks powerful global search capability, and its extension to the multi-objective domain easily leads to the loss of solution diversity. Therefore, in this paper, we propose a general multi-objective SMA framework which utilises a logical chaotic single-dimensional perturbation mechanism to increase the search traversal of individuals in the decision space; secondly, a non-dominated sorting mechanism based on reference point is used to select more diverse solutions to participate in the next generation of evolution. Through experiments with seven advanced multi-objective algorithms such as CMOPSO, NSGA-II, NSGA-III, MOEAD, PSEA-II, SPEA-II and NSLS on 28 basis functions, the results show that multi-objective SMA achieves the best convergence, accuracy and diversity.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0