{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173565,0.001412287,0.001467606,0.001375974,0.0009426659,0.002225085,0.001974255,0.002776553,0.005493329],"category_scores_gemma":[0.002582839,0.001090584,0.001145862,0.001997067,0.000847752,0.001681645,0.00108808,0.002027647,0.0005172581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784818,"about_ca_system_score_gemma":0.002551827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01182762,"about_ca_topic_score_gemma":0.0127037,"domain_scores_codex":[0.9993966,0.0002954848,0.00002090131,0.00006261768,0.0001531327,0.00007140014],"domain_scores_gemma":[0.9986749,0.000957428,0.000084767,0.0000538345,0.0001675789,0.000061539],"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.0001079446,0.0001264066,0.0001627399,0.00007014573,0.00002816944,0.00003904507,0.00004097054,0.9546938,0.0005062075,0.0138598,0.001372262,0.02899258],"study_design_scores_gemma":[0.00002021313,0.00003075772,0.00003392949,0.000006670684,0.000008742564,0.000008465651,0.00001135551,0.9959394,0.0001255456,0.003458361,0.0003520432,0.000004603951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03121103,0.0005609047,0.9574652,0.0004491815,0.0001455319,0.0002248362,0.0001733345,0.0003180596,0.009451918],"genre_scores_gemma":[0.2420089,0.0006194501,0.7476441,0.000230556,0.0001273082,0.0007633247,0.000352826,0.0001615069,0.008092096],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01182762,"threshold_uncertainty_score":0.02351755,"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."}}