Simulation-Based Schedule Optimization for Virtual Coupling-Enabled Rail Transit Services with Multiagent Technique
Bibliographic record
Abstract
Virtual coupling (VC) is a train-centric next generation signalling system, which can enable multiple trains to operate in a formation just like one train or decouple separately on-the-run or at station flexibly or as planned. With the aim of optimizing the interdeparture train headway time, providing the variable capacity for diverse passenger demand, maximizing the passenger riding comfort degree, and minimizing passenger travel cost and train operation cost, the dynamic schedule for VC-enabled rail transit services is investigated with the multiagent simulation technique on NetLogo platform. Our contribution is mainly fourfold. First, VC-enabled rail transit entity for simulation is represented with the multiagent technique, including representation of train unit, train convoy, passenger attributes and behavior, and mathematical formula for calculation of the train operation cost and passenger travel cost, as well as passengers riding comfort degree are proposed. Second, the operational principles for flexible and self-organisingVC-enabled trains are defined. Third, the VC-enabled train-centric, passenger demand-driven, and agent-based simulation flow and algorithms are developed innovatively, which adopt the ergodic strategy for simulation by traversing each O-D pair demand along each route section over the rail transit network. Finally, we test and discuss the proposed methodology on the designed computational experiment on the NetLogo platform, and the simulation results series validated the effectiveness of the proposed methodology. The provided research can effectively support the VC-enabled platoon operation-oriented train service schedule for future study.
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.001 | 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.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".