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.