Buy The Practical Handbook of Genetic Algorithms by Lance D. Chambers
close menu
Bookswagon
search
My Account
Home > Computer Science Books > Mathematical theory of computation > Maths for computer scientists > The Practical Handbook of Genetic Algorithms: Applications, Second Edition
The Practical Handbook of Genetic Algorithms: Applications, Second Edition

The Practical Handbook of Genetic Algorithms: Applications, Second Edition


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

The mathematics employed by genetic algorithms (GAs)are among the most exciting discoveries of the last few decades. From the construction of a simple GA through to advanced implementation, the Practical Handbook of Genetic Algorithms stands as a vital source of compiled knowledge from respected experts around the world.

But Volume I of this handbook does more than just describe GAs. Almost two hundred figures and numerous tables show how they should look and how they work. It offers extensive code lists in a number of languages-C++, Modl, QuickBasic, C, LISP, and many more. Because the book contains compiled knowledge from respected international experts, you gain confidence in the efficacy of the applications and code examples. An accompanying diskette is filled with codes that are ready to cut and paste, ready-to-run applications, and detailed descriptions of how each code can be implemented.

The Practical Handbook of Genetic Algorithms is an exciting introduction to the power of this approach to solving new and exciting problems faced in the real world. It presents an intriguing collection of GA applications that represent a wide area of undertakings in which genetic algorithms have proven to be of value. With the valuable software included, Volume 1 offers a comprehensive selection of hybrid methods for designing efficient and effective solutions for even the most complex problems.

Table of Contents:
Model Building, Model Testing, and Model Fitting
Uses of Genetic Algorithms
Quantitative Models
Analytical Optimization
Iterative Hill Climbing Technique Assay Continuity in a Gold Prospect
Genie: A First GA
Introduction
Genie
Code Examples
Similes and Space
Data Structures
Individuals
Genes
Chromosomes
Fitness
Populations
Data Structures
Search Strategies
Population Size and Convergence
Breeding
Search Termination
Search Histories
Solution Evaluation
After Genie
Dynamic Populations
Parallel Fitness Evaluation
Niching
Search Refinement
Robustness
Niche and Species Formation in Genetic Algorithms
Introduction
Motivation
Isolation by Distance
Panmictic Mating
Summary Conclusion
Construction of Neural Networks
Introduction
Merging Neural Networks and Genetic Algorithms
Evolutionary Growth Perceptrons
Types of Crossover Operators
Empirical Results
Co-Evolution of Populations
Summary
Crossover Operators
Source Code
Random Numbers
Array
Chromosome
Crossover
Which Operator to Use?
The Boltzmann Selection Procedure
Introduction
Empirical Analysis
Introduction to Boltzmann Selection
Theoretical Analysis
Discussion and Related Work
Conclusion
Optimal State Space Representation via Evolutionary Algorithms: Supporting Expensive Fitness Functions
Introduction to the Problem
Introduction to the Method
Algorithm Overview
The Code Framework
The Genome
New Member Generation
Diversity Enforcement
Reaction to Simulated Annealing
Stopping Conditions
Examples
Conclusions
Using LibGA to Develop Genetic Algorithms for Solving Combinatorial Optimization Problems
Introduction
Genetic Algorithms
Combinatorial Optimization
LibGA
Examples
Conclusions
LibGA Availability
Strategic Modeling Using a Genetic Algorithm Approach
Introduction
Structure of a Model
A Simulation
Graphs
Populations
The Menus
Model Window
Edit Menu
Window Menu
The Windows
Model Menu
Cross Impacts Dialog
Factor Attributes Dialog
Model Preferences Dialog
Graph Browser Window
Graph Window
Population Window
The Population Window
The Genetic Window
Population Limits Dialog
Meet The People Dialog
Defaults and Limits
Model Construction and Interpretation of Results
Western Australian Transport Model
GAs as Assistors in Transport Model
GAs as Assistors in Understanding Systems
Evolving Timetables
Introduction
Timetabling Problems
Genetic Algorithms
Some Possible Methods for GA-Based Timetabling
Some Investigation of the Three Approaches
Results on Some Real Problems
Speeding Things Up: Delta Evaluation
Investigating Further: Scope and Limitation
Strong Methods and Stronger GAs
Some Final Discussion
Applications of Genetic Algorithms in Chemical Engineering
Introduction
Case Study 1: Best Controller Synthesis using Qualitative Criteria
Case Study 2: Optimal Control of a Semi-Batch Reactor
Case Study 3: Optimization of Backmix Reactors in Series
Case Study 4: Solution of Lattice Model to Predict the Adsorption of Polymer Molecules
Comparison with Other Techniques
Conclusions
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Introduction
Three Fine-Grain Parallel GA Topologies
Future Directions
Locating Putative Protein Signal Sequences
Introduction
Implementation
Results of Sample Applications
Parametrization Study
Future Directions
Selection Methods for Evolutionary Algorithms
Fitness Proportionate Selection (FPS)
Windowing
Sigma Scaling
Linear Scaling
Sampling Algorithms
Ranking
Linear Ranking
Exponential Ranking
Tournament Selection
Genitor or Steady State Models
Evolution Strategy and Evolutionary Programming Methods
Evolution Strategy Methods
Top-n Selection
Evolutionary Programming Methods
The Effects of Noise
Conclusions
Parallel Cooperating Genetic Algorithms: An Application to Robot Motion Planning
Introduction
Principles of Genetic Algorithms
The Search Algorithm
The Explore Algorithm
The ARIADNE's CLEW Algorithm
Parallel Implementation
Conclusion, Results and Perspectives
Algorithms for Multidimensional Scaling
Introduction
Multidimensional Scaling Examined in More Detail
A Genetic Algorithm for Multidimensional Scaling Methods
Experimental Results
The Computer Program
Using the EXTEND Program
How to Apply Genetic Algorithms to Constrained Problems
Introduction
A CSP Perspective
A GA Point of View
Presentations, Operators and Fitness
Case Studies
Conclusions
Genetic Algorithms for Routing and Scheduling Problems
Scheduling Genetic Algorithms
The Traveling Salesperson Problem
Job Shop and Open Shop Scheduling Problems
The Linear Order Crossover for JSS and OSS Problems
Other Genetic Algorithm Scheduling Problems
Beneficial Effect of Intentional Noise in the Genetic Algorithm
Introduction
Noise Assignment Scheme in the Binary Representation Chromosome
Noise Assignment of GA for Design of a Control System
Analysis of Noise Effects in Genetic Algorithms
Conclusions
Evolving Behavior in Repeated 2-Player Games
Introduction
Game Theory
Evolutionary Game Theory
Implementing a GA
A GA for DFAs in the IPD
Artificial Neural Network Evolution: Learning to Steer a Land Vehicle
Overview
Introduction to Artificial Neural Networks
Introduction to ALVINN
The Evolutionary Approach
Task Specifics
Implementation and Results
Conclusions
Future Directions
Appendixes
ga-test.cfg
Frequently Asked Question
Crossover Code
GenAlg Code
Contributor Agreement


Best Sellers


Product Details
  • ISBN-13: 9780849325199
  • Publisher: Taylor & Francis Inc
  • Publisher Imprint: CRC Press Inc
  • Height: 235 mm
  • No of Pages: 568
  • Returnable: N
  • Weight: 998 gr
  • ISBN-10: 0849325196
  • Publisher Date: 27 Jun 1995
  • Binding: Hardback
  • Language: English
  • No of Pages: 568
  • Sub Title: Applications, Second Edition
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
The Practical Handbook of Genetic Algorithms: Applications, Second Edition
Taylor & Francis Inc -
The Practical Handbook of Genetic Algorithms: Applications, Second Edition
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

The Practical Handbook of Genetic Algorithms: Applications, Second Edition

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    Your IP: 216.73.217.9 IN