{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001068763,0.0002737097,0.0003228979,0.0002838458,0.0006409473,0.0001379386,0.0002732316,0.0001202534,0.00000924192],"category_scores_gemma":[0.0006286688,0.0002538903,0.0001683645,0.0003019862,0.00004842547,0.0001842967,0.0000316634,0.0006531325,0.00001621329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000283238,"about_ca_system_score_gemma":0.0001327964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001634463,"about_ca_topic_score_gemma":8.818535e-7,"domain_scores_codex":[0.9980346,0.00003682927,0.0008314059,0.0001539062,0.0003659464,0.0005773248],"domain_scores_gemma":[0.9986108,0.0004563672,0.0002963972,0.0001843245,0.0002334311,0.0002186621],"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.00001563073,0.00002060573,0.001133056,0.00005710228,0.00003208635,0.00001022173,0.0005490261,0.9801502,0.00004849655,0.0001166744,0.0002878813,0.01757897],"study_design_scores_gemma":[0.001297448,0.0001544403,0.0004326377,0.0003207565,0.00001555694,0.0001722524,0.00003490807,0.996205,0.0001781812,0.00009483297,0.0007861877,0.000307778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1040466,0.00004836214,0.8935875,0.00004531513,0.0009234214,0.0002609363,0.00000269846,0.0003661853,0.000718989],"genre_scores_gemma":[0.8540584,0.000004849853,0.1450419,0.0002119899,0.0005557106,0.000004163875,0.000006823624,0.00007461778,0.00004152913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7500118,"threshold_uncertainty_score":0.9999914,"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."}}