Tactical runway scheduling for demand and delay management
Authors: Rodríguez-Sanz Álvaro , Arnaldo Valdes Rosa Maria M. , Pérez-Castán Javier A. , López Cózar Pablo , Comendador Victor Fernando Gómez 
Published: June 2021

Purpose
Airports are limited in terms of capacity. Particularly, runways can only accommodate a certain number of movements (arrivals and departures) while ensuring safety and determined operational requirements. In such a constrained operating environment, any reduction in system capacity results in major delays with significant costs for airlines and passengers. Therefore, the efficient operation of airports is a critical cornerstone for demand and delay management of the whole air transportation system. Runway scheduling deals with the sequencing of arriving and departing aircraft at airports such that a predefined objective is optimized subject to several operational constraints, like the dependency of separation on the leading and trailing aircraft type or the runway occupancy time. This study aims to develop a model that acts as a tactical runway scheduling methodology for reducing delays while managing runway usage.

Design/methodology/approach
By considering real airport performance data with scheduled and actual movements, as well as arrival/departure delays, this study presents a robust model together with an optimization algorithm, which incorporates the knowledge of uncertainty into the tactical operational step. The approach transforms the planning problem into an assignment problem with side constraints. The coupled landing/take-off problem is solved to optimality by exploiting a time-indexed (0, 1) formulation for the problem. The Binary Integer Linear Programming approach allows to include multi-criteria and multi-constraints levels and, even with some major simplifications, provides fewer sequence changes and target time updates, when compared to the usual approach in which the plan is simply updated in case of infeasibility. Thus, the use of robust optimization leads to a protection against tactical uncertainties, reduces delays and achieves more stable operations.

Findings
This model has been validated with real data from a large international European airport in different traffic scenarios. Results are compared to the actual sequencing of flights and show that the algorithm can significantly contribute to the reduction of delay, while adhering as much as possible to the operative procedures and constraints, and to the objectives of the airport stakeholders. Computational experiments performed on the case study illustrate the benefits of this arrival/departure integrated approach: the proposed algorithm significantly reduces weighted aircraft delay and computes efficient runway schedule solutions within a few seconds and with little computational effort. It can be adopted as a decision-making tool in the tactical stage. Furthermore, this study presents operational insights regarding demand and delay management based on the results of this work.

Originality/value
Scheduling arrivals and departures at runways is a complex problem that needs to address diverse and often competing considerations among involved flights. In the context of the Airport Collaborative Decision Making programme, airport operators and air navigation service providers require arrival and departure management tools that improve aircraft flows at airports. Airport runway optimization, as the main element that combines airside and groundside operations, is an ongoing challenge for air traffic management.