Travelling salesman problem
Videos
In the theory of computational complexity, the travelling salesman problem asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest poss
William Rowan Hamilton, c. 1850
Simulated annealing
Videos
Simulated annealing is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search spac
Travelling salesman problem
…optimal route for 700 to 800 cities. TSP is a touchstone for many general heuristics devised for combinatorial optimization such as genetic algorithms, simulated annealing, tabu search, ant colony optimization, river formation dynamics (see swarm intelligence), and the cross entropy method. This starts with a sub-tour…
Fast
Slow