This repository contains a collection of optimization problems solved using Genetic Algorithms (GA) in Python.
Each subfolder is a standalone project with its own explanation, implementation, and optional visualization.
| Project | Description |
|---|---|
| 🗺️ Travelling Salesman Problem (TSP) | Find the shortest tour visiting all cities once and returning to the start. |
| 👑 N-Queens Problem | Place N queens on an NxN board without attacking each other. |
| 🎒 0/1 Knapsack Problem | Choose a subset of items to maximize value within weight capacity. |
- Population Initialization
- Chromosome Encoding (permutation, binary, etc.)
- Fitness Function Design
- Crossover (one-point, uniform, etc.)
- Mutation
- Termination Criteria
This project is implemented in Jupyter Notebook.
git clone https://github.com/Saniadrn/Genetic-Algorithm-Projects.git