Search

In this paper, a new bio-inspired metaheuristic algorithm named the Kookaburra Optimization Algorithm (KOA) is introduced, which imitates the natural behavior of kookaburras in nature. The fundamental inspiration of KOA is the strategy of kookaburras when hunting and killing prey. The KOA theory is stated, and its mathematical modeling is presented in the following two phases: (i) exploration based on the simulation of prey hunting and (ii) exploitation based on the simulation of kookaburras' behavior in ensuring that their prey is killed. The performance of KOA has been evaluated on 29 standard benchmark functions from the CEC 2017 test suite for the different problem dimensions of 10, 30, 50, and 100. The optimization results show that the proposed KOA approach, by establishing a balance between exploration and exploitation, has good efficiency in managing the effective search process and providing suitable solutions for optimization problems. The results obtained using KOA have been compared with the performance of 12 well-known metaheuristic algorithms. The analysis of the simulation results shows that KOA, by providing better results in most of the benchmark functions, has provided superior performance in competition with the compared algorithms. In addition, the implementation of KOA on 22 constrained optimization problems from the CEC 2011 test suite, as well as 4 engineering design problems, shows that the proposed approach has acceptable and superior performance compared to competitor algorithms in handling real-world applications. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper introduces a new bio-inspired metaheuristic algorithm called Walrus Optimization Algorithm (WaOA), which mimics walrus behaviors in nature. The fundamental inspirations employed in WaOA design are the process of feeding, migrating, escaping, and fighting predators. The WaOA implementation steps are mathematically modeled in three phases exploration, migration, and exploitation. Sixty-eight standard benchmark functions consisting of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, CEC 2015 test suite, and CEC 2017 test suite are employed to evaluate WaOA performance in optimization applications. The optimization results of unimodal functions indicate the exploitation ability of WaOA, the optimization results of multimodal functions indicate the exploration ability of WaOA, and the optimization results of CEC 2015 and CEC 2017 test suites indicate the high ability of WaOA in balancing exploration and exploitation during the search process. The performance of WaOA is compared with the results of ten well-known metaheuristic algorithms. The results of the simulations demonstrate that WaOA, due to its excellent ability to balance exploration and exploitation, and its capacity to deliver superior results for most of the benchmark functions, has exhibited a remarkably competitive and superior performance in contrast to other comparable algorithms. In addition, the use of WaOA in addressing four design engineering issues and twenty-two real-world optimization problems from the CEC 2011 test suite demonstrates the apparent effectiveness of WaOA in real-world applications. The MATLAB codes of WaOA are available in https://uk.mathworks.com/matlabcentral/profile/authors/13903104. [ABSTRACT FROM AUTHOR]

In this paper, a new optimization algorithm called hybrid leader-based optimization (HLBO) is introduced that is applicable in optimization challenges. The main idea of HLBO is to guide the algorithm population under the guidance of a hybrid leader. The stages of HLBO are modeled mathematically in two phases of exploration and exploitation. The efficiency of HLBO in optimization is tested by finding solutions to twenty-three standard benchmark functions of different types of unimodal and multimodal. The optimization results of unimodal functions indicate the high exploitation ability of HLBO in local search for better convergence to global optimal, while the optimization results of multimodal functions show the high exploration ability of HLBO in global search to accurately scan different areas of search space. In addition, the performance of HLBO on solving IEEE CEC 2017 benchmark functions including thirty objective functions is evaluated. The optimization results show the efficiency of HLBO in handling complex objective functions. The quality of the results obtained from HLBO is compared with the results of ten well-known algorithms. The simulation results show the superiority of HLBO in convergence to the global solution as well as the passage of optimally localized areas of the search space compared to ten competing algorithms. In addition, the implementation of HLBO on four engineering design issues demonstrates the applicability of HLBO in real-world problem solving. [ABSTRACT FROM AUTHOR]

This paper introduces a new human-based metaheuristic algorithm called Sewing Training-Based Optimization (STBO), which has applications in handling optimization tasks. The fundamental inspiration of STBO is teaching the process of sewing to beginner tailors. The theory of the proposed STBO approach is described and then mathematically modeled in three phases: (i) training, (ii) imitation of the instructor's skills, and (iii) practice. STBO performance is evaluated on fifty-two benchmark functions consisting of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. The optimization results show that STBO, with its high power of exploration and exploitation, has provided suitable solutions for benchmark functions. The performance of STBO is compared with eleven well-known metaheuristic algorithms. The simulation results show that STBO, with its high ability to balance exploration and exploitation, has provided far more competitive performance in solving benchmark functions than competitor algorithms. Finally, the implementation of STBO in solving four engineering design problems demonstrates the capability of the proposed STBO in dealing with real-world applications. [ABSTRACT FROM AUTHOR]

In this paper, a new optimization algorithm called hybrid leader-based optimization (HLBO) is introduced that is applicable in optimization challenges. The main idea of HLBO is to guide the algorithm population under the guidance of a hybrid leader. The stages of HLBO are modeled mathematically in two phases of exploration and exploitation. The efficiency of HLBO in optimization is tested by finding solutions to twenty-three standard benchmark functions of different types of unimodal and multimodal. The optimization results of unimodal functions indicate the high exploitation ability of HLBO in local search for better convergence to global optimal, while the optimization results of multimodal functions show the high exploration ability of HLBO in global search to accurately scan different areas of search space. In addition, the performance of HLBO on solving IEEE CEC 2017 benchmark functions including thirty objective functions is evaluated. The optimization results show the efficiency of HLBO in handling complex objective functions. The quality of the results obtained from HLBO is compared with the results of ten well-known algorithms. The simulation results show the superiority of HLBO in convergence to the global solution as well as the passage of optimally localized areas of the search space compared to ten competing algorithms. In addition, the implementation of HLBO on four engineering design issues demonstrates the applicability of HLBO in real-world problem solving. [ABSTRACT FROM AUTHOR]

With the advancement of science and technology, new complex optimization problems have emerged, and the achievement of optimal solutions has become increasingly important. Many of these problems have features and difficulties such as non-convex, nonlinear, discrete search space, and a non-differentiable objective function. Achieving the optimal solution to such problems has become a major challenge. To address this challenge and provide a solution to deal with the complexities and difficulties of optimization applications, a new stochastic-based optimization algorithm is proposed in this study. Optimization algorithms are a type of stochastic approach for addressing optimization issues that use random scanning of the search space to produce quasi-optimal answers. The Selecting Some Variables to Update-Based Algorithm (SSVUBA) is a new optimization algorithm developed in this study to handle optimization issues in various fields. The suggested algorithm's key principles are to make better use of the information provided by different members of the population and to adjust the number of variables used to update the algorithm population during the iterations of the algorithm. The theory of the proposed SSVUBA is described, and then its mathematical model is offered for use in solving optimization issues. Fifty-three objective functions, including unimodal, multimodal, and CEC 2017 test functions, are utilized to assess the ability and usefulness of the proposed SSVUBA in addressing optimization issues. SSVUBA's performance in optimizing real-world applications is evaluated on four engineering design issues. Furthermore, the performance of SSVUBA in optimization was compared to the performance of eight well-known algorithms to further evaluate its quality. The simulation results reveal that the proposed SSVUBA has a significant ability to handle various optimization issues and that it outperforms other competitor algorithms by giving appropriate quasi-optimal solutions that are closer to the global optima. [ABSTRACT FROM AUTHOR]

A new bio-inspired metaheuristic algorithm named the Pufferfish Optimization Algorithm (POA), that imitates the natural behavior of pufferfish in nature, is introduced in this paper. The fundamental inspiration of POA is adapted from the defense mechanism of pufferfish against predators. In this defense mechanism, by filling its elastic stomach with water, the pufferfish becomes a spherical ball with pointed spines, and as a result, the hungry predator escapes from this threat. The POA theory is stated and then mathematically modeled in two phases: (i) exploration based on the simulation of a predator's attack on a pufferfish and (ii) exploitation based on the simulation of a predator's escape from spiny spherical pufferfish. The performance of POA is evaluated in handling the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that POA has achieved an effective solution with the appropriate ability in exploration, exploitation, and the balance between them during the search process. The quality of POA in the optimization process is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that POA provides superior performance by achieving better results in most of the benchmark functions in order to solve the CEC 2017 test suite compared to competitor algorithms. Also, the effectiveness of POA to handle optimization tasks in real-world applications is evaluated on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems. Simulation results show that POA provides effective performance in handling real-world applications by achieving better solutions compared to competitor algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO is derived from the hunting strategy of giant armadillos in moving towards prey positions and digging termite mounds. The theory of GAO is expressed and mathematically modeled in two phases: (i) exploration based on simulating the movement of giant armadillos towards termite mounds, and (ii) exploitation based on simulating giant armadillos' digging skills in order to prey on and rip open termite mounds. The performance of GAO in handling optimization tasks is evaluated in order to solve the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that GAO is able to achieve effective solutions for optimization problems by benefiting from its high abilities in exploration, exploitation, and balancing them during the search process. The quality of the results obtained from GAO is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that GAO presents superior performance compared to competitor algorithms by providing better results for most of the benchmark functions. The statistical analysis of the Wilcoxon rank sum test confirms that GAO has a significant statistical superiority over competitor algorithms. The implementation of GAO on the CEC 2011 test suite and four engineering design problems show that the proposed approach has effective performance in dealing with real-world applications. [ABSTRACT FROM AUTHOR]