{"id":"W2041088973","doi":"10.1016/j.cor.2014.06.007","title":"A decomposition-based heuristic for the multiple-product inventory-routing problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Vendor; Computer science; Vehicle routing problem; Operations research; Routing (electronic design automation); Integer programming; Decomposition; Time horizon; Mathematical optimization; Product (mathematics); Linear programming; Mathematics; Algorithm; Business; Artificial intelligence; Marketing","routes":{"ca_aff":true,"ca_fund":true,"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.002744026,0.0001389547,0.0001442618,0.0002046523,0.001032765,0.0003577368,0.000430152,0.00004941638,0.00001468903],"category_scores_gemma":[0.0009324725,0.0001193344,0.00006513168,0.0005470371,0.0001078584,0.0001085326,0.00006905111,0.0003405092,0.0000292078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001388028,"about_ca_system_score_gemma":0.00008407062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003898235,"about_ca_topic_score_gemma":0.00004456949,"domain_scores_codex":[0.9981829,0.0004614923,0.0003044914,0.000293,0.0003216067,0.0004364952],"domain_scores_gemma":[0.9965743,0.00234184,0.00001391108,0.0004902306,0.0004840019,0.00009571444],"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.000005367404,0.00002356524,0.0002545904,0.00005432309,0.00002141067,2.617626e-7,0.0002820098,0.9834431,0.001197383,0.001373821,0.001792934,0.01155123],"study_design_scores_gemma":[0.0004755252,0.00004597557,0.000316873,0.00004963322,0.000008279071,0.000001959156,0.00003396109,0.9950668,0.001349811,0.0000655215,0.002449575,0.0001361344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009215952,0.00009573189,0.9875649,0.001219709,0.0003312749,0.001056286,0.000006915332,0.0002844576,0.0002247795],"genre_scores_gemma":[0.667274,0.000004452821,0.3319477,0.00007637063,0.0002833626,0.000282529,0.00003606312,0.00003985978,0.00005561636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.658058,"threshold_uncertainty_score":0.7943301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06450626381469744,"score_gpt":0.3730753622545784,"score_spread":0.308569098439881,"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."}}