Binary Encoding Differential Evolution with Application to Combinatorial Optimization Problem

Differential Evolution algorithm is a new competitive heuristic optimization algorithm in the continuous field. The operators in the original Differential Evolution are simple; however, these operators make it impossible to use the Differential Evolution in the binary space directly. Based on the analysis of problems led by the mutation operator of the original Differential Evolution in the binary space, a new mutation operator was proposed to enable this optimization technique can be used in binary space. The new mutation operator, which is called semi-probability mutation operator, is a combination of the original mutation operator and a new probability-based defined operator. Initial experimental results of two different combinatorial optimization problems show its effectiveness and validity.

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

[2]  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.

[3]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  Bingyan Zhao,et al.  Novel binary Differential Evolution without scale factor F , 2010, Third International Workshop on Advanced Computational Intelligence.

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

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

[7]  Swagatam Das,et al.  Automatic Clustering Using an Improved Differential Evolution Algorithm , 2007 .