求解0-1整数规划的混合粒子群优化算法  

Solving 0-1 Integer Programming Problem by Hybrid Particle Swarm Optimization Algorithm

作　　者：薛峰[1] 陈刚[1] 高尚[1] 

机构地区：[1]江苏科技大学计算机科学与工程学院,江苏镇江212003

出　　处：《计算技术与自动化》2011年第1期86-89,共4页Computing Technology and Automation

基　　金："青蓝工程"资助(苏教师(2010)27号);江苏省高校自然科学基础研究课题(08KJB520003)

摘　　要：经典的粒子群是一个有效的寻找连续函数极值的方法,结合遗传算法的思想提出的混合粒子群算法来解决0-1整数规划问题,经过比较测试,6种混合粒子群算法的效果都比较好,特别交叉策略A和变异策略C的混合粒子群算法是最好的且简单有效的算法。对于目前还没有好的解法的组合优化问题,很容易地修改此算法就可解决。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整数规划问题 背包问题 遗传算法 变异 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]