{"id":"W4310033065","doi":"10.1016/j.ejor.2022.11.040","title":"An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Integer (computer science); Mathematical optimization; TRIPS architecture; Branch and cut; Routing (electronic design automation); Operations research; Integer programming; 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.00887902,0.00009160926,0.0001203982,0.0001494247,0.0007545258,0.0002080036,0.0003223262,0.000009938391,0.0001423754],"category_scores_gemma":[0.000199469,0.00006432672,0.00002928587,0.0002773701,0.0000710887,0.0002298803,0.0000874135,0.0006278672,0.000004642805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008318417,"about_ca_system_score_gemma":0.0001128905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.781708e-7,"about_ca_topic_score_gemma":3.04977e-7,"domain_scores_codex":[0.9976847,0.0009708269,0.0003204226,0.0001234941,0.0006665804,0.0002340403],"domain_scores_gemma":[0.9984735,0.0007339007,0.00005922106,0.0001188309,0.0005104532,0.000104092],"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.00005679418,0.00002494677,0.00004291208,0.000005766223,0.00005149029,0.0000163638,0.0007278393,0.9705176,0.003103659,0.0001571424,0.0002966964,0.02499883],"study_design_scores_gemma":[0.0007898451,0.00062731,0.0006472433,0.00002129521,0.00001137241,0.0001728952,0.0003919677,0.9964594,0.00006708296,0.00002437134,0.0007048332,0.00008233056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02119896,0.0001976851,0.9771648,0.0005489797,0.00005337727,0.0003409761,0.00001421432,0.00002611837,0.0004549101],"genre_scores_gemma":[0.8517485,0.000006896813,0.1474987,0.0000551669,0.000308426,0.00002057743,0.000007840167,0.00006459682,0.0002892711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8305495,"threshold_uncertainty_score":0.5803279,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04175022239280719,"score_gpt":0.3241135125620981,"score_spread":0.2823632901692909,"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."}}