Optimization algorithms are one of the effective stochastic methods in solving optimization problems. In this paper, a new swarm-based algorithm called Northern Goshawk Optimization (NGO) algorithm is presented that simulates the behavior of northern goshawk during prey hunting. This hunting strategy includes two phases of prey identification and the tail and chase process. The various steps of the proposed NGO algorithm are described and then its mathematical modeling is presented for use in solving optimization problems. The ability of NGO to solve optimization problems is evaluated on sixty-eight different objective functions. To analyze the quality of the results, the proposed NGO algorithm is compared with eight well-known algorithms, particle swarm optimization, genetic algorithm, teaching-learning based optimization, gravitational search algorithm, grey wolf optimizer, whale optimization algorithm, tunicate swarm algorithm, and marine predators algorithm. In addition, for further analysis, the proposed algorithm is also employed to solve four engineering design problems. The results of simulations and experiments show that the proposed NGO algorithm, by creating a proper balance between exploration and exploitation, has an effective performance in solving optimization problems and is much more competitive than similar algorithms.

No abstract

In this paper, a new bio-inspired metaheuristic algorithm called Tasmanian Devil Optimization (TDO) is designed that mimics Tasmanian devil behavior in nature. The fundamental inspiration used in TDO is simulation of the feeding behavior of the Tasmanian devil, who has two strategies: attacking live prey or feeding on carrions of dead animals. The proposed TDO is described, then its mathematical modeling is presented. TDO performance in optimization is tested on a set of twenty-three standard objective functions. Unimodal benchmark functions have analyzed the TDO exploitation capability, while high-dimensional multimodal and fixed-exploitation multimodal benchmark functions have challenged the TDO exploration capability. The optimization results indicate the high ability of the proposed TDO in exploration and exploitation and create a proper balance between these two indicators to effectively solve optimization problems. Eight well-known metaheuristic algorithms are employed to analyze the quality of the obtained results from TDO. The simulation results show that the proposed TDO, with its strong performance, has a higher capability than the eight competitor algorithms and is much more competitive. For further analysis, TDO is tested in optimizing four engineering design problems. Implementation results show that TDO has an effective performance in solving real-world applications.

In this paper, a novel evolutionary-based method, called Average and Subtraction-Based Optimizer (ASBO), is presented to attain suitable quasi-optimal solutions for various optimization problems. The core idea in the design of the ASBO is to use the average information and the subtraction of the best and worst population members for guiding the algorithm population in the problem search space. The proposed ASBO is mathematically modeled with the ability to solve optimization problems. Twenty-three test functions, including unimodal and multimodal functions, have been employed to evaluate ASBO’s performance in effectively solving optimization problems. The optimization results of the unimodal functions, which have only one main peak, show the high ASBO’s exploitation power in converging towards global optima. In addition, the optimization results of the high-dimensional multimodal functions and fixed-dimensional multimodal functions, which have several peaks and local optima, indicate the high exploration power of ASBO in accurately searching the problem-solving space and not getting stuck in nonoptimal peaks. The simulation results show the proper balance between exploration and exploitation in ASBO in order to discover and present the optimal solution. In addition, the results obtained from the implementation of ASBO in optimizing these objective functions are analyzed compared with the results of nine well-known metaheuristic algorithms. Analysis of the optimization results obtained from ASBO against the performance of the nine compared algorithms indicates the superiority and competitiveness of the proposed algorithm in providing more appropriate solutions.

No abstract