{"id":"W2037219660","doi":"10.1016/j.cor.2014.03.027","title":"Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; China Scholarship Council","keywords":"Computer science; Heuristic; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Markov chain; Markov decision process; Embedding; Process (computing); Operations research; Sequence (biology); Markov process; Computer network; Mathematics; Artificial intelligence; Machine learning","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.002110448,0.0001759642,0.0001819084,0.0001607117,0.00119561,0.0005190963,0.0003425439,0.00007977157,0.00001635076],"category_scores_gemma":[0.0002875235,0.0001299237,0.00003566435,0.0008285071,0.0001401089,0.0002684525,0.00006676833,0.0003595834,0.00001180447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001202042,"about_ca_system_score_gemma":0.0001195128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002560668,"about_ca_topic_score_gemma":0.00007771277,"domain_scores_codex":[0.9981204,0.0004343652,0.0003068683,0.0003091414,0.0003590269,0.0004701929],"domain_scores_gemma":[0.9973689,0.001301246,0.00001896517,0.0003801883,0.0008328655,0.00009784243],"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.00001525987,0.00001897141,0.00002195831,0.00002317563,0.00004516175,2.866276e-7,0.0007176484,0.9827421,0.0002995783,0.004305288,0.0005488253,0.01126169],"study_design_scores_gemma":[0.0006638298,0.0002368775,0.0001306525,0.00005847932,0.00001445274,0.000004392832,0.0002408896,0.9978776,0.0003951225,0.00004466411,0.0001622731,0.0001707942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005860885,0.0000598661,0.9913912,0.0005903327,0.00009941725,0.001279395,0.000006090798,0.0002735772,0.0004391787],"genre_scores_gemma":[0.7936772,0.000008767624,0.2054552,0.00004165134,0.0001706659,0.0003451133,0.00004089404,0.00005550514,0.0002049876],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7878163,"threshold_uncertainty_score":0.9195783,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0653815366770034,"score_gpt":0.3409312984287469,"score_spread":0.2755497617517435,"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."}}