A new fir ewor ks algor ithm for solving constr ained optimization pr oblems
XU Huan-fen
LIU Wei
XIE Yue-shan
Abstract:Aiming at the drawbacks of existing algorithms in solving constrained optimization problems like slow convergence speed and low accuracy, this paper proposes a new fireworks algorithm to solve constrained optimization problems. The algorithm not only utilizes parameter equation method to reduce dimension, which aiming at dealing with the equality constraint functions, but also uses annealing penalty function method to dispose of inequality constraints. The experimental results demonstrate that the proposed algorithm has the advantages of strong searching ability, fast convergence speed, high convergence precision and so on. It is a stable algorithm to solve constrained optimization problems.
Keywords:fireworks algorithmpenalty functionsparameter equationconstrained optimization
Publication Date:2018-01-01
Online Publishing Date:2025-08-15(First online date of this platform, not the publication date of the document)
Pages:8( 13-20 )
