In book: "Shell Structures for Architecture - Form finding and optimization", (pp.290-294). Chapter: Appendix C. Publisher: Routledge. Editors: Sigrid Adriaenssens, Philippe Block, Diederik Veenendaal, Chris Williams. Genetic algorithms are a subclass of evolutionary algorithms. A genetic algorithm (GA) is defined by Goldberg as a “search algorithm based on the mechanics...
[More] In book: "Shell Structures for Architecture - Form finding and optimization", (pp.290-294). Chapter: Appendix C. Publisher: Routledge. Editors: Sigrid Adriaenssens, Philippe Block, Diederik Veenendaal, Chris Williams.
Genetic algorithms are a subclass of evolutionary algorithms. A genetic algorithm (GA) is defined by Goldberg as a “search algorithm based on the mechanics of natural selection and natural genetics”, but another definition, more focused on its way of functioning, is provided by John R. Koza in his 1992 book, “Genetic programming: On the Programming of Computers by Means of Natural Selection”: “The GA is a highly parallel mathematical algorithm that transforms a set (population) of individual mathematical objects [...], each with an associated fitness value, into a new population (i.e. the next generation) using operations patterned after the Darwinian principle of reproduction and survival of the fittest and after naturally occurring genetic operations (notably sexual recombination)”. In other words, in a random population of potential solutions, the best individuals are favoured and combined in order to create better individuals at the nextgeneration.
[Less]