| 引用本文: | 刘勇,马良.随机扩散算法求解二次背包问题[J].控制理论与应用,2011,28(8):1140~1144.[点击复制] |
| LIU Yong,MA Liang.Stochastic diffusion search algorithm for quadratic knapsack problem[J].Control Theory and Technology,2011,28(8):1140~1144.[点击复制] |
|
| 随机扩散算法求解二次背包问题 |
| Stochastic diffusion search algorithm for quadratic knapsack problem |
| 摘要点击 3122 全文点击 2183 投稿时间：2010-08-01 修订日期：2011-01-08 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 10.7641/j.issn.1000-8152.2011.8.CCTA100884 |
| 2011,28(8):1140-1144 |
| 中文关键词 一对一通信 部分函数估计 二次背包问题 |
| 英文关键词 one-to-one communication partial function evaluation quadratic knapsack problem |
| 基金项目 国家自然科学基金资助项目(70871081); 上海市重点学科建设资助项目(S30504). |
|
| 中文摘要 |
| 针对二次背包问题, 提出一种新的基于群体智能的随机扩散算法. 算法采用一对一的通信机制; 利用部分函数估计评价候选解; 利用量子机制构造个体; 采用1--OPT和异或操作提高搜索性能. 通过数值实验并与微粒群算法、蚁群算法作比较, 结果表明算法具有较好的优化性能. |
| 英文摘要 |
| To solve the quadratic knapsack problem, we propose a stochastic diffusion search algorithm which is a novel algorithm based on swarm intelligence. This algorithm adopts one-to-one communication mechanism. The candidate solutions are estimated by the partial function evaluation. Individuals are produced by quantum computation. 1--OPT and XOR operations are employed to improve the search ability. Comparison of the experiment results with those obtained from the particle swarm optimization and the ant colony optimization shows that the proposed algorithm is more effective. |