MétaCan
Menu
Back to cohort

FS-ACO: An Algorithm for Unsafe U-Turn Detours in Service Vehicle Route Optimization Applications

2023· article· en· W4388820886 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 institutionsOntario Tech University
Fundersnot available
KeywordsIntersection (aeronautics)Ant colony optimization algorithmsVehicle routing problemComputer scienceRouting (electronic design automation)Operator (biology)Mathematical optimizationAlgorithmService (business)EngineeringMathematicsComputer networkTransport engineering

Abstract

fetched live from OpenAlex

In this study, an algorithm is proposed to yield the shortest distance detours to resolve unsafe u-turns in routing applications. In service routing operations such as waste collection and snowplowing, it is unsafe for these large vehicles to perform u-turns at intersections. Rather than doing a u-turn, the operator must find the shortest detour that leads back to the intersection to continue in the desired travel direction. To solve this problem, a forward-searching ant colony optimization (FS-ACO) algorithm is proposed. Experimental results show that the proposed algorithm can yield optimal detours for a collection of u-turn examples.

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: Methods
Teacher disagreement score0.054
Threshold uncertainty score0.746

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.002
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.024
GPT teacher head0.294
Teacher spread0.270 · 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

Citations3
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicVehicle Routing Optimization MethodsFrench-language works237,207