Efficient Route Planning in Flight Networks

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.

• Type: Conference
• Year: 2009
• Where: ATMOS
• Authors: Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis
• Keywords: ATMOS 2009, Optimization, Realistic Route Planning, Realistic Way, Small Graph