{"id":"W2987023879","doi":"10.1016/j.ejor.2019.11.015","title":"Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Iterated local search; Mathematical optimization; Computer science; Heuristic; Routing (electronic design automation); Metaheuristic; Product (mathematics); Time horizon; Set (abstract data type); Quality (philosophy); USable; Vehicle routing problem; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004567392,0.0001008422,0.0001496559,0.0001902768,0.0002104242,0.0002435772,0.0001272075,0.00001352922,0.00001865038],"category_scores_gemma":[0.0003242312,0.00008554471,0.00001723423,0.0001665585,0.00005174577,0.0005713371,0.00003952316,0.000319488,0.000005488127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005323945,"about_ca_system_score_gemma":0.0001301659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001487423,"about_ca_topic_score_gemma":5.726176e-7,"domain_scores_codex":[0.9984207,0.0004202619,0.0003383335,0.0001662074,0.0004242246,0.0002302501],"domain_scores_gemma":[0.9986244,0.0001801759,0.00006155051,0.0001156721,0.0008867448,0.0001314089],"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.000296947,0.0002011565,0.01087754,0.000825726,0.0003038396,0.0000728213,0.004458356,0.7212521,0.02253915,0.003703041,0.003296312,0.2321729],"study_design_scores_gemma":[0.001295878,0.0008209071,0.004063246,0.0001676778,0.00001155438,0.0003153852,0.0001253453,0.9892826,0.001002665,0.00012776,0.002617481,0.0001694746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6584526,0.0004538703,0.3377019,0.0003349796,0.00009736549,0.0006940367,0.00001325324,0.00003955006,0.002212428],"genre_scores_gemma":[0.7050791,0.0000354892,0.2942024,0.00001794924,0.0002342835,0.000004525953,0.00001066597,0.00004776748,0.0003678519],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2680305,"threshold_uncertainty_score":0.3488412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.053666287729541,"score_gpt":0.3264092029831595,"score_spread":0.2727429152536184,"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."}}