/Fall14-TravellingSalesmanProblem-SimulatedAnnealing-BranchAndBound

Implementation of the optimization meta-heuristic, "Simulated Annealing" to solve the travelling salesman problem for a large set of points. Includes cool visualization of the best route found so far as the algorithm progresses

Primary LanguagePython

TO RUN CLASS EXPERIMENTS:
	run experiments.py
		instructions at the bottom to turn visualizations on or off

TO RUN tsp225.txt PROBLEM:
	run LargeTSPProblem.py
		instructions at the bottom to turn visualizations on or off


TO RUN VISUALIZATIONS:
	run visualize_hill_climber.py
		allows you to customize some parameters

	also:
		both the experiments and the tsp225 probllem can be run with visualizations turned on or off