{"id":"W4387642517","doi":"10.1111/itor.13387","title":"A hybrid adaptive iterated local search heuristic for the maximal covering location problem","year":2023,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Metaheuristic; Iterated local search; Vehicle routing problem; Mathematical optimization; Heuristic; Iterated function; Local search (optimization); Computer science; Routing (electronic design automation); Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.0008083986,0.0005720112,0.0008082145,0.0008255993,0.0003069493,0.000559255,0.001284654,0.0008882894,0.001942836],"category_scores_gemma":[0.001333597,0.0003089737,0.0006130026,0.0006350338,0.0004919682,0.0005963387,0.0008336317,0.0004739953,0.0002201143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007680923,"about_ca_system_score_gemma":0.0008521882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00307305,"about_ca_topic_score_gemma":0.002748696,"domain_scores_codex":[0.9995658,0.000192504,0.00001500481,0.0000604632,0.00009657974,0.00006959762],"domain_scores_gemma":[0.9994146,0.000348135,0.00006798677,0.00004177765,0.00007760825,0.00005000511],"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.00005972437,0.00007713003,0.0004054272,0.00004783589,0.00004004343,0.00006871899,0.00003917264,0.9589053,0.001525663,0.005162688,0.0008886604,0.03277955],"study_design_scores_gemma":[0.00001618432,0.00003333833,0.00004445389,0.000003656326,0.000004909256,0.00001288345,0.000006880889,0.9986067,0.0002181509,0.0007780947,0.0002719098,0.000002795578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1121501,0.0005443859,0.8769595,0.000277761,0.00006009059,0.000172313,0.00007968389,0.0005781146,0.009177957],"genre_scores_gemma":[0.7685876,0.00013893,0.2283231,0.0001607397,0.00003708259,0.0002550187,0.0001404851,0.0000748946,0.002282098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00307305,"threshold_uncertainty_score":0.006499469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09645886260686357,"score_gpt":0.3898434265457198,"score_spread":0.2933845639388563,"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."}}