{"id":"W4361221305","doi":"10.1287/ijoc.2023.1288","title":"Decomposition Strategies for Vehicle Routing Heuristics","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Merge (version control); Decomposition; Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Local search (optimization); Decomposition method (queueing theory); Heuristic; Mathematics; Algorithm; Discrete mathematics; Information retrieval","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.001104804,0.0001611145,0.0001837356,0.0002376001,0.0004220644,0.0004011364,0.0001745291,0.00008007394,0.000006392416],"category_scores_gemma":[0.0001707643,0.0001538114,0.00009874558,0.0004113611,0.00001535151,0.0003251499,0.00003436244,0.0003618303,0.00004782968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001141574,"about_ca_system_score_gemma":0.00004308874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.63791e-7,"about_ca_topic_score_gemma":2.650814e-7,"domain_scores_codex":[0.9987061,0.00002584755,0.0005234725,0.00009990083,0.0002172024,0.0004274977],"domain_scores_gemma":[0.9990448,0.0004664203,0.0001381093,0.0001117347,0.000135791,0.0001031424],"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.000008259266,0.000004470184,0.0002487669,0.00003507109,0.00002440719,0.00000722622,0.0004357603,0.954407,0.0005087515,0.001836036,0.0006987797,0.04178541],"study_design_scores_gemma":[0.0004632508,0.00007588133,0.001261029,0.0001242625,0.000008695853,0.00005173193,0.0004361236,0.9942927,0.000663598,0.001475731,0.0009568757,0.0001901037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3237115,0.00001200134,0.6727443,0.00006066689,0.0008713218,0.0001054102,0.000003353308,0.0006979956,0.001793419],"genre_scores_gemma":[0.9241338,0.00001497577,0.07511041,0.0001128932,0.0005447132,0.000002213914,0.0000122872,0.00004823473,0.00002052703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6004222,"threshold_uncertainty_score":0.6272248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02684790388710746,"score_gpt":0.3186934770919792,"score_spread":0.2918455732048718,"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."}}