{"id":"W2146004814","doi":"10.1016/j.cor.2012.04.007","title":"An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":506,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; HEC Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Vehicle routing problem; Heuristic; Computer science; Context (archaeology); Routing (electronic design automation); Mathematical optimization; Scheme (mathematics); Local search (optimization); Operations research; Mathematics; Algorithm; Artificial intelligence; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.000957475,0.0004744751,0.001037241,0.0006161207,0.0004815903,0.0005373624,0.001291592,0.0009352362,0.001652474],"category_scores_gemma":[0.00185552,0.0003251911,0.0006078384,0.0006649304,0.0004542594,0.001110429,0.0007749419,0.0007073685,0.0002074696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006975832,"about_ca_system_score_gemma":0.001023307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00412501,"about_ca_topic_score_gemma":0.00553263,"domain_scores_codex":[0.9995246,0.00023811,0.00001881758,0.00006771265,0.00009680011,0.00005405741],"domain_scores_gemma":[0.9992448,0.0005388925,0.0000657227,0.00003591539,0.00007124437,0.0000434655],"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.00006852511,0.00009249676,0.0004293886,0.00006178925,0.00003186747,0.00006101338,0.0000414385,0.944086,0.0006772919,0.01000507,0.001214839,0.04323033],"study_design_scores_gemma":[0.00001429034,0.00002791682,0.00004793127,0.000003793272,0.000004431423,0.00001326058,0.00001133503,0.9971737,0.0001377797,0.00207068,0.000491287,0.000003553326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03702108,0.000681737,0.9580293,0.0001900952,0.00006636023,0.0001333294,0.00004906115,0.0001940271,0.003634963],"genre_scores_gemma":[0.5061894,0.0004250878,0.4899481,0.0001567698,0.0000574783,0.0003276016,0.0002152426,0.00007913992,0.002601133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00412501,"threshold_uncertainty_score":0.008201957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1379065368142567,"score_gpt":0.4106109157336956,"score_spread":0.2727043789194389,"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."}}