Proof-of-Concept of an Algorithm for Aircraft Departure Sequencing

An algorithm is presented for establishing an optimal sequence of aircraft departing from an airport. Under a specific choice of the requirements and objectives, the problem is formulated as a combinatorial optimization task. The algorithm blends exhaustive evaluation of the possible sequences with a sliding sub-horizon technique. The validity of the algorithm’s concept is evaluated by application on a realistic traffic data sample for Milan Malpensa airport, concerning an entire day period in which a significant traffic load was recorded. Results suggest that the algorithm is capable of delivering the benefits for which it has been designed. Indeed, the algorithm exhibits variations w.r.t. the real traffic sample in the defined performance metrics that are in complete accordance with the expected effects. For instance, the algorithm allows saving around 15 % of the overall time the aircraft spend with active engines, with related cost, pollution and noise benefits