MétaCan
Menu
Back to cohort
Record W2314520391 · doi:10.1109/ieem.2013.6962399

Optimization of forest vehicle routing using reactive tabu search metaheuristic

2013· article· en· W2314520391 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsUniversité du Québec en Abitibi-TémiscamingueÉcole de Technologie Supérieure
Fundersnot available
KeywordsTabu searchMetaheuristicVehicle routing problemComputer scienceGuided Local SearchMathematical optimizationRouting (electronic design automation)AlgorithmMathematicsComputer network

Abstract

fetched live from OpenAlex

Forest vehicle routing is an important step in optimization of forest transportation system to minimize the total cost. To perform this work, we propose a mathematical model and use a reactive tabu search metaheuristic approach. The objective is to minimize the total cost by respecting the time window of all customers which is sometimes important in this field. Finally, the experimental results obtained with the reactive tabu search metaheuristic approach of the named vehicle routing problem is showed, and compared to its extended great deluge results.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.322
Threshold uncertainty score0.550

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.030
GPT teacher head0.278
Teacher spread0.248 · 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

Quick stats

Citations4
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicVehicle Routing Optimization MethodsFrench-language works237,207