{"id":"W4385438103","doi":"10.1016/j.tre.2023.103226","title":"A branch-and-regret algorithm for the same-day delivery problem","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Regret; Computer science; Vehicle routing problem; Routing (electronic design automation); Variety (cybernetics); Mathematical optimization; Operations research; Scheme (mathematics); Look-ahead; Algorithm; Mathematics; Computer network; Artificial intelligence","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.003027613,0.001801097,0.003653191,0.001120292,0.001282431,0.001996347,0.004251011,0.003963452,0.00860918],"category_scores_gemma":[0.00453804,0.001191091,0.001986889,0.002404607,0.001265744,0.002817164,0.002341792,0.004538848,0.001777319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002151716,"about_ca_system_score_gemma":0.004020379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01034975,"about_ca_topic_score_gemma":0.008443347,"domain_scores_codex":[0.9984463,0.0006317608,0.00006078471,0.0002776441,0.0003122616,0.0002712097],"domain_scores_gemma":[0.9972461,0.001979578,0.0001004196,0.0001466988,0.0003326595,0.0001945472],"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.0002728152,0.0002847894,0.0004095418,0.0001926102,0.0001048115,0.00006764458,0.00007889575,0.8057347,0.0005989601,0.02146094,0.01634019,0.1544542],"study_design_scores_gemma":[0.00005766318,0.00005419342,0.00007605553,0.00001268885,0.00001705599,0.00002227791,0.0000143536,0.9882246,0.0001287658,0.01032502,0.00105946,0.000007783988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006311696,0.0009099826,0.9857833,0.0006026494,0.0002344152,0.0001177586,0.0001505369,0.0005318911,0.005357814],"genre_scores_gemma":[0.1371066,0.001137555,0.8482821,0.000500796,0.0004069277,0.0004501554,0.0006759418,0.0004424606,0.01099755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01034975,"threshold_uncertainty_score":0.02880055,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1063418470076204,"score_gpt":0.3734209020231644,"score_spread":0.267079055015544,"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."}}