3.8 Article

DGO: Dice Game Optimizer

期刊

GAZI UNIVERSITY JOURNAL OF SCIENCE
卷 32, 期 3, 页码 871-882

出版社

GAZI UNIV
DOI: 10.35378/gujs.484643

关键词

Metaheuristic algorithms; Optimization; Game; Dice game; Dice Game Optimizer

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

In recent years, optimization algorithms have been used in many applications. Most of these algorithms are inspired by physical processes or living beings' behaviors. This article suggests a new optimization method called Dice Gaming Optimizer (DGO), which simulates dice gaming laws. This algorithm is inspired by an old game and the searchers are a set of players. Each player moves in the playground based on at least one and maximum six different players called guide's players. The number of guide's players for each player is determined by the number of dice. DGO is tested on 23 standard benchmark test functions and also compared with eight other algorithms such as: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Cuckoo Search (CS), Ant-Lion Optimizer (ALO), Grey Wolf Optimizer (GWO), Grasshopper Optimization Algorithm and Emperor Penguin Optimizer (EPO). Moreover, a real-life engineering design problem is solved by DGO. The results indicate that DGO have better performance as compared to the other well-known optimization algorithms.

作者

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

评论

主要评分

3.8
评分不足

次要评分

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

推荐

暂无数据
暂无数据