Application of differential evolution algorithm for solving discounted {0–1} knapsack problem

Knapsack problem is a classical problem in combinatorial optimization. This paper first introduces the basic concepts of discount {0-1} knapsack problem and differential evolution algorithm, the improved differential evolution discount {0-1} knapsack problem algorithm for solving large scale data, and combined with the dynamic programming algorithm to verify its correctness. Simulation results show that this method can obtain the best solution with the highest fitness.