辽宁石油化工大学学报Issue(4)：53-57,5.DOI:10.3696/j.issn.1672-6952.2015.04.012
一种改进的蚁群算法求解多维背包问题
An Improved Ant Colony Algorithm Solving Multi-Dimension Knapsack Problem
王小彤 1侯立刚 1苏成利1
作者信息
- 1. 辽宁石油化工大学信息与控制工程学院，辽宁抚顺 113001
- 折叠
摘要
Abstract
Multi-dimension 0-1 knapsack problem is a typical Non-Deterministic Polynomial problem.In view that ant colony algorithm solving often have local optimum and slow convergence speed problems,this article propose an improved ant colony algorithm.Based on the introduction of leap frog algorithm clustering thought,the ants have been developed into two groups with different culture,which improves the global search ability.The greedy strategy modified formula is applied in order to improve the accuracy of calculation.The formula is further simplified by roulette algorithm.Simulation results indicated that the modified algorithm improves the accuracy and global search ability.关键词
蛙跳算法/贪心策略/蚁群算法/多维 0-1 背包问题/轮盘赌算法Key words
Leap frog algorithm/Greedy strategy/Ant colony algorithm/Multi-dimension 0-1 knapsack problem/Roulette algorithm分类
信息技术与安全科学引用本文复制引用
王小彤,侯立刚,苏成利..一种改进的蚁群算法求解多维背包问题[J].辽宁石油化工大学学报,2015,(4):53-57,5.
