MétaCan
Menu
Back to cohort
Record W2908756765 · doi:10.1155/2019/5364201

A Hybrid Simulated Annealing Heuristic for Multistage Heterogeneous Fleet Scheduling with Fleet Sizing Decisions

2019· article· en· W2908756765 on OpenAlexvenueno aff
Xinyu Yang, Hua Xuan

Bibliographic record

VenueJournal of Advanced Transportation · 2019
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsnot available
FundersNational Natural Science Foundation of China
KeywordsSizingSimulated annealingMathematical optimizationScheduling (production processes)Integer programmingHeuristicVehicle routing problemComputer scienceJob shop schedulingRouting (electronic design automation)Mathematics

Abstract

fetched live from OpenAlex

This paper deals with multistage heterogeneous fleet scheduling with fleet sizing decisions (MHFS-FSD). This MHFS-FSD attempts to integrate vehicles allocation and fleet sizing decisions considering the vehicle routing of multiple vehicle types. The problem is formulated as mixed integer programming model. The matrix formulation denoting vehicle allocation scheme is explored according to the characteristic of this problem. Generating vehicle allocation scheme with greedy heuristic procedure (VA-GHP) as initial solution of problem is presented. The USP-IVA method to update the initial solution generated by VA-GHP approach is developed. And then, incorporating VA-GHP and USP-IVA into simulated annealing algorithm, a novel heuristic called HSAH-GHP&IVA is proposed. Finally, some experiments are designed to test the proposed heuristic and the results show that the heuristic can generate reasonably good solutions in short CPU times.

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.007
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.013
GPT teacher head0.275
Teacher spread0.261 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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

Citations17
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Advanced TransportationSame topicVehicle Routing Optimization MethodsFrench-language works237,207