Advanced models of cellular genetic algorithms evaluated on SAT

Cellular Genetic Algorithms

“…Although our aim was not to obtain techniques able to compete with specialized heuristics of the state of the art, the results clearly show that cEAs are very efficient optimization techniques that can be improved even more by hybridizing them with local search techniques [14,15,16,92]. The results of the test problems clearly confirm, with some little exceptions, that the capacity of these algorithms for solving the problems by using different ratios and update policies is directly related to the selection pressure of the algorithms, showing that exploitation plays a very important role in the search.…”

“…1.10. Larger neighborhoods induce a higher level of implicit migration 16 1 Introduction to Cellular Genetic Algorithms A cEA can be seen as a cellular automaton (CA) [264] with probabilistic rewritable rules, where the alphabet of the CA is equivalent to the potential set of chromosomes in the search space [245,259], that is, to the potential number of solutions to the problem. Hence, if we see cEAs as a kind of CA, it is possible to import analytic tools and existing models and proposals from the field of CAs to cEAs in order to better understand these structured EAs and to improve their performance.…”

“…Additionally, two different ways of embedding local search have been analyzed: (i) a computationally light local search step applied to every individual, or (ii) an in depth exploitation local search step applied with a low probability. The numerical work is an extension to [15,16], including a preliminary study justifying the algorithms used plus a comparison of our results versus those of other well-known algorithms in the literature (a must in effective research).…”

Operadores de mutación en algoritmos genéticos celulares aplicados a problemas continuos

“…Un cGA es un tipo de Algoritmo Genético, basado en una clase de población descentralizado en el que las soluciones tentativas evolucionan en barrios superpuestos [3], [4] . En un cGA, conceptualmente los individuos son situados en una malla toroidal bidimensional (normalmente es bidimensional, aunque el número de dimensiones puede ser extendido fácilmente a tres o más), y se les permite recombinarse con individuos cercanos.…”

A Simple Cellular Genetic Algorithm for Continuous Optimization

“…This endows the cGA with useful properties for the optimization [2] and also facilitates a parallel implementation because of its inherent parallel design [3], [4]. In recent years, cGAs have been successfully applied to very complex (NP-hard) combinatorial optimization problems such as the Vehicle Routing (VRP) and the Satisfiability (SAT) problems [5], [6], becoming part of the state-ofthe-art algorithms for those problems. Additionally, really competitive results have been also reported by cGAs for other problems belonging to a number of different fields such as logistics, telecommunications, scheduling, or academic, Enrique Alba and Bernabé Dorronsoro are with the Department of Languages and Computer Science, University of Málaga, Málaga, Spain (emails: bernabe,eat@lcc.uma.es).…”