Study on Driving Cycle Synthesis Method for City Buses considering Random Passenger Load
Bibliographic record
Abstract
This paper proposes a novel driving cycle construction method in consideration of velocity, road slope, and passenger load, based on a real-world bus route with a plug-in hybrid electric bus (PHEB). The main purpose is to address the disadvantage that an inaccurate reflection of the real-world driving characteristics for city buses will be caused when ignoring the passenger load in the course of a driving cycle synthesis. Two contributions are supplemented to distinguish from the previous research. Firstly, a novel station-based method is proposed aiming at developing a driving cycle with high accuracy. The kinematic segments are partitioned according to the distance of adjacent bus stops, while a two-dimensional Markov chain Monte Carlo method is employed to synthesize driving cycle between each interval of adjacent bus stops. Secondly, the random passenger load for different bus stops is treated as a discrete Markov chain model, according to the correlation analysis of the measured passenger data which are distinguished for off-peak and peak hours. Meanwhile, Monte Carlo simulation and maximum likelihood estimation are utilized to determine the most likely number of passengers for each bus stop. At last, the fuel consumption of the PHEB is simulated with the best-synthesized driving cycle and contrasted to the mean fuel consumption of the later measured data which is composed of the velocity, road slope, and the passenger load. The results demonstrate that the synthesized driving cycle has a higher accuracy on fuel consumption estimation.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".