Stochastic Risk Assessment with a Lagrangian Solution for the Optimal Cost Allocation in High-Speed Rail Networks
Bibliographic record
Abstract
In large-scale high-speed rail networks (HSRNs), the occurrence of occasional malfunctions or accidents is unavoidable. The key issue considered in this study is the optimal allocation of the maintenance costs, based on the stochastic risk assessment for HSRNs. Inspired by the theoretical risk evaluation methods in the complex network, three major factors, including the local effects, global effects, and component self-effects are considered in the process of assessing the impact on the network components (nodes or lines). By introducing the component failure occurrence probability, which is considered to be an exponential function changing with the component maintenance costs, a feasible stochastic risk assessment model of the HSRNs together with the component impact assessment is proposed that can better unify the impact assessment of both the high-speed rail stations and railways. An optimal allocation algorithm based on a Lagrangian relaxation approach is designed. Correspondingly, the optimal cost allocation scheme can be determined using the algorithm to eliminate the various HSRN risks under the given costs. Furthermore, a real-world case study of the HSRNs in eastern China is illustrated. Compared with the genetic algorithm, the simulation shows that the approach can solve the optimal cost allocation problem to more effectively reduce the risks of large-scale HSRNs in practice.
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.001 | 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.001 |
| 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".