Optimization of Vehicle Paths considering Carbon Emissions in a Time-Varying Road Network
Bibliographic record
Abstract
Regarding the study of the time-dependent green vehicle path problem (TDGVRP), most of the literature uses the step function to represent the vehicle speed change in order to reduce the computation, ignoring the continuity of vehicle speed, which leads to the lack of accurate carbon emissions measurement. This study represents the vehicle speed variation as a continuous function to make the constructed model more consistent with the actual situation, in order to promote the reduction of carbon emissions generated in the logistics and distribution process, improve the greenhouse effect and ecological environment, and ultimately promote sustainable development. In this paper, a simulated annealing-genetic hybrid algorithm (GA-SA) is proposed to solve the constructed optimization model, and two sets of comparison experiments are designed. The experimental results show that compared with the two classical algorithms, the simulated annealing-genetic hybrid algorithm (GA-SA) has better solution performance, inherits the robustness and potential parallelism of the genetic algorithm, and has a higher practical value. Meanwhile, although the total driving distance of the vehicle path considering carbon emissions increases by 3.52 km, the carbon emission cost and the total cost decrease by 5.6% and 3.4%, respectively, which confirms that the path optimization model considering carbon emissions constructed in this study can not only play the role of restraining carbon emissions but also reduce the total distribution cost and the waste of resources. In this study, a continuous function is used to represent the vehicle speed variation, and two classical optimization algorithms (the genetic algorithm and simulated annealing algorithm) are combined and parameter-optimized, and certain innovations are made in the processing of vehicle speed and the solution algorithm. Finally, the effectiveness of the model and algorithm is verified by experiments.
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.001 |
| 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.001 |
| Open science | 0.001 | 0.001 |
| 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".