Application of Complex Network Principles to Key Station Identification in Railway Network Efficiency Analysis
Bibliographic record
Abstract
Network efficiency analysis becomes important in railways in order to contribute towards improving the safety and capacity of the rail network, making rail travel more attractive for passengers, and improving industry practice and informing policy development. However, a physical railway network structure is a complicated system, and the operation, maintenance, and management of such a network is a difficult task which may be affected by many influential factors. By using efficiency analysis technology for a railway network, combining physical structure with operation functions can help railway industry to optimize the railway network while improving its efficiency and reliability. This paper presents a new methodology based on complex network principles that combines the physical railway structure with railway operation strategy for a railway network efficiency analysis. In this method, two network models of railway physical and train flow networks are developed for the identification of key stations in the railway network based on network efficiency contribution in which the terms of degree, strength, betweenness, clustering coefficient, and a comprehensive factor are taken into consideration. Once the key stations have been identified and analysed, the railway network efficiency is then studied on the basis of selective and random modes of the station failures. A case study is presented in this paper to demonstrate the application of the proposed methodology. The results show that the identified key stations in the railway network play an important role in improving the overall railway network efficiency, which can provide useful information to railway designers, engineers, operators and maintainers to operate and maintain railway network effectively and efficiently.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".