Latest revision as of 12:59, 16 February 2021

Abstract

The present paper focuses on the development of an algorithm for safely and optimally managing the routing of aircraft on an airport surface in future airport operations. This tool is intended to support air traffic controllers’ decision-making in selecting the paths of all aircraft and the engine startup approval time for departing ones. Optimal routes are sought for minimizing the time both arriving and departing aircraft spend on an airport surface with engines on, with benefits in terms of safety, efficiency and costs. The proposed algorithm first computes a standalone, shortest path solution from runway to apron or vice versa, depending on the aircraft being inbound or outbound, respectively. For taking into account the constraints due to other traffic on an airport surface, this solution is amended by a conflict detection and resolution task that attempts to reduce and possibly nullify the number of conflicts generated in the first phase. An example application on a simple Italian airport exemplifies how the algorithm can be applied to true-world applications. Emphasis is given on how to model an airport surface as a weighted and directed graph with non-negative weights, as required for the input to the algorithm.

Document type: Article

Full document

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.3390/a6030494 under the license https://creativecommons.org/licenses/by

• http://hdl.handle.net/11367/22740 under the license http://creativecommons.org/licenses/by/3.0/

• http://www.mdpi.com/1999-4893/6/3/494/pdf

• http://www.mdpi.com/1999-4893/6/3/494,

https://doaj.org/toc/1999-4893 under the license cc-by

• http://www.mdpi.com/1999-4893/6/3/494/pdf,

http://dx.doi.org/10.3390/a6030494

• https://www.mdpi.com/1999-4893/6/3/494,

https://www.mdpi.com/1999-4893/6/3/494/pdf,

https://core.ac.uk/display/55113273,

https://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#TancrediAFRRM13,

https://doi.org/10.3390/a6030494,

http://www.mdpi.com/1999-4893/6/3/494/pdf,

https://academic.microsoft.com/#/detail/2030329757 under the license https://creativecommons.org/licenses/by/4.0/