Efficient and accurate parallel genetic algorithms

From MaRDI portal





This book is about the design of parallel genetic algorithms and is based on the Ph. D. dissertation of the author. The book is organized into 9 chapters. The first chapter contains a brief introduction to Genetic Algorithms (GAs) and presents the tour common types of parallel GAs. Chapters 2 and 3 are about GA with single population. Chapter 2 deals with finding an appropriate population size for simple serial GAs and introduces an abstract model of GHs that will be used in the remainder of the book to study parallel GHs. Chapter 3 shows how to parallelize GAs using a simple master-slave algorithm and how to minimize its execution time. It may be mentioned that most of the book focusses on algorithms with multiple populations. Chapter 4 extends the population sizing theory of serial GAs to the parallel bounding cases and shows how to minimize the execution time while maintaining a constant target solution quality. Then, Chapter 5 uses Markov chains to analyze the long-term behaviour of communicating demes. Chapter 5 also introduces the first model for intermediate topologies. Chapter 6 finds approximate equations that capture the effects of the topology and migration rate on the quality and cost of multideme GAs. Chapter 7 studies how the individuals that migrate between populations may affect the speed of convergence of the algorithm. The controversial issue of superlinear speedups in parallel GAs is explored in this chapter. Chapter 8 describes how to minimize the execution time by allocating the available processors to combinations of demes and slaves. Finally, Chapter 9 contains a summary of results, recommendations for further research and the conclusions of this study.




Cited in
(55)








This page was built for publication: Efficient and accurate parallel genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4523517)