Integrated Optimization on Train Control and Timetable to Minimize Net Energy Consumption of Metro Lines
Bibliographic record
Abstract
Energy-efficient metro operation has received increasing attention because of the energy cost and environmental concerns. This paper developed an integrated optimization model on train control and timetable to minimize the net energy consumption. The extents of train motoring and braking as well as timetable configurations such as train headway and interstation runtime are optimized to minimize the net energy consumption with consideration of utilizing regenerative energy. An improved model on train control is proposed to reduce traction energy by allowing coasting on downhill slopes as much as possible. Variations of train mass due to the change of onboard passengers are taken into account. The brute force algorithm is applied to attain energy-efficient speed profiles and an NS-GSA algorithm is designed to attain the optimal extents of motoring/braking and timetable configurations. Case studies on Beijing Metro Line 5 illustrate that the improved train control approach can save traction energy consumption by 20% in the sections with steep downhill slopes, in comparison with the commonly adopted train control sequence in timetable optimization. Moreover, the integrated model is able to significantly prolong the overlapping time between motoring and braking trains, and the net energy consumption is accordingly reduced by 4.97%.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".