Marine Predators Algorithm: A Review Marine Predators Algorithm: A Review

• Published in: Archives of computational methods in engineering Vol. 30; no. 5; pp. 3405 - 3435
• Main Authors: Al-Betar, Mohammed Azmi, Awadallah, Mohammed A., Makhadmeh, Sharif Naser, Alyasseri, Zaid Abdi Alkareem, Al-Naymat, Ghazi, Mirjalili, Seyedali
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Netherlands 01.06.2023; Springer Nature B.V
• Subjects: Algorithms; Brownian motion; Convergence; Engineering; Mathematical and Computational Engineering; Optimization; Predators; Review; Review Article
• ISSN: 1134-3060; 1886-1784; 1886-1784
• DOI: 10.1007/s11831-023-09912-1

Marine Predators Algorithm (MPA) is a recent nature-inspired optimizer stemmed from widespread foraging mechanisms based on Lévy and Brownian movements in ocean predators. Due to its superb features, such as derivative-free, parameter-less, easy-to-use, flexible, and simplicity, MPA is quickly evolved for a wide range of optimization problems in a short period. Therefore, its impressive characteristics inspire this review to analyze and discuss the primary MPA research studies established. In this review paper, the growth of the MPA is analyzed based on 102 research papers to show its powerful performance. The MPA inspirations and its theoretical concepts are also illustrated, focusing on its convergence behaviour. Thereafter, the MPA versions suggested improving the MPA behaviour on connecting the search space shape of real-world optimization problems are analyzed. A plethora and diverse optimization applications have been addressed, relying on MPA as the main solver, which is also described and organized. In addition, a critical discussion about the convergence behaviour and the main limitation of MPA is given. The review is end-up highlighting the main findings of this survey and suggests some possible MPA-related improvements and extensions that can be carried out in the future.