A Modified Manta Ray Foraging Optimization for Global Optimization Problems

Andi Tang

doi:10.1109/ACCESS.2021.3113323

2021-01-01

DOI：10.1109/ACCESS.2021.3113323

原文链接

原文求助

摘要

En 中文

The Manta ray foraging optimization (MRFO) is a novel swarm-based metaheuristic optimizer. It is mainly modeled by simulating three foraging behaviors of the Manta rays, which has a good performance. However, several drawbacks of MRFO have been noticed by analyzing its mathematical model. Random selection of reference points in the early iterations weakens the exploitation capability of MRFO. Chain foraging tends to lead the algorithm into local optimum. In addition, the algorithm suffers from the deficiency of decreasing population diversity in the late iteration. To address these shortcomings, a modified MRFO using three strategies, called m-MRFO, is proposed in this paper. An elite search pool (ESP) is established in this paper to enhance exploitation capability. By using adaptive control parameter strategies (ACP), we expand the range of MRFO's exploration in the early iterations and enhance the accuracy of exploitation in the later iterations, balancing exploiting and exploring capabilities. Furthermore, we use a distribution estimation strategy (DES) to adjust the evolutionary direction using the dominant population information to promote convergence. The m-MRFO performance was verified by selecting 23 classical test functions and CEC2017 test suite. The significance of the results was also verified by Friedman test, Wilcoxon test and Iman-Davenport test. Moreover, we have confirmed the potential of m-MRFO to solve real-world problems by solving three engineering design problems. The simulation results show that the improvement strategy proposed in this paper can effectively improve the performance of MRFO. m-MRFO is highly competitive.

Keyword:

Statistics

Sociology

Mathematical model

Heuristic algorithms

Spirals

Cyclones

Convergence

Manta rays foraging optimizer

metaheuristic

swarm intelligence algorithm

engineering optimization problems