Vehicle Relocation Triggering Thresholds Determination in Electric Carsharing System under Stochastic Demand
Bibliographic record
Abstract
Vehicle unbalance usually occurs in multistation electric carsharing systems. Threshold triggering method is one of the most practicable approaches for vehicle relocation, while determination of thresholds has not been sufficiently studied particularly for electric carsharing system. This paper presents an approach on determining the thresholds considering the stochastic demands and system states. Firstly, we establish a state transition model involving the stochastic variables to capture the dynamics of the number and battery status of vehicles as well as the traffic demands. Consequently, a dual-objective optimization model was developed to determine the proper values of thresholds. The solution algorithm employed the min–max robust optimization to tackle the uncertainty and the Pareto optimum to decide the solution under dual objectives. To test the distribution stochastic variables, we involve the orders data and the supplementary user survey. Comparison is conducted among three methods: the empirical rules, the deterministic method, and the stochastic method, where the results suggest that the stochastic method achieves better solutions on the dual objectives under stochastic demands.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".