Determining optimal police patrol areas with maximal covering and backup covering location models

DOI10.1007/S11067-007-9035-6MaRDI QIDQ2379709zbMATH OpenOpenAlexWikidataFDO

Authors Kevin M. Curtin, Karen Hayslett-McCall, Fang Qiu

Publication date 19 March 2010

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11067-007-9035-6

zbMATH Keywords

backup coveringgeographic information systemsmaximal coveringoptimizationpolice beatspolice patrol areas

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27)

Recommendations

• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• Location-allocation models for traffic police patrol vehicles on an interurban network
• An improved formulation for the maximum coverage patrol routing problem
• A maximal covering location model in the presence of partial coverage
• Police patrol route optimization
• Covering-Location Models for Emergency Situations That Require Multiple Response Units
• The optimal dispatch of Traffic and Patrol Police Service Platforms
• The Maximal Expected Covering Location Problem: Revisited

Cites work

• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol
• A Lagrangean heuristic for the maximal covering location problem
• A Multiple Dispatch Queueing Model of Police Patrol Operations
• A Patrol Car Allocation Model: Capabilities and Algorithms
• A simulated annealing approach to police district design
• Approximating the Performance of Urban Emergency Service Systems
• Geographical information systems and location science
• Heuristic methods and applications: A categorized survey
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Police Sector Design Incorporating Preferences of Interest Groups for Equality and Efficiency
• Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
• The generalized maximal covering location problem
• The Maximal Conditional Covering Problem
• The Maximal Covering Location Problem with Capacities on Total Workload
• Transfer of Emergency Service Deployment Models to Operating Agencies

Cited in

(33)

• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• Location-coverage models for preventing attacks on interurban transportation networks
• OR models in urban service facility location: a critical review of applications and future developments
• A taxonomy for emergency service station location problem
• Police districting problem: literature review and annotated bibliography
• An analysis of p-median location problem: effects of backup service level and demand assignment policy
• Minimizing dispersion in multiple drone routing
• Cooperative cover of uniform demand
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• Clean water network design for refugee camps
• The use of fuzzy logic in various combinatorial optimization problems
• An overview of graph covering and partitioning
• Shadow prices in territory division
• A Voronoi-based heuristic algorithm for locating distribution centers in disasters
• Patrol scheduling in urban rail network
• Covering part of a planar network
• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• Capacitated p-center problem with failure foresight
• An improved formulation for the maximum coverage patrol routing problem
• Continuous space maximal coverage: insights, advances and challenges
• Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis
• Location-allocation models for traffic police patrol vehicles on an interurban network
• Key route planning of patrol based on ant colony algorithm
• Fuzzy covering location problems with different aggregation operators
• Police patrol route optimization
• The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches
• Change of scene: the geographic dynamics of resilience to vehicular accidents
• Vertex covering with capacitated trees
• Reducing police response times: optimization and simulation of everyday police patrol
• Police service district planning
• Police staffing and workload assignment in law enforcement using multi-server queueing models
• Scheduling bodyguards
• A dynamic programming model for optimal distribution of police patrol efforts in Nigeria: a case study of Lagos state

This page was built for publication: Determining optimal police patrol areas with maximal covering and backup covering location models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379709)