What is a Genetic Algorithm?
Last updated
Last updated
A genetic algorithm - specifically NSGA II - is a kind of optimization algorithm that is popular in generative design applications.
Genetic algorithms tend to be very useful when your objective function is highly complex, subject to randomness, or is discontinuous.
In technical terms, it is an example of an 'adaptive heuristic algorithm'. You might also hear it referred to as an 'evolutionary algorithm' - this is because genetic algorithms were inspired by the process of evolution by natural selection.
In a genetic algorithm, the 'fittest' individuals (or the potential solutions) from a 'population' of possible solutions are selected for reproduction and their 'genes' are passed on to future 'generations'.
In generative design processes, the _'_genes' are the parameters of our model. These are the values that drive our design and will either consist of a single value or a range of acceptable values.
A typical genetic algorithm has five phases:
Each of these phases repeats itself over generations (or iterations), where each iteration uses the data from the previous generation to inform the next.
