{"id":"W4383070024","doi":"10.1016/j.cor.2023.106338","title":"Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Context (archaeology); Markov decision process; Mathematical optimization; Set (abstract data type); Variable (mathematics); Dynamic programming; State variable; Routing (electronic design automation); Markov process; Mathematics","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.0007844132,0.0001051791,0.0001092387,0.0002351347,0.000724808,0.0002483324,0.0001480178,0.00004146677,0.000005253312],"category_scores_gemma":[0.00003136056,0.00007952009,0.00001930201,0.001476434,0.0001019061,0.0001954951,0.00003086727,0.0002262716,0.00001023379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005217741,"about_ca_system_score_gemma":0.00007503088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003787731,"about_ca_topic_score_gemma":0.0002191598,"domain_scores_codex":[0.9989497,0.0000288697,0.0002194591,0.0002097203,0.0002227493,0.000369478],"domain_scores_gemma":[0.9990858,0.0003206578,0.000008573074,0.0002073419,0.0003196674,0.00005789116],"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.000009804955,0.0000259333,0.00005846717,0.00008984993,0.00006349486,8.589657e-7,0.0009490185,0.9694193,0.0008066352,0.00692348,0.0002959758,0.02135717],"study_design_scores_gemma":[0.000438626,0.00006055131,0.0008337167,0.00005013158,0.00001668475,0.000002591273,0.0003983583,0.996456,0.00005272999,0.00004536835,0.001545676,0.00009957977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0829493,0.00006695828,0.9138439,0.001134507,0.00006867752,0.001473553,0.00003024349,0.0003715354,0.00006133089],"genre_scores_gemma":[0.9608894,0.00002115554,0.03755877,0.00002383017,0.00003512431,0.001058188,0.0001384896,0.00003264807,0.000242416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8779401,"threshold_uncertainty_score":0.557471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03419786777119948,"score_gpt":0.3140108607773663,"score_spread":0.2798129930061668,"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."}}