Abstract
When regulated network capacities are violated, flights may be delayed to meet time-based slot restrictions. In addition, reactionary delays occur when time buffers to subsequent flight legs are exceeded. This work aims to minimize both—primary and reactionary delays in a dynamic simulation of the European Air Transportation System. The slot allocation process is solved by minimizing network delay with a binary optimization approach instead of using the current first-planned–first-served principle. The new module presented in this study, called constraint reconciliation and optimization (CRO), is applied within EUROCONTROL’s Research Network Strategic Tool (R-NEST). The results are compared to delays generated by R-NEST’s computer-aided slot allocation (ISA–CASA). In simulations of tactical air traffic flow management (ATFM) operations, time is iterated over the day and flight plans are updated with random and propagated delays. The computational complexity of all possible delay- and slot-entry-permutations is reduced by the method of column generation for solving large linear problems. Three validation scenarios that contain flight plans, rotation margins, sector configurations, regulations, and deterministic or stochastic delays are evaluated. In the most realistic scenario, compared to ISA–CASA, CRO reduces primary and reactionary delays by up to 16% while achieving low levels of airspace sector and airport overloads and fast computation times.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call