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.
@InProceedings{delling_et_al:OASIcs.ATMOS.2009.2145, author = {Delling, Daniel and Pajor, Thomas and Wagner, Dorothea and Zaroliagis, Christos}, title = {{Efficient Route Planning in Flight Networks}}, booktitle = {9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}, pages = {1--17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-11-8}, ISSN = {2190-6807}, year = {2009}, volume = {12}, editor = {Clausen, Jens and Di Stefano, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2145}, URN = {urn:nbn:de:0030-drops-21450}, doi = {10.4230/OASIcs.ATMOS.2009.2145}, annote = {Keywords: Timetable information, flight modeling, shortest paths, multi criteria, table lookups Timetable information, flight modeling, shortest paths, multi criteria, table lookups} }
Feedback for Dagstuhl Publishing