MétaCan
Menu
Back to cohort
Record W2099501018 · doi:10.1287/ijoc.1080.0312

<b>State-of-the Art Review</b>—Evolutionary Algorithms for Vehicle Routing

2009· article· en· W2099501018 on OpenAlexaff
Jean‐Yves Potvin

Bibliographic record

VenueINFORMS journal on computing · 2009
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsVehicle routing problemBenchmark (surveying)Evolutionary algorithmComputer scienceParticle swarm optimizationMathematical optimizationRouting (electronic design automation)MetaheuristicGenetic algorithmAlgorithmMemetic algorithmMathematics

Abstract

fetched live from OpenAlex

This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports on genetic algorithms, evolution strategies, and particle swarm optimization when applied to the classical capacitated vehicle routing problem and many of its variants. The performance of evolutionary algorithms is also compared with the best alternative problem-solving approaches on benchmark instances.

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.001
metaresearch head score (Gemma)0.002
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.009
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.004
Science and technology studies0.0000.000
Scholarly communication0.0020.002
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0090.004

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.020
GPT teacher head0.287
Teacher spread0.266 · 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

Citations103
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueINFORMS journal on computingSame topicVehicle Routing Optimization MethodsFrench-language works237,207