Cellular memetic algorithms evaluated on SAT

In this work, we study the behavior of several cellular memetic algorithms (cMAs) when solving the satisfiability problem (SAT). The proposed cMAs are the result of including hybridization techniques in different structural ways into a canonical cellular genetic algorithm (cGA). Specifically, we hybridize our cGA with problem dependent recombination and mutation operators, as well as with three local search methods. Furthermore, two different policies for applying the local search methods are proposed. An adaptive fitness function (SAW), specifically designed for SAT, has been used for the evaluation of the individuals. Our conclusion is that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Jens Gottlieb,et al.  Improving the Performance of Evolutionary Algorithms for the Satisfiability Problem by Refining Functions , 1998, PPSN.

[3]  Thomas Bäck,et al.  A Superior Evolutionary Algorithm for 3-SAT , 1998, Evolutionary Programming.

[4]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[5]  Raymond Reiter,et al.  A Logical Framework for Depiction and Image Interpretation , 1989, Artif. Intell..

[6]  Jens Gottlieb,et al.  Representations, Fitness Functions and Genetic Operators for the Satisfiability Problem , 1997, Artificial Evolution.

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[9]  Enrique Alba,et al.  Improving flexibility and efficiency by adding parallelism to genetic algorithms , 2002, Stat. Comput..

[10]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[11]  Enrique Alba,et al.  The exploration/exploitation tradeoff in dynamic cellular genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[12]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[13]  Enrique Alba,et al.  Decentralized Cellular Evolutionary Algorithms , 2005, Handbook of Bioinspired Algorithms and Applications.

[14]  Elena Marchiori,et al.  An adaptive evolutionary algorithm for the satisfiability problem , 2000, SAC '00.

[15]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Elena Marchiori,et al.  Evolutionary Algorithms for the Satisfiability Problem , 2002, Evolutionary Computation.

[18]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[19]  Pablo Moscato,et al.  Memetic Algorithms , 2007, Handbook of Approximation Algorithms and Metaheuristics.