(Created page with " == Abstract == We present an application of Integer Programming to the design of arrival routes for aircraft in a Terminal Maneuvering Area (TMA). We generate operationally...") |
m (Scipediacontent moved page Draft Content 369005152 to Andersson Granberg et al 2016a) |
(No difference)
| |
Latest revision as of 00:41, 29 January 2021
Abstract
We present an application of Integer Programming to the design of arrival routes for aircraft in a Terminal Maneuvering Area (TMA). We generate operationally feasible merge trees of curvature-constrained routes, using two optimization criteria: (1) total length of the tree, and (2) distance flown along the tree paths. The output routes guarantee that the overall traffic pattern in the TMA can be monitored by air traffic controllers; in particular, we keep merge points for arriving aircraft well separated, and we exclude conflicts between arriving and departing aircraft. We demonstrate the feasibility of our method by experimenting with arrival routes for a runway at Arlanda airport in the Stockholm TMA. Our approach can easily be extended in several ways, e.g., to ensure that the routes avoid no-fly zones.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2016
Volume 2016, 2016
DOI: 10.4230/oasics.atmos.2016.9
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?