{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002614081,0.0001983766,0.0003209869,0.0001355904,0.0003257453,0.00005451489,0.0001376214,0.00009492497,0.00005122801],"category_scores_gemma":[0.00008045357,0.0001600264,0.00008519658,0.0008525054,0.000193661,0.0001190726,0.000001919035,0.0002904733,0.00001262284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609636,"about_ca_system_score_gemma":0.00004377449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004992138,"about_ca_topic_score_gemma":0.0002387462,"domain_scores_codex":[0.9981169,0.0001295638,0.000600895,0.0003144081,0.0004271292,0.0004111708],"domain_scores_gemma":[0.998028,0.001202003,0.00006462444,0.000203341,0.0003656413,0.0001363487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000217627,0.00004579081,0.002466688,0.01263799,0.0002713614,0.00002659038,0.00174435,0.09407486,0.0001082148,0.01802838,0.01184137,0.8587326],"study_design_scores_gemma":[0.001847695,0.0002037452,0.09310824,0.003125,0.0006576824,0.000002895198,0.0003782729,0.587368,0.0001526945,0.005394001,0.3068648,0.0008970375],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002474085,0.03917804,0.9505791,0.002437187,0.0002280787,0.00328669,0.001108713,0.0005954493,0.0001126561],"genre_scores_gemma":[0.105329,0.8141149,0.07262333,0.0006653558,0.0002382867,0.002552299,0.003563282,0.0001947478,0.0007188433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8779558,"threshold_uncertainty_score":0.6525686,"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."}}