{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603685,0.0001027548,0.0002059786,0.00005409514,0.00007718257,0.00004881827,0.0001127934,0.00004804018,0.00008147787],"category_scores_gemma":[0.00007159136,0.00008640017,0.00005211754,0.0001407103,0.00002603473,0.00009038774,0.000006161064,0.0002191191,0.000003863989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005424089,"about_ca_system_score_gemma":0.00004004395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001994867,"about_ca_topic_score_gemma":0.000001769086,"domain_scores_codex":[0.999105,0.00003988319,0.0003519325,0.00006096012,0.0001874522,0.0002547219],"domain_scores_gemma":[0.9992327,0.0003439599,0.00006309909,0.00008805638,0.0001892896,0.00008291441],"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.0000606738,0.000010345,0.00275135,0.0001070203,0.00004560219,0.000008708845,0.0003469067,0.9864185,0.00006999142,0.00005193494,0.001757431,0.00837148],"study_design_scores_gemma":[0.001177828,0.0002827334,0.0005017794,0.0001971735,0.00004891652,0.0001586662,0.0001656355,0.9474232,0.0007955838,0.0002491359,0.04878142,0.0002179781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09552807,0.0003602543,0.9019675,0.00005197659,0.0001547401,0.0001741833,0.00002054262,0.00007130461,0.001671466],"genre_scores_gemma":[0.3353161,0.0001159654,0.6633195,0.00001677929,0.0003920751,0.000003158151,0.000001907041,0.00003903367,0.0007955171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.239788,"threshold_uncertainty_score":0.3523297,"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."}}