WEMAXA.COM Design · Development · AI · Available worldwide
Studio / Wemaxa 01
Status Active Location Worldwide Focus Web + AI Delivery Remote Response < 1 Business Day
AI Reference 026 Classical AI & Machine Learning Wikipedia guided Primary sources linked

Genetic Algorithms

Definition

Genetic algorithms are optimization methods inspired by evolutionary selection, iteratively varying and selecting candidate solutions according to a fitness function.

What is a genetic algorithm?

A genetic algorithm is an optimization method inspired by biological evolution. It maintains a population of candidate solutions, measures each candidate with a fitness function, and produces new candidates through selection, crossover and mutation.

How the search progresses

Candidates that score well are more likely to contribute to later generations. Crossover recombines parts of candidate representations, while mutation introduces random variation. Over many generations, the population can move toward better solutions.

Where genetic algorithms fit

John Holland helped formalize genetic algorithms in the 1960s and 1970s. They are useful when a problem has a large search space and a workable fitness function but no convenient gradient. They are optimization algorithms, not models that understand the problem in a human sense.

Related terms, defined

Reference guide and primary sources

Wikipedia is used here as a terminology and history reference guide. Current model versions, institutional statistics and product-specific claims are also linked to first-party or institutional sources because those details can change faster than encyclopedia articles.