MétaCan
Menu
Back to cohort
Record W101593720

Le problème d'approvisionnement des stations d'essence

2000· article· fr· W101593720 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueJournal Européen des Systèmes Automatisés · 2000
Typearticle
Languagefr
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsnot available
Fundersnot available
KeywordsHeuristicsHeuristicWelfare economicsOperations researchComputer scienceEngineeringEconomicsArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

In this paper we study the gas stations supply problem and we analyze the performance of two distribution policies. A first policy, generally used in this economic sector, do not allow to supply more than one gas station on the same trip. Two construction heuristics and one improvement heuristic are developed following this policy. A second policy allows to visit one or more stations on each trip. A construction heuristic is developed to evaluate this policy. We present the results of a comparative study where the proposed heuristics are used to solve several test problems. The results show that substantial savings can be made by using the fourth heuristic. This leads us to question the validity of the distribution policy which do not allow to supply more than one gas station on the same trip. MOTS-CLES : Distribution de marchandises, problemes de tournees, methodes heuristiques, optimisation.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.565
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0020.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0050.001

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.021
GPT teacher head0.267
Teacher spread0.246 · 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