An Estimation Model on Electricity Consumption of New Metro Stations
Bibliographic record
Abstract
Electricity consumption of metro stations increases sharply with expansion of a metro network and this has been a growing cause for concern. Based on relevant historical data from existing metro stations, this paper proposes a support vector regression (SVR) model to estimate daily electricity consumption of a newly constructed metro station. The model considers some major factors influencing the electricity consumption of metro station in terms of both the interior design scheme of a station (e.g., layout of the station and allocation of facilities) and external factors (e.g., passenger volume, air temperature and relative humidity). A genetic algorithm with five-fold cross-validation is used to optimize the hyper-parameters of the SVR model in order to improve its accuracy in estimating the electricity consumption of a metro station (ECMS). With the optimized hyper-parameters, results from case studies on the Beijing Subway showed that the estimating accuracy of the proposed SVR model could reach up to 95% and the correlation coefficient was 0.89. It was demonstrated that the proposed model could outperform the traditional methods which use a back-propagation neural network or multivariate linear regression. The method presented in this paper can be an adequate tool for estimating the ECMS and should further assist in the delivery of new, energy-efficient metro stations.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".