Stochastic Electric Vehicle Network with Elastic Demand and Environmental Costs
Bibliographic record
Abstract
Along with the increasing number of the electric vehicles (EVs), an urban transportation network with a large number of EVs will come true in the near future. Since many countries encourage EVs due to their environmental-friendly benefits, the environmental costs of vehicles have attracted much attention in recent years. In this paper, besides the environmental costs, we take into account the issues of the stochastic user equilibrium (SUE), the elastic demand (ED), and the driving range of EVs in the network. We propose an SUE with ED (SUEED) problem to consider these issues in the urban transportation network with EVs. An SUEED model is developed. We also propose a method of successive average (MSA) to solve the SUEED problem. The computational feasibility of the algorithm is tested in a large-scale network. Through a comparison analysis, we show the benefits of introducing EVs into the urban transportation network in the SUEED circumstance. Moreover, a sensitivity analysis is conducted to reveal the potential values of EVs against the development of EVs. The results suggest that EVs may help to reduce both the travelers’ travel costs and the environmental costs of the entire network.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".