Group-based whale optimization algorithm

Farinaz Hemasian-Etefagh

doi:10.1007/s00500-019-04131-y

2019-06-18

Farinaz Hemasian-Etefagh

Faramarz Safi-Esfahani *

DOI：10.1007/s00500-019-04131-y

原文链接

查看原文

摘要

En 中文

Meta-heuristic algorithms are divided into two categories: biological and non-biological. Biological algorithms are divided into evolutionary and swarm-based intelligence, where the latter is divided into imitation based and sign based. The whale algorithm is a meta-heuristic biological swarm-based intelligence algorithm (based on imitation). This algorithm suffers from the early convergence problem which means the population convergences early to an unfavorable optimum point. Usually, the early convergence occurs because of the weakness in exploration capability (global search). In this study, an optimized version of the whale algorithm is proposed that introduces a new idea in grouping of whales (called GWOA) to overcome the early convergence problem. The proposed whale optimization algorithm is compared with the standard whale algorithm (WOA), CWOA improved whale algorithm, particle swarm optimization, and BAT algorithms applying CEC2017 functions. The results of the experiments show that the proposed method applying Friedman's test on 30 standard benchmark functions has a better performance than the other baseline algorithms.

Keyword:

Biological

Meta-heuristic algorithm

Whale optimization algorithm