首页 | 本学科首页   官方微博 | 高级检索  
     

基于改进的微粒群优化算法的0-1背包问题求解
引用本文:沈显君,王伟武,郑波尽,李元香.基于改进的微粒群优化算法的0-1背包问题求解[J].计算机工程,2006,32(18):23-24,3.
作者姓名:沈显君  王伟武  郑波尽  李元香
作者单位:1. 武汉大学软件工程国家重点实验室,武汉,430072;华中师范大学计算机科学系,武汉,430079
2. 武汉大学软件工程国家重点实验室,武汉,430072
摘    要:在介绍微粒群优化算法及其搜索策略的基础上,根据组合约束优化问题的特点,定义了等值变换、异值变换以及变换序列等概念,有针对性地设计了一种适合求解0-1背包问题的特殊微粒群优化算法。实验证明,改进后的微粒群优化算法在求解0-1背包问题上具有可行性和高效性。

关 键 词:微粒群优化  0-1背包问题  组合约束优化
文章编号:1000-3428(2006)18-0023-02
收稿时间:2005-10-19
修稿时间:2005-10-19

Modified Particle Swarm Optimization for 0-1 Knapsack Problems
SHEN Xianjun,WANG Weiwu,ZHENG Bojin,LI Yuanxiang.Modified Particle Swarm Optimization for 0-1 Knapsack Problems[J].Computer Engineering,2006,32(18):23-24,3.
Authors:SHEN Xianjun  WANG Weiwu  ZHENG Bojin  LI Yuanxiang
Affiliation:1. State Key Laboratory,of Software Engineering, Wuhan University, Wuhan 430072; 2. Department of Computer Science, Central China Normal University, Wuhan 430079
Abstract:The algorithm and the search strategies of particle swarm optimization are introduced, on base of which concepts such as equivalent transformation, the difference value transformation and the transform serial sequence are defined according to characteristics of 0-1 knapsack problem, then a kind of special particle swarm optimization that is applicable to solve 0- 1 knapsack problem is designed. The experimental results show the possibility and the efficiency of the modified particle swarm optimization on solving 0-1 knapsack problem.
Keywords:Particle swarm optimization  0-1 knapsack problem  Constrained combinatorial optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号