Analyzing synchronous and asynchronous parallel distributed genetic algorithms
Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Proceedings of the 3rd International Conference on Genetic Algorithms
Fine-Grained Parallel Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Cellular Evolutionary Algorithms: Evaluating the Influence of Ratio
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
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 statistical study of a class of cellular evolutionary algorithms
Evolutionary Computation
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Hybrid Multi-population Collaborative Asynchronous Search
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Adaptive cellular memetic algorithms
Evolutionary Computation
Asynchronous evolutionary search: multi-population collaboration and complex dynamics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Selection intensity in asynchronous cellular evolutionary algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
| Hi-index | 0.00 |
This paper presents a comparative study of several asynchronous policies for updating the population in a cellular genetic algorithm (cGA). Cellular GA's are regular GA's with the important exception that individuals are placed in a given geographical distribution (usually a 2-d grid). Operators are applied locally on a set made of each individual and the surrounding neighbors, thus promoting intra-neighborhood exploitation and inter-neighborhood exploration of the search space. Here, we analyze the respective advantages and drawbacks of dealing with this decentralized population in the traditional synchronous manner or in several possible asynchronous update policies. Asynchronous behavior has proven to be better in many domains such as cellular automata and distributed GA's, which, in turn, is also the main conclusion of this work. We will undergo a structured analysis on a set of problems with different features in order to get well grounded conclusions.