{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008295153,0.0007212411,0.0009694255,0.0003992801,0.0003611343,0.001015784,0.00143623,0.001102853,0.002004536],"category_scores_gemma":[0.001388194,0.0004449242,0.0006838278,0.0006306599,0.0004795666,0.001004004,0.001005212,0.0009019764,0.0001573699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008096633,"about_ca_system_score_gemma":0.001237591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007873275,"about_ca_topic_score_gemma":0.00840466,"domain_scores_codex":[0.9994404,0.000245009,0.00001901203,0.0001379821,0.00008407338,0.0000734865],"domain_scores_gemma":[0.9994766,0.0003268611,0.00006689197,0.0000287707,0.00005079646,0.00005017585],"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.00002705791,0.00003002387,0.0003458283,0.00005264928,0.00001673089,0.00008439762,0.0000207672,0.9823818,0.0002911078,0.006963605,0.0007414964,0.009044497],"study_design_scores_gemma":[0.000006510314,0.00001364842,0.00005511031,0.000004185901,0.000003953814,0.00001908052,0.00001775885,0.9971076,0.00007249981,0.002204533,0.0004920778,0.000003109574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06227277,0.001115872,0.9248459,0.0006398968,0.0001206728,0.0001565209,0.0001823975,0.0001562787,0.01050983],"genre_scores_gemma":[0.7510547,0.0007485066,0.2401471,0.0001768278,0.00007825992,0.0003235075,0.0002960975,0.00007569148,0.007099225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007873275,"threshold_uncertainty_score":0.01565486,"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."}}