DGO: Dice Game Optimizer

Authors : Mohammad DEHGHANI, Zeinab MONTAZERI, Om Parkash MALIK

Pages : 871-882

Doi:10.35378/gujs.484643

View : 21 | Download : 10

Publication Date : 2019-09-01

Article Type : Research Paper

Abstract :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“ insert ignore into journalissuearticles values(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 insert ignore into journalissuearticles values(GA);, Particle Swarm Optimization insert ignore into journalissuearticles values(PSO);, Artificial Bee Colony insert ignore into journalissuearticles values(ABC);, Cuckoo Search insert ignore into journalissuearticles values(CS);, Ant-Lion Optimizer insert ignore into journalissuearticles values(ALO);, Grey Wolf Optimizer insert ignore into journalissuearticles values(GWO);, Grasshopper Optimization Algorithm and Emperor Penguin Optimizer insert ignore into journalissuearticles values(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.
Keywords : optimization, metaheuristic algorithms, dice, dice game, Dice Game Optimizer, game