MétaCan
Menu
Back to cohort
Record W4296912568 · doi:10.1109/access.2022.3208899

Green Vehicle Routing Problem: State of the Art and Future Directions

2022· article· en· W4296912568 on OpenAlexaff
Saba Sabet, Bilal Farooq

Bibliographic record

VenueIEEE Access · 2022
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceVehicle routing problemRouting (electronic design automation)State (computer science)Computer networkAlgorithm

Abstract

fetched live from OpenAlex

Green vehicle routing problem (GVRP) aims to consider greenhouse gas emissions reduction, while routing the vehicles. It can be either through adopting Alternative Fuel Vehicles (AFVs) or with existing conventional fossil fuel vehicles in fleets. GVRP also takes into account environmental sustainability in transportation and logistics. We critically review several variations and specializations of GVRP to address issues related to charging, pick-up, delivery, and energy consumption. Starting with the concepts and definitions of GVRP, we summarize the key elements and contributors to GVRP publications. Afterward, the issues regarding each category of green vehicle routing are reviewed, based on which key future research directions and challenges are suggested. It was observed that the main focus of previous publications is on the operational level routing decision and not the supply chain issues. The majority of publications used metaheuristic methods, while overlooking the emerging machine learning methods. We envision that in addition to machine learning, reinforcement learning, distributed systems, internet of vehicles (IoV), and new fuel technologies have a strong role in developing the GVRP research further.

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 imitation

Not 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.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Review · Consensus signal: Review
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.003
Science and technology studies0.0010.001
Scholarly communication0.0040.006
Open science0.0020.001
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0050.002

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.

Opus teacher head0.017
GPT teacher head0.268
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreReview

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".

Quick stats

Citations50
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueIEEE AccessSame topicVehicle Routing Optimization MethodsFrench-language works237,207