Abstract
The Tube Challenge consists of visiting all stations of the London Underground in the least possible time. The competition started in 1959 and the current record was established in August 2013. This paper shows that under some simplifications, this problem and some of its variants can be cast as a Generalized Traveling Salesman Problem, as a Traveling Salesman Problem, as a Rural Postman Problem or as a Chinese Postman Problem defined on a directed graph.
Original language | English |
---|---|
Pages (from-to) | 10-13 |
Number of pages | 4 |
Journal | INFOR |
Volume | 52 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Feb 2014 |
Keywords
- Directed Chinese Postman Problem
- Directed Generalized Traveling Salesman Problem
- Directed Rural Postman Problem
- Directed Traveling Salesman Problem
- London Underground
- Tube Challenge
ASJC Scopus subject areas
- Signal Processing
- Information Systems
- Computer Science Applications