Year-end Sale % OFF 
Abstract
SummaryThe Aquila optimizer (AO) is an efficient method for solving global optimization problems. However, the evolution of each individual learns from experience in the same group, which can easily fall into local optima. Therefore, this paper adopts the dynamic grouping strategy (DGS) of the population and proposes an improved AO algorithm to solve the global optimization problem. Different from the original AO algorithm, the DGSAO algorithm only evolves the individuals with the worst fitness in each group each time, which increases the diversity of the population. In order to verify the effectiveness of the algorithm, we tested it on 23 benchmark functions, among which the dimensions of to are 30, 100, and 200 dimensions. The experimental results show that the DGSAO algorithm is an effective method for solving global optimization problems. At the same time, we also conduct experiments on two engineering design problems, and the results show that the DGSAO algorithm can obtain a competitive result.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
