Optimization of the Shunting Operation Plan at Electric Multiple Units Depots
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
The number of standard electric multiple units (EMUs) in China has increased from 1003 in 2013 to 3256 in 2018. For maintaining all EMUs in time, the high-speed rail system with the fast-developing number of EMUs is facing growing pressure. The maintenance and cleaning capacity of an EMU depot can be improved by a better shunting operation planning (SOP). This paper considers an SOP problem at EMU depots, which may have two types of yards, namely, stub-end and through. Every track at an EMU depot has two sections and can accommodate two short standard EMUs of 8 railcars or one long EMU of 16 railcars. As the SOP is currently handled manually by dispatchers, this paper proposes two integer linear programming models for two types of yards for daily planning and dispatching, which aim at minimizing the total delay time of all EMUs during the planning horizon. A Reduced Variable Neighborhood Search (RVNS) algorithm is designed to improve the solution efficiency. The results of the numerical experiment show that the RVNS algorithm can yield an optimal maintenance plan in a few seconds for depots of different layout types and can be applied to a computer-aided planning system. The track utilization rate of the maintenance yard with the stub-end type is higher than that of the through type. The stub-end type may be more suitable for the current schedule, as its total track utilization rate is much lower than the through type.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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)
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