Abstract: A new hybrid algorithm which inspired from Ant Colony Algorithm（ACA） and Antibody Immune Clonal Algorithm （AICA） to tackle 0-1 knapsack problem is proposed.It takes full advantages of the ability of searching and the diversity which provided respectively.Some parameters of the algorithm and the comparison with other algorithms have been performed.The experimental results show that the proposed algorithm is a perfect hybrid algorithm with higher performance.

摘要： 该文汲取了蚁群算法（ACA）和抗体免疫克隆算法（AICA）的优点，提出了一种求解0-1背包问题的混合型算法，该算法充分利用了前者的搜索能力和后者的种群多样性。仿真实验对算法的部分参数进行了分析，并与其他文献的算法进行比较，结果表明，该算法是一种具有较高性能的混合优化算法。