{"id":"W4312080859","doi":"10.1155/2022/5603956","title":"The Two-Echelon Vehicle Routing Problem with Transshipment Nodes and Occasional Drivers: Formulation and Adaptive Large Neighborhood Search Heuristic","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ministry of Education, India; Ministry of Science and Technology of the People's Republic of China; Ministry of Education of the People's Republic of China","keywords":"Transshipment (information security); Vehicle routing problem; Operations research; Truck; Heuristic; Routing (electronic design automation); Computer science; Local search (optimization); Mathematical optimization; Heuristics; Crowds; Engineering; Mathematics; Algorithm; Artificial intelligence; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002683603,0.0001193636,0.0001454646,0.00006300234,0.0003243244,0.00002275396,0.00006153349,0.00002250094,0.000007521113],"category_scores_gemma":[0.000002331771,0.00009054989,0.00003438124,0.0001328363,0.0000346547,0.0002757106,0.000001955389,0.0003262923,1.134458e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007017412,"about_ca_system_score_gemma":0.00003135925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003232952,"about_ca_topic_score_gemma":0.00006740954,"domain_scores_codex":[0.9990168,0.00002491346,0.0003310244,0.0001033521,0.0003367602,0.0001872142],"domain_scores_gemma":[0.999597,0.00009881526,0.00009833513,0.00005046123,0.00008589181,0.00006955852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0008304287,0.0000840049,0.03206841,0.00009455701,0.0001441839,0.0000898107,0.008308068,0.9267314,0.004134072,0.01488094,0.000004945628,0.01262918],"study_design_scores_gemma":[0.009744862,0.001723752,0.8290942,0.0002147481,0.0003705818,0.000116332,0.01037482,0.1406683,0.001368536,0.004906895,0.0008525946,0.0005643541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8727068,0.0007871101,0.1259461,0.00008560436,0.00009051054,0.0002209012,0.00005515667,0.00002957653,0.0000782503],"genre_scores_gemma":[0.9942595,0.0002334546,0.00540198,0.00001162217,0.00003175953,0.000007738674,0.00002659956,0.00002035246,0.000007039916],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7970259,"threshold_uncertainty_score":0.3692517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0124028890482465,"score_gpt":0.2097586499359249,"score_spread":0.1973557608876784,"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."}}