{"id":"W2024936662","doi":"10.1109/cec.2010.5586382","title":"An efficient genetic algorithm for the uncapacitated single allocation hub location problem","year":2010,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Crossover; Benchmark (surveying); Genetic algorithm; Encoding (memory); Computer science; Mathematical optimization; Flow network; Simple (philosophy); Chromosome; Facility location problem; Network planning and design; Representation (politics); Algorithm; Mathematics; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354224,0.0001054593,0.00007115808,0.00005158786,0.0001192496,0.00007411471,0.0001535112,0.00007792634,0.00003291637],"category_scores_gemma":[0.00005494394,0.00008281436,0.00002299949,0.0002797554,0.00003140567,0.00006346981,0.000006985985,0.0001124985,0.000009254662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003460019,"about_ca_system_score_gemma":0.00001810317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078708,"about_ca_topic_score_gemma":0.00001626385,"domain_scores_codex":[0.9993235,0.0000319307,0.0002005038,0.0001503628,0.000114909,0.0001788147],"domain_scores_gemma":[0.9992602,0.0001390184,0.00003249216,0.0002956866,0.0002221622,0.00005046771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.346634e-7,0.00002841338,0.00001100067,0.00001101185,0.000008490505,3.377368e-8,0.000195562,0.8229584,0.03273275,0.0002569224,0.00006301236,0.1437337],"study_design_scores_gemma":[0.0001827759,0.00003557718,0.0005774908,0.000004143853,0.00001686302,0.000002851428,0.00007103511,0.9769292,0.02132564,0.0000853056,0.000652828,0.0001162593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02205386,0.00002833504,0.9759821,0.0001055282,0.0003764828,0.0005580987,0.000002713848,0.0004869538,0.0004058709],"genre_scores_gemma":[0.3756954,0.000001670719,0.6240181,0.00002767161,0.00008011223,0.00007177315,0.00001651766,0.00002867609,0.00006006919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3536415,"threshold_uncertainty_score":0.3377072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0141453342209531,"score_gpt":0.252395169104052,"score_spread":0.2382498348830989,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}