The question of whether machines can think... is about as relevant as the question of whether submarines can swim
Dijkstra
Comparison between a Non-AI and two AI techniques to solve the TSP. The non-AI technique used is a greedy algorithm. A Genetic algorithm and Simulated Annealing are the two intelligent techniques used to solve the NP-hard problem.
Please reference the Final_Results pdf for details on implementation and analysis of results.
To run type bash main.sh from the working directory of this project.
Each algorithm will output a graph to show the salesman's route.
This provides easy comparison of the three approaches.
In the command line output, all quantitative information is printed.
NOTE you must close the graph to move on to the next algorithm.