Heuristic Algorithms for the Travelling Salesman Problem

Animations of two versions of a heuristic algorithm for the travelling salesman problem. These algorithms search for an approximate solution to the following question: what is the shortest possible route that passes through each of the state capitals of the contiguous U.S. exactly once and returns to its origin city? Created by Reed Harder.