摘要
0/1背包问题是一类典型的组合优化问题,并且是NP完全问题。针对0/1背包问题和蚁群算法的特点,设计了一个标志表,使得蚁群算法可以应用到背包问题上。仿真结果表明,改进的蚁群算法在求解0/1背包问题上是相当出色的。
The 0/1 knapsack problem is a class of typical combinatorial optimization problems and is NP-complete. Aiming at the characteristics of the 0/1 knapsack problem and ant colony algorithm, a flag table is designed, which makes the ant colony algorithm suitable for the knapsack problem. The simulation results show that the improved algorithm is very excellent in solving the 0/1 knapsack problem.
出处
《软件导刊》
2009年第12期52-54,共3页
Software Guide
关键词
蚁群算法
组合优化
0/1背包问题
启发式算法
Ant Algorithm
Combinatorial Optimization
0/1 Knapsack Problem
Meta-Heuristic Algorithm
