Dynamic Fault-Tolerant three-dimensional cellular genetic algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Cellular Genetic Algorithms (cGAs) have shown their ability to solve not only difficult optimization problems, but also outperform centralized Genetic Algorithms (GAs) in terms of efficiency and efficacy. The study herein presented aims to analyze and compare 2D and 3D cellular GAs, while maintaining in general their configuration constraints such as population size, neighbourhood radius, local selection method, replacement polices, among others. A primary objective of this paper is to provide a wide insight into the advantages of increasing cellular dimensionality for future development of 3D adaptive optimization engine architectures.