Parallel hybrid method for SAT that couples genetic algorithms and local search

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{Folino:2001:ieeeTEVC,

• author = "G. Folino and C. Pizzuti and G. Spezzano",
• title = "Parallel hybrid method for {SAT} that couples genetic algorithms and local search",
• journal = "IEEE Transactions on Evolutionary Computation",
• year = "2001",
• volume = "5",
• number = "4",
• pages = "323--334",
• month = aug,
• keywords = "genetic algorithms, genetic programming",
• ISSN = "1089-778X",
• DOI = "doi:10.1109/4235.942527",
• abstract = "A parallel hybrid method for solving the satisfiability (SAT) problem that combines cellular genetic algorithms (GAs) and the random walk SAT (WSAT) strategy of greedy SAT (GSAT) is presented. The method, called cellular genetic WSAT (CGWSAT), uses a cellular GA to perform a global search from a random initial population of candidate solutions and a local selective generation of new strings. The global search is then specialized in local search by adopting the WSAT strategy. A main characteristic of the method is that it indirectly provides a parallel implementation of WSAT when the probability of crossover is set to zero. CGWSAT has been implemented on a Meiko CS-2 parallel machine using a 2D cellular automaton as a parallel computation model. The algorithm has been tested on randomly generated problems and some classes of problems from the DIMACS and SATLIB test set",
• notes = "also lnown as \cite{942527}",

}

Genetic Programming entries for Gianluigi Folino Clara Pizzuti Giandomenico Spezzano

Citations