A Rescheduling Approach for Freight Railway considering Equity and Efficiency by an Integrated Genetic Algorithm
Bibliographic record
Abstract
Since unexpected event occurrences are inevitable, an efficient and effective rescheduling approach is critical in freight railway day-to-day operations. Represented by the minimal-delay objectives, the most commonly used efficiency-oriented approach ignores the role of train priority and poses equity problems in rescheduling. For equity, different train priority also reflects the preference in deciding train orders; i.e., the high-priority train is likely to be favorable. However, a conflict may be laid between reducing delays and emphasizing train priority. Hence, it is critical to decide the criteria in train order for freight railway, especially with heterogeneous priority in a competitive resource. To make a tradeoff between equity and efficiency, this paper makes train priority evolutionary and proposed the dynamic train priority considering delay time and static priority. We formulate an optimization model based on the rescheduling strategies such as retime, reorder, and retrack in a complex railway network containing single-track, double-track, and quadruple-track sections. An integrated two-dimension genetic algorithm (ITGA) approach is developed to reobtain an optimized timetable of sufficient quality while meeting the time requirements for real-time rescheduling. In the experiment, the effectiveness of the ITGA approach was employed in a simple case and a real-world case in the Netherlands freight railway. The result shows that there is a synergy between delay time and train priority, where the threshold to upgrade the evolutionary train priority plays an important role. The proposed approach is compared with the benchmark solution first-in-first-out (FIFO) approach in a real-world case to verify the performance and efficiency. Our work extends the rescheduling approach considering both equity and efficiency and provides auxiliary operation support for the dispatcher’s operation rescheduling.
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".