A comparative study of discrete differential evolution on binary constraint satisfaction problems

There are some variants and applications of the discretization of differential evolution. Performances of discrete differential evolution algorithms on random binary constraint satisfaction problem are studied in this paper, and a novel discrete differential evolution algorithm based on exchanging elements is proposed. We compare the proposed discrete differential evolution, evolutionary algorithms and discrete particle swarm optimization on random binary constraint satisfaction problems. Experimental results indicate though the proposed algorithm is simpler, it is competitive with other evolutionary algorithms solving constraint satisfaction problems.

[1]  María Cristina Riff,et al.  Using the knowledge of the constraints network to design an evolutionary algorithm that solves CSP , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  Elena Marchiori,et al.  Combining Constraint Processing and Genetic Algorithms for Constraint Satisfaction Problems , 1997, ICGA.

[3]  Ling Wang,et al.  Multi-objective Flow Shop Scheduling Using Differential Evolution , 2006 .

[4]  Andreas C. Nearchou,et al.  Differential evolution for sequencing and scheduling optimization , 2006, J. Heuristics.

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

[6]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[7]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[8]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

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

[10]  B. Naudts,et al.  Swarm intelligence on the binary constraint satisfaction problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[11]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[12]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[13]  Barbara M. Smith,et al.  The Phase Transition and the Mushy Region in Constraint Satisfaction Problems , 1994, ECAI.

[14]  Ivan Zelinka,et al.  Mechanical engineering design optimization by differential evolution , 1999 .

[15]  Yuan Yan Tang,et al.  Multi-agent oriented constraint satisfaction , 2002, Artif. Intell..

[16]  Ling Wang,et al.  A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .

[17]  Ling Wang,et al.  Scheduling multi-objective job shops using a memetic algorithm based on differential evolution , 2008 .

[18]  Toby Walsh,et al.  Random Constraint Satisfaction: Theory Meets Practice , 1998, CP.

[19]  B.G.W. Craenen,et al.  Solving constraint satisfaction problems with evolutionary algorithms , 2005 .

[20]  M. Rojas,et al.  Using the knowledge of the constraints network to design an evolutionary algorithm that solves CSP , 1996 .

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

[22]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

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

[24]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..