Abstract
Aiming at the problem of resource allocation for departure flights at congested airports, this research explores the optimal configuration of holding units in the terminal control area (TCA). Similar to the job-shop scheduling problem, this problem is solved through a max-plus model with additional constraints. In particular, two optimization models are constructed, in which air segments, departure fixes and holding units are explicitly modeled. Based on the realistic airspace network selected, the proposed models are tested using actual flight data. The experimental results show that the models proposed have better qualities compared with the other methods.
Publisher
Public Library of Science (PLoS)
Reference28 articles.
1. A dynamic programming approach for the airport capacity allocation problem[J];P Dell’Olmo;IMA Journal of Management Mathematics,2003
2. Congestion Transition in Air Traffic Networks[J];M Bernardo;PLOS ONE,2015
3. Assessment of airport arrival congestion and delay: Prediction and reliability[J];A Rodriguez-Sanza;Transportation Research Part C Emerging Technologies,2019
4. Sood N, Mulgund S, Wanke C, Greenbaum D. A Multi-Objective Genetic Algorithm for Solving Airspace Congestion Problems[C]// AIAA Guidance, Navigation and Control Conference and Exhibit, Hilton Head, South Carolina, 2007. AIAA, 1–28. doi: 10.2514/6.2007–6357
5. Modeling Congestion Propagation in Multistage Schedule within an Airport Network[J];X Dai;Journal of Advanced Transportation,2018