{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315739,0.0009078415,0.001237695,0.001602567,0.0009766765,0.001484495,0.001503407,0.001483173,0.007728189],"category_scores_gemma":[0.003434071,0.0007042241,0.0005880769,0.002224958,0.0009781725,0.001080537,0.0007515802,0.0007635786,0.001094236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554442,"about_ca_system_score_gemma":0.002117247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009768316,"about_ca_topic_score_gemma":0.007756586,"domain_scores_codex":[0.9993089,0.0004345971,0.00001707834,0.00005407384,0.00007883214,0.0001064674],"domain_scores_gemma":[0.9983439,0.001225687,0.0001254393,0.00008275653,0.0001495567,0.00007252771],"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.00008880216,0.00009309866,0.0003082867,0.00006181855,0.00002616831,0.00005382529,0.0000526425,0.9511088,0.0004219328,0.006619405,0.00259854,0.03856679],"study_design_scores_gemma":[0.0000422628,0.00003544006,0.0000692939,0.00001295742,0.000008015867,0.0000142432,0.00002493058,0.9961826,0.0001863646,0.002649646,0.0007682669,0.000005925023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.135209,0.001688801,0.8395484,0.0006334932,0.0001627497,0.0005401283,0.0005744358,0.002151948,0.01949097],"genre_scores_gemma":[0.4262362,0.000564151,0.5664696,0.0002598091,0.00005044043,0.0007702634,0.0007234371,0.000294361,0.004631804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009768316,"threshold_uncertainty_score":0.0258534,"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."}}