An optimization algorithm inspired by natural selection, evolving solutions over generations.A genetic algorithm is an optimization technique that mimics biological evolution to find solutions to complex problems. It starts with a population of candidate solutions, evaluates their 'fitness' against a goal, then breeds new candidates by combining and mutating the best performers — iterating over many generations until a good solution emerges. It's particularly useful for problems where the search space is vast and traditional methods struggle, such as designing antennas, scheduling tasks, or tuning machine learning models.
The genetic algorithm was pioneered by John Holland in the 1960s and formalized in his 1975 book 'Adaptation in Natural and Artificial Systems.' It gained popularity in the 1980s as computing power grew.
Each solution is encoded as a 'chromosome' (e.g., a string of parameters). The algorithm repeatedly applies three operations: selection (choose the fittest), crossover (mix parts of two parents), and mutation (randomly tweak a child). Over generations, the population converges toward high-fitness solutions. The key is balancing exploration (mutation) and exploitation (selection). Unlike gradient-based methods, it doesn't require derivatives, making it robust for discontinuous or noisy landscapes.
Genetic algorithms are used in engineering design (e.g., optimizing aircraft wings), financial modeling, and even in evolving neural network architectures.
NASA used a genetic algorithm to design a satellite antenna that was flown on the Space Technology 5 mission — the resulting shape was so odd that no human engineer would have conceived it.
















