{"id":"W2136863244","doi":"10.1057/jors.2009.86","title":"An ant colony optimization metaheuristic for single-path multicommodity network flow problems","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Metaheuristic; Ant colony optimization algorithms; Mathematical optimization; Multi-commodity flow problem; Computer science; Path (computing); Flow network; Ant colony; Node (physics); Minimum-cost flow problem; Parallel metaheuristic; Optimization problem; Flow (mathematics); Mathematics; Computer network; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.005455134,0.0001218912,0.0002108895,0.00004136789,0.0005752812,0.0002359064,0.0004381284,0.0001086318,0.00002746343],"category_scores_gemma":[0.001034638,0.00008894068,0.000220102,0.0004296013,0.0000721511,0.0004044006,0.00002943748,0.0005465476,8.635269e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000346811,"about_ca_system_score_gemma":0.0001945414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001349031,"about_ca_topic_score_gemma":0.000001134614,"domain_scores_codex":[0.9977713,0.0004736256,0.0004801356,0.0001259445,0.0008033081,0.0003456531],"domain_scores_gemma":[0.9976258,0.0005863912,0.0001130909,0.0002195499,0.001321583,0.0001336103],"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.00002070628,0.0001078634,0.00006505529,0.00001973329,0.00005037926,4.613206e-7,0.000340725,0.982503,0.006650887,0.0002014716,0.009118034,0.0009216985],"study_design_scores_gemma":[0.0005238805,0.0002526592,0.0004692415,0.00005758983,0.00002213821,0.00001748019,0.00004397401,0.9962161,0.0006683555,0.0006630126,0.0009689339,0.00009668642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008507897,0.0002546879,0.9883201,0.001742352,0.0003971191,0.0005704426,0.00001911882,0.00003857134,0.0001497867],"genre_scores_gemma":[0.331035,0.00008829507,0.6678525,0.000162375,0.0007527369,0.00001141355,0.0000134925,0.00002362866,0.00006057108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3225271,"threshold_uncertainty_score":0.4424656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07605495017992003,"score_gpt":0.3630611638825094,"score_spread":0.2870062137025893,"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."}}