DGO: Dice Game Optimizer

DGO: Dice Game Optimizer

In recent years, optimization algorithms have been used in many applications. Most of thesealgorithms are inspired by physical processes or living beings' behaviors. This article suggests anew optimization method called “Dice Gaming Optimizer“ (DGO), which simulates dice gaminglaws. This algorithm is inspired by an old game and the searchers are a set of players. Each playermoves in the playground based on at least one and maximum six different players called guide’splayers. The number of guide’s players for each player is determined by the number of dice. DGOis tested on 23 standard benchmark test functions and also compared with eight other algorithmssuch 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 reallifeengineering design problem is solved by DGO. The results indicate that DGO have betterperformance as compared to the other well-known optimization algorithms.

___

  • Tang, K.S., Man, K.F., Kwong, S., and He, Q., “Genetic algorithms and their applications”, IEEE signal processing magazine, 13(6): 22-37, (1996).
  • Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., “Optimization by simulated annealing”, science, 220: 671-680, (1983).
  • Dehghani, M., Mardaneh, M., and Malik, O.P., “FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems”, Journal of Operation and Automation in Power Engineering, 8: 118-130, (2019).
  • Drigo, M., “The ant system: optimization by a colony of cooperating agents”, IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26: 1-13, (1996).
  • Montazeri, Z., and Niknam, T., “Optimal utilization of electrical energy from power plants based on final energy consumption using gravitational search algorithm”, Електротехніка і Електромеханіка, 4: 70-73, (2018).
  • Dehghani, M., Montazeri, Z., Dehghani, A., and Seifi, A., “Spring search algorithm: A new metaheuristic optimization algorithm inspired by Hooke's law”, in 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI), Tehran, 0210-0214, (2017).
  • Ehsanifar, A., Dehghani, M., and Allahbakhshi, M., “Calculating the leakage inductance for transformer inter-turn fault detection using finite element method”, in 2017 Iranian Conference on Electrical Engineering (ICEE), Tehran, 1372-1377, (2017).
  • Dehghani, M., Mardaneh, M., Montazeri, Z., Ehsanifar, A., Ebadi, M.J., and Grechko, O.M., “Spring search algorithm for simultaneous placement of distributed generation and capacitors”, Електротехніка і Електромеханіка, 6: 68-73, (2018).
  • Dehghani, M., Montazeri, Z., Ehsanifar, A., Seifi, A., Ebadi, M.J., and Grechko, O., “Planning of energy carriers based on final energy consumption using dynamic programming and particle swarm optimization”, Електротехніка і Електромеханіка, 5: 62-71, (2018).
  • Montazeri, Z., and Niknam, T., “Energy carriers management based on energy consumption”, in 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI), Tehran, 0539-0543, (2017).
  • Dehbozorgi, S., Ehsanifar, A., Montazeri, Z., Dehghani, M., and Seifi, A., “Line loss reduction and voltage profile improvement in radial distribution networks using battery energy storage system”, in 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI), Tehran, 0215-0219, (2017).
  • Tarasewich, T., and McMullen, P.R., “Swarm intelligence: power in numbers”, Communications of the ACM, 45: 62-67, (2002).
  • Barry, J., and Thron, C., “A Computational Physics-Based Algorithm for Target Coverage Problems”, in Advances in Nature-Inspired Computing and Applications, ed: Springer, 269-290, (2019).
  • Rashedi, E., H. Nezamabadi-Pour, H., and Saryazdi, S., “GSA: a gravitational search algorithm”, Information Sciences, 179: 2232-2248, (2009).
  • Eskandar, H., Sadollah, A., Bahreininejad, A., and Hamdi, M., “Water cycle algorithm–A novel metaheuristic optimization method for solving constrained engineering optimization problems”, Computers & Structures, 110: 151-166, (2012).
  • Dehghani, M., Montazeri, Z., Dehghani, A., Nouri, N., and Seifi, A., “BSSA: Binary spring search algorithm”, in 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI), Tehran, 0220-0224, (2017).
  • Shah-Hosseini, H., “Principal components analysis by the galaxy-based search algorithm: a novel metaheuristic for continuous optimisation”, International Journal of Computational Science and Engineering, 6: 132-140, (2011).
  • Moghaddam, F.F., Moghaddam, R.F., and Cheriet, M., “Curved space optimization: A random search based on general relativity theory”, arXiv preprint arXiv, 1208.2214, (2012).
  • Alatas, B., “ACROA: artificial chemical reaction optimization algorithm for global optimization”, Expert Systems with Applications, 38: 13170-13180, (2011).
  • Du, H., Wu, X., and Zhuang, J., “Small-world optimization algorithm for function optimization”, in International Conference on Natural Computation, 264-273, (2006).
  • Formato, R.A., “Central force optimization: a new nature inspired computational framework for multidimensional search and optimization”, in Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), ed: Springer, 221-238, (2008).
  • Bansal, J.C., “Particle Swarm Optimization”, in Evolutionary and Swarm Intelligence Algorithms, ed: Springer, 11-23, (2019).
  • Mirjalili, S., Mirjalili, M., and Lewis, A., “Grey wolf optimizer”, Advances in Engineering Software, 69: 46-61, (2014).
  • Saremi, S., Mirjalili, S., and Lewis, A., “Grasshopper optimisation algorithm: theory and application”, Advances in Engineering Software, 105: 30-47, (2017).
  • Dhiman, G., and Kumar, V., “Emperor penguin optimizer: A bio-inspired algorithm for engineering problems”, Knowledge-Based Systems, 159: 20-50, (2018).
  • Dorigo, M., and Stützle, T., “Ant colony optimization: overview and recent advances”, in Handbook of metaheuristics, ed: Springer, 311-351, (2019).
  • Karaboga, D., and Basturk, B., “Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems”, in International fuzzy systems association world congress, 789- 798, (2007).
  • Gandomi, A.H., Yang, X.S., and Alavi, A.H., “Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems”, Engineering with computers, 29: 17-35, (2013).
  • Mirjalili, S., “The ant lion optimizer,” Advances in Engineering Software, 83: 80-98, (2015).
  • Yang, X.S., “A new metaheuristic bat-inspired algorithm”, in Nature inspired cooperative strategies for optimization (NICSO 2010), ed: Springer, 65-74, (2010).
  • Mirjalili, S., and Lewis, A., “The whale optimization algorithm”, Advances in Engineering Software, 95: 51-67, (2016).
  • Dhiman, G., and Kumar, V., “Spotted hyena optimizer: A novel bio-inspired based metaheuristic technique for engineering applications”, Advances in Engineering Software, 114: 48-70, (2017).
  • Castillo, O., and Aguilar, L.T., “Genetic Algorithms”, in Type-2 Fuzzy Logic in Control of Nonsmooth Systems, ed: Springer, 23-39, (2019).
  • Storn, R., and Price, K., “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces”, Journal of Global Optimization, 11: 341-359, (1997).
  • Beyer, H.G., and Schwefel, H.P., “Evolution strategies–A comprehensive introduction”, Natural Computing 1: 3-52, (2002).
  • Koza, J.R., “Genetically breeding populations of computer programs to solve problems in artificial intelligence”, in [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence, 819-827, (1990).
  • Mirjalili, S., “Biogeography-Based Optimisation”, in Evolutionary Algorithms and Neural Networks, ed: Springer, 57-72, (2019).
  • Dehghani, M., Montazeri, Z., Malik, O.P., Ehsanifar, A., and Dehghani, A., “OSA: Orientation Search Algorithm”, International Journal of Industrial Electronics, Control and Optimization, 2: 99-112, (2019).
  • Yao, X., Liu, Y., and Lin, G., “Evolutionary programming made faster”, IEEE Transactions on Evolutionary Computation, 3: 82-102, (1999).
  • Mirjalili, S., “Genetic Algorithm”, in Evolutionary Algorithms and Neural Networks, ed: Springer, 43-55, (2019).
  • Mirjalili, S., “Particle Swarm Optimisation”, in Evolutionary Algorithms and Neural Networks, ed: Springer, 15-31, (2019).
  • Kannan B., and Kramer, S.N., “An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design”, Journal of Mechanical Design, 116: 405-411, (1994).
  • Woolson, R., “Wilcoxon signed‐rank test”, Wiley Encyclopedia of Clinical Trials, 1-3, (2007).