{"id":"W2137944694","doi":"10.1023/a:1009679511137","title":"Tabu Search for a Network Loading Problem with Multiple Facilities","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computer science; Vertex (graph theory); Mathematical optimization; Network planning and design; Heuristic; Computer network; Mathematics; Algorithm; Theoretical computer science; Graph","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.002096614,0.001007983,0.00153361,0.002290584,0.001543129,0.001736634,0.002142448,0.002757624,0.01190671],"category_scores_gemma":[0.007817013,0.001466093,0.001172477,0.003132494,0.001194117,0.002160703,0.001048099,0.001532391,0.0009509138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001777763,"about_ca_system_score_gemma":0.002238264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01805067,"about_ca_topic_score_gemma":0.01469031,"domain_scores_codex":[0.9991092,0.0005202016,0.00002826126,0.00009003218,0.0001060884,0.000146201],"domain_scores_gemma":[0.9959674,0.003346585,0.0001886948,0.0001257715,0.0002589538,0.0001126488],"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.0001806568,0.0001568912,0.000448733,0.000145938,0.00004550665,0.00006034474,0.00006976353,0.9503018,0.0003738805,0.008125047,0.003412394,0.03667894],"study_design_scores_gemma":[0.0000582469,0.00004638797,0.00009888393,0.0000156539,0.00001713648,0.00001565296,0.00003995931,0.9928622,0.0001488005,0.006125012,0.0005641482,0.000007886222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1842816,0.001757761,0.7850865,0.001339075,0.0002510351,0.00058806,0.001074094,0.001856643,0.02376516],"genre_scores_gemma":[0.4300352,0.0005330757,0.5595274,0.000256227,0.00008783262,0.0006024766,0.0007706987,0.0004322265,0.007754844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01805067,"threshold_uncertainty_score":0.03983194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945790216528166,"score_gpt":0.2552496876173788,"score_spread":0.2357917854520971,"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."}}