No abstract

In this paper, a novel game-based optimization technique entitled darts game optimizer (DGO) is proposed. The novelty of this investigation is DGO designing based on simulating the rules of Darts game. The key idea in DGO is to get the most possible points by the players in their throws towards the game board. Simplicity of equations and lack of control parameters are the main features of the proposed algorithm. The ability and quality of DGO performance in optimization is evaluated on twenty-three objective functions, and then is compared with eight other optimization algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching Learning-Based Optimization (TLBO), Grey Wolf Optimizer (GWO), Grasshopper Optimization Algorithm (GOA), Whale Optimization Algorithm (WOA), and Marine Predators Algorithm (MPA). The results of simulation and comparison indicate the superiority and optimal quality of the proposed DGO algorithm over the mentioned algorithms.

Optimization is a topic that has always been discussed in all different fields of science. One of the most effective techniques for solving such problems is optimization algorithms. In this paper, a new optimizer called Multi-Leader optimizer (MLO) is developed in which multiple leaders guide members of the population towards the optimal answer. MLO is mathematically modelled based on the process of advancing members of the population and following the leaders. MLO performance in optimization is examined on twenty-three standard objective functions. The results of this optimization are compared with the results of the other eight existing optimization algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Teaching-Learning-Based Optimization (TLBO), Gray Wolf Optimizer (GWO), Grasshopper Optimization Algorithm (GOA), Emperor Penguin Optimizer (EPO), Shell Game Optimization (SGO), and Hide Objects Game Optimization (HOGO). Based on the analysis of the simulation results on unimodal test functions to evaluate exploitation ability and multimodal test functions in order to evaluate exploration ability, it has been determined that MLO has a higher ability to solve optimization problems than existing optimization algorithms.

At present, optimization algorithms are used extensively. One particular type of such algorithms includes random-based heuristic population optimization algorithms, which may be created by modeling scientific phenomena, like, for example, physical processes. The present article proposes a novel optimization algorithm based on Hooke’s law, called the spring search algorithm (SSA), which aims to solve single-objective constrained optimization problems. In the SSA, search agents are weights joined through springs, which, as Hooke’s law states, possess a force that corresponds to its length. The mathematics behind the algorithm are presented in the text. In order to test its functionality, it is executed on 38 established benchmark test functions and weighed against eight other optimization algorithms: a genetic algorithm (GA), a gravitational search algorithm (GSA), a grasshopper optimization algorithm (GOA), particle swarm optimization (PSO), teaching–learning-based optimization (TLBO), a grey wolf optimizer (GWO), a spotted hyena optimizer (SHO), as well as an emperor penguin optimizer (EPO). To test the SSA’s usability, it is employed on five engineering optimization problems. The SSA delivered better fitting results than the other algorithms in unimodal objective function, multimodal objective functions, CEC 2015, in addition to the optimization problems in engineering.

No abstract