DMCA
Timetable information updating in case of delays: Modeling issues (2008)
| Citations: | 4 - 2 self |
BibTeX
@TECHREPORT{Delling08timetableinformation,
author = {Daniel Delling and Kalliopi Giannakopoulou and Dorothea Wagner and Christos Zaroliagis},
title = {Timetable information updating in case of delays: Modeling issues},
institution = {},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. The timetable information problem can be solved by computing shortest paths in special graphs built from timetable data. In general, two models exist: the time-dependent and time-expanded network. In a recent work, both models are compared with respect to advantages and disadvantages on a theoretical and a practical framework. In addition, an extensive experimental evaluation reveals further differences with respect to query performance. However, delays – which occur very frequently in railway systems – are not covered. In this work, we show how the time-dependent and the time-expanded models should be updated in order to capture delays. It turns out that delays can be incorporated in the time-dependent model without changing the topology of the network. This is not true for the time-expanded model, whose updating involves a (sometimes large) sequence of edge insertions, deletions, and cost modifications. 1
Keyphrases
timetable information updating modeling issue time-expanded model time-expanded network timetable information problem time-dependent model cost modification capture delay timetable data extensive experimental evaluation reveals edge insertion special graph railway system practical framework recent work
