no. 10 · Friday 6 November 2026
Distributionally Robust Airport Ground Holding Problem under Wasserstein Ambiguity Sets
Abstract
We develop a distributionally robust formulation of the single-airport ground holding problem (dr-SAGHP) using a $1$-Wasserstein ambiguity set with an $\ell_1$ transportation metric over the full physical capacity support. We exploit the problem's structural properties to develop an exact dynamic programming separation algorithm within delayed constraint generation (DCG-DP). We also develop K-IL, which combines Kelley's cutting-plane method with an integer L-shaped framework to solve a a restricted-support approximation, rs-dr-SAGHP. Delayed constraint generation with MILP separation (DCG-MILP) serves as the computational baseline. Computational experiments demonstrate substantial runtime reductions for DCG-DP and K-IL relative to this baseline. Airport capacity distributions are constructed using Gaussian process regression based on historical weather and operational data at Denver International Airport from 2021 to 2023. We develop a chronological expanding-window calibration procedure to select the Wasserstein radius and the results show that the calibrated dr-SAGHP approaches reduce mean operational cost by approximately $2.6\%$ and the Conditional Value at Risk $\mathrm{CVaR}_{90}$ by approximately $8\%$ relative to the stochastic SAGHP benchmark, while avoiding the excessive conservatism observed in a classical robust optimization benchmark.
- comments
- 44 pages, 12 figures
- fields
- Optimization and Control