Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A Superior Evolutionary Algorithm for 3-SAT
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Selection intensity in asynchronous cellular evolutionary algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Parallel hybrid method for SAT that couples genetic algorithms andlocal search
IEEE Transactions on Evolutionary Computation
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
The exploration/exploitation tradeoff in dynamic cellular genetic algorithms
IEEE Transactions on Evolutionary Computation
Image ordering by cellular genetic algorithms with TSP and ICA
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Structured population genetic algorithms: a literature survey
Artificial Intelligence Review
| Hi-index | 0.00 |
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work, we study the behavior of a large number of different cGAs when solving the well-known 3-SAT problem. These cellular algorithms differ in the policy of individuals update and the population shape, since these two features affect the balance between exploration and exploitation of the algorithm. We study in this work both synchronous and asynchronous cGAs, having static and dynamically adaptive shapes for the population. Our main conclusion is that the proposed adaptive cGAs outperform other more traditional genetic algorithms for a well known benchmark of 3-SAT.