【摘要】 0-1背包问题是典型的NP完全问题,且蚁群算法已成功地解决了许多组合优化的难题。因此,文中介绍一种基于蚁群算法求解0-1背包问题的算法,并对此算法进行优化,提出一种求解0-1背包问题的快速蚁群算法。它大大减少了蚁群算法的搜索时间,有效改善了蚁群算法易于过早地收敛于非最优解的缺陷,当物品数较大时,也取得了较好的求解质量。仿真实验取得了较好的结果。更多还原

【Abstract】 0-1 knapsack problem is a difficult NP problem.Ant colony algorithm was applied successfully to many hard combinational optimization problems.So,an ant colony algorithm of solving 0-1 knapsack problem is introduced.By optimizing it,a quick ant colony algorithm of solving 0-1 knapsack problem is presented.It greatly reduces the searching time of ant colony algorithm.It also effectively ameliorates the disadvantage of easily falling in local best of ant colony algorithm.When the number of article is big it also can obtain better effects.The simulation results show that the algorithm is more efficient.更多还原