Pith. sign in

REVIEW

Distributionally Robust Ground Delay Programs with Learning-Driven Airport Capacity Predictions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.11415 v1 pith:LXUDLB2X submitted 2024-02-18 math.OC

Distributionally Robust Ground Delay Programs with Learning-Driven Airport Capacity Predictions

classification math.OC
keywords capacitydelaydistributionallyfuturegdpsgroundoptimizationrobust
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Strategic Traffic Management Initiatives (TMIs) such as Ground Delay Programs (GDPs) play a crucial role in mitigating operational costs associated with demand-capacity imbalances. However, GDPs can only be planned (e.g., duration, delay assignments) with confidence if the future capacities at constrained resources (i.e., airports) are predictable. In reality, such future capacities are uncertain, and predictive models may provide forecasts that are vulnerable to errors and distribution shifts. Motivated by the goal of planning optimal GDPs that are \emph{distributionally robust} against airport capacity prediction errors, we study a fully integrated learning-driven optimization framework. We design a deep learning-based prediction model capable of forecasting arrival and departure capacity distributions across a network of airports. We then integrate the forecasts into a distributionally robust formulation of the multi-airport ground holding problem (\textsc{dr-MAGHP}). We show how \textsc{dr-MAGHP} can outperform stochastic optimization when distribution shifts occur, and conclude with future research directions to improve both the learning and optimization stages.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.