Genetic Algorithms + Data Structures = Evolution Programs
'What does your Master teach?' asked a visitor. 'Nothing,' said the disciple. 'Then why does he give discourses?' 'He only points the way - he teaches nothing.' Anthony de Mello, One Minute Wisdom During the last three decades there has been a growing interest...
Main Author: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1992, 1992
|
Edition: | 1st ed. 1992 |
Series: | Artificial Intelligence
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- I. Genetic Algorithms
- 1 GAs: What Are They?
- 2 GAs: How Do They Work?
- 3 GAs: Why Do They Work?
- 4 GAs: Selected Topics
- II. Numerical Optimization
- 5 Binary or Float?
- 6 Fine Local Tuning
- 7 Handling Constraints
- 8 Evolution Strategies and Other Methods
- III. Evolution Programs
- 9 The Transportation Problem
- 10 The Traveling Salesman Problem
- 11 Drawing Graphs, Scheduling, and Partitioning
- 12 Machine Learning
- Conclusions
- References