{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005336909,0.0002004346,0.0002567739,0.0004512585,0.0006191744,0.0003329168,0.0004045558,0.0001375909,0.00001972439],"category_scores_gemma":[0.0004932036,0.0002246528,0.00004742201,0.001078597,0.00008663005,0.0005865743,0.0001635103,0.0008237339,0.00001964844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004621042,"about_ca_system_score_gemma":0.0001261678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001375854,"about_ca_topic_score_gemma":0.0001258552,"domain_scores_codex":[0.9967758,0.0007623157,0.0004546292,0.0003579623,0.0004530255,0.001196257],"domain_scores_gemma":[0.9979612,0.0008102485,0.00001676131,0.0004467932,0.0005009957,0.0002640025],"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.00001261619,0.0001860996,0.004961028,0.0000481864,0.00001818827,0.000001804453,0.002791628,0.9776144,0.001865091,0.006767613,0.0000601808,0.005673167],"study_design_scores_gemma":[0.000775975,0.0001259052,0.002555204,0.00007293684,0.000005972256,0.000003625648,0.0005354655,0.9942925,0.001231782,0.0001154608,0.00004849716,0.0002366983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08073785,0.0001538169,0.9171859,0.00008696344,0.0002556024,0.0009390454,0.00002967819,0.0002236864,0.000387467],"genre_scores_gemma":[0.7870376,0.00001019352,0.2123972,0.00002266471,0.0002913105,0.00009660565,0.0000605962,0.0000586258,0.00002520809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7062997,"threshold_uncertainty_score":0.9161075,"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."}}