欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在介绍微粒群优化算法及其搜索策略的基础上，根据组合约束优化问题的特点，定义了等值变换、异值变换以及变换序列等概念，有针对性地设计了一种适合求解0—1背包问题的特殊微粒群优化算法。实验证明，改进后的微粒群优化算法在求解0-1背包问题上具有可行性和高效性。
英文摘要：
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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：