{"id":"W2083487387","doi":"10.1016/j.cor.2014.12.001","title":"A hybrid method for the Probabilistic Maximal Covering Location–Allocation Problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Université Laval","keywords":"Mathematical optimization; Benchmark (surveying); Solver; Probabilistic logic; Heuristic; Integer programming; Computer science; Metaheuristic; Linear programming; Mathematics; Algorithm; Artificial intelligence","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.00388814,0.0001386034,0.0001468984,0.0001891392,0.0007477911,0.0004049062,0.0004450299,0.00005123295,0.00001546374],"category_scores_gemma":[0.0008186416,0.0001193465,0.00004549689,0.0006018822,0.00008392894,0.0002049906,0.00009600037,0.0003033646,0.00003259968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001959329,"about_ca_system_score_gemma":0.0001122161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004252787,"about_ca_topic_score_gemma":0.00002635195,"domain_scores_codex":[0.9981777,0.0004635203,0.0003227651,0.0002953263,0.0003485767,0.0003921158],"domain_scores_gemma":[0.9968265,0.001734726,0.00001490765,0.0004933497,0.000847992,0.00008254419],"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.000004527429,0.0000175561,0.000006898531,0.00009510465,0.00002357579,1.208213e-7,0.0002846785,0.9299209,0.0007365967,0.01442359,0.00129113,0.05319537],"study_design_scores_gemma":[0.0002722283,0.00005434301,0.0001203962,0.00003775479,0.0000109035,0.00000788325,0.00003511048,0.9914327,0.001214426,0.0007744272,0.005905108,0.0001347484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001227525,0.00009234402,0.99507,0.001210102,0.000244297,0.001436951,0.000005407583,0.0002579151,0.0004554281],"genre_scores_gemma":[0.2850377,0.00001352675,0.713709,0.00005944968,0.0002311562,0.0006867045,0.00003598538,0.00004498386,0.0001814486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2838102,"threshold_uncertainty_score":0.575148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05287132260263117,"score_gpt":0.3643040575187613,"score_spread":0.3114327349161301,"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."}}