Practical Genetic Algorithms / Edition 2

Hardcover (Print)
Buy New
Buy New from BN.com
$119.70
Used and New from Other Sellers
Used and New from Other Sellers
from $59.95
Usually ships in 1-2 business days
(Save 52%)
Other sellers (Hardcover)
  • All (4) from $59.95   
  • New (2) from $103.02   
  • Used (2) from $59.95   

Overview

* This book deals with the fundamentals of genetic algorithms and their applications in a variety of different areas of engineering and science
* Most significant update to the second edition is the MATLAB codes that accompany the text
* Provides a thorough discussion of hybrid genetic algorithms
* Features more examples than first edition

Read More Show Less

Editorial Reviews

From the Publisher
"Statisticians and computing scientists will like this book very much and will benefit greatly from it." (Journal of Statistical Computation and Simulation, November 2005)

"…an excellent introduction to the world of optimization with its distinct vocabulary and tools." (Journal of the American Statistical Association, September 2005)

"I recommend it highly to anyone who is interested in trying to explore this powerful tool to optimization problems in his or her area of interest." (International Journal of General Systems, June 2005)

"…a nice step-by-step introduction to genetic algorithms (GA) which is specifically designed for practitioners…" (Journal of Intelligent & Fuzzy Systems, Vol. 16, No. 2, 2005)

"This book is very nice to read. It is ideal for some interesting evening study." (Technometrics, May 2005)

"…this book is a worthwhile addition to any course in optimization and/or Gas. It could also serve as a practical guide and template source for researchers…" (Computing Reviews.com, September 30, 2004)

Booknews
Per the glossary of this introductory text, a genetic algorithm (GA) is a type of computation that models the biological genetic process by including crossover and mutation operators. R. Haupt (electrical engineering, U. of Nevada, Reno) and S. Haupt (atmospheric and oceanic science, U. of Colorado, Boulder) explain GA parameters, applications, and trends in computer modeling of natural processes. Includes a list of symbols, and<-->rather than divorcing over which computer language codes to provide<-->pseudocodes for customizing GAs. Annotation c. by Book News, Inc., Portland, Or.
Read More Show Less

Product Details

  • ISBN-13: 9780471455653
  • Publisher: Wiley
  • Publication date: 8/27/2004
  • Edition description: REV
  • Edition number: 2
  • Pages: 272
  • Product dimensions: 6.46 (w) x 9.51 (h) x 0.82 (d)

Meet the Author

RANDY L. HAUPT, PhD, is Department Head and Senior Scientist at The Pennsylvania State University Applied Research Laboratory, State College, Pennsylvania.

SUE ELLEN HAUPT, PhD, is a Senior Research Associate in the Computational Mechanics Division of The Pennsylvania State University Applied Research Laboratory, State College, Pennsylvania.
Both Randy and Sue Ellen Haupt are renowned experts in the field of genetic algorithms in engineering and science applications.

Read More Show Less

Table of Contents

Preface.

Preface to First Edition.

List of Symbols.

1. Introduction to Optimization.

1.1 Finding the Best Solution.

1.2 Minimum-Seeking Algorithms.

1.3 Natural Optimization Methods.

1.4 Biological Optimization: Natural Selection.

1.5 The Genetic Algorithm.

2. The Binary Genetic Algorithm.

2.1 Genetic Algorithms: Natural Selection on a Computer.

2.2 Components of a Binary Genetic Algorithm.

2.3 A Parting Look.

3. The Continuous Genetic Algorithm.

3.1 Components of a Continuous Genetic Algorithm.

3.2 A Parting Look.

4. Basic Applications.

4.1 "Mary Had a Little Lamb".

4.2 Algorithmic Creativity-Genetic Art.

4.3 Word Guess.

4.4 Locating an Emergency Response Unit.

4.5 Antenna Array Design.

4.6 The Evolution of Horses.

4.7 Summary.

5. An Added Level of Sophistication.

5.1 Handling Expensive Cost Functions.

5.2 Multiple Objective Optimization.

5.3 Hybrid GA.

5.4 Gray Codes.

5.5 Gene Size.

5.6 Convergence.

5.7 Alternative Crossovers for Binary GAs.

5.8 Population.

5.9 Mutation.

5.10 Permutation Problems.

5.11 Selling GA Parameters.

5.12 Continuous versus Binary GA.

5.13 Messy Genetic Algorithms.

5.14 Parallel Genetic Algorithms.

6. Advanced Applications.

6.1 Traveling Salespersons Problem.

6.2 Locating an Emergency Response Unit Revisited.

6.3 Decoding a Secret Message.

6.4 Robot Trajectory Planning.

6.5 Stealth Design.

6.6 Building Dynamical Inverse Models-The Linear Case.

6.7 Building Dynamical Inverse Models-The Nonlinear Case.

6.8 Combining GAs with Simulations-Air Pollution Receptor Modeling.

6.9 Combining Methods Neural Nets with GAs.

6.10 Solving High-Order Nonlinear Partial Differential Equations.

7. More Natural Optimization Algorithms.

7.1 Simulated Annealing.

7.2 Particle Swarm Optimization (PSO).

7.3 Ant Colony Optimization (ACO).

7.4 Genetic Programming (GP).

7.5 Cultural Algorithms.

7.6 Evolutionary Strategies.

7.7 The Future of Genetic Algorithms.

Appendix I: Test Functions.

Appendix II: MATLAB Code.

Appendix III. High-Performance Fortran Code.

Glossary.

Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)