This repository shows how to apply genetic algorithms to well known combinatorial problems:
- One Max problem
- Knapsack problem
The GA are first built from scratch and then using the DEAP library.
See also DEAP Documentation and specially Examples using DEAP