Advanced models of cellular genetic algorithms evaluated on SAT
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Emergent mating topologies in spatially structured genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Anisotropic selection in cellular genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An analysis of the effects of population structure on scalable multiobjective optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Peer-to-peer evolutionary algorithms with adaptive autonomous selection
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The influence of scaling and assortativity on takeover times in scale-free topologies
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Examining the Effect of Elitism in Cellular Genetic Algorithms Using Two Neighborhood Structures
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Expert Systems with Applications: An International Journal
Use of Local Ranking in Cellular Genetic Algorithms with Two Neighborhood Structures
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Adaptive cellular memetic algorithms
Evolutionary Computation
Computers and Operations Research
Underdominance, multiscale interactions, and self-organizing barriers to gene flow
Journal of Artificial Evolution and Applications - Special issue on artificial evolution methods in the biological and biomedical sciences
Evolutionary dynamics on scale-free interaction networks
IEEE Transactions on Evolutionary Computation
Optimal contraction theorem for exploration-exploitation tradeoff in search and optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Distributed differential evolution with explorative---exploitative population families
Genetic Programming and Evolvable Machines
A distributed cellular GA based architecture for real time GPS attitude determination
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multiobjective evolutionary algorithms on complex networks
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Design issues in a multiobjective cellular genetic algorithm
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
The effects of heterogeneity on asynchronous panmictic genetic search
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
A comparative study of the multi-objective optimization algorithms for coal-fired boilers
Expert Systems with Applications: An International Journal
Polynomial selection scheme with dynamic parameter estimation in cellular genetic algorithm
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Theory and practice of cellular UMDA for discrete optimization
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A simulated annealing method based on a specialised evolutionary algorithm
Applied Soft Computing
Ockham's Razor in memetic computing: Three stage optimal memetic exploration
Information Sciences: an International Journal
Sexual recombination in self-organizing interaction networks
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
From cells to islands: an unified model of cellular parallel genetic algorithms
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Hierarchical cellular genetic algorithm
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Step length adaptation by generalized predictive control
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
An evaluation of cellular population model for improving quantum-inspired evolutionary algorithm
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Dynamic Fault-Tolerant three-dimensional cellular genetic algorithms
Journal of Parallel and Distributed Computing
Cellular genetic algorithms without additional parameters
The Journal of Supercomputing
Exploration and exploitation in evolutionary algorithms: A survey
ACM Computing Surveys (CSUR)
A scale-rate filter selection method in the spectro-temporal domain for phoneme classification
Computers and Electrical Engineering
International Journal of Metaheuristics
Advances in Engineering Software
Hi-index | 0.00 |
This paper studies static and dynamic decentralized versions of the search model known as cellular genetic algorithm (cGA), in which individuals are located in a specific topology and interact only with their neighbors. Making changes in the shape of such topology or in the neighborhood may give birth to a high number of algorithmic variants. We perform these changes in a methodological way by tuning the concept of ratio. Since the relationship (ratio) between the topology and the neighborhood shape defines the search selection pressure, we propose to analyze in depth the influence of this ratio on the exploration/exploitation tradeoff. As we will see, it is difficult to decide which ratio is best suited for a given problem. Therefore, we introduce a preprogrammed change of this ratio during the evolution as a possible additional improvement that removes the need of specifying a single ratio. A later refinement will lead us to the first adaptive dynamic kind of cellular models to our knowledge. We conclude that these dynamic cGAs have the most desirable behavior among all the evaluated ones in terms of efficiency and accuracy; we validate our results on a set of seven different problems of considerable complexity in order to better sustain our conclusions.