A Dynamic Programming Approach for the Aircraft Landing Problem with Aircraft Classes

Abstract

The capacity of a runway system represents a bottleneck at many international airports. The current practice at airports is to land approaching on a first-come, first-served basis. An active rescheduling of landing times increases runway capacity or reduces delays. The problem of finding an optimal schedule for landings is referred to as the aircraft landing problem''. The objective is to minimize the total delay of landings or the respective cost. The necessary separation time between two operations must be met. Due to the complexity of this scheduling problem, recent research has been focused on developing heuristic solution approaches. This article presents a new algorithm that is able to create optimal landing schedules on multiple independent runways for with positive target landing times and limited time windows. Our numerical experiments show that problems with up to 100 can be optimally solved within seconds.