摘要：This work is focussed on the development and analysis of anew class of algorithms, called cellular memetic algorithms(cMAs), which will be evaluated here on the satisfiabilityproblem (SAT). For describing a cMA, we study the effects ofadding specific knowledge of the problem to the fitness func-tion, the crossover and mutation operators, and to the localsearch step in a canonical cellular genetic algorithm (cGA).Hence, the proposed cMAs are the result of including thesehybridization techniques in different structural ways into acanonical cGA. We conclude that the performance of the cGAis largely improved by these hybrid extensions. The accuracyand efficiency of the resulting cMAs are even better than thoseof the best existing heuristics for SAT in many cases
关键词：Cellular evolutionary algorithms; memetic algo-;rithms; SAT problem
