.png){kind=icon}
.png){kind=icon}
Return
Performance Evaluation of the Plant Growth Optimization Algorithm for Constrained Nonlinear Optimization
.png){kind=icon}
PRE
AI
H
C
J
R
S
D
M
DOI：10.3390/eng7030132.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constrained nonlinear optimization plays a fundamental role in engineering design due to the presence of irregular feasible regions and interacting nonlinear restrictions. This study evaluates the performance of the Plant Growth Optimization (PGO) algorithm in a constrained nonlinear benchmark problem. The algorithm was implemented in MATLAB (R) and assessed using a fixed external penalty formulation for constraint handling. Performance was analyzed through convergence dynamics, constraint evolution, dispersion across 20 independent runs, and computational efficiency. A comparative study was conducted against Particle Swarm Optimization (PSO), Genetic Algorithms (GA), and Differential Evolution (DE) under identical experimental conditions. Results show that PGO achieves stable convergence within 87 generations, consistently attaining a feasible solution near the constraint boundary with low dispersion across runs. Statistical validation using the Friedman test (chi(2)=32.45, p<0.001) confirmed significant performance differences among algorithms, while post-hoc Wilcoxon tests indicated comparable performance between PGO and DE and significant differences relative to PSO and GA. These findings demonstrate that PGO provides a balanced compromise between robustness, convergence stability, and computational efficiency, supporting its suitability for constrained nonlinear engineering optimization tasks.
Keywords:
plant growth optimization
constrained nonlinear optimization
metaheuristic algorithms
penalty-based constraint handling
engineering optimization
statistical validation
Journal
E
IF:
2.4
Papers:
302
Citations:
0
Organization
Cited Papers