Binary Differential Evolution

The ability of differential evolution (DE) to perform well in continuous-valued search spaces is well documented. The arithmetic reproduction operator used by differential evolution is simple, however, the manner in which the operator is defined, makes it practically impossible to effectively apply the standard DE to other problem spaces. An interesting and unique mapping method is examined which will enable the DE algorithm to operate within binary space. Using angle modulation, a bit string can be generated using a trigonometric generating function. The DE is used to evolve the coefficients to the trigonometric function, thereby allowing a mapping from continuous-space to binary-space. Instead of evolving the higher-dimensional binary solution directly, angle modulation is used together with DE to reduce the complexity of the problem into a 4-dimensional continuous-valued problem. Experimental results indicate the effectiveness of the technique and the viability for the DE to operate in binary space.

[1]  Riccardo Poli,et al.  Particle Swarm Optimisation , 2011 .

[2]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[3]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

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

[5]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[6]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization approaches to coevolve strategies for the iterated prisoner's dilemma , 2005, IEEE Transactions on Evolutionary Computation.

[7]  Mitchell A. Potter,et al.  The design and analysis of a computational model of cooperative coevolution , 1997 .

[8]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Charles E. Taylor Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[10]  N. Franken,et al.  Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[11]  Cornelis J. Franken,et al.  PSO-based coevolutionary Game Learning , 2004 .

[12]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.