Skip to content

Implementation with python3 of the genetic algorithm that can approximately solve traveling salesman problem

Notifications You must be signed in to change notification settings

vtakdeniz/TSP-Genetic-Algorithm

Repository files navigation

TSP-Genetic-Algorithm

This project utilizes the fundamentals of genetic algorithm to approximately solve the traveling salesman problem. The project also draws the best route in the current generation it is at and prints the information to the standard output. All the variables like mutation chance, mutation rate, crossover chance, drawing interval, printing to console interval etc. are all customizable and can be changed from constants.json file.

How to install and use ?

Install python dependencies after changing the working directory to project folder with the command ;

pip install -r requirements.txt

After changing the constants from the constants.json file as you wish, start the project with the command ;

python3 cli.py

About

Implementation with python3 of the genetic algorithm that can approximately solve traveling salesman problem

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages