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

DOI10.1007/S11067-007-9035-6zbMATH Open1183.90288OpenAlexW2093612088WikidataQ58484341 ScholiaQ58484341MaRDI QIDQ2379709FDOQ2379709

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

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

zbMATH Keywords

optimizationmaximal coveringgeographic information systemsbackup coveringpolice beatspolice patrol areas

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (32)

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

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)