Abstract: Ant colony algorithm is analyzed and optimized in this article.A new solving 0-1 knapsack problem algorithm,Multi-dimension 0-1 Knapsack Problem Ant Colony Algorithm（MKPACA）,is put forward.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.The simulation results show that the algorithm is more efficient.

摘要： 系统地阐述了蚁群算法,并对它进行改进、优化。将蚁群算法应用于求解多维0-1背包问题,提出一种求解多维0-1背包问题的算法——多维0-1背包问题蚁群算法。它大大减少了蚁群算法的搜索时间,有效改善了蚁群算法易于过早地收敛于非最优解的缺陷。仿真实验取得了较好的结果。