{"id":"W2584833029","doi":"10.1016/j.cor.2017.01.020","title":"Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Austrian Science Fund","keywords":"Truck; Trailer; Computer science; Vehicle routing problem; Metaheuristic; Routing (electronic design automation); Branch and price; Set (abstract data type); Order (exchange); Service (business); Operations research; Variable neighborhood search; Transport engineering; Mathematical optimization; Automotive engineering; Integer programming; Business; Algorithm; Engineering; Computer network; Mathematics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001749745,0.0001332812,0.0001634363,0.0001042927,0.002028477,0.0009259378,0.0002627196,0.00006342063,0.00001060729],"category_scores_gemma":[0.0001027276,0.00009921633,0.0000169439,0.0001429556,0.0002245775,0.0003493246,0.0002250188,0.0003599519,0.000003559814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003533857,"about_ca_system_score_gemma":0.0000596486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000031662,"about_ca_topic_score_gemma":0.00003486147,"domain_scores_codex":[0.9987254,0.0001739222,0.0001571566,0.0002898966,0.0002386391,0.0004149455],"domain_scores_gemma":[0.9985284,0.0007323855,0.00001437242,0.0003533083,0.0002580591,0.0001134515],"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.0001196818,0.00007026844,0.006978469,0.000212249,0.0003627461,0.000006224981,0.01293422,0.8132324,0.002685179,0.02039398,0.0007205012,0.142284],"study_design_scores_gemma":[0.0009341003,0.0001096985,0.01100199,0.00005796274,0.00001053106,0.00001464296,0.0001768226,0.9870604,0.0002462095,0.00004374153,0.0002161877,0.000127757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06945941,0.0003261805,0.9264433,0.001343103,0.0000389565,0.001313468,0.0000231484,0.00008249161,0.0009699595],"genre_scores_gemma":[0.8879067,0.00007964131,0.1114761,0.00002686592,0.0001029958,0.0001024437,0.000005488127,0.0000386358,0.0002611028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8184473,"threshold_uncertainty_score":0.9992707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05007025236499678,"score_gpt":0.3340841521052146,"score_spread":0.2840138997402178,"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."}}