{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001412833,0.0001368518,0.0001441958,0.0001765373,0.0008321854,0.0008824159,0.0001683525,0.00006905821,0.00002126885],"category_scores_gemma":[0.00004883526,0.0001057424,0.00002823794,0.0005034151,0.0001394205,0.0002538745,0.0001203481,0.0004052916,0.00003456283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009492296,"about_ca_system_score_gemma":0.00009508584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003281853,"about_ca_topic_score_gemma":0.000008756381,"domain_scores_codex":[0.9986797,0.0001832851,0.0002030043,0.0003008523,0.0002967312,0.0003364086],"domain_scores_gemma":[0.9985843,0.0008899972,0.000006522305,0.0002141089,0.000211594,0.00009349455],"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.000008227203,0.00002452863,0.00001540464,0.00006477349,0.0001529301,0.000003951197,0.001336185,0.8515477,0.00186078,0.002280918,0.001591866,0.1411128],"study_design_scores_gemma":[0.0004943266,0.00009564355,0.00003708251,0.00007892506,0.00002148075,0.0000338177,0.00005079607,0.9969178,0.0004895432,0.0001499542,0.001500619,0.000129975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005401353,0.0005356143,0.9906496,0.001262609,0.0003106452,0.001174104,0.00002440523,0.0003844016,0.0002572096],"genre_scores_gemma":[0.4413758,0.0001707375,0.5531362,0.00006418268,0.001228007,0.0008081336,0.00006167819,0.0002059497,0.002949391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4375135,"threshold_uncertainty_score":0.8509157,"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."}}