摘要
粒子群是一种智能优化算法,通过群体中个体间的相互作用寻找复杂空间中的最优区域.二次规划是一类基本而又重要的非线性规划问题.本文讨论一种改进的粒子群算法求解二次规划问题,进行了数值试验,数值结果表明算法的有效性.
Particle swarm is an intellectualized optimization algorithm which can be used to locate optimal regions in complex spaces through the interaction of individuals in a population of particles.Quadratic programming is a basic and significant non-linear optimization problem.This paper discusses the problem of quadratic programming with regard to solving an improved particle swarm algorithm.Numerical experiment is carried out and the results show that the algorithm is effective.
出处
《南京工程学院学报（自然科学版）》
2010年第3期5-8,共4页
Journal of Nanjing Institute of Technology(Natural Science Edition)
基金
国家自然科学基金资助(10771212)
关键词
粒子群
二次规划
无约束问题
particle swarm
quadratic programming
unconstrained problem
