English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

A Hypercube Queuing Model Approach to the Police Units Allocation Problem