Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management

Authors:
Publisher website
Google Scholar
Abstract
The extended aircraft arrival management problem, as an extension of the classic aircraft landing problem, seeks to preschedule aircraft on a destination airport a few hours before their planned landing times. A two-stage stochastic mixed-integer programming model enriched by chance constraints is proposed in this paper. The first-stage optimization problem determines an aircraft sequence and target times over a reference point in the terminal area, called initial approach fix (IAF), so as to minimize the landing sequence length. Actual times over the IAF are assumed to deviate randomly from target times following known probability distributions. In the second stage, actual times over the IAF are assumed to be revealed, and landing times are to be determined in view of minimizing a time-deviation impact cost function. A Benders reformulation is proposed, and acceleration techniques to Benders decomposition are sketched. Extensive results on realistic instances from Paris Charles-de-Gaulle airport show the benefit of two-stage stochastic and chance-constrained programming over a deterministic policy.

This publication has 28 references indexed in Scilit: