A simple yet extensible Genetic Algorithm (GA) solver for the Traveling Salesman Problem (TSP) written in Python.
It uses tournament selection, order crossover (OX), swap mutation, and elitism.
You can plug in your own points from data/points.json or use the default 10-city se
OzanDuru/tsp-genetic-algorithm-python
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|