Modeling Congestion Propagation in Multistage Schedule within an Airport Network
Bibliographic record
Abstract
In order to alleviate flight delay it is important to understand how air traffic congestion evolves or propagates. In this context, this paper focusses on the aggravation of airport congestion by the accumulation of delayed departure flights. We start by applying a heterogeneous network model that takes congestion connection/degree into consideration to predict departure congestion clusters. This is on the basis of the fact that, from a micro perspective, the connection between congestion and discrete clusters can be embodied in models. However, the results show prediction to be of high accuracy and time consuming due to the complexities in capturing the connection in congested flights. The problem of being highly time consuming is resolved in this paper by improving the models by stages. Stage partitioning based on the variation of delay clusters is similar to the typical infectious cycle. For heterogeneous networks the model can describe the congestion propagation and its causes at the different stages of operation. If the connection between flights is homogeneous, the model can describe a more indicative process or trend of congestion propagation. In particular, for single source congestion, the simplified multistage models enable short-term prediction to be fast. Furthermore, for the controllers, the accuracy of prediction using simplified models can be acceptable and the speed on the prediction is significantly increased. The simplified models can help controllers to understand congestion propagation characteristics at different stages of operation, make a fast and short-term prediction of congestion clusters, and facilitate the formulation of traffic control strategies.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".