Abstract: The hybrid differential evolution for knapsack problem is proposed in this paper，and the detailed realization of the algorithm is illustrated.The algorithm utilizes two important strategies，i.e.heuristic greedy algorithms and the binary differential evolution.Some examples in other references are recomputed and both simulation results are compared.It can be found that the algorithm presented is very effective in solving knapsack problem，and is helpful for solving other discrete optimization problems.

摘要： 提出了一种用于求解0-1背包问题的混合差异演化算法，详细阐述了该算法求解背包问题的具体操作过程。算法主要使用了两个思想策略，即启发式贪婪算法和基于二进制编码的差异演化算法。通过对其它文献中仿真实例的计算和结果对比，表明该算法对求解0-1背包问题的有效性，这对差异演化算法解决其它离散问题会有些帮助。