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

DOI10.1007/s11067-007-9035-6zbMath1183.90288OpenAlexW2093612088WikidataQ58484341 ScholiaQ58484341MaRDI QIDQ2379709

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

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

optimizationmaximal coveringgeographic information systemsbackup coveringpolice beatspolice patrol areas

Mathematics Subject Classification ID

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

Related Items (23)

Shadow prices in territory division ⋮ Patrol scheduling in urban rail network ⋮ Covering part of a planar network ⋮ An overview of graph covering and partitioning ⋮ A VNS-LP algorithm for the robust dynamic maximal covering location problem ⋮ A multi-criteria police districting problem for the efficient and effective design of patrol sector ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ Continuous space maximal coverage: insights, advances and challenges ⋮ Location-coverage models for preventing attacks on interurban transportation networks ⋮ Change of scene: the geographic dynamics of resilience to vehicular accidents ⋮ Vertex covering with capacitated trees ⋮ Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis ⋮ OR models in urban service facility location: a critical review of applications and future developments ⋮ Location-allocation models for traffic police patrol vehicles on an interurban network ⋮ An analysis of \(p\)-median location problem: effects of backup service level and demand assignment policy ⋮ A taxonomy for emergency service station location problem ⋮ 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 ⋮ Fuzzy covering location problems with different aggregation operators ⋮ A Voronoi-based heuristic algorithm for locating distribution centers in disasters

Cites Work

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

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