{"id":"W2964779613","doi":"10.1155/2019/3201656","title":"A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves","year":2019,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Center for Interuniversity Research and Analysis on Organizations","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Arc routing; Tabu search; Ant colony optimization algorithms; Mathematical optimization; Routing (electronic design automation); Arc (geometry); Computer science; Ant colony; Algorithm; Metaheuristic; Mathematics; Computer network","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007330743,0.0003469275,0.0004584083,0.000194471,0.00005622612,0.0001644432,0.0002910795,0.0001266439,0.00009660118],"category_scores_gemma":[0.0001450738,0.0002673699,0.00005196663,0.0008209643,0.00002357805,0.000191686,0.00007005833,0.0004377132,0.00005062023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001817985,"about_ca_system_score_gemma":0.00003850625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001846522,"about_ca_topic_score_gemma":0.00000357253,"domain_scores_codex":[0.9981229,0.00003248085,0.0005926347,0.0003210849,0.0003257475,0.0006051094],"domain_scores_gemma":[0.9990379,0.000296187,0.00006483059,0.0003684985,0.00006672645,0.0001658287],"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.000003498508,0.00001962467,0.00009732465,0.000302929,0.00003690371,0.000003709881,0.002965235,0.9918506,0.001325398,0.0009582532,0.00003664372,0.002399921],"study_design_scores_gemma":[0.0005821735,0.00008020322,0.00003959522,0.0007006248,0.00001758678,0.00003361849,0.0001998346,0.9971491,0.0004253827,0.0002939823,0.0001013216,0.0003765843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008044044,0.00008293887,0.9882702,0.0001266662,0.0001180571,0.001405322,0.000003390307,0.0006500011,0.001299433],"genre_scores_gemma":[0.1695233,0.000007097225,0.8299806,0.00003268037,0.00004897224,0.0001236493,0.000005484321,0.000127666,0.0001506543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1614792,"threshold_uncertainty_score":0.9999778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007159781880296249,"score_gpt":0.205677634802776,"score_spread":0.1985178529224798,"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."}}