Modified Dynamic Differential Evolution for 0-1 Knapsack Problems

A modified dynamic differential evolution was proposed for discrete optimization. Based on the new framework of dynamic differential evolution, two additional operators were used to extend the dynamic differential evolution to the field of discrete optimization. The first operator was the mapping operator, which could map the continuous value into zero or one. The other new operator was the boundary constraints handling operator, which ensured the results gotten by the mutation operation fall in some range. The results of the simulation on four different sizes of the knapsack problems show it is efficient and effective way for solving 0-1 knapsack problems.