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

Python