Optimal aircraft scheduling and routing at a terminal control area during disturbances

摘要

This paper addresses the real-time problem of aircraft scheduling and routing. A main task of traffic controllers is to mitigate the effects of severe traffic disturbances on the day of operations in the Terminal Control Area (TCA) of an airport. When managing disturbed take-off and landing operations, they need to minimize the delay propagation and, in addition, to reduce the aircraft travel time and energy consumption. The paper tackles the problem of developing effective decision support tools for air traffic monitoring and control in a busy TCA. To this purpose, centralized and rolling horizon traffic control paradigms are implemented and compared. The mathematical formulation is a detailed model of air traffic flows in the TCA based on alternative graphs, that are generalized disjunctive graphs. As for the aircraft scheduling and (re-)routing approaches, the First In First Out (FIFO) rule, used as a surrogate for the dispatchers behaviour, is compared with various optimization-based approaches including a branch and bound algorithm for aircraft scheduling with fixed routes, a tabu search algorithm for aircraft re-routing, and a mixed integer linear programming formulation for simultaneous scheduling and routing. Various hypothetical disturbance scenarios are simulated for a real-world airport case study, Milano Malpensa, and the proposed timing and routing approaches are compared in terms of their performance in the different scenarios. The disturbed traffic situations are generated by simulating multiple delayed landing/departing aircraft and a temporarily disrupted runway. In general, the optimization approaches are found to improve the solutions significantly compared to FIFO, in terms of aircraft delay minimization. However, there are some trade-offs involved in picking the right approach and paradigms for practical implementations.