An implementation of a research paper on using Genetic Algorithms (GAs) to solve the 0-1 Knapsack Problem (KP). The Knapsack Problem is an example of a combinatorial optimization problem, which seeks to maximize the benefit of objects in a knapsack without exceeding its capacity.
Resources:
- Dr. Amr S. Ghoneim
- Intro. to Artificial Intelligence (6 | PART A: Genetic Algorithms–Beyond Classical Search) in Arabic. https://youtu.be/AQ9rxieL2nQ
- Intro. to Artificial Intelligence (6 | PART B: Genetic Algorithms–Beyond Classical Search) in Arabic. https://youtu.be/VHLPiosJFfE
- GA-knapsack.pdf