{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002410212,0.002677269,0.002883127,0.00187286,0.001274868,0.002489147,0.00296441,0.002498466,0.0112734],"category_scores_gemma":[0.005287229,0.001313153,0.00149926,0.004010943,0.0009949517,0.003592553,0.001834488,0.003663757,0.001817327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00263999,"about_ca_system_score_gemma":0.003537225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009729735,"about_ca_topic_score_gemma":0.01126398,"domain_scores_codex":[0.9987732,0.0004669978,0.00006150175,0.0002129401,0.0002328943,0.0002524916],"domain_scores_gemma":[0.9972225,0.002100109,0.0002015242,0.0001309266,0.0001869553,0.0001579513],"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.0001594773,0.0002537752,0.0003860189,0.0002120274,0.00009502695,0.00006249917,0.00008156708,0.8655506,0.0004621914,0.03082547,0.007258706,0.0946526],"study_design_scores_gemma":[0.00006009918,0.00004470944,0.00007060792,0.00001764341,0.00001463181,0.00001736946,0.0000233287,0.9810049,0.0001713092,0.01711529,0.001451821,0.000008278977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01911429,0.002185791,0.9628103,0.000697915,0.0002000413,0.0004365369,0.0003432398,0.001124138,0.01308767],"genre_scores_gemma":[0.2048141,0.002007204,0.7824369,0.0003151302,0.0002206239,0.0009475019,0.001200195,0.0005524658,0.007505929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0112734,"threshold_uncertainty_score":0.03771323,"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."}}