Results 1  10
of
131
Engineering TimeExpanded Graphs for Faster Timetable Information
, 2009
"... We present an extension of the wellknown timeexpanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speedup techniques ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We present an extension of the wellknown timeexpanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed
Engineering GraphBased Models for Dynamic Timetable Information Systems
, 2014
"... Many efforts have been done in the last years to model public transport timetables in order to find optimal routes. The proposed models can be classified into two types: those representing the timetable as an array, and those representing it as a graph. The arraybased models have been shown to be v ..."
Abstract
 Add to MetaCart
considering the case where transportation systems are subject to delays with respect to the given timetable. We make three contributions: (i) we give a simplified and optimized update routine for the wellknown timeexpanded model along with an engineered query algorithm; (ii) we propose a new graph
Contracting Timetable . . .
, 2008
"... During the last years, impressive progress has been achieved in the field of speedup techniques for DIJKSTRA’s algorithm. Due to the availability of road networks, most speedup techniques were developed for such networks. The fastest known techniques use contraction, a procedure that reduces the ..."
Abstract
 Add to MetaCart
the graph size, in order to gain their impressive speedups. However, in a recent work it was observed that those techniques yield a much worse performance when applied on timeexpanded networks resulted from railway timetable information data, and conjectured that this might be due to the contraction
Efficient Models for Timetable Information in Public Transportation Systems
 ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS
, 2008
"... We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the timeexpanded approach, every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the timedependent approach t ..."
Abstract

Cited by 41 (11 self)
 Add to MetaCart
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the timeexpanded approach, every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the timedependent approach
Timetable information updating in case of delays: Modeling issues
, 2008
"... 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 timedependent and timeexpanded network. In a recent work, both models are compared with respect to advantages and disadvantages on a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
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 timedependent and timeexpanded network. In a recent work, both models are compared with respect to advantages and disadvantages on a
Experimental Comparison of Shortest Path Approaches for Timetable Information
"... We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the timeexpanded approach every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the timedependent approach th ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the timeexpanded approach every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the timedependent approach
Fully Realistic MultiCriteria Timetable Information Systems
"... Millions of people use public transportation and consult electronic timetable information systems. A customer selects from the connections offered by the system according to personal preferences. The chosen connection is typically a compromise based on the importance of several criteria, including ..."
Abstract
 Add to MetaCart
since the schedules are modeled as large graphs (several hundred thousand edges and nodes). The graphs are either timeexpanded or timedependent to model the dimension of time.
Two Approaches for TimeTable Information: A Comparison of Models and Performance
, 2003
"... We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the timeexpanded approach every event at a station, e.g., the departure of a train, is modelled as a node in the graph, while in the timedependent approa ..."
Abstract
 Add to MetaCart
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the timeexpanded approach every event at a station, e.g., the departure of a train, is modelled as a node in the graph, while in the timedependent
Maintenance of Multilevel Overlay Graphs for Timetable Queries
, 2007
"... In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s algorithm. Due to the continuously growing size of realworld graphs, there is a constant need for faster algorithms and ..."
Abstract
 Add to MetaCart
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s algorithm. Due to the continuously growing size of realworld graphs, there is a constant need for faster algorithms
Efficient OnTrip Timetable Information in the Presence of Delays
"... Abstract. The search for train connections in stateoftheart commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems suffer from delays for various reasons. Thus, dynamic changes of the planned schedule have to be taken into account. A s ..."
Abstract
 Add to MetaCart
which have to wait according to certain waiting policies between connecting trains. We introduce the concept of a dependency graph to efficiently calculate and update all primary and secondary delays. This delay information is then incorporated into a timeexpanded search graph which has to be updated
Results 1  10
of
131