佛山科学技术学院学报（自然科学版）2018，Vol.36Issue(6)：13-20,8.
一种新的烟花算法求解约束优化问题
A new fir ewor ks algor ithm for solving constr ained optimization pr oblems
徐焕芬 1刘伟 1谢月珊1
作者信息
- 1. 广东工业大学 应用数学学院,广东 广州 510520
- 折叠
摘要
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.关键词
烟花算法/罚函数/参数方程/约束优化Key words
fireworks algorithm/penalty functions/parameter equation/constrained optimization分类
信息技术与安全科学引用本文复制引用
徐焕芬,刘伟,谢月珊..一种新的烟花算法求解约束优化问题[J].佛山科学技术学院学报（自然科学版）,2018,36(6):13-20,8.
