{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001759109,0.001366357,0.0008103785,0.001583795,0.0006014489,0.001579782,0.0009922505,0.001018503,0.005849528],"category_scores_gemma":[0.006143182,0.0005892852,0.001178923,0.001651912,0.0009540766,0.001456605,0.001417445,0.001767697,0.001171824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750844,"about_ca_system_score_gemma":0.001445914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002183379,"about_ca_topic_score_gemma":0.002538696,"domain_scores_codex":[0.9987361,0.0006212957,0.00006289007,0.0001321112,0.0002867662,0.0001607965],"domain_scores_gemma":[0.9982072,0.001127488,0.000180794,0.0001734701,0.000226718,0.00008435233],"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.0001025813,0.00009169854,0.000753263,0.0004331593,0.00009569968,0.00008152938,0.0002271485,0.623009,0.003322619,0.1744046,0.008585936,0.1888927],"study_design_scores_gemma":[0.00005911656,0.0001035108,0.0002542146,0.0001611758,0.00004438677,0.0001113776,0.0001159669,0.868461,0.001225205,0.1148975,0.01454723,0.00001927936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01369839,0.002175268,0.9677652,0.0003643568,0.0001056191,0.0002273087,0.0001120297,0.0002568798,0.01529504],"genre_scores_gemma":[0.2612577,0.002699686,0.7273343,0.0003737269,0.0001051004,0.0006299041,0.0004373658,0.0003140795,0.006848195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005849528,"threshold_uncertainty_score":0.01956868,"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."}}