4.2 Article

Chaotic Coyote Optimization Algorithm

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s12652-021-03234-5

关键词

Coyote Optimization Algorithm; Chaos theory; Swarm intelligence algorithms; Optimization

资金

  1. National Key Research and Development Program of China [2016YFE0200200]
  2. National Natural Science Funds of China [61701253, 61801240]

向作者/读者索取更多资源

The study proposes a new algorithm called Chaotic Coyote Optimization Algorithm (CCOA), which outperforms the original Coyote Optimization Algorithm (COA) in terms of global convergence speed.
Coyote Optimization Algorithm (COA) is classified as both swarm intelligence and evolutionary heuristic algorithms. However, getting trapped in a poor local optimum and the low convergence speed are the weaknesses of COA obviously. Due to these weaknesses, this paper proposes a new algorithm named Chaotic Coyote Optimization Algorithm (CCOA) which focusing on COA equipped with chaotic maps. Through utilising ten well-known benchmark functions, experimental results are recorded in tables and drawn in figures to provide a sharp contrast. The performance of CCOA and COA are discussed, which proves CCOA outperforms COA guaranteeing rapid global convergence rate.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据