Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems.

In this paper, a new bio-inspired metaheuristic algorithm called Zebra Optimization Algorithm (ZOA) is developed; its fundamental inspiration is the behavior of zebras in nature. ZOA simulates the foraging behavior of zebras and their defense strategy against predators’ attacks. The ZOA steps are described and then mathematically modeled. ZOA performance in optimization is evaluated on sixty-eight benchmark functions, including unimodal, high-dimensional multimodal, fixed-dimensional multimodal, CEC2015, and CEC2017. The results obtained from ZOA are compared with the performance of nine well-known algorithms. The simulation results show that ZOA can solve optimization problems by creating a suitable balance between exploration and exploitation and has a superior performance compared to nine competitor algorithms. ZOA’s ability to solve real-world problems has been tested on four engineering design problems, namely, tension/compression spring, welded beam, speed reducer, and pressure vessel. The optimization results show that ZOA is an effective optimizer in determining the values of the design variables of these problems compared to the nine competitor algorithms.

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.

This paper presents a new evolutionary-based approach called a Subtraction-Average-Based Optimizer (SABO) for solving optimization problems. The fundamental inspiration of the proposed SABO is to use the subtraction average of searcher agents to update the position of population members in the search space. The different steps of the SABO’s implementation are described and then mathematically modeled for optimization tasks. The performance of the proposed SABO approach is tested for the optimization of fifty-two standard benchmark functions, consisting of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, and the CEC 2017 test suite. The optimization results show that the proposed SABO approach effectively solves the optimization problems by balancing the exploration and exploitation in the search process of the problem-solving space. The results of the SABO are compared with the performance of twelve well-known metaheuristic algorithms. The analysis of the simulation results shows that the proposed SABO approach provides superior results for most of the benchmark functions. Furthermore, it provides a much more competitive and outstanding performance than its competitor algorithms. Additionally, the proposed approach is implemented for four engineering design problems to evaluate the SABO in handling optimization tasks for real-world applications. The optimization results show that the proposed SABO approach can solve for real-world applications and provides more optimal designs than its competitor algorithms.

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.