{"id":"W4401665365","doi":"10.1016/j.cor.2024.106807","title":"A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Fundamental Research Funds for the Central Universities; National University's Basic Research Foundation of China; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Computer science; Combinatorial auction; Branch and cut; Routing (electronic design automation); Combinatorial optimization; Algorithm; Common value auction; Mathematical optimization; Integer programming; Mathematics; Computer network","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.00162689,0.001301976,0.002345734,0.001309142,0.0009917435,0.002051903,0.002491343,0.002543988,0.008270007],"category_scores_gemma":[0.003921695,0.001256583,0.001323579,0.002306401,0.0007409157,0.00253006,0.00159785,0.002795914,0.001130703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001464249,"about_ca_system_score_gemma":0.003099426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007149213,"about_ca_topic_score_gemma":0.006473185,"domain_scores_codex":[0.999149,0.0002862217,0.00003998915,0.0001472551,0.0002319836,0.000145542],"domain_scores_gemma":[0.9982688,0.001250138,0.00007795371,0.00008724959,0.0001859639,0.0001298384],"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.0003911928,0.000478215,0.0004139862,0.0001791768,0.0001039812,0.0001181011,0.00007812605,0.7274806,0.001843771,0.03699422,0.009205908,0.2227127],"study_design_scores_gemma":[0.00006670131,0.00004545594,0.00006437903,0.000009763733,0.00001773675,0.00002530649,0.00001235176,0.9854527,0.000250486,0.01310715,0.000940542,0.000007464762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01012319,0.0004208383,0.983373,0.0003317852,0.0001110001,0.0001611682,0.0001122428,0.0004463414,0.004920518],"genre_scores_gemma":[0.1005068,0.0004389522,0.8925191,0.0001663826,0.0001046245,0.0003053274,0.0003602682,0.0002380711,0.005360446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008270007,"threshold_uncertainty_score":0.02766591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02329080499722644,"score_gpt":0.3124205499573705,"score_spread":0.289129744960144,"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."}}