{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391309,0.0006465338,0.0009292401,0.000872422,0.0004661983,0.0008922959,0.001864096,0.001262515,0.005043686],"category_scores_gemma":[0.002474168,0.0005831314,0.001139683,0.000995643,0.0006244566,0.00115779,0.001703586,0.00105061,0.0006888483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007318478,"about_ca_system_score_gemma":0.001090463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002830218,"about_ca_topic_score_gemma":0.002840736,"domain_scores_codex":[0.9992592,0.0002746693,0.00002650703,0.0001014004,0.0002747549,0.00006337361],"domain_scores_gemma":[0.9989692,0.0006591039,0.0000593674,0.00008924248,0.0001708064,0.00005227696],"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.0001099491,0.00008497267,0.0004708845,0.0001735005,0.0001041348,0.00006993782,0.0000716139,0.7832465,0.004261961,0.06123041,0.002724977,0.1474512],"study_design_scores_gemma":[0.00001006128,0.00001827717,0.00004526517,0.00000520372,0.000006971746,0.00002229685,0.000004486281,0.9922795,0.0002405168,0.006199567,0.0011625,0.00000528355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002320099,0.00007764243,0.9960164,0.00005464015,0.00003207421,0.00002371863,0.00002126376,0.0000812232,0.001372861],"genre_scores_gemma":[0.1723659,0.0002333578,0.8195805,0.0001408888,0.0001348307,0.0003176811,0.0001612601,0.0001944191,0.006871053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005043686,"threshold_uncertainty_score":0.01687282,"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."}}