TY - CONF
A1 - Blanco, Marco
A1 - BorndÃ¶rfer, Ralf
A1 - Hoang, Nam Dung
A1 - Kaier, Anton
A1 - Schienle, Adam
A1 - Schlechte, Thomas
A1 - Schlobach, Swen
T1 - Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind
T2 - 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)
N2 - We study the Flight Planning Problem for a single aircraft, which deals with finding a path of minimal travel time in an airway network. Flight time along arcs is affected by wind speed and direction, which are functions of time. We consider three variants of the problem, which can be modeled as, respectively, a classical shortest path problem in a metric space, a time-dependent shortest path problem with piecewise linear travel time functions, and a time-dependent shortest path problem with piecewise differentiable travel time functions. The shortest path problem and its time-dependent variant have been extensively studied, in particular, for road networks. Airway networks, however, have different characteristics: the average node degree is higher and shortest paths usually have only few arcs. We propose A* algorithms for each of the problem variants. In particular, for the third problem, we introduce an application-specific "super-optimal wind" potential function that overestimates optimal wind conditions on each arc, and establish a linear error bound. We compare the performance of our methods with the standard Dijkstra algorithm and the Contraction Hierarchies (CHs) algorithm. Our computational results on real world instances show that CHs do not perform as well as on road networks. On the other hand, A* guided by our potentials yields very good results. In particular, for the case of piecewise linear travel time functions, we achieve query times about 15 times shorter than CHs.
Y1 - 2016
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6027
VL - 54
ER -