{"id":"W4308453111","doi":"10.3390/a15110412","title":"Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Column generation; Vehicle routing problem; Computer science; Variable (mathematics); TRIPS architecture; Truck; Routing (electronic design automation); Column (typography); Mathematical optimization; Branch and price; Variable neighborhood search; Algorithm; Integer programming; Mathematics; Metaheuristic; Parallel computing; Engineering; 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.002058084,0.001530736,0.002070046,0.001260234,0.001139618,0.00168906,0.002440225,0.001898352,0.01163222],"category_scores_gemma":[0.002927435,0.000967085,0.001144223,0.002461467,0.0007951137,0.002206943,0.001328144,0.002444861,0.001569521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00201415,"about_ca_system_score_gemma":0.003209279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009795895,"about_ca_topic_score_gemma":0.0107115,"domain_scores_codex":[0.999132,0.0003216488,0.00004001868,0.0001240411,0.0002050537,0.0001772587],"domain_scores_gemma":[0.9986713,0.0009097527,0.0001053964,0.00006544375,0.000147244,0.0001009139],"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.0001263252,0.0001492162,0.0003742143,0.0001397437,0.00006057827,0.000107614,0.00007937964,0.8694162,0.0005443841,0.04748207,0.007159975,0.07436026],"study_design_scores_gemma":[0.00003037025,0.00003017336,0.00004088494,0.000009875905,0.000007424698,0.0000148283,0.000009774503,0.9870884,0.0001430558,0.01125,0.001370127,0.000005040229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007995248,0.0004993325,0.9835285,0.0003542796,0.00008255926,0.0001980903,0.0001329047,0.0005014671,0.006707586],"genre_scores_gemma":[0.1234836,0.0005760119,0.8664885,0.000166333,0.00007130917,0.0006569419,0.0004460074,0.000278877,0.007832301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01163222,"threshold_uncertainty_score":0.03891361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01395751889559828,"score_gpt":0.2573606026811846,"score_spread":0.2434030837855863,"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."}}