Designing efficient and balanced police patrol districts on an urban street network

ABSTRACT In police planning, a territory is often divided into several patrol districts with balanced workloads, in order to repress crime and provide better police service. Conventionally, in this districting problem, there is insufficient consideration of the impacts of street networks. In this study, we propose a street-network police districting problem (SNPDP) that explicitly uses streets as basic underlying units. This model defines the workload as a combination of different attributes and seeks an efficient and balanced design of districts. We also develop an efficient heuristic to generate high-quality districting plans in an acceptable time. The capability of the algorithm is demonstrated in comparison to an exact linear programming solver on simulated datasets. The SNPDP model is successfully implemented and tested in a case study in London, and the generated police districts have different characteristics that are consistent with the crime risk and land use distribution. Besides, we demonstrate that SNPDP is superior to an aggregation grid-based model regarding the solution quality. This model has the potential to generate street-based districts with balanced workloads for other districting problems, such as school districting and health care districting.

[1]  Phillip S. Mitchell.  Optimal Selection of Police Patrol Beats , 1972 .

[2]  Bruno Simeone,et al.  Local search algorithms for political districting , 2008, Eur. J. Oper. Res..

[3]  Rajan Batta,et al.  Reconfiguring Police Reporting Districts in the City of Buffalo , 1999 .

[4]  Timothy J. Lowe,et al.  Aggregation error for location models: survey and analysis , 2009, Ann. Oper. Res..

[5]  Vito Latora,et al.  The network analysis of urban streets: A dual approach , 2006 .

[6]  F. Liberatore,et al.  A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph , 2016 .

[7]  Rajan Batta,et al.  A simulated annealing approach to police district design , 2002, Comput. Oper. Res..

[8]  V. Latora,et al.  The Network Analysis of Urban Streets: A Primal Approach , 2006 .

[9]  Raúl Ramos Lobo,et al.  Supervised regionalization methods: A survey , 2006 .

[10]  Alan T. Murray,et al.  Heuristics in Spatial Analysis: A Genetic Algorithm for Coverage Maximization , 2009 .

[11]  John M. Carroll,et al.  Using simulation to assign police patrol zones , 1981 .

[12]  T. Neumann.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[13]  J W Thomas,et al.  Techniques for defining geographic boundaries for health regions. , 1979, Socio-economic planning sciences.

[14]  Christophe Claramunt,et al.  Topological Analysis of Urban Street Networks , 2004 .

[15]  Jun Yan,et al.  Kernel Density Estimation of traffic accidents in a network space , 2008, Comput. Environ. Urban Syst..

[16]  Shane D. Johnson,et al.  Examining the Relationship Between Road Structure and Burglary Risk Via Quantitative Network Analysis , 2015 .

[17]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[18]  J. Thill,et al.  Local Indicators of Network-Constrained Clusters in Spatial Patterns Represented by a Link Attribute , 2010 .

[19]  Stan Openshaw,et al.  Modifiable Areal Unit Problem , 2008, Encyclopedia of GIS.

[20]  Peter Sanders,et al.  Distributed Evolutionary Graph Partitioning , 2011, ALENEX.

[21]  Gilbert Laporte,et al.  Districting for Arc Routing , 2014, INFORMS J. Comput..

[22]  Tao Cheng,et al.  Novel evaluation metrics for sparse spatio-temporal point process hotspot predictions - a crime case study , 2016, Int. J. Geogr. Inf. Sci..

[23]  Shane D. Johnson,et al.  Near repeats and crime forecasting , 2013 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Jay Lee,et al.  Weighted network Voronoi Diagrams for local spatial analysis , 2015, Comput. Environ. Urban Syst..

[26]  S. Openshaw.  A million or so correlation coefficients : three experiments on the modifiable areal unit problem , 1979 .

[27]  C. Cirincione,et al.  Assessing South Carolina's 1990s congressional districting , 2000 .

[28]  Richard L. Church,et al.  Contiguity Constraints for Single‐Region Site Search Problems , 2010 .

[29]  Richard L. Church,et al.  A new network representation of a “classic” school districting problem , 1991 .

[30]  S. Bishop,et al.  Modelling patterns of burglary on street networks , 2013, Crime Science.

[31]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[32]  Xinyue Ye,et al.  The Network-Max-P-Regions model , 2017, Int. J. Geogr. Inf. Sci..

[33]  Samuel E. Bodily.  Police Sector Design Incorporating Preferences of Interest Groups for Equality and Efficiency , 1978 .

[34]  Kevin M. Curtin,et al.  Integrating GIS and Maximal Covering Models to Determine Optimal Police Patrol Areas , 2005 .

[35]  Heiko Balzter,et al.  Corine land cover 2012 for the UK, Jersey and Guernsey , 2015 .

[36]  Sidney W. Hess,et al.  Experiences with a Sales Districting Model: Criteria and Implementation , 1971 .

[37]  Shane D. Johnson,et al.  Predictive Crime Mapping: Arbitrary Grids or Street Networks? , 2016, Journal of Quantitative Criminology.

[38]  Federico Liberatore,et al.  A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector , 2015, Eur. J. Oper. Res..

[39]  P. Davies,et al.  Modelling patterns of burglary on street , 2013 .

[40]  Felipe Caro,et al.  School redistricting: embedding GIS tools with integer programming , 2004, J. Oper. Res. Soc..

[41]  W. Vickrey.  On the Prevention of Gerrymandering , 1961 .

[42]  Antonio Galvão Naclério Novaes,et al.  A multiplicatively-weighted Voronoi diagram approach to logistics districting , 2006, Comput. Oper. Res..

[43]  Yue Zhang,et al.  Police patrol districting method and simulation evaluation using agent-based model & GIS , 2013, Security Informatics.

[44]  J. Surkis,et al.  An operations research approach to racial desegregation of school systems , 1968 .

[45]  Luc Anselin,et al.  The Max‐P‐Regions Problem , 2012 .

[46]  M. A. Salazar-Aguilar,et al.  New Models for Commercial Territory Design , 2011 .

[47]  Shane D. Johnson,et al.  Does the Configuration of the Street Network Influence Where Outdoor Serious Violence Takes Place? Using Space Syntax to Test Crime Pattern Theory , 2017 .

[48]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[49]  Kevin M. Curtin,et al.  Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models , 2010 .

[50]  S Openshaw,et al.  Algorithms for Reengineering 1991 Census Geography , 1995, Environment & planning A.