| Summary: | CELLULAR GENETIC ALGORITHMS defines a new class of optimization algorithms based on the concepts of structured populations and Genetic Algorithms (GAs). The authors explain and demonstrate the validity of these cellular genetic algorithms throughout the book. This class of genetic algorithms is shown to produce impressive results on a whole range of domains, including complex problems that are epistatic, multi-modal, deceptive, discrete, continuous, multi-objective, and random in nature. The focus of this book is twofold. On the one hand, the authors present new algorithmic models and extensions to the basic class of Cellular GAs in order to tackle complex problems more efficiently. On the other hand, practical real world tasks are successfully faced by applying Cellular GA methodologies to produce workable solutions of real-world applications. These methods can include local search (memetic algorithms), cooperation, parallelism, multi-objective, estimations of distributions, and self-adaptive ideas to extend their applicability. The methods are benchmarked against well-known metaheutistics like Genetic Algorithms, Tabu Search, heterogeneous GAs, Estimation of Distribution Algorithms, etc. Also, a publicly available software tool is offered to reduce the learning curve in applying these techniques. The three final chapters will use the classic problem of "vehicle routing" and the hot topics of "ad-hoc mobile networks" and "DNA genome sequencing" to clearly illustrate and demonstrate the power and utility of these algorithms
|
|---|