MétaCan
Menu
Back to cohort
Record W1902275675 · doi:10.1002/mcda.1516

Multicriteria Optimization of A Long‐Haul Routing and Scheduling Problem

2014· article· en· W1902275675 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Multi-Criteria Decision Analysis · 2014
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsHEC MontréalUniversité du Québec à Montréal
FundersHEC Montréal
KeywordsTabu searchScheduling (production processes)TruckVehicle routing problemComputer scienceOperations researchEconomic shortageRouting (electronic design automation)Job shop schedulingTransport engineeringEngineeringOperations managementComputer networkAutomotive engineeringArtificial intelligence

Abstract

fetched live from OpenAlex

ABSTRACT Long‐haul carriers are facing a shortage of drivers in North American countries. To reduce turnover rates and improve driver retention, trucking companies are making more efforts to improve their drivers' quality of life. The aim of this paper is to introduce and solve a multi‐objective vehicle routing and truck driver scheduling problem under the legislative requirements on work and rest hours in the US (US MOVRTDSP). We present a tabu search algorithm that solves the US MOVRTDSP and provides a heuristic non‐dominated solution set from which tradeoffs between operating costs and driver inconvenience are evaluated. The tradeoffs between the number of vehicles used and operating costs are also estimated. Overall, interpretations of the computational results on artificial and real‐life instances provide meaningful information to long‐haul carriers. Copyright © 2014 John Wiley & Sons, Ltd.

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.003
metaresearch head score (Gemma)0.001
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: Methods
Teacher disagreement score0.237
Threshold uncertainty score0.866

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
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.020
GPT teacher head0.310
Teacher spread0.289 · 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