Aquila Optimizer: A novel meta-heuristic optimization algorithm

This paper proposes a novel population-based optimization method, called Aquila Optimizer (AO), which is inspired by the Aquila's behaviors in nature during the process of catching the prey. Hence, the optimization procedures of the proposed AO algorithm are represented in four methods; selecting the search space by high soar with the vertical stoop, exploring within a diverge search space by contour flight with short glide attack, exploiting within a converge search space by low flight with slow descent attack, and swooping by walk and grab prey. To validate the new optimizer's ability to find the optimal solution for different optimization problems, a set of experimental series is conducted. For example, during the first experiment, AO is applied to find the solution of well-known 23 functions. The second and third experimental series aims to evaluate the AO's performance to find solutions for more complex problems such as thirty CEC2017 test functions and ten CEC2019 test functions, respectively. Finally, a set of seven real-world engineering problems are used. From the experimental results of AO that compared with well-known meta-heuristic methods, the superiority of the developed AO algorithm is observed. Matlab codes of AO are available at https://www.mathworks.com/matlabcentral/fileexchange/89381-aquila-optimizer-a-meta-heuristic-optimization-algorithm and Java codes are available at https://www.mathworks.com/matlabcentral/fileexchange/89386-aquila-optimizer-a-meta-heuristic-optimization-algorithm

Novel metaheuristic based on multiverse theory for optimization problems in emerging systems

This is an accepted manuscript of an article published by Springer in Applied Intelligence on 11/11/2020, available online at: https://doi.org/10.1007/s10489-020-01920-z The accepted version of the publication may differ from the final published version.Finding an optimal solution for emerging cyber physical systems (CPS) for better efficiency and robustness is one of the major issues. Meta-heuristic is emerging as a promising field of study for solving various optimization problems applicable to different CPS systems. In this paper, we propose a new meta-heuristic algorithm based on Multiverse Theory, named MVA, that can solve NP-hard optimization problems such as non-linear and multi-level programming problems as well as applied optimization problems for CPS systems. MVA algorithm inspires the creation of the next population to be very close to the solution of initial population, which mimics the nature of parallel worlds in multiverse theory. Additionally, MVA distributes the solutions in the feasible region similarly to the nature of big bangs. To illustrate the effectiveness of the proposed algorithm, a set of test problems is implemented and measured in terms of feasibility, efficiency of their solutions and the number of iterations taken in finding the optimum solution. Numerical results obtained from extensive simulations have shown that the proposed algorithm outperforms the state-of-the-art approaches while solving the optimization problems with large feasible regions