Explore the vast range of titles available.

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.

This paper proposes a novel nature-inspired algorithm called Gaining Sharing Knowledge based Algorithm (GSK) for solving optimization problems over continuous space. The GSK algorithm mimics the process of gaining and sharing knowledge during the human life span. It is based on two vital stages, junior gaining and sharing phase and senior gaining and sharing phase. The present work mathematically models these two phases to achieve the process of optimization. In order to verify and analyze the performance of GSK, numerical experiments on a set of 30 test problems from the CEC2017 benchmark for 10, 30, 50 and 100 dimensions. Besides, the GSK algorithm has been applied to solve the set of real world optimization problems proposed for the IEEE-CEC2011 evolutionary algorithm competition. A comparison with 10 state-of-the-art and recent metaheuristic algorithms are executed. Experimental results indicate that in terms of robustness, convergence and quality of the solution obtained, GSK is significantly better than, or at least comparable to state-of-the-art approaches with outstanding performance in solving optimization problems especially with high dimensions.

The Sine Cosine Algorithm (SCA) is a population-based optimization algorithm introduced by Mirjalili in 2016, motivated by the trigonometric sine and cosine functions. After providing an overview of the SCA algorithm, we survey a number of SCA variants and applications that have appeared in the literature. We then present the results of a series of computational experiments to validate the performance of the SCA against similar algorithms.

Sine Cosine Algorithm (SCA) is a recent meta-heuristic algorithm inspired by the proprieties of trigonometric sine and cosine functions. Since its introduction by Mirjalili in 2016, SCA has attracted great attention from researchers and has been widely used to solve different optimization problems in several fields. This attention is due to its reasonable execution time, good convergence acceleration rate, and high efficiency compared to several well-regarded optimization algorithms available in the literature. This paper presents a brief overview of the basic SCA and its variants divided into modified, multi-objective, and hybridized versions. Furthermore, the applications of SCA in several domains such as classification, image processing, robot path planning, scheduling, radial distribution networks, and other engineering problems are described. Finally, the paper recommended some potential future research directions for SCA.

The Jaya Algorithm is a relatively new population-based optimization, which has become a progressively valuable tool in swarm intelligence. The Jaya algorithm incorporates the survival of the fittest principle alike evolutionary algorithm by its victorious nature as well as the ideal of an inducement towards a global optimal, which represents its swarm intelligence nature. Nevertheless, it has been applied in various areas of optimization, mainly in engineering practice, which is discussed and abridged based on each problem’s domain. The Jaya optimization’s vast applicability can be explained by its ability to work without any algorithm-specific parameters. The successfully solved problems may also use some of this meta-heuristic’s variants, in which the algorithm has been modified or hybridized. This paper focuses on a comprehensive review, as well as a bibliometric study of the Jaya algorithm, to imply its versatility. Hence, this study is likely to emphasize this optimization’s abilities, inspiring new researchers to make use of this simple and efficient algorithm for problem-solving.

The African Vultures Optimization Algorithm (AVOA) is a recently developed meta-heuristic algorithm inspired by the foraging behavior of African vultures in nature. This algorithm has gained attention due to its simplicity, flexibility, and effectiveness in tackling many optimization problems. The significance of this review lies in its comprehensive examination of the AVOA’s development, core principles, and applications. By analyzing 112 studies, this review highlights the algorithm’s versatility and the growing interest in enhancing its performance for real-world optimization challenges. This review methodically explores the evolution of AVOA, investigating proposed improvements that enhance the algorithm’s ability to adapt to various search geometries in optimization problems. Additionally, it introduces the AVOA solver, detailing its functionality and application in different optimization scenarios. The review demonstrates the AVOA’s effectiveness, particularly its unique weighting mechanism, which mimics vulture behavior during the search process. The findings underscore the algorithm’s robustness, ease of use, and lack of dependence on derivative information. The review also critically evaluates the AVOA’s convergence behavior, identifying its strengths and limitations. In conclusion, the study not only consolidates the existing knowledge on AVOA but also proposes directions for future research, including potential adaptations and enhancements to address its limitations. The insights gained from this review offer valuable guidance for researchers and practitioners seeking to apply or improve the AVOA in various optimization tasks.

Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer's shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer. The AA is mathematically described, and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions. Furthermore, the proposed algorithm's performance is compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic algorithm, grey wolf optimization, particle swarm optimization, whale optimization algorithm, gravitational search algorithm, and tunicate swarm algorithm. According to the simulation findings, the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios, and it can give adequate quasi-optimal solutions to these problems. The analysis and comparison of competing algorithms’ performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA.

Swarm behaviors in nature have inspired the emergence of many heuristic optimization algorithms. They have attracted much attention, particularly for complex problems, owing to their characteristics of high dimensionality, nondifferentiability, and the like. A new heuristic algorithm is proposed in this study inspired by the prey location and communication behaviors of electric fish. Nocturnal electric fish have very poor eyesight and live in muddy, murky water, where visual senses are very limited. Therefore, they rely on their species-specific ability called electrolocation to perceive their environment. The active and passive electrolocation capability of such fish is believed to be a good candidate for balancing local and global search, and hence it is modeled in this study. A new heuristic called electric fish optimization (EFO) is introduced and compared with six well-known heuristics (simulated annealing, SA; vortex search, VS; genetic algorithm, GA; differential evolution, DE; particle swarm optimization, PSO; and artificial bee colony, ABC). In the experiments, 50 basic and 30 complex mathematical functions, 13 clustering problems, and five real-world design problems are used as the benchmark sets. The simulation results indicate that EFO is better than or very competitive with its competitors.

Ant lion optimizer (ALO) is a newly developed population-based search algorithm inspired by hunting mechanism of antlions and based on five steps of hunting the ants, i.e., the random walk of ants, building traps, entrapment of ants in traps, catching preys and re-building traps. This paper presents the application of ALO algorithm for the solution of non-convex and dynamic economic load dispatch problem of electric power system. The performance of ALO algorithm is tested for economic load dispatch problem of four IEEE benchmarks of small-scale power systems, and the results are verified by a comparative study with lambda iteration method, particle swarm optimization algorithm, genetic algorithm, artificial bee colony, evolutionary programming and Grey Wolf optimizer (GWO). Comparative results show that the performance of ant lion optimizer algorithm is better than recently developed GWO algorithm and other well-known heuristics and meta-heuristics search algorithms.

In recent decades, many optimization algorithms have been proposed by researchers to solve optimization problems in various branches of science. Optimization algorithms are designed based on various phenomena in nature, the laws of physics, the rules of individual and group games, the behaviors of animals, plants and other living things. Implementation of optimization algorithms on some objective functions has been successful and in others has led to failure. Improving the optimization process and adding modification phases to the optimization algorithms can lead to more acceptable and appropriate solution. In this paper, a new method called Dehghani method (DM) is introduced to improve optimization algorithms. DM effects on the location of the best member of the population using information of population location. In fact, DM shows that all members of a population, even the worst one, can contribute to the development of the population. DM has been mathematically modeled and its effect has been investigated on several optimization algorithms including: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching-learning-based optimization (TLBO), and grey wolf optimizer (GWO). In order to evaluate the ability of the proposed method to improve the performance of optimization algorithms, the mentioned algorithms have been implemented in both version of original and improved by DM on a set of twenty-three standard objective functions. The simulation results show that the modified optimization algorithms with DM provide more acceptable and competitive performance than the original versions in solving optimization problems.