宁夏大学学报（自然科学版）2017，Vol.38Issue(1)：15-18,22,5.
一种求解非线性规划问题的粒子群算法
Particle Swarm Algorithm of the Nonlinear Programming Problem
摘要
Abstract
A particle swarm optimization based on random walk(RWPSO) is proposed to solve nonlinear mixed integer programming problem.To balance local search capability and global search capability,self-adaptive inertia weight is constructed.A "random walk" behavior is proposed to enhance the local search ability of particles.In order to prevent premature convergence,the "survival of the fittest" update mechanism is introduced.Finally,in order to validate the algorithm is feasible and effective for solving nonlinear mixed integer programming problem,RWPSO is tested and compared with the other three algorithms in 16 test functions.The experimental study shows that RWPSO has been greatly improved in terms of accuracy and success rate.关键词
粒子群算法/非线性混合整数规划/随机游走Key words
particle swarm optimization/nonlinear mixed integer programming/random walk分类
信息技术与安全科学引用本文复制引用
赵佳鑫,高岳林,陈群林..一种求解非线性规划问题的粒子群算法[J].宁夏大学学报（自然科学版）,2017,38(1):15-18,22,5.基金项目
国家自然科学基金资助项目(61561001) （61561001）
北方民族大学研究生创新项目(YCX1547) （YCX1547）
