Genetic Algorithm: Fitness Evolution in 2D

What is a Genetic Algorithm?

A genetic algorithm (GA) is a search heuristic inspired by the process of natural selection. It uses mechanisms such as reproduction, mutation, and recombination to evolve populations of candidate solutions over successive generations.

GAs are widely used in optimization problems where traditional algorithms struggle due to complex or non-convex solution spaces.

How Does Fitness Evolution Work?

In a genetic algorithm, each individual in the population is evaluated based on its fitness function, which measures how well it solves the problem at hand. Individuals with higher fitness are more likely to be selected for reproduction and contribute to the next generation.

Through operations like crossover (uniform crossover) and mutation (Gaussian), new individuals are created, leading to a gradual improvement in the population's overall fitness over generations.

live demo · related simulation● LIVE

Why Does It Matter?

Genetic algorithms are valuable for solving complex optimization problems that are difficult or impossible to solve with traditional methods. They can be applied in fields such as engineering, economics, and artificial intelligence.

The ability of GAs to explore a large solution space efficiently makes them particularly useful for scenarios where the search space is vast and non-linear.

Real-World Applications

Genetic algorithms have been used in various applications, including scheduling problems, design optimization, and even in training neural networks. For example, they can optimize the layout of circuit boards to minimize signal interference.

In bioinformatics, GAs are employed to predict protein structures or to identify patterns in genetic data.

Frequently asked questions

How does crossover work in a genetic algorithm?

Crossover involves combining parts of two parent genomes to create offspring. In uniform crossover, each gene is randomly chosen from one of the parents with equal probability, while in other methods, segments are swapped between parents.

What is mutation and why is it important?

Mutation introduces small random changes into an individual's genome to maintain diversity within the population. It helps prevent premature convergence to suboptimal solutions by introducing new genetic material.

Can a genetic algorithm get stuck in local optima?

Yes, genetic algorithms can sometimes converge to local optima rather than finding the global optimum. Techniques like elitism (keeping the best individuals unchanged) and increasing mutation rates can help mitigate this issue.

How does selection affect the evolution process?

Selection determines which individuals are more likely to reproduce based on their fitness. Methods like tournament selection involve comparing a few random individuals, while roulette-wheel selection uses probabilities proportional to fitness values.

Try it live

Everything above runs in your browser — open Genetic Algorithm — Fitness Evolution (2D) and change the parameters while it is running. Nothing is installed, nothing is uploaded, the whole model lives in one tab.

▶ Open Genetic Algorithm — Fitness Evolution (2D) simulation