{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000454687,0.0008117154,0.0009380042,0.0006161157,0.0004702335,0.0008508895,0.00153785,0.001252939,0.002919934],"category_scores_gemma":[0.00120401,0.0004567052,0.0005768866,0.0008958687,0.0004762291,0.0008929562,0.00081047,0.001065045,0.0006046322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004082721,"about_ca_system_score_gemma":0.001039514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004603406,"about_ca_topic_score_gemma":0.00437653,"domain_scores_codex":[0.9996817,0.00008064137,0.0000163276,0.00006505591,0.0001226513,0.00003364817],"domain_scores_gemma":[0.9996485,0.0001750712,0.0000367478,0.00002782355,0.0000833331,0.00002865297],"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.00005032859,0.00006144129,0.0002178673,0.00009408252,0.00004098575,0.00008450151,0.00005030872,0.901522,0.002123479,0.01101755,0.003021646,0.08171574],"study_design_scores_gemma":[0.00001497224,0.0000159357,0.00002182739,0.000003163528,0.000003717979,0.00001625263,0.000004594652,0.9971616,0.0001533077,0.00134887,0.00125276,0.000002985358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007275123,0.0002934024,0.9866046,0.0001472114,0.0001142686,0.00007599208,0.00004383127,0.0003567172,0.005088766],"genre_scores_gemma":[0.1513555,0.0003104426,0.8409563,0.0001417013,0.00006912768,0.0003656579,0.0001854475,0.0001415115,0.006474345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004603406,"threshold_uncertainty_score":0.009768188,"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."}}