Genetic algorithm

Core concepts and operators

At the center of a genetic algorithm are representations called chromosomes or genotypes (often bit strings, real-valued vectors, or structured encodings). A fitness function evaluates how well each individual solves the problem. The main operators that produce new candidates are:

• Selection — choosing individuals to reproduce based on fitness (tournament, roulette-wheel).
• Crossover — combining parts of two parents to create offspring, e.g. single-point or uniform crossover.
• Mutation — randomly altering genes to introduce novel variation; related to biological mutation.
• Replacement — deciding which individuals survive to the next generation.

Genetic algorithms also encode concepts analogous to inheritance, where offspring inherit traits from parents, and depend on careful parameter choices (population size, mutation rate, selection pressure) to perform well.

How they work (process)

1. Initialize a diverse population of candidate solutions.
2. Evaluate fitness of each candidate.
3. Select parents according to fitness-based rules.
4. Apply crossover and mutation to produce offspring.
5. Form a new population and repeat until a termination criterion is met (time, generations, or target fitness).

History and development

The formal study of genetic algorithms began in the 1960s and 1970s, most notably advanced by researchers such as John Holland. Over time the field broadened into many related methods (genetic programming, evolutionary strategies, differential evolution) that share the same evolutionary metaphor. Researchers have proposed many selection schemes and genetic operators to suit different problem domains.

Applications and examples

Genetic algorithms are applied to a wide variety of tasks: engineering design optimization, scheduling, routing, parameter tuning for machine learning models, symbolic regression and creative generation in art and music. They are particularly useful when the landscape is multimodal or discontinuous and classical gradient-based methods fail. Practical deployments often combine GAs with domain-specific knowledge and local search.

Strengths, limitations and variants

Strengths include global search capability, flexibility of representation, and robustness against noisy objective evaluations. Limitations are computational cost, stochastic results that require multiple runs, and sensitivity to parameter settings. Variants and hybrids—such as memetic algorithms or genetic programming—adapt the basic idea to different problem structures.

For further introductions and technical details see general references on optimization and evolutionary computation; background material and implementations are widely available for practitioners and researchers. Optimization texts and surveys provide practical guidance, while tutorial resources explain how to choose representations and operators.

Related concepts and resources: genetic algorithms, natural selection, evolutionary algorithms, inheritance, mutation, crossover, computer science, optimization.