4.6 Article

Chaos Game Optimization: a novel metaheuristic algorithm

期刊

ARTIFICIAL INTELLIGENCE REVIEW
卷 54, 期 2, 页码 917-1004

出版社

SPRINGER
DOI: 10.1007/s10462-020-09867-w

关键词

Metaheuristic; Statistical analysis; Chaos Game Optimization

资金

  1. University of Tabriz [1105]

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

A novel metaheuristic algorithm called Chaos Game Optimization (CGO) is developed in this paper, based on chaos theory principles to solve optimization problems. Through evaluation of 239 mathematical functions and comparison with other algorithms, results indicate that CGO outperforms in most cases.
In this paper, a novel metaheuristic algorithm called Chaos Game Optimization (CGO) is developed for solving optimization problems. The main concept of the CGO algorithm is based on some principles of chaos theory in which the configuration of fractals by chaos game concept and the fractals self-similarity issues are in perspective. A total number of 239 mathematical functions which are categorized into four different groups are collected to evaluate the overall performance of the presented novel algorithm. In order to evaluate the results of the CGO algorithm, three comparative analysis with different characteristics are conducted. In the first step, six different metaheuristic algorithms are selected from the literature while the minimum, mean and standard deviation values alongside the number of function evaluations for the CGO and these algorithms are calculated and compared. A complete statistical analysis is also conducted in order to provide a valid judgment about the performance of the CGO algorithm. In the second one, the results of the CGO algorithm are compared to some of the recently developed fractal- and chaos-based algorithms. Finally, the performance of the CGO algorithm is compared to some state-of-the-art algorithms in dealing with the state-of-the-art mathematical functions and one of the recent competitions on single objective real-parameter numerical optimization named CEC 2017 is considered as numerical examples for this purpose. In addition, a computational cost analysis is also conducted for the presented algorithm. The obtained results proved that the CGO is superior compared to the other metaheuristics in most of the cases.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

暂无数据
暂无数据