Abstract: Owing to the superior performance on dealing with the complicated continuous problems， a binary differential evolution algorithm named BDEPM was proposed to solve 01 programming problem on account of characteristics of the 01 variables. Compared with discrete transform and logical operations， in the proposed method， the scaling factor was not required in the evolutionary process and binary mutation was directly carried out only on the basis of the differences between two individuals. The binary coded BDEPM algorithm was easy to understand， and it was implemented with a simple structure and less control parameters. A repair strategy based on quadratic greedy transform was put forward to handle the constraints when the BDEPM algorithm was applied to the solve 01 knapsack problems. Experimental results of two instances validated the superiority of the BDEPM algorithm.

Key words: parameterless mutation, binary code, differential evolution, 01 knapsack problem, quadratic greedy transform