DGO: Dice Game Optimizer

• Published in: Gazi University Journal of Science Vol. 32; no. 3; pp. 871 - 882
• Main Authors: DEHGHANI, Mohammad, MONTAZERI, Zeinab, MALIK, Om Parkash
• Format: Journal Article
• Language: English
• Published: Gazi Üniversitesi Yayınları 01-01-2019
• Subjects: Bilim-Teknoloji; Ankara; Türkiye; Dice Game Optimizer; Game; Dice game; Optimization; Metaheuristic algorithms
• ISSN: 2147-1762; 2147-1762
• DOI: 10.35378/gujs.484643

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.