{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875161,0.001011038,0.0008019017,0.0007895082,0.0005095153,0.0007131361,0.001167002,0.001461314,0.001865555],"category_scores_gemma":[0.002022962,0.0003595631,0.0005454182,0.001047176,0.0006193122,0.0006010887,0.0007257821,0.001047513,0.0003625443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009576643,"about_ca_system_score_gemma":0.001695129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005966909,"about_ca_topic_score_gemma":0.006006007,"domain_scores_codex":[0.999673,0.00009752478,0.00001128204,0.00006913867,0.00009987009,0.00004910387],"domain_scores_gemma":[0.9995778,0.000269494,0.00003839035,0.00002819659,0.00006799821,0.00001811109],"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":[0.0000313036,0.00006871719,0.0004849647,0.00004599375,0.00002934773,0.0000800206,0.00006323,0.8964807,0.001771379,0.01337626,0.001851214,0.0857169],"study_design_scores_gemma":[0.00002695248,0.0000251816,0.00009313316,0.000006462904,0.000009768853,0.00002343046,0.00001257141,0.9944031,0.0003509199,0.003958771,0.001084754,0.000004971288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02824,0.0003052653,0.9652886,0.000254349,0.00006797043,0.0001383543,0.00008152641,0.0004425636,0.005181348],"genre_scores_gemma":[0.2539807,0.0003708735,0.7407882,0.0001820281,0.0000494601,0.0004583342,0.0003081242,0.00009816889,0.003764129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005966909,"threshold_uncertainty_score":0.01186436,"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."}}