{"id":"W2886343885","doi":"10.1287/trsc.2018.0844","title":"Branch-and-Price–Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; TKI DINALOG; Université de Montréal","keywords":"Vehicle routing problem; Path (computing); Set (abstract data type); Column generation; Computer science; Routing (electronic design automation); Mathematical optimization; Algorithm; Operations research; Engineering; 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.0003893833,0.0001225065,0.0001060188,0.00005631692,0.0003071614,0.00005624993,0.0002046825,0.00002920428,0.00002900103],"category_scores_gemma":[0.000006019693,0.0000841838,0.0000251519,0.0004920255,0.0005449151,0.0002258668,0.000001034991,0.00008169464,0.00001250693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002317915,"about_ca_system_score_gemma":0.00006316632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002421579,"about_ca_topic_score_gemma":0.0001011007,"domain_scores_codex":[0.9990247,0.000003717172,0.0001892821,0.00022689,0.0002658844,0.0002895512],"domain_scores_gemma":[0.9995013,0.00008918699,0.00003503277,0.0001611344,0.0001370844,0.0000762023],"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.0005311004,0.0002473297,0.08158546,0.000661226,0.0002121033,0.00003030911,0.02185524,0.3997963,0.3597118,0.03377481,0.0005331617,0.1010612],"study_design_scores_gemma":[0.001235356,0.0001566105,0.09390707,0.00004562699,0.00006541225,0.000001588231,0.000053067,0.8757302,0.02691402,0.0002854243,0.001319055,0.0002865805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1465338,0.00005937476,0.8510736,0.0001238037,0.0001069538,0.0004928925,0.00003931077,0.0002400432,0.001330244],"genre_scores_gemma":[0.9814378,0.000003534835,0.01825877,0.00009410491,0.00006978404,0.00003502311,0.00001319807,0.00001885277,0.00006893539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.834904,"threshold_uncertainty_score":0.3432916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02525336733336839,"score_gpt":0.2377814720255807,"score_spread":0.2125281046922123,"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."}}