# Examples

This section contains some documented examples of common toy problems often encountered in the evolutionary computation community. Note that there are several other examples in the `deap/examples` sub-directory of the framework. These can be used as ground work for implementing your own flavour of evolutionary algorithms.

## Genetic Algorithm (GA)

- One Max Problem
- One Max Problem: Short Version
- One Max Problem: Using Numpy
- Knapsack Problem: Inheriting from Set
- Cooperative Coevolution
- Non-dominated Sorting Genetic Algorithm III (NSGA-III)

## Genetic Programming (GP)

- Symbolic Regression Problem: Introduction to GP
- Even-Parity Problem
- Multiplexer 3-8 Problem
- Artificial Ant Problem
- Spambase Problem: Strongly Typed GP

## Evolution Strategy (ES)

- Evolution Strategies Basics
- One Fifth Rule
- Covariance Matrix Adaptation Evolution Strategy
- Controlling the Stopping Criteria: BI-POP CMA-ES
- Plotting Important Data: Visualizing the CMA Strategy

## Particle Swarm Optimization (PSO)

- Particle Swarm Optimization Basics
- Moving Peaks Benchmark with Multiswarm PSO

## Estimation of Distribution Algorithms (EDA)

- Making Your Own Strategy : A Simple EDA