{"id":"W2800829962","doi":"10.1016/j.cor.2018.05.004","title":"A decomposition heuristic for a rich production routing problem","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Solver; Mathematical optimization; Heuristic; Computer science; Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Context (archaeology); Set (abstract data type); Production (economics); Decomposition; 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.0007724782,0.0009127029,0.0009154746,0.001087515,0.000564756,0.0009650067,0.0008789887,0.001330523,0.00481165],"category_scores_gemma":[0.001805592,0.000716245,0.001076352,0.001244622,0.0005280909,0.001005941,0.001242202,0.001154532,0.0005100722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008143926,"about_ca_system_score_gemma":0.0009794487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003468585,"about_ca_topic_score_gemma":0.004153616,"domain_scores_codex":[0.9997049,0.0001182906,0.00001171679,0.00004888144,0.00005707184,0.00005910381],"domain_scores_gemma":[0.9993892,0.0003945047,0.00004106944,0.00005366246,0.00006421906,0.00005736365],"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.0001057635,0.0001058156,0.0002336079,0.0001281148,0.00003947054,0.0001119454,0.00006248152,0.9178421,0.003135495,0.01579528,0.00262206,0.05981782],"study_design_scores_gemma":[0.00002844067,0.00003271232,0.00007381592,0.00001748006,0.00001653794,0.00002667848,0.00002138855,0.9895739,0.000352877,0.008861713,0.0009891449,0.000005232773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04072913,0.0004162109,0.9491515,0.0002614906,0.00008439142,0.0001112828,0.0001730764,0.0002588329,0.008814001],"genre_scores_gemma":[0.2643696,0.0003792193,0.7299896,0.0001264861,0.00004997275,0.000210359,0.0003523181,0.0001884508,0.004333893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00481165,"threshold_uncertainty_score":0.01609653,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06507195492111406,"score_gpt":0.4036858702288438,"score_spread":0.3386139153077297,"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."}}