{"id":"W4405045402","doi":"10.1016/j.eswa.2024.125996","title":"A new branch-and-Benders-cut algorithm for the time-dependent vehicle routing problem","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Vehicle routing problem; Branch and cut; Computer science; Algorithm; Mathematical optimization; Routing (electronic design automation); Integer programming; Mathematics; Computer network","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.0003651212,0.0001800739,0.000170106,0.00006213868,0.0002473685,0.0002833357,0.0001785358,0.00007600783,0.00001349672],"category_scores_gemma":[0.000007220496,0.0001301496,0.00004234343,0.0003144801,0.00002588217,0.0001276456,0.00002696986,0.0001396456,0.0000533702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008538381,"about_ca_system_score_gemma":0.00005612974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000584,"about_ca_topic_score_gemma":0.000005367437,"domain_scores_codex":[0.9989588,0.00003242963,0.0002764255,0.0003001571,0.0001738238,0.0002584241],"domain_scores_gemma":[0.9991024,0.0003772816,0.00003585134,0.0003313768,0.00005332673,0.00009981725],"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.000006911604,0.00002681082,0.00003152322,0.0004051353,0.0004983229,0.000002285198,0.005112244,0.3238878,0.006323338,0.01361192,0.01667675,0.633417],"study_design_scores_gemma":[0.0002248097,0.00001517787,0.000005687744,0.00009594723,0.00003054784,0.00004320321,0.0003154329,0.9413869,0.0005836997,0.00009027357,0.05702676,0.0001815222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002244387,0.006062881,0.989243,0.0005306489,0.0001433211,0.001837637,0.00001922055,0.001022894,0.001117971],"genre_scores_gemma":[0.2194195,0.0002460902,0.7589457,0.0001564288,0.002080989,0.01051129,0.00004898589,0.0003743926,0.008216579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6332355,"threshold_uncertainty_score":0.5307345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01292064753711186,"score_gpt":0.2621486258310455,"score_spread":0.2492279782939336,"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."}}