{"id":"W2098090443","doi":"10.1287/trsc.1040.0103","title":"A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":273,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Benchmark (surveying); Algorithm; Computer science; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Residual; Route planning; Mathematics; Computer network","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.001306915,0.00009606065,0.00008538162,0.00008284735,0.0003764944,0.0001017317,0.0002836445,0.00003301445,0.00001700894],"category_scores_gemma":[0.00001301827,0.00008097542,0.00004231634,0.0008929421,0.0001539985,0.0003442825,0.000003468747,0.0000982553,0.000007469143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005569974,"about_ca_system_score_gemma":0.00007224539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001197365,"about_ca_topic_score_gemma":0.00003365344,"domain_scores_codex":[0.9987956,0.00001490572,0.0002636415,0.0002171286,0.0003740411,0.0003347221],"domain_scores_gemma":[0.9993652,0.0001880892,0.00003395364,0.0001652816,0.0002016747,0.00004579897],"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.000001896534,0.000008540977,0.001434827,0.0000173277,0.000003589146,6.431303e-7,0.0005752073,0.9104491,0.01052518,0.002038107,0.00003568406,0.07490982],"study_design_scores_gemma":[0.0002179252,0.000009224444,0.039293,0.00001085792,0.00001086126,7.176306e-7,0.0001359206,0.9496039,0.01018211,0.000144141,0.0002836572,0.0001076586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1392037,0.00006239297,0.8595569,0.00008883684,0.0001074461,0.0003437385,0.00002057086,0.0002302301,0.0003862369],"genre_scores_gemma":[0.6573957,0.00000678427,0.3423711,0.00002364373,0.00005229669,0.00003633793,0.00001028206,0.00001602575,0.00008782493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5181921,"threshold_uncertainty_score":0.3302082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01970802792664043,"score_gpt":0.2744546307225553,"score_spread":0.2547466027959149,"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."}}