{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008065647,0.0001785879,0.0001898749,0.000375357,0.00008214615,0.000207,0.0005473654,0.0001151871,0.00003759519],"category_scores_gemma":[0.001675943,0.0001594667,0.00007829285,0.0007022089,0.00002246134,0.0001814716,0.00003500425,0.0008505664,0.00001004303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001706963,"about_ca_system_score_gemma":0.0002457772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001113816,"about_ca_topic_score_gemma":0.000002366575,"domain_scores_codex":[0.9985087,0.00003446401,0.0006473055,0.0001172154,0.0004673972,0.000224944],"domain_scores_gemma":[0.9977637,0.0006627844,0.0001870652,0.0001467482,0.001084468,0.0001552124],"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.00001049105,0.0000302619,0.0001691362,0.000005747218,0.0001229346,0.000005954163,0.0002820445,0.9886416,0.003499489,0.003856248,0.0005646588,0.002811493],"study_design_scores_gemma":[0.0007970838,0.00003692428,0.0002890302,0.0001722042,0.00003663564,0.00007184739,0.00005169167,0.9957208,0.0009429706,0.0002047449,0.001504882,0.0001711608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01601245,0.00001254805,0.9774641,0.001705375,0.004277058,0.0002104828,0.0000147487,0.0001474766,0.0001557813],"genre_scores_gemma":[0.7102036,7.189173e-7,0.2888399,0.00007856542,0.0008183036,0.000009374977,0.000009414821,0.00003564868,0.000004411482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6941912,"threshold_uncertainty_score":0.6502863,"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."}}