MétaCan
Menu
Back to cohort
Record W2544503045 · doi:10.1109/iscbi.2013.41

Air Cargo Scheduling Using Genetic Algorithms

2013· article· en· W2544503045 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
TopicAdvanced Manufacturing and Logistics Optimization
Canadian institutionsLakehead University
FundersUniversidade de Macau
KeywordsScheduling (production processes)Genetic algorithmComputer scienceProfit (economics)ChinaSouthern chinaFitness functionAir cargoAir travelOperations researchMathematical optimizationEngineeringAviationOperations managementTransport engineeringAerospace engineeringMathematicsMachine learningEconomicsGeography

Abstract

fetched live from OpenAlex

This project is to optimize the scheduling of the packages within the aircrafts' loading capacities, which are simulated. The optimization criteria are evaluated by customer satisfaction and maximize the usage and profit of the aircrafts. Three algorithms for the batch delivery scheduling problem are developed to find the optimal air cargo shipment. These algorithms are genetic algorithm with earliest due date method, extended due date method and genetic algorithm with extended due date method. The performances of these algorithms are compared to first come first serve and earliest due date scheduling method. The performance of genetic algorithm is analyzed by its fitness function. Air cargos which are handled within Chinese cities is based on flight schedules of nine airline companies including Air Macau, EVA Airways, Cathay Pacific, China Southern Airlines, China Eastern Airlines, Air China, Dragon Air, China Airlines and Mandarin Airlines.

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.482
Threshold uncertainty score0.327

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.014
GPT teacher head0.220
Teacher spread0.206 · 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