计算技术与自动化2011，Vol.30Issue(1)：86-89,4.
求解0-1整数规划的混合粒子群优化算法
Solving 0-1 Integer Programming Problem by Hybrid Particle Swarm Optimization Algorithm
摘要
Abstract
The classical particle swarm optimization is a powerful method to find the minimum of a numerical function,on a continuous definition domain. The particle swarm optimization algorithm combine the ideal of the genetic algorithm is recommended to solve 0-1 integer programming problem. All the 6 hybrid particle swarm optimization algorithms are proved effective. Especially the hybrid particle swarm optimization algorithm with across strategy A and mutation strategy C is a simple and effective better algorithm than others. It can easily be modified for any combinatorial problem for which we have no good specialized algorithm.关键词
粒子群算法/0-1整数规划问题/背包问题/遗传算法/变异Key words
particle swarm algorithm/ 0- 1 integer programming problem / knapsack problem/ genetic algorithm/ mutation分类
信息技术与安全科学引用本文复制引用
薛峰,陈刚,高尚..求解0-1整数规划的混合粒子群优化算法[J].计算技术与自动化,2011,30(1):86-89,4.基金项目
"青蓝工程"资助(苏教师(2010)27号) （苏教师(2010）
江苏省高校自然科学基础研究课题(08KJB520003) （08KJB520003）
