Optimal Real-Time Traffic Control in Metro Stations
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Full frame distilled prediction
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.
- Candidate categories
- none
- Consensus categories
- none
- Domain
- Candidate signal: noneConsensus signal: none
- Study design
- Candidate signal: Simulation or modelingConsensus signal: Simulation or modeling
- Genre
- Candidate signal: EmpiricalConsensus signal: Empirical
- Teacher disagreement score
- 0.021
- Threshold uncertainty score
- 0.355
- Validation status
machine_predicted_unvalidated·codex-gemma-dda1882f352a
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
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.
- Teacher spread
- 0.290 · how far apart the two teachers sit on this one work
- Validation status
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
Abstract
Train movements across railway stations are still operated by human dispatchers. Motivated by an application provided by Azienda Trasporti Milanesi (ATM), the major Italian municipal transport company, we developed a real-time automated traffic control system to operate trains in metro stations. The system optimally controls the trains in a metro station by identifying a suitable routing and by establishing an optimum schedule of the performed operations. For each candidate routing an instance of the blocking, no-wait job-shop scheduling problem with convex costs is solved to optimality by branch and bound. A new, effective lower bound is developed to speed up the enumeration process. Computational testing in a real environment proved that the algorithm is able to solve relevant practical instances within the very tight time limit imposed by the application. The system has been in operation in the Milan metro since July 2007. To our knowledge, this is the first example of successful application of optimization methods to real-time traffic control in metro stations.
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.
The record
- Venue
- Operations Research
- Topic
- Railway Systems and Energy Efficiency
- Field
- Engineering
- Canadian institutions
- Bombardier (Canada)
- Funders
- not available
- Keywords
- TrainComputer scienceScheduling (production processes)ScheduleRouting (electronic design automation)Real-time computingBranch and boundControl (management)Process (computing)Real-time Control SystemColumn generationOperations researchMathematical optimizationComputer networkEngineeringMathematics
- Has abstract in OpenAlex
- yes