{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001638828,0.0001840038,0.0001473071,0.0001639432,0.0002582227,0.000107746,0.0007347545,0.00006653456,0.00003209638],"category_scores_gemma":[8.817137e-7,0.0001909901,0.00007876474,0.0004594815,0.00006706259,0.0002413813,0.00003666544,0.00006973156,0.00004941076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005254535,"about_ca_system_score_gemma":0.00006107305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000252519,"about_ca_topic_score_gemma":0.000005154714,"domain_scores_codex":[0.9986174,0.00002271754,0.0003463026,0.0006228822,0.0001374156,0.0002533239],"domain_scores_gemma":[0.9988161,0.00009181596,0.0001520013,0.0006667318,0.0001759626,0.00009734875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001992832,0.00129421,0.0001607452,0.00005550136,0.00004745454,0.000003026552,0.0005507258,0.02436992,0.000575996,0.06316418,0.005008042,0.9047503],"study_design_scores_gemma":[0.0008947962,0.00008929129,0.00149046,0.0000115209,0.00001846541,0.000001414489,0.00001417915,0.9271415,0.001789278,0.0008049679,0.06750623,0.0002378598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008326578,0.000007131895,0.9961852,0.0002462239,0.00002818212,0.002351839,0.0003183949,0.0003084511,0.0004712807],"genre_scores_gemma":[0.03417204,0.000004331936,0.9611288,0.0007365912,0.00004460294,0.002849438,0.001019178,0.00001814896,0.00002691876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9045124,"threshold_uncertainty_score":0.7788352,"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."}}