Blockchain-Powered Energy Optimization in Metro Networks: A Case Study on Electric Braking
Bibliographic record
Abstract
As urban populations continue to expand, the need for efficient and sustainable metro systems has become increasingly pressing. Traditional energy management methods, while somewhat effective, often fall short in fully utilizing the potential of regenerative braking systems within metro networks. These conventional approaches, which rely heavily on centralized control and energy storage systems, encounter scalability, security, and transparency limitations. Additionally, inefficient management of energy recovery data can result in significant energy losses and higher operational costs. In response to these challenges, this study proposes a blockchain-based solution utilizing Proof-of-Work (PoW) algorithms to optimize energy recovery, particularly during electric braking in metro systems. The developed model securely and transparently validates energy recovery events in real-time, eliminating the need for centralized oversight. By customizing the PoW algorithm, we achieved a balance between computational efficiency and strong security, making this solution scalable and practical for large metro networks. Initial simulations demonstrated a 12-15% improvement in energy recovery efficiency and a 10% reduction in operational costs compared to traditional systems. Furthermore, the comparison between net energy gains and the energy expended by the PoW process highlights the transformative potential of blockchain technologies in metro transportation, offering a pathway to more sustainable and environmentally friendly urban mobility solutions.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".