Category:Genetic algorithms

A genetic algorithm (GA) is an algorithm used to find approximate solutions to difficult-to-solve problems through application of the principles of evolutionary biology to computer science. Genetic algorithms use biologically-derived techniques such as inheritance, mutation, natural selection, and recombination. Genetic algorithms are a particular class of evolutionary algorithms.

Pages in category "Genetic algorithms"

Additional recommended knowledge

Safe Weighing Range Ensures Accurate Results

Weighing the right way

Essential Laboratory Skills Guide

There are 20 pages in this section of this category.

* Genetic algorithm Fitness function C Chromosome (genetic algorithm) Crossover (genetic algorithm) Cultural algorithm D Defining length

E Edge recombination operator F Fitness proportionate selection G Genetic algorithm in economics Genetic operator H Holland's schema theorem M Mutation (genetic algorithm) N NeuroEvolution of Augmenting Topologies

Q Quality control and genetic algorithms S Selection (genetic algorithm) Speciation (genetic algorithm) Stochastic universal sampling Swapsc T Tournament selection W Weasel program