Amazon.com: Evolutionary Algorithms: The Role of Mutation and Recombination (Natural Computing Series) (9783540669500): William M. Spears: Books


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Evolutionary Algorithms: The Role of Mutation and Recombination (Natural Computing Series)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Evolutionary Algorithms: The Role of Mutation and Recombination (Natural Computing Series) [Hardcover]

William M. Spears (Author)
4.0 out of 5 stars  See all reviews (2 customer reviews)

Price: $89.95 & this item ships for FREE with Super Saver Shipping. Details
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Tuesday, February 28? Choose One-Day Shipping at checkout. Details

Formats

Amazon Price New from Used from
Hardcover $89.95  
Paperback $89.95  

Book Description

July 26, 2000 Natural Computing Series
Despite decades of work in evolutionary algorithms, there remains an uncertainty as to the relative benefits and detriments of using recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates important prior work and introduces new theoretical techniques for studying evolutionary algorithms. Consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. The focus allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.

Product Details

  • Hardcover: 236 pages
  • Publisher: Springer; 1 edition (July 26, 2000)
  • Language: English
  • ISBN-10: 3540669507
  • ISBN-13: 978-3540669500
  • Product Dimensions: 9.5 x 6.4 x 0.7 inches
  • Shipping Weight: 1 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #4,034,426 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

2 Reviews
5 star:    (0)
4 star:
 (2)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (2 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

10 of 11 people found the following review helpful:
4.0 out of 5 stars Interesting. Very academic, June 12, 2001
By A Customer
This review is from: Evolutionary Algorithms: The Role of Mutation and Recombination (Natural Computing Series) (Hardcover)
This book is based on the author's PhD dissertation and it shows (you can download the dissertation from the web). There is page after page of mind numbing step-by-step derivations that do not add too much to the discussion. I would have enjoyed the book more if Spears had shortened some of his derivations. I found the results interesting. Although some of the conclusions seem fairly obvious after reading the book, I think it is important that someone took the time to come up with the mathematical models to formalize things.

The empirical approach is very interesting, and I wish more people would follow and improve on Spears' ideas. Empirical studies of evolutionary algorithms are justly critized for being too limited to a few "standard" functions that do not show much about the capabilities and limitations of the algorithms. Spears took a good step in emulating the machine learning comunity and using test problem generators. With these generators, the experimenters can play around with parameters such as the multimodality or noise in a problem and make systematic empirical studies of the algorithms. Unfortunately, it is difficult to translate from those systematic studies to real life. For example, how much noise or how many peaks are in real-life problems?

Still, I would recommend to go and read this book (or the free dissertation). Skip the equations, though, and get to the point.

BTW, Dr Gordon (the first reviewer) is married to Spears, which may explain some of the excitement in her review...

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


9 of 11 people found the following review helpful:
4.0 out of 5 stars Essential Reading on Evolutionary Algorithms, December 24, 2000
By 
Dr. Diana F. Gordon (Washington, D.C. USA) - See all my reviews
This review is from: Evolutionary Algorithms: The Role of Mutation and Recombination (Natural Computing Series) (Hardcover)
This book is an essential resource for anyone studying the theoretical underpinnings of evolutionary algorithms (EAs). The book very carefully analyzes the effects of two fundamental evolutionary operators, recombination and mutation, and their interaction with evolutionary selection. This analysis significantly enhanced my understanding of EAs because of the fundamental role that these operators play. The book begins with the more traditional static analysis approach, but soon it transitions to a very exciting dynamic analysis. Just as neurophysiologists have discovered that when studying the brain it helps to view it as a dynamic process, Spears illustrates how much better we can understand EAs when using dynamic models, such as the popular Markov chain model approach. One of the best parts of the book was the creative use of problem generators for empirically testing the theory and for characterizing the classes of problems for which each EA operator is more effective. This was exciting for two reasons. For one, it encourages EA researchers to break away from myopic use of the same old test suites. Secondly, the problem characterization has tremendous potential value for practical applications of EAs.

Another of my favorite parts of the book was Spears' novel algorithm for compressing Markov chains. I particularly liked the mathematical analysis, which was both elegant and clear. Because Markov chains are widely used, e.g., in operations research, control theory, and artificial intelligence, this compression algorithm has wide-reaching implications for reducing the complexity of modeling a variety of systems.

The intended audience for Spears' book is computer scientists, mathematicians, and biologists, as well as students of evolutionary processes. To make the book accessible to such a diverse audience, the presentation is exceptionally clear and devoid of excessive jargon and obscure mathematics. Only an undergraduate level math background is required. One thing that I found mildly distracting was the repetition between chapters. The reason for the repetition was to make the chapters as self-sufficient as possible. Nevertheless, I read the book as a continuous whole and for anyone who does this I recommend skimming or skipping over the redunant portions. If this is done, the reader can maintain a high level of interest.

In conclusion, because of the valuable insights I gleaned from this book I believe it should be required reading for anyone who wishes to gain a better understanding of evolution as simulated by EAs. Spears' rigorous analyses and lucid explanations make this a delightful book to read.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
Evolutionary computation uses computational models of evolutionary processes as key elements in the design and implementation of computer-based problem solving systems. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
uniform recombination, probability that the two parents, static schema analysis, epistatic problems, optimal allele, schema analyses, aggregation algorithm, distributional bias, differences between mutation, positional bias, exploratory power, population homogeneity, possible recombination events, perceived fitness, restricted mating, undergoing recombination, problem generator, defining length, static characterizations, defining positions, recombination operator, random problems, uniform equilibrium, column equivalent, hoc problems
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Defining Length Fourth-Order Hyperplanes, Defining Length Defining Length Fig, Defining Length Fifth-Order Hyperplanes, Sixth-Order Hyperplanes, Geiringer's Theorem, Building Block Eighth-Order Hyperplanes, Building Block Fig, Computation Time, Dynamic Model of Selection, Fuel System Turbo Valves Cylinders, Overview of Related Work, Building Block Order, Let Peq, The Multimodal Problem Generator
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject