|
![]() |
|||
|
||||
OverviewAs genetic algorithms (GAs) become increasingly popular, they are applied to difficult problems that may require considerable computations. In such cases, parallel implementations of GAs become necessary to reach high-quality solutions in reasonable times. But, even though their mechanics are simple, parallel GAs are complex non-linear algorithms that are controlled by many parameters, which are not well understood. This text is about the design of parallel GAs. It presents theoretical developments that improve our understanding of the effect of the algorithm's parameters on its search for quality and efficiency. These developments are used to formulate guidelines on how to choose the parameter values that minimize the execution time while consistently reaching solutions of high quality. The book can be read in several ways, depending on the readers' interests and their previous knowledge about these algorithms. Newcomers to the field should find the background material in each chapter useful to become acquainted with previous work, and to understand the problems that must be faced to design efficient and reliable algorithms. Potential users of parallel GAs that may have doubts about their practicality or reliability may be more confident after reading this book and understanding the algorithms better. Those who are ready to try a parallel GA on their applications may choose to skim through the background material, and use the results directly without following the derivations in detail. These readers will find that using the results can help them to choose the type of parallel GA that best suits their needs, without having to invest the time to implement and test various options. Once that is settled, even the most experienced users dread the long and frustrating experience of configuring their algorithms by trial and error. The guidelines contained herein should shorten dramatically the time spent tweaking the algorithm, although some experimentation may still be needed for fine-tuning. The text should be suitable as a secondary text for a graduate level Full Product DetailsAuthor: Erick Cantú-PazPublisher: Springer Imprint: Springer Edition: 2001 ed. Volume: 1 Dimensions: Width: 15.50cm , Height: 1.20cm , Length: 23.50cm Weight: 0.439kg ISBN: 9780792372219ISBN 10: 0792372212 Pages: 162 Publication Date: 30 November 2000 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1 Introduction.- 2 The Gambler’s Ruin and Population Sizing.- 3 Master-Slave Parallel Gas.- 4 Bounding Cases of Gas with Multiple Demes.- 5 Markov Chain Models of Multiple Demes.- 6 Migration Rates and Optimal Topologies.- 7 Migration and Selection Pressure.- 8 Fine-Grained and Hierarchical Parallel Gas.- 9 Summary, Extensions, and Conclusions.- References.Reviews`I urgently recommend that all readers interested in parallel genetic and evolutionary algorithms study this important book carefully and soon.' David Goldberg `I urgently recommend that all readers interested in parallel genetic and evolutionary algorithms study this important book carefully and soon.' David Goldberg I urgently recommend that all readers interested in parallel genetic and evolutionary algorithms study this important book carefully and soon.' David Goldberg Author InformationTab Content 6Author Website:Countries AvailableAll regions |