Authors:
Nilson Felipe Matos Mendes
and
André Gustavo dos Santos
Affiliation:
Universidade Federal de Viçosa, Brazil
Keyword(s):
Optimization, Stochastic Model, Police Allocation, Hypercube Queuing Model, Metaheuristics.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence and Decision Support Systems
;
Enterprise Information Systems
;
Group Decision Support Systems
;
Operational Research
;
Scheduling and Planning
;
Strategic Decision Support Systems
Abstract:
Providing security requires efficient police services. Considering this, we deal in this paper with the police units allocation problem. To describe the problem a probabilistic model based on Hypercube Queuing Model is proposed. Considering an action radius and constraints for minimal coverage and mandatory closeness, the model aims to allocate police units on several points of an urban area to minimize the expected distance traveled by these units when they are answering calls for service. A VND heuristic is used to solve the model, and we analyse the improvement of using a Tabu Serach method instead of a random initialization. We experiment the methods in scenarios with different parameters values to verify the robustness and suitability of the proposed model. The results presented a high influence of service time on solutions quality, some difficulties in getting feasible solutions.