Genetic Algorithms: Difference between revisions
Mr. MacKenty (talk | contribs) (Created page with "right|frame|Advanced programming<ref>http://www.flaticon.com/</ref> == Start here to understand genetic algorithms == == References == <referen...") |
Mr. MacKenty (talk | contribs) No edit summary |
||
| Line 5: | Line 5: | ||
== Start here to understand genetic algorithms == | == 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]] | |||
Revision as of 12: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