{"id":"W2071299513","doi":"10.1080/03052150701551461","title":"Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem","year":2007,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ant colony optimization algorithms; Tabu search; Mathematical optimization; Metaheuristic; Heuristics; Computer science; Simulated annealing; Quadratic assignment problem; Algorithm; Genetic algorithm; Combinatorial optimization; Parallel metaheuristic; Ant colony; Meta-optimization; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0008771059,0.0006902681,0.0008307165,0.0009495043,0.0004130116,0.0007124782,0.001153921,0.0007770642,0.001271608],"category_scores_gemma":[0.002461566,0.0004671875,0.0005731879,0.0009799298,0.000745874,0.0006135163,0.001083473,0.0006432778,0.000254266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006908384,"about_ca_system_score_gemma":0.0009071312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005724194,"about_ca_topic_score_gemma":0.006167296,"domain_scores_codex":[0.9994249,0.0002587005,0.00002014098,0.00006446762,0.0001807584,0.00005110358],"domain_scores_gemma":[0.9990564,0.000618273,0.00009498648,0.00007552615,0.0001077554,0.00004697502],"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.00004710436,0.00003988966,0.0004514893,0.00005539504,0.00003742301,0.00005883346,0.0000523391,0.9444609,0.001369136,0.006526289,0.000668889,0.04623237],"study_design_scores_gemma":[0.00001603078,0.00003698189,0.00008703007,0.000003849304,0.00000695755,0.00003246096,0.00001070057,0.9967378,0.0003220916,0.001675468,0.001065961,0.000004718996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03289376,0.0002264427,0.9626002,0.0001118302,0.0000330543,0.00008117748,0.00001949005,0.0003708371,0.003663278],"genre_scores_gemma":[0.4612114,0.0002136483,0.535269,0.0001009046,0.00002875468,0.0002205544,0.0001008965,0.00009896641,0.002755857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005724194,"threshold_uncertainty_score":0.01138175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006671249574654596,"score_gpt":0.2106323036794777,"score_spread":0.2039610541048231,"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."}}