Genetic Algorithm solution to Traveling-Salesman-Problem.
in this specific problem we have 7 nodes in partially connected graph. And want to find minimum cost path to visit all nodes and return to starting node.
Install dependencies by running following command:
pip install -r requirements.txt
python TSP.py
Here is final route distance with minimum cost 63 to visit all nodes and return to first place.
Amir Rezaei @ameerezae