{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417264,0.0008810048,0.001404289,0.0009036801,0.0005605384,0.0008124614,0.001291725,0.00114298,0.003035479],"category_scores_gemma":[0.003886492,0.0005418151,0.0006525752,0.001431338,0.0007159523,0.001373565,0.0008056071,0.001242804,0.0002837862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010906,"about_ca_system_score_gemma":0.00128063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007520092,"about_ca_topic_score_gemma":0.006748965,"domain_scores_codex":[0.9994895,0.0002894491,0.00001853792,0.00006215945,0.00007272195,0.000067525],"domain_scores_gemma":[0.9981641,0.001493404,0.0001286164,0.00004332534,0.00008019103,0.00009030069],"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.00008928894,0.00008264967,0.0003001121,0.00004467204,0.00002344811,0.00003920683,0.00002131825,0.9762151,0.0002144457,0.00828194,0.0006731073,0.01401466],"study_design_scores_gemma":[0.00001288292,0.00002257699,0.00003887643,0.000002885968,0.000003739899,0.000004353054,0.000005281587,0.9968592,0.00005479873,0.002842327,0.0001512539,0.000001862703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1076975,0.001566692,0.8810498,0.0005743165,0.000110195,0.0001962245,0.0001641028,0.0002553236,0.00838601],"genre_scores_gemma":[0.595595,0.0009118182,0.3969356,0.0001434478,0.0001117513,0.0004910356,0.0003911074,0.000148347,0.005271973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007520092,"threshold_uncertainty_score":0.0149526,"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."}}