{"id":"W2392662732","doi":"","title":"Optimization for Multiple Constraints Transportation Path Based on Mutated Ant Colony Algorithm","year":2011,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Web Applications and Data Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Path (computing); Mathematical optimization; Ant colony; Mutation; Local optimum; Algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611132,0.0008175377,0.0009808948,0.0008031012,0.0005497576,0.0008837773,0.001199119,0.0009884612,0.002346945],"category_scores_gemma":[0.001429264,0.0004346541,0.0008057952,0.001067466,0.0004505631,0.001206015,0.0007762415,0.0008598497,0.000206894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001121077,"about_ca_system_score_gemma":0.001914216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01333843,"about_ca_topic_score_gemma":0.005936534,"domain_scores_codex":[0.9995661,0.0001065415,0.00001815877,0.00008059114,0.0001594254,0.00006912298],"domain_scores_gemma":[0.9996669,0.0001339571,0.00004910737,0.00002122709,0.0001011406,0.00002764761],"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.00001900767,0.00001463268,0.0002264672,0.00003466577,0.00002138896,0.00006713461,0.00002963198,0.9754857,0.001265374,0.008793104,0.0005426917,0.01350018],"study_design_scores_gemma":[0.000005539381,0.000009457701,0.00003433272,0.00000185062,0.000003935937,0.00001555838,0.000005004433,0.9978209,0.0002324809,0.001510758,0.0003576321,0.000002625577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01603037,0.0001415282,0.9807859,0.00011006,0.00002921604,0.00003979661,0.00003289472,0.0001838069,0.002646458],"genre_scores_gemma":[0.6429551,0.0003854152,0.3501051,0.00008195514,0.0000255535,0.0002861023,0.0002035884,0.0001262555,0.005830987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01333843,"threshold_uncertainty_score":0.02652162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01790850952454223,"score_gpt":0.2220869246571552,"score_spread":0.204178415132613,"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."}}