An Inclusive Survey on Marine Predators Algorithm: Variants and Applications

Marine Predators Algorithm (MPA) is the existing population-based meta-heuristic algorithms that falls under the category of Nature-Inspired Optimization Algorithm (NIOA) enthused by the foraging actions of the marine predators that principally pursues Levy or Brownian approach as its foraging strategy. Furthermore, it employs the optimal encounter rate stratagem involving both the predator as well as prey. Since its introduction by Faramarzi in the year 2020, MPA has gained enormous popularity and has been employed in numerous application areas ranging from Mathematical and Engineering Optimization problems to Fog Computing to Image Processing to Photovoltaic System to Wind-Solar Generation System for resolving continuous optimization problems. Such huge interest from the research fraternity or the massive recognition of MPA is due to several factors such as its simplicity, ease of application, realistic execution time, superior convergence acceleration rate, soaring effectiveness, its ability to unravel continuous, multi-objective and binary problems when compared with other renowned optimization algorithms existing in the literature. This paper offers a detailed summary of the Marine Predators Algorithm (MPA) and its variants. Furthermore, the applications of MPA in a number of spheres such as Image processing, classification, electrical power system, Photovoltaic models, structural damage detection, distribution networks, engineering applications, Task Scheduling, optimization problems etc., are illustrated. To conclude, the paper highlights and thereby advocates few of the potential future research directions for MPA.

Automated summary

The Marine Predators Algorithm (MPA) is a popular population-based meta-heuristic algorithm inspired by the foraging actions of marine predators. It has gained significant attention since its introduction in 2020 and has been successfully applied in various fields such as image processing, power systems, and optimization problems. MPA stands out from other optimization algorithms due to its simplicity, quick execution time, and ability to solve continuous, multi-objective, and binary problems. This paper provides a comprehensive summary of MPA and its applications, and suggests potential future research directions.