Genetic Algorithms: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) |
||
| Line 5: | Line 5: | ||
== Start here to understand genetic algorithms == | == Start here to understand genetic algorithms == | ||
[[Brute force approach]] | * [[Brute force approach]] | ||
[[Combinatorial optimization]] | * [[Combinatorial optimization]] | ||
[[Computational intractability]] | * [[Computational intractability]] | ||
[[Convergence]] | * [[Convergence]] | ||
[[Crossover / crossover operator]] | * [[Crossover / crossover operator]] | ||
[[Elitism]] | * [[Elitism]] | ||
[[Exploration vs exploitation]] | * [[Exploration vs exploitation]] | ||
[[Fitness / fitness function / fitness landscape]] | * [[Fitness / fitness function / fitness landscape]] | ||
[[Heuristic]] | * [[Heuristic]] | ||
[[Hill climbing]] | * [[Hill climbing]] | ||
[[Initialization parameters | * [[Initialization parameters]] | ||
[[Local extrema]] | * [[Local extrema]] | ||
[[Mating pool]] | * [[Mating pool]] | ||
[[Mutation / mutation rate]] | * [[Mutation / mutation rate]] | ||
[[Novelty search]] | * [[Novelty search]] | ||
[[Offspring]] | * [[Offspring]] | ||
[[Optimization]] | * [[Optimization]] | ||
[[Population]] | * [[Population]] | ||
[[Premature convergence]] | * [[Premature convergence]] | ||
[[Problem space]] | * [[Problem space]] | ||
[[Ranking]] | * [[Ranking]] | ||
[[Roulette wheel selection]] | * [[Roulette wheel selection]] | ||
[[Selection strategy]] | * [[Selection strategy]] | ||
[[Simulated annealing]] | * [[Simulated annealing]] | ||
[[Stochastic universal sampling]] | * [[Stochastic universal sampling]] | ||
[[Termination condition]] | * [[Termination condition]] | ||
[[Tour]] | * [[Tour]] | ||
[[Tournament selection]] | * [[Tournament selection]] | ||
[[Truncation selection]] | * [[Truncation selection]] | ||
== References == | == References == | ||
Revision as of 11:27, 17 November 2020
Advanced programming[1]
Start here to understand genetic algorithms
- Brute force approach
- Combinatorial optimization
- Computational intractability
- Convergence
- Crossover / crossover operator
- Elitism
- Exploration vs exploitation
- Fitness / fitness function / fitness landscape
- Heuristic
- Hill climbing
- Initialization parameters
- Local extrema
- Mating pool
- Mutation / mutation rate
- Novelty search
- Offspring
- Optimization
- Population
- Premature convergence
- Problem space
- Ranking
- Roulette wheel selection
- Selection strategy
- Simulated annealing
- Stochastic universal sampling
- Termination condition
- Tour
- Tournament selection
- Truncation selection