Binary Differential Evolution algorithm with new mutation operator

Differential Evolution (DE) algorithm is well known real parameter optimization method and has been successfully applied in many different fields. The operators used in DE are simple, however, the mechanism in which the operators are defined, makes it impossible to apply the standard DE to combinatorial problems directly. A novel binary DE was proposed to extend DE to solve binary space optimization problems. New mutation rules based on knowledge was used to guide the mutation operator. Initial experiment results indicate the effectiveness of the new mutation operator and feasibility of DE operating in binary space.