{"id":"W2064035628","doi":"10.1287/opre.51.4.655.16098","title":"Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"ca_institutions":"Computer Research Institute of Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Neighbourhood (mathematics); Tabu search; Mathematical optimization; Fixed charge; Network planning and design; Metaheuristic; Flow network; Computer science; Simple (philosophy); Flow (mathematics); Multi-commodity flow problem; Mathematics","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.0008012945,0.0005254483,0.0006896888,0.0009561581,0.0004807899,0.0006420001,0.001230116,0.0008965625,0.002194017],"category_scores_gemma":[0.002531362,0.0003732809,0.0006339367,0.0008619164,0.0006953981,0.00111636,0.000871207,0.0006646386,0.0004191397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007765261,"about_ca_system_score_gemma":0.0006553324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002043109,"about_ca_topic_score_gemma":0.002423525,"domain_scores_codex":[0.9996815,0.0001285185,0.0000136791,0.00003723883,0.0001124589,0.00002661446],"domain_scores_gemma":[0.9994397,0.0002923191,0.00005968289,0.00006785201,0.0001063661,0.00003403951],"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.00003899842,0.00002790626,0.000259016,0.00003931122,0.00001563463,0.00002181702,0.00005173782,0.9095024,0.000924183,0.03412491,0.0006414199,0.0543526],"study_design_scores_gemma":[0.00001287376,0.00004479486,0.00005491574,0.00000780238,0.000005114336,0.00001382597,0.00000861226,0.9833734,0.0004245159,0.01440905,0.001637371,0.000007680105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01564002,0.0002148849,0.9805088,0.00007266363,0.00002677679,0.00005926917,0.00003449164,0.0001623139,0.003280762],"genre_scores_gemma":[0.4222546,0.0003431719,0.5727841,0.00007701434,0.00003726408,0.0004624716,0.0001647421,0.0001326978,0.003744102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002194017,"threshold_uncertainty_score":0.007339716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1244174663249808,"score_gpt":0.375052910876536,"score_spread":0.2506354445515552,"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."}}