Validation of a Low Fidelity Catenary Model Developed Using a Novel Optimization Algorithm
Bibliographic record
Abstract
Contact wire pre-sag directly impacts the current quality collection in a high-speed railway catenary.Due to this, the initial configuration of the catenary geometry plays an important role on the dynamic performance of the railway.Therefore, accurately representing the initial equilibrium state of the catenary based on specific design requirements is crucial to obtain accurate dynamic results.Despite its importance, there are only a few publications in this area that present methods that can accommodate desired amount of presag in the contact wire and are computationally efficient.The goal of this paper is to present a catenary system that has been modelled using a novel optimization method and validate its dynamic response from its interaction with a pantograph system against the reference model results in BS EN 50318.The novel optimization methodology presented in this paper employs a gradient-based algorithm with a modified finite difference method to solve the initial equilibrium geometry of the catenary.The pantograph and catenary systems are modelled using a commercial finite element software and the post-processing of the results is done using in-house code.A penalty contact-force model is used to represent the contact behavior between the pantograph-catenary system and a threestep simulation procedure is used to achieve better convergence of results.The results from the simulation demonstrated good accordance with the reference model results in BS EN 50318.
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.000 | 0.001 |
| 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.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".