Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-56217
Kasperovics, Romans; Böhlen, Michael Hanspeter; Gamper, Johann (2008). Representing Public Transport Schedules as Repeating Trips. In: TIME '08. 15th International Symposium on Temporal Representation and Reasoning, Montreal, QC, 16 June 2008 - 18 June 2008, 54-58.
PDF - Registered users only
View at publisher
The movement in public transport networks is organized according to schedules. The real-world schedules are specified by a set of periodic rules and a number of irregularities from these rules. The irregularities appear as cancelled trips or additional trips on special occasions such as public holidays, strikes, cultural events, etc. Under such conditions, it is a challenging problem to capture real-world schedules in a concise way. This paper presents a practical approach for modelling real-world public transport schedules. We propose a new data structure, called repeating trip, that combines route information and the schedule at the starting station of the route; the schedules at other stations can be inferred. We define schedules as semi-periodic temporal repetitions, and store them as pairs of rules and exceptions. Both parts are represented in a tree structure, termed multislice, which can represent finite and infinite periodic repetitions. We illustrate our approach on a real-world schedule and we perform in-depth comparison with related work.
1 download since deposited on 01 Jun 2012
0 downloads since 12 months
|Item Type:||Conference or Workshop Item (Paper), refereed, original work|
|Communities & Collections:||03 Faculty of Economics > Department of Informatics|
|Dewey Decimal Classification:||000 Computer science, knowledge & systems|
|Event End Date:||18 June 2008|
|Deposited On:||01 Jun 2012 15:30|
|Last Modified:||05 Apr 2016 15:26|
|Other Identification Number:||merlin-id:2301|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page