Related Experiment Video
Updated: May 8, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Improved aquila optimizer for swarm-based solutions to complex engineering problems
Himanshu Sharma1, Krishan Arora1, Raghav Mahajan1
1School of Electronics and Electrical Engineering, Lovely Professional University, Jalandhar, India.
Abstract:
The traditional optimization approaches suffer from certain problems like getting stuck in local optima, low speed, susceptibility to local optima, and searching unknown search spaces, thus requiring reliance on single-based solutions. Herein, an Improved Aquila Optimizer (IAO) is proposed, which is a unique meta-heuristic optimization method motivated by the hunting behavior of Aquila. An improved version of Aquila optimizer seeks to increase effectiveness and productivity. IAO emulates the hunting behaviors of Aquila, elucidating each step of the hunting process. The IAO algorithm contains innovative elements to boost its optimization capabilities. It combines a combination of low flight with a leisurely descent for exploitation, high-altitude vertical dives, contour flying with brief gliding attacks for exploration, and controlled swooping maneuvers for effective prey capture. To assess the effectiveness of IAO, Herein, numerous experiments were carried out. Firstly, IAO was compared using 23 classical optimization functions. The achieved results demonstrate that the proposed model outperforms various champion algorithms. Secondly, the proposed algorithm is applied to five real-world engineering problems. The achieved results prove effectiveness in diverse application domains. The key findings of the research work highlight IAO's resilience and adaptability in solving challenging optimization issues and its importance as a strong optimization tool for real-world engineering applications. Convergence curves compare the speed of proposed algorithms with selected algorithms for 1000 iterations. Time complexity analysis shows that the best time is 0.00015225 which is better as compared to other algorithms also Wilcoxon ranksum test is carried out to calculate the p-value is less than 0.05 rejecting the null hypothesis. The research emphasizes the potential of IAO as a tool for tackling real-world optimization challenges by explaining its efficacy and competitiveness compared to other optimization procedures via comprehensive testing and analysis.
More Related Videos
Related Concept Videos
Turbulent Flow: Problem Solving
Temperature is a key factor in CO2 solubility. In this case, the CO2 gas and the liquid are cooled to 20°C. Lower temperatures...
Laminar Flow: Problem Solving
Distributed Loads: Problem Solving
Prismatic Beams: Problem Solving
The design begins with analyzing the beam as a free body to identify moments and force balances, thereby determining support reactions. Next, the...
Newtonian Fluid: Problem Solving
A velocity gradient forms within the fluid when a Newtonian fluid is placed between two parallel plates, with...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

