No More Surprises: Stand Assignment Algorithm with Likelihood of Turnaround Time Deviation

Airport management is frequently faced with a problem of assigning flights to available stands and parking positions in the most economical way that would comply with airline policies and suffer minimum changes due to any operational disruptions. This work presents a novel approach to the most common airport problem – efficient stand assignment. The described algorithm combines benefits of data-mining and metaheuristic approaches and generates qualitative solutions, aware of delay trends and airport performance perturbations. The presented work provides promising solutions from the starting moments of computation, in addition, it delivers to the airport stakeholders delay-aware stand assignment, and facilitates the estimation of risk and consequences of any operational disruptions on the slot adherence.