Luis Alberto Alvarez Penayo, Marco Antonio Alvarez Penayo, José Colbes, Diego Pinto
{"title":"Optimization in Positioning of Police Resources A case study of Asunción - Paraguay","authors":"Luis Alberto Alvarez Penayo, Marco Antonio Alvarez Penayo, José Colbes, Diego Pinto","doi":"10.1109/CLEI56649.2022.9959939","DOIUrl":null,"url":null,"abstract":"Efficient attendance of 911 emergency calls is a significant challenge, mainly in cities with high rates of violence. This problem has been addressed by considering it as a coverage problem with violence rates but without guaranteeing maximum response time or minimizing response time without guaranteeing coverage. Consequently, in this work, we address this problem by considering a coverage maximization according to the violence index guaranteeing maximum response and coverage. For this purpose, we developed a tool that builds a weighted graph with the violence index, given a city map and the history of recorded incidents. Next, inspired by the previous works, we propose a new mathematical formulation that maximizes coverage according to the rate of violence subject to total coverage and guarantees maximum response time. Furthermore, we apply a Tabu Search to calculate the best solution. Considering actual data from the city of Asunción (Paraguay), a numerical simulation was performed using the strategy in the system 911, a state-of-theart algorithm based on coverage, and our contribution. The simulation results show that the proposed algorithm can find security coverage solutions with a better allocation for the areas with a high rate of violence than the other alternatives evaluated.","PeriodicalId":156073,"journal":{"name":"2022 XVLIII Latin American Computer Conference (CLEI)","volume":"345 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 XVLIII Latin American Computer Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI56649.2022.9959939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Efficient attendance of 911 emergency calls is a significant challenge, mainly in cities with high rates of violence. This problem has been addressed by considering it as a coverage problem with violence rates but without guaranteeing maximum response time or minimizing response time without guaranteeing coverage. Consequently, in this work, we address this problem by considering a coverage maximization according to the violence index guaranteeing maximum response and coverage. For this purpose, we developed a tool that builds a weighted graph with the violence index, given a city map and the history of recorded incidents. Next, inspired by the previous works, we propose a new mathematical formulation that maximizes coverage according to the rate of violence subject to total coverage and guarantees maximum response time. Furthermore, we apply a Tabu Search to calculate the best solution. Considering actual data from the city of Asunción (Paraguay), a numerical simulation was performed using the strategy in the system 911, a state-of-theart algorithm based on coverage, and our contribution. The simulation results show that the proposed algorithm can find security coverage solutions with a better allocation for the areas with a high rate of violence than the other alternatives evaluated.