The Tube Challenge involves searching for a solution to the Travelling Salesman Problem (TSP). Trying to solve the TSP using brute force techniques quickly runs into difficulties as the time required to search trough all sequences of city visits scales exponentially with the number of cities. Therefore I’ve removed as many cities (stations) as possible from the network without materially changing the layout. More details can be found on the page 2. Network Simplification within the Primary Data Gathering segment of the Project Plan.
Tube Challenge Blog >