An Algorithm for Managing Aircraft Movement on an Airport Surface

Algorithms

Urbano Tancredi²  Domenico Accardo¹  Giancarmine Fasano¹  Alfredo Renga¹  Giancarlo Rufino¹ 

[1] Department of Industrial Engineering (DII), University of Naples “Federico II”, P.le Tecchio 80, Naples I80125, Italy; E-Mails:;Department for Technologies, University of Naples “Parthenope”, Centro Direzionale, Isola C4, Naples I80143, Italy

关键词: air traffic control;    airport;    SESAR;    shortest path problem;    Airport CDM;    aircraft taxi procedures;   

DOI  :  10.3390/a6030494

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2013 by the authors; licensee MDPI, Basel, Switzerland.