{"id":"W72737831","doi":"","title":"An Ant Colony Optimization Metaheuristic for the Undirected Rural Postman Problem","year":2007,"lang":"en","type":"article","venue":"IRIS eCampus Telematic University (Università degli Studi eCampus)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca; Università della Calabria","keywords":"Metaheuristic; Parallel metaheuristic; Ant colony optimization algorithms; Heuristics; Mathematical optimization; Benchmark (surveying); Heuristic; Set (abstract data type); Computer science; Ant colony; Algorithm; Mathematics; Meta-optimization; Geography","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.0003342866,0.0005982182,0.0006182265,0.000466695,0.0004918731,0.0005338516,0.001032042,0.0007493754,0.003056278],"category_scores_gemma":[0.0006555426,0.0002798025,0.000500545,0.0007270246,0.0003242299,0.0007594288,0.000542475,0.0008755733,0.000455048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004561689,"about_ca_system_score_gemma":0.0008272774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001627525,"about_ca_topic_score_gemma":0.003593598,"domain_scores_codex":[0.9997993,0.00006585997,0.000008436798,0.0000327977,0.00006340932,0.00003018969],"domain_scores_gemma":[0.9998065,0.00009344867,0.00003836399,0.00002215249,0.00002039592,0.00001920483],"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.0001034278,0.0002116379,0.0005159726,0.0001895269,0.00006364476,0.000197339,0.00006918773,0.7522358,0.006320942,0.03044961,0.004286997,0.2053558],"study_design_scores_gemma":[0.00006131335,0.0001801072,0.0002197687,0.00002320761,0.00003071695,0.0001248764,0.00003718584,0.9742149,0.002191481,0.01117815,0.01172466,0.00001366318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03288661,0.0005488375,0.950546,0.0002479532,0.0001299021,0.0002109103,0.000128695,0.0004093394,0.01489178],"genre_scores_gemma":[0.1919881,0.0005362335,0.7963396,0.0001723545,0.00005275599,0.0002916352,0.0002881711,0.0001613971,0.01016972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003056278,"threshold_uncertainty_score":0.01022428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01461644419964762,"score_gpt":0.2578491791426865,"score_spread":0.2432327349430388,"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."}}