Optimization Online


Tubechallenges: Can OR help break records?

Efstratios Rappos (rappos***at***ortrivia.com)

Abstract: Several 'tubechallenges' have been attempted on the London Underground network, often gaining vast press coverage. The most famous of them consists of trying to travel to all 275 stations of the London Underground network (known as 'the tube') in the shortest possible time. In this article we examine how Operational Research can assist potential record-breakers, by formulating this complex optimisation problem as an integer programming model and trying to establish the optimal route that one has to follow, taking into consideration as many route constraints as possible.

Keywords: routing, scheduling, traveling salesman, London subway system

Category 1: Applications -- OR and Management Sciences (Other )


Download: [Postscript]

Entry Submitted: 04/13/2005
Entry Accepted: 04/21/2005
Entry Last Modified: 04/13/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society