Energy‐Efficient Train Operation Optimization Method for Urban Rail Intervals Based on Curve Splicing
Bibliographic record
Abstract
Urban rail transit trains consume a significant amount of energy; therefore, reducing the operational energy consumption is of great importance for train energy‐saving efforts. To address this issue, and to avoid the limitations of solutions constrained by operational condition combination strategies and the combination explosion of schemes with interval‐by‐interval position searches under unrestricted operational strategies, an operation control scheme solution method based on curve splicing is proposed. This method involves selecting curve segments and continuously splicing and recombining them to efficiently generate new running curves without being restricted by the basic energy‐saving curve framework. Based on this optimization concept, a splicing strategy is developed that includes four parameter variables: the splice point location, splice point speed, splice relationship type, and control force magnitude. On this basis, a curve splicing optimization model is established, with the objective function being the minimization of the train’s operational energy consumption while meeting interval running time requirements. A two‐layer iterative optimization algorithm is designed based on the simulated annealing framework. Utilizing the data of Guangzhou Metro Line 2, the optimized scheme achieves energy savings of 11.713% in the Baiyun Cultural Square–Baiyun Park interval and 9.115% in the entire downward intervals.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".