{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008413273,0.0009161827,0.0009726745,0.0007359462,0.0005050253,0.0008796955,0.001181444,0.00135324,0.001281666],"category_scores_gemma":[0.002224456,0.0003999237,0.0006454324,0.001165024,0.0005458522,0.0008707237,0.0006389874,0.001086474,0.0002354863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006411606,"about_ca_system_score_gemma":0.001158588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003651142,"about_ca_topic_score_gemma":0.003721249,"domain_scores_codex":[0.9995473,0.0001972755,0.00002081125,0.00006120215,0.0001274829,0.00004589293],"domain_scores_gemma":[0.9991584,0.000551126,0.00009204343,0.00005878276,0.0001021,0.00003751463],"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.00002985034,0.0000501153,0.0002148579,0.00005714016,0.0000325623,0.00004463162,0.00002900938,0.9568658,0.0007668011,0.007933005,0.0008820164,0.03309422],"study_design_scores_gemma":[0.00001332548,0.00001851567,0.0000301144,0.000005556135,0.0000056836,0.00001345465,0.000006161082,0.9967315,0.0001911625,0.002097,0.0008848232,0.00000267111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02902289,0.0008804595,0.9608867,0.0004080147,0.0001238828,0.0001555332,0.00009678947,0.0003624633,0.00806324],"genre_scores_gemma":[0.2714383,0.0007069644,0.7235169,0.0002319534,0.00008850065,0.0003111273,0.0001876796,0.0001126782,0.003405902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003651142,"threshold_uncertainty_score":0.007259786,"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."}}