{"id":"W3197585368","doi":"10.20944/preprints202108.0573.v1","title":"Enhanced Hyper-Cube Framework Aco for Combinatorial Optimization Problems","year":2021,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Spacecraft Design and Technology","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Mathematical optimization; Heuristic; Combinatorial optimization; Optimization problem; Time complexity; Extremal optimization; Algorithm; Artificial intelligence; Meta-optimization; Mathematics","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.0007424032,0.0009973671,0.0009689803,0.0008434187,0.0004134759,0.001065255,0.00139841,0.0009820921,0.003122066],"category_scores_gemma":[0.001833161,0.000351614,0.0009286968,0.001432206,0.000607029,0.0007300792,0.000806366,0.00164595,0.0006274541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007322992,"about_ca_system_score_gemma":0.001497949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005306403,"about_ca_topic_score_gemma":0.006146763,"domain_scores_codex":[0.9993218,0.0002518173,0.00002515059,0.00008095369,0.0002552736,0.00006502685],"domain_scores_gemma":[0.9990884,0.0005465706,0.00006170343,0.00007142722,0.0001957508,0.00003608956],"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.00004386142,0.00004571012,0.0002584266,0.0001506381,0.00006174337,0.00008278171,0.00002815348,0.9063001,0.001644309,0.02855753,0.002560008,0.06026672],"study_design_scores_gemma":[0.000010454,0.00001744657,0.00005091615,0.000007115288,0.000007090962,0.00002258387,0.000005708424,0.9921337,0.000305701,0.005639351,0.001795378,0.000004454154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009336269,0.001090924,0.977881,0.000302223,0.0001090561,0.0001174045,0.000116391,0.0003677733,0.01067903],"genre_scores_gemma":[0.2808854,0.001806976,0.7096142,0.0003296314,0.0001735924,0.0005557499,0.0004128078,0.000206305,0.00601539],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005306403,"threshold_uncertainty_score":0.01055104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05764484253165045,"score_gpt":0.2954577633795973,"score_spread":0.2378129208479468,"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."}}