research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleEfficient Route Planning in Flight Networks
Bibtex cite IDRACTI-RU1-2009-28
Booktitle 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems
Year published 2009
Month September
Organization ATMOS 2009
Location Copenhagen, Denmark
Keywords timetable information,ight modeling,shortest paths,multi cri- teria,table lookups
We present a set of three new time-dependent models with increasing exibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while modeling airport procedures in a realistic way. With these graphs, we are able to efficiently compute a set of best connections with multiple criteria over a full day. It even turns out that due to the very limited graph sizes it is feasible to precompute full distance tables between all airports. As a result, best connections can be retrieved in a few microseconds on real world data.
Delling, Daniel
Pajor, Thomas
Wagner, Dorothea
Zaroliagis, Christos
C58-ATMOS2009-rpfn.pdf (main file)
Publication ID671