{"id":"W2099721629","doi":"10.5267/j.ijiec.2010.06.003","title":"A variable neighborhood descent based heuristic to solve the capacitated location-routing problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Variable neighborhood search; Descent (aeronautics); Heuristic; Variable (mathematics); Mathematical optimization; Computer science; Routing (electronic design automation); Facility location problem; Vehicle routing problem; Mathematics; Metaheuristic; Geography; 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.0005603402,0.0005162228,0.0009559254,0.0007023741,0.0004799956,0.0004555664,0.001071974,0.0008937453,0.001901097],"category_scores_gemma":[0.001255866,0.0004176761,0.0004471151,0.0008994893,0.0004086309,0.0005072987,0.0005996959,0.000525038,0.0003083848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007357548,"about_ca_system_score_gemma":0.001137943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006208611,"about_ca_topic_score_gemma":0.007189059,"domain_scores_codex":[0.9996594,0.0001561565,0.0000122945,0.0000477945,0.0000724598,0.00005186614],"domain_scores_gemma":[0.9995866,0.0002485228,0.0000407331,0.00002740317,0.0000651026,0.00003167904],"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.00004983741,0.00007615722,0.0004229943,0.00005497759,0.00002758519,0.00006223589,0.00003223095,0.9422478,0.001022094,0.006465069,0.001910443,0.04762853],"study_design_scores_gemma":[0.00001309666,0.0000307469,0.00005634832,0.000003208462,0.000003462864,0.00001968381,0.000006972055,0.9979874,0.0001708967,0.001087107,0.000617803,0.000003166897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02675687,0.0003444798,0.9677116,0.0001702908,0.00008128193,0.0001160744,0.00006333926,0.0002359987,0.004520118],"genre_scores_gemma":[0.3685984,0.0002035907,0.6266617,0.0001238944,0.00003999831,0.0003294516,0.0002364161,0.00008659028,0.003719889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006208611,"threshold_uncertainty_score":0.0123449,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0222289373703065,"score_gpt":0.2598013817370045,"score_spread":0.2375724443666979,"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."}}