An Improved Growth Optimizer and Its Simulation

Addressing the problems of slow convergence speed of growth optimizer, low optimization accuracy, easy to fall into local optimum, and difficult to be well balanced for exploration and exploitation, an improved growth optimizer is proposed. This innovative method enhances the initial population quality and improves the population diversity by applying the Latin hypercube method in the initialization stage of the population. It also dynamically adjusts the upper echelon of society and employs a nonlinear optimization strategy to achieve an effective balance between exploration and exploitation capabilities, which further improves the convergence speed of the algorithm and its ability to jump out of the local optimum. Simulation experiments on several types of standard test functions and two engineering application problems show that the algorithm has high optimization performance and robustness.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1145/3736426.3736476
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Growth Optimizer and Its Simulation

Shanshan Luo, Qiang Liu
Metaheuristic Optimization Algorithms Research
article

An Improved Growth Optimizer and Its Simulation

Shanshan Luo, Qiang Liu
article en

Abstract

Addressing the problems of slow convergence speed of growth optimizer, low optimization accuracy, easy to fall into local optimum, and difficult to be well balanced for exploration and exploitation, an improved growth optimizer is proposed. This innovative method enhances the initial population quality and improves the population diversity by applying the Latin hypercube method in the initialization stage of the population. It also dynamically adjusts the upper echelon of society and employs a nonlinear optimization strategy to achieve an effective balance between exploration and exploitation capabilities, which further improves the convergence speed of the algorithm and its ability to jump out of the local optimum. Simulation experiments on several types of standard test functions and two engineering application problems show that the algorithm has high optimization performance and robustness.

Liaoning Shihua University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 92%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.