{"id":"W2117833774","doi":"10.1287/ijoc.1080.0291","title":"Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Routing (electronic design automation); Operations research; Vendor; Inventory theory; Vehicle routing problem; Time horizon; Markov decision process; Column generation; Markov chain; Inventory management; Inventory control; Markov process; Mathematics; Operations management; Engineering","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.001771229,0.001062718,0.001356888,0.0009692993,0.0006499379,0.001088227,0.001237847,0.001008351,0.002837248],"category_scores_gemma":[0.003393186,0.0007038339,0.0009509049,0.001694829,0.0008656497,0.001684614,0.0009908302,0.001311192,0.0003419507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569592,"about_ca_system_score_gemma":0.001745967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0046873,"about_ca_topic_score_gemma":0.007053175,"domain_scores_codex":[0.9987489,0.0008221577,0.00005407622,0.00009921414,0.0001360966,0.000139626],"domain_scores_gemma":[0.996971,0.00248495,0.0001929989,0.00009058324,0.0001263343,0.0001340944],"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.00004531179,0.00003181528,0.0001539497,0.00004721085,0.00002776365,0.00004372362,0.00003439491,0.9708562,0.0001566828,0.01854782,0.0007281576,0.009326985],"study_design_scores_gemma":[0.00002601356,0.00002806844,0.00004261659,0.00001324886,0.000008969081,0.00001714098,0.00002265613,0.9720675,0.0001068111,0.02694617,0.0007137653,0.000007092177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03044283,0.001125325,0.9632022,0.0003317375,0.0000635975,0.0001874472,0.0002479677,0.0003368476,0.004061948],"genre_scores_gemma":[0.6280134,0.001473841,0.3677128,0.0001692077,0.0000601788,0.0004371007,0.0006531236,0.0001023895,0.001378042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0046873,"threshold_uncertainty_score":0.0113883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03873982677101141,"score_gpt":0.2671217237228494,"score_spread":0.228381896951838,"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."}}