A Combinatorial model to optimize air traffic flow management problems

In this paper we introduce a new 0-1 mathematical formulation for the Air Traffic Flow Management problem. The model is based on a 4D-graph, which allows us to consider the problem not as general combinatorial one, but as a set of shortest path problems with common capacity constraints, a fact that introduces several neat features. Among the decisions considered in the model are ground and air delays, changes in the speed of the aircraft and alternative routes. The proposed model, in comparison with the current state of the art, is shown to be an easy way to model different real complex situations (e.g., more realistic representation of costs and decisions involved, as well as dynamic sector configuration). The rapidity with which the computations are performed in this model shows the applicability of our proposal to the industry. (C) 2019 Elsevier Ltd. All rights reserved.