{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599487,0.000115163,0.0001243168,0.0003092271,0.0008220711,0.0002722132,0.000201888,0.0000680927,0.00001829335],"category_scores_gemma":[0.0003176189,0.0001255127,0.00003299037,0.0008222785,0.0001022698,0.0002391724,0.00006524573,0.00022795,0.00006404457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001996087,"about_ca_system_score_gemma":0.00006687555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000124642,"about_ca_topic_score_gemma":0.00002676483,"domain_scores_codex":[0.9985096,0.0002305559,0.0002790477,0.0003099678,0.0002635331,0.0004072392],"domain_scores_gemma":[0.9984893,0.00020097,0.00001107152,0.0002865459,0.0009315759,0.0000805308],"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.00001237126,0.00004556703,0.00006763251,0.00007338877,0.00003031334,6.59816e-7,0.001608334,0.9600378,0.01378452,0.001784112,0.005148753,0.01740659],"study_design_scores_gemma":[0.0002200995,0.00009880002,0.0001684422,0.00006237124,0.000006126174,0.00001149713,0.00006978892,0.9889857,0.009380079,0.0001874577,0.0006750005,0.0001347066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08192006,0.00003308332,0.915076,0.0004907204,0.0005197006,0.0009517749,0.00000457571,0.0003672046,0.0006369185],"genre_scores_gemma":[0.5411187,0.000006520031,0.457888,0.00001358813,0.0005984603,0.0001730391,0.00003179715,0.00003192362,0.0001379836],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4591986,"threshold_uncertainty_score":0.632279,"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."}}