Delling, Daniel ;
Pajor, Thomas ;
Wagner, Dorothea ;
Zaroliagis, Christos
Efficient Route Planning in Flight Networks
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.
BibTeX - Entry
@InProceedings{delling_et_al:DSP:2009:2145,
author = {Daniel Delling and Thomas Pajor and Dorothea Wagner and Christos Zaroliagis},
title = {Efficient Route Planning in Flight Networks},
booktitle = {ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems},
year = {2009},
editor = {Jens Clausen and Gabriele Di Stefano},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/2145},
annote = {Keywords: Timetable information, flight modeling, shortest paths, multi criteria, table lookups},
ISBN = {978-3-939897-11-8}
}
|
Keywords: |
|
Timetable information, flight modeling, shortest paths, multi criteria, table lookups |
|
Freie Schlagwörter (englisch): |
|
Timetable information, flight modeling, shortest paths, multi criteria, table lookups |
|
Seminar: |
|
9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)
|
|
Issue date: |
|
2009 |
|
Date of publication: |
|
25.11.2009 |