Tabu search on a small TSP

About this app

The seven-city example from Hillier and Lieberman, iteration by iteration: all neighbours with their length, which ones are tabu, the chosen move and the tabu list of links. The search climbs from the local optimum 64 to 66 and then finds the optimum 63.

Subject: Operations research: DP & heuristics

More from Operations research: DP & heuristics

• Vehicle routing step by step
• TSP heuristics
• TSP-Metaheuristiken live

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps