Intelligent Systems II · TEE · read-chapter
3. Genetic algorithms
Candidate → fitness → encoding → selection → crossover → mutation → two complete generations.
- GA meaning, biological idea and every basic term
- Encoding: binary, real values and permutations
- Roulette selection, cumulative intervals and alternatives
- Crossover and mutation: four complete worked variants
- GA architecture, two-generation flow, constraints and theory
- Two generations with given selection, cut and mutation
- Two generations including roulette selection
- GA minimisation: transform cost before roulette selection