Event‐based allocation of airline check‐in counters: a simple dynamic optimization method supported by empirical data
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract This paper studies the real‐life problem of dynamically optimizing the number of airport check‐in counters to allocate for a single flight. The main feature of our work is the use of empirical data collected at the Singapore Changi Airport, which drives the dynamic optimization model of a parallel queues system. We propose an event‐based dynamic programming model that simplifies considerably the optimization analysis even for large‐scale problems with 700+ booked passengers. We investigate the following research questions: (a) For a particular flight, what is the optimal number of counters the system should open with and what is the corresponding optimal total cost? (b) Given the state of the system at any event epoch, should we open another counter or not and what is the optimal cost‐to‐go from this state? The empirical data we collected at the airport are used to test the assumptions, estimate the key parameters, and run the computational experiments. We apply our model to 14 flights at the Singapore Changi Airport and identify cases in which, depending on the cost parameters, the model advocates the use of either a dynamic or a static policy. Although the model concerns only an exclusive‐use system, it is flexible enough to apply to other configurations such as a common‐use system or a single‐queue, multicounter system.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.011 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.004 | 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 it