2026-07-21T14:54:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2145 2024-03-06T10:28:40Z ddc:004 open_access

Efficient Route Planning in Flight Networks Delling, Daniel Pajor, Thomas Wagner, Dorothea Zaroliagis, Christos Timetable information flight modeling shortest paths multi criteria table lookups Timetable information flight modeling shortest paths multi criteria table lookups 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Daniel Delling and Thomas Pajor and Dorothea Wagner and Christos Zaroliagis 2009 Is Part Of OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2009.2145 urn:nbn:de:0030-drops-21450 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2145 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode