返回
Enhanced Marine Predators Algorithm with Local Escaping Operator for Global Optimization
DOI:10.1016/j.knosys.2021.107467.png)
摘要
En 中文
The recently introduced Marine Predators Algorithm (MPA) exhibits competitive performance in solving optimization problems. However, it often prematurely converges due to an imbalance between its exploration and exploitation capabilities. Therefore, in this paper, an improved MPA variant using a proposed Local Escaping Operator (LEO) is introduced. In the MPA, solution candidates are replaced by better candidates from the previous iteration, mimicking a memory of already visited prey abundant areas. This indicates a weak inter-dependence between the candidates in the population and possible acceptance of new solution candidates created outside the algorithm without damaging the optimization process. Consequently, in the proposed approach, the worst candidates are replaced with solutions created by the LEO. The LEO is based on representative solutions, taking into account the relationship between predators and the characteristics of their population. The approach is experimentally compared with the state-of-the-art meta-heuristics on 82 test functions, including IEEE Congress on Evolutionary Computation test suites (CEC'14 and CEC'17) and three engineering problems. The results show the superiority of the LEO-MPA over the MPA and recent algorithms. Furthermore, in this paper, the suitability of the hybridization of meta-heuristics with the LEO is discussed and successful attempts with the best algorithms are shown. (C) 2021 The Author(s). Published by Elsevier B.V.
Keyword:
Global optimization
Meta-heuristics
Hybridization
Marine Predators Algorithm
Representative solutions
Local escaping operator
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W

