A binary differential evolution algorithm learning from explored solutions

Although real-coded differential evolution (DE) algorithms can perform well on continuous optimization problems (CoOPs), designing an efficient binary-coded DE algorithm is still a challenging task. Inspired by the learning mechanism in particle swarm optimization (PSO) algorithms, we propose a binary learning differential evolution (BLDE) algorithm that can efficiently locate the global optimal solutions by learning from the last population. Then, we theoretically prove the global convergence of BLDE, and compare it with some existing binary-coded evolutionary algorithms (EAs) via numerical experiments. Numerical results show that BLDE is competitive with the compared EAs. Further study is performed via the change curves of a renewal metric and a refinement metric to investigate why BLDE cannot outperform some compared EAs for several selected benchmark problems. Finally, we employ BLDE in solving the unit commitment problem (UCP) in power systems to show its applicability to practical problems.

[1]  Kalyanmoy Deb,et al.  Long Path Problems , 1994, PPSN.

[2]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[3]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[4]  Subhabrata Chakraborti,et al.  Nonparametric Statistical Inference , 2011, International Encyclopedia of Statistical Science.

[5]  Chun-Yin Wu,et al.  Topology optimization of structures using modified binary differential evolution , 2010 .

[6]  Andries Petrus Engelbrecht,et al.  Bare bones differential evolution , 2009, Eur. J. Oper. Res..

[7]  Ali Husseinzadeh Kashan,et al.  DisABC: A new artificial bee colony algorithm for binary optimization , 2012, Appl. Soft Comput..

[8]  Dilip Datta,et al.  A binary-real-coded differential evolution for unit commitment problem , 2012 .

[9]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part I: background and development , 2007, Natural Computing.

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

[11]  Amit Konar,et al.  Improving particle swarm optimization with differentially perturbed velocity , 2005, GECCO '05.

[12]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

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

[14]  Lin Han,et al.  A novel binary differential evolution algorithm based on artificial immune system , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[16]  BanksAlec,et al.  A review of particle swarm optimization. Part II , 2007 .

[17]  Ankit Pat,et al.  An adaptive quantum-inspired differential evolution algorithm for 0–1 knapsack problem , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).

[18]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications , 2008, Natural Computing.

[19]  A. Sima Etaner-Uyar,et al.  Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach , 2005, GECCO '05.

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

[21]  Ali Husseinzadeh Kashan,et al.  A novel differential evolution algorithm for binary optimization , 2012, Computational Optimization and Applications.

[22]  Ioannis T. Rekanos,et al.  Shape Reconstruction of a Perfectly Conducting Scatterer Using Differential Evolution and Particle Swarm Optimization , 2008, IEEE Transactions on Geoscience and Remote Sensing.

[23]  Ganesh K. Venayagamoorthy,et al.  Evolving Digital Circuits Using Hybrid Particle Swarm Optimization and Differential Evolution , 2006, Int. J. Neural Syst..

[24]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[25]  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).

[26]  Andries Petrus Engelbrecht,et al.  Binary differential evolution strategies , 2007, 2007 IEEE Congress on Evolutionary Computation.

[27]  Antonin Ponsich,et al.  Differential Evolution performances for the solution of mixed-integer constrained process engineering problems , 2011, Appl. Soft Comput..

[28]  Minrui Fei,et al.  A novel modified binary differential evolution algorithm and its applications , 2012, Neurocomputing.

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

[30]  Qingyun Yang,et al.  A comparative study of discrete differential evolution on binary constraint satisfaction problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[31]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.