On air traffic flow management with rerouting. Part II: Stochastic case

We present a framework for modeling multistage mixed 0–1 problems for the air traffic flow management problem with rerouting (ATFMRP) under uncertainty in the airport arrival and departure capacity, the air sector capacity and the flight demand. The model allows for flight cancelation, if necessary. It considers several types of objective functions to minimize, namely, total ground and air holding cost, penalization of the alternative routes to the scheduled one for each flight, delay cost for the flights to arrive to the airports and the air sector nodes, and penalization for advancing the arrival of the flights to the airport over the scheduled period. A scenario tree based scheme is used to represent the Deterministic Equivalent Model (DEM) of the stochastic mixed 0–1 program with full recourse. The nonanticipativity constraints that equate the so named common 0–1 and continuous variables from the same group of scenarios in each period are implicitly satisfied in the compact representation of DEM. Some computational experience is reported for medium‐scale instances. The model is so tight that none of the instances of the testbed but two of them requires to execute the branch‐and‐cut phase of the MIP optimization engine of choice.