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

薛峰; 陈刚; 高尚

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

引用本文：薛峰，陈刚，高尚.求解0-1整数规划的混合粒子群优化算法[J].计算技术与自动化,2011,(1):86-89

摘要点击次数: 2371

全文下载次数: 205

作者	单位
薛峰，陈刚，高尚	(江苏科技大学计算机科学与工程学院，江苏镇江212003)

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

中文关键词:粒子群算法 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.

keywords:particle swarm algorithm 0-1 integer programming problem knapsack problem genetic algorithm mutation

查看全文 查看/发表评论 下载pdf阅读器