A cellular evolutionary algorithm to solve satisfiability problem
Clara Pizzuti, Giandomenico Spezzano · Dialnet (Universidad de la Rioja) · 1997
This paper presents a new evolutionary method for the satisfiability problem. It is based on a cellular genetic algorithm which performs a global search on random initial population of individuals and local selective generation of new strings according to new defined genetic operators. The algorithm adopts a diffusion model of information among chromosomes by realizing a two-dimensional cellular automata. Furthermore, the cellular algorithm is suitable for a direct parallel implementation.