GitHub - rehpotsirhc/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

rehpotsirhc / Fall14-TravellingSalesmanProblem-SimulatedAnnealing-BranchAndBound Public

Notifications You must be signed in to change notification settings
Fork 0
Star 4

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

4 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
src		src
.gitattributes		.gitattributes
.gitignore		.gitignore
Design.docx		Design.docx
README.txt		README.txt
tsp100.txt		tsp100.txt
tsp225.txt		tsp225.txt
tsp30.txt		tsp30.txt

Repository files navigation

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