Mantis Search Algorithm (MSA)

MSA is a novel bio-inspired algorithm for global optimization and engineering design problems

Vous suivez désormais cette soumission

Mantis Search Algorithm (MSA) is a novel bio-inspired optimization algorithm that is inspired by the unique hunting behavior and sexual cannibalism of praying mantises. MSA consists of three optimization stages, including the search for prey (exploration), attack prey (exploitation), and sexual cannibalism. Those operators are simulated using various mathematical models to effectively tackle various optimization problems.
MSA is rigorously tested on fifty-two optimization problems and three real-world applications (five engineering design problems, and the parameter estimation problem of photovoltaic modules and fuel cells) to show its versatility and adaptability to different scenarios. To disclose the MSA’s superiority, it is compared to two categories from the rival optimizers: the first category involves well-established and highly-cited optimizers, like Differential evolution; and the second category contains recently-published algorithms, like African Vultures Optimization Algorithm. This comparison is conducted using several performance metrics, the Wilcoxon rank-sum test and the Friedman mean rank to disclose the MSA’s effectiveness and efficiency. The results of this comparison highlight the effectiveness of this new approach and its potential for future optimization application.
The source code of this algorithm is also available at https://github.com/redamohamed8/Mantis-Search-Algorithm-MSA-

Citation pour cette source

Reda Mohamed (2026). Mantis Search Algorithm (MSA) (https://fr.mathworks.com/matlabcentral/fileexchange/131833-mantis-search-algorithm-msa), MATLAB Central File Exchange. Extrait(e) le .

Add the first tag.

Informations générales

Compatibilité avec les versions de MATLAB

  • Compatible avec toutes les versions

Plateformes compatibles

  • Windows
  • macOS
  • Linux
Version Publié le Notes de version Action
1.0.1

The MSA's termination condition in this version relies on the maximum number of iterations, not the maximum number of function evaluations.

1.0.0