{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006184072,0.0001672903,0.0002790115,0.00006138718,0.0002221622,0.00003222642,0.0001024192,0.00005438599,0.00007494576],"category_scores_gemma":[0.00004459039,0.0001750665,0.00002633321,0.0003639012,0.00004603338,0.000128609,0.0001034927,0.0001838405,0.000001585474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681335,"about_ca_system_score_gemma":0.00002971656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003665687,"about_ca_topic_score_gemma":4.135574e-7,"domain_scores_codex":[0.9989429,0.00007269794,0.0002529606,0.0002590029,0.0001710971,0.0003013528],"domain_scores_gemma":[0.9993563,0.0002455938,0.00007466815,0.0001698164,0.00007130665,0.00008232841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008215238,0.000330829,0.01153829,0.0004575271,0.0006748814,0.00002506694,0.00520302,0.4017217,0.01155253,0.0008443283,0.0003883749,0.5671813],"study_design_scores_gemma":[0.001678062,0.0000768506,0.0006500725,0.00001882929,0.00004349322,0.0001112948,0.000106661,0.9953114,0.0009041927,0.00007381619,0.0008032599,0.0002220177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03666838,0.0002172947,0.9616308,0.00002634391,0.00009772316,0.0005054636,0.0001232739,0.0002002194,0.0005305589],"genre_scores_gemma":[0.0442722,0.00001339975,0.9549385,0.00003654824,0.00004406282,0.000119471,0.00001893418,0.00007358815,0.0004832712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5935898,"threshold_uncertainty_score":0.7139006,"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."}}