Novel binary Differential Evolution without scale factor F

Differential Evolution is a competitive optimization technique over continuous space. The operation in the original Differential Evolution is simple, however, the mechanism, in the Differential Evolution makes it practically impossible to effectively use the original Differential Evolution to the binary space. A novel binary mutation operation was defined to enable the Differential Evolution to operate within the binary space. The new binary mutation works well in the binary space without the original scale factor F. Initial experimental results of three different sizes of knapsack problems and the One-Max problem indicate the effectiveness and validity of the binary Differential Evolution operating in binary space.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  R. W. Derksen,et al.  Differential Evolution in Aerodynamic Optimization , 1999 .

[3]  Amit Konar,et al.  Two-Dimensional IIR Filter Design with Modern Search Heuristics: a Comparative Study , 2006, Int. J. Comput. Intell. Appl..

[4]  Dexian Huang,et al.  Designing Neural Networks Using Hybrid Particle Swarm Optimization , 2005, ISNN.

[5]  Tao Gong,et al.  Differential Evolution for Binary Encoding , 2007 .

[6]  Andries Petrus Engelbrecht,et al.  Binary Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[7]  Chao Liu,et al.  A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem , 2009, 2009 International Association of Computer Science and Information Technology - Spring Conference.

[8]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..