OASIcs.ATMOS.2009.2145.pdf
- Filesize: 0.53 MB
- 17 pages
Document
Efficient Route Planning in Flight Networks
Authors
-
Part of:
Volume:
9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (ATMOS 2009)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-11-25
Cite AsGet BibTex
Daniel Delling, Thomas Pajor, Dorothea Wagner, and Christos Zaroliagis. Efficient Route Planning in Flight Networks. In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09). Open Access Series in Informatics (OASIcs), Volume 12, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/OASIcs.ATMOS.2009.2145
https://doi.org/10.4230/OASIcs.ATMOS.2009.2145
Abstract
We present a set of three new time-dependent models with increasing flexibility 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.
Keywords
- Timetable information
- flight modeling
- shortest paths
- multi criteria
- table lookups Timetable information
- flight modeling
- shortest paths
- multi criteria
- table lookups
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads