Defining Reserve Times for Metro Systems: An Analytical Approach
Bibliographic record
Abstract
The aim of this paper is to provide an analytical approach for determining operational parameters for metro systems so as to support the planning and implementation of energy-saving strategies. Indeed, one of the main targets of train operating companies is to identify and implement suitable strategies for reducing energy consumption. For this purpose, researchers and practitioners have developed energy-efficient driving profiles with the aim of optimising train motion. However, as such profiles generally entail an increase in travel times, the operating parameters in the planned timetable need to be appropriately recalibrated. Against this background, this paper develops a suitable methodology for estimating reserve times which represent the main rate of extra time needed to put ecodriving strategies in place. Our proposal is to exploit layover times (i.e., times spent by a train at the terminus waiting for the next trip) for energy-saving purposes, keeping buffer times intact in order to preserve the flexibility and robustness of the timetable in case of delays. In order to show its feasibility, the approach was applied in the case of a real metro context, whose service frequency was duly taken into account. In particular, after stochastic analysis of the parameters involved for calibrating suitable buffer times, different operating schemes were simulated by analysing the relationship between layover times, number of convoys, and feasible headway values. Finally, some operation configurations are analysed in order to quantify the amount of energy that can be saved.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".