A Hybrid Framework for Real-Time Dispatching of Airline Unit Load Devices under Demand Variations
Bibliographic record
Abstract
This study is devoted to a new research topic in real-time airline operations, the redispatching of unit load devices (ULDs) under demand variations. We develop a new hybrid framework to solve the problem of ULD redispatch following the time-sequence decision-making required by airlines. The hybrid framework is developed by integrating techniques including the probability distribution technique to simulate different types of operational demand, the adjustable number of stages which is needed to meet the requirements of a decision-making process following a time sequence and the time pressure characteristic of real operations, and the scenario tree and probability rule approaches which are aimed and representing all possible demand scenarios for a stage, while the network flow technique is applied to represent the movement and location of ULDs at each airport over time and is used for the development of the associated mathematical model and the simulation. We performed a simulation of 2,000 cases based on different operational days and types of operational demand. The results show that this hybrid framework is able to achieve stability and also a small variability of both ULD operating costs and solution times, which could allow the airline to save on ULD operating costs, under demand variations in real-time operations.
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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".