摘要
针对约束优化问题,提出了一种新的引力搜索算法。在该算法中,对每一个粒子定义两个质量,一是"可行质量"另一个是"不可行质量"。若对可行粒子更新,则采用可行质量;否则采用不可行质量。其目的使可行粒子向目标函数值好的方向发展,使不可行粒子向可行域方向发展。最后对5个测试函数进行数值实验,数值结果表明提出的算法是可行的、有效的。
A new gravitational search algorithm is proposed for constrained optimization problem.In this algorithm,two mass are defined for each particle,＂feasible mass＂ and ＂infeasible mass＂.If feasible particles are updated,feasible mass is used;otherwise,infeasible mass is used.Its purpose is to make feasible particles develop to the direction of good objective function value,and the infeasible particles develop to the direction of feasible domain.Finally,the numerical experiments of five test functions are carried out.The numerical results show that the proposed algorithm is feasible and effective.
出处
《价值工程》
2017年第12期205-206,共2页
Value Engineering
基金
国家自然科学基金资助项目(1371071)
关键词
引力搜索算法
约束优化
违反约束度
全局优化
gravitational search algorithm
constraint optimization
violation of constraint
global optimization
