{"id":"W2749062520","doi":"10.1002/net.20192","title":"A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":203,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Consiglio Nazionale delle Ricerche; Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Tabu search; Heuristics; Mathematical optimization; Computer science; Minification; Heuristic; Routing (electronic design automation); Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135296,0.0001124105,0.00009838953,0.00003138672,0.0001972439,0.00005955363,0.00009264967,0.00005569113,0.00005262325],"category_scores_gemma":[0.00001082354,0.00008122694,0.00002967772,0.0001968084,0.00007091053,0.00004630407,0.00001694074,0.0002332224,0.000006868233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003452299,"about_ca_system_score_gemma":0.00001798915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007626868,"about_ca_topic_score_gemma":0.00002494307,"domain_scores_codex":[0.9991623,0.00001227869,0.0001685523,0.0001295412,0.0001327369,0.0003945859],"domain_scores_gemma":[0.9992848,0.0004386739,0.00002539776,0.0001171265,0.0000662012,0.00006779328],"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.00001921824,0.000005982758,0.0009309096,0.00001669928,0.00003200517,0.000002886848,0.0001889677,0.9858066,0.00005213347,0.001059102,0.0004707494,0.01141479],"study_design_scores_gemma":[0.0005765005,0.00002660268,0.0003542832,0.00008408965,0.0000151666,0.00001558206,0.00004877845,0.9980828,0.00008885846,0.00003656487,0.0005489868,0.0001218239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031493,0.0002787964,0.9833676,0.00008496494,0.0002602243,0.0005007061,0.000003384642,0.0002496056,0.004939819],"genre_scores_gemma":[0.9890727,0.000006675759,0.01039396,0.0001158303,0.0002309796,0.00001558245,0.00001154253,0.0000376352,0.0001150387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787578,"threshold_uncertainty_score":0.3312338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01426255619985574,"score_gpt":0.2389436817591051,"score_spread":0.2246811255592494,"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."}}