Genetic Algorithms
Advanced programming[1]
In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection[2]
- Please first review the characteristics of algorithms.
- Please then review the characteristics of heuristics.
The basic pattern of genetic algorithms[edit]
- A random set of solutions would be generated on the sample documents
- And tested against the human labelling
- Best fit solutions retained
- New generation created by mutating/crossing
- Algorithm repeated
- Until a good fit obtained
Use of genetic algorithms[edit]
- Click here for a fairly good list
- Click here for several good examples (scroll down)
- here are some short examples of GA
Some videos[edit]
Helpful resources[edit]
- This article is a good place to get started
- a good game: https://andymakes.itch.io/combat-genetics
- a better game to help you understand genetic algorithms: https://david-birge-cotte.itch.io/evolution-sandbox
Terms associated with genetic algorithms[edit]
- Brute force approach
- Computational intractability
- Convergence
- Crossover / crossover operator
- Elitism
- Fitness / fitness function / fitness landscape
- Heuristics
- Optimization
- Population
- Premature convergence
- Problem space
- Roulette wheel selection
- Selection strategy
- Simulated annealing
- Termination condition