Mantis Search Algorithm (MSA)

버전 1.0.1 (8.13 MB) 작성자: Reda Mohamed
MSA is a novel bio-inspired algorithm for global optimization and engineering design problems
다운로드 수: 391
업데이트 날짜: 2023/7/2

라이선스 보기

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-

인용 양식

Reda Mohamed (2024). Mantis Search Algorithm (MSA) (https://www.mathworks.com/matlabcentral/fileexchange/131833-mantis-search-algorithm-msa), MATLAB Central File Exchange. 검색됨 .

MATLAB 릴리스 호환 정보
개발 환경: R2023a
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux
태그 태그 추가

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
버전 게시됨 릴리스 정보
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