Haupt Randy L., Haupt Sue Ellen. Practical genetic algorithms

2nd ed. — 1998. — 253 p.Introduction to Optimization
Finding the Best Solution
What Is Optimization?
Root Finding versus Optimization
Categories of Optimization
Minimum-Seeking Algorithms
Exhaustive Search
Analytical Optimization
Nelder-Mead Downhill Simplex Method
Optimization Based on Line Minimization
Natural Optimization Methods
Biological Optimization: Natural Selection
The Genetic Algorithm
The Binary Genetic Algorithm
Genetic Algorithms: Natural Selection on a Computer
Components of a Binary Genetic Algorithm
Selecting the Variables and the Cost
Variable Encoding and Decoding
The Population
Natural Selection
Selection
Mating
Mutations
The Next Generation
The Continuous Genetic Algorithm
Components of a Continuous Genetic Algorithm 52
The Example Variables and Cost Function 52
Variable Encoding, Precision, and Bounds 53
Initial Population
Natural Selection
Pairing
Mating
Mutations
The Next Generation
Basic Applications
An Added Level of Sophistication
Advanced Applications
More Natural Optimization Algorithms