Police patrol districting method and simulation evaluation using agent-based model & GIS

AbstractPolice patrols play an important role in public safety. The patrol district design is an important factor affecting the patrol performances, such as average response time and workload variation. The redistricting or redrawing police command boundaries can be described as partitioning a police jurisdiction into command districts with the constraints such as contiguity and compactness. The size of the possible sample space is large and the corresponding graph-partitioning problem is NP-complete. In our approach, the patrol districting plans generated by a parameterized redistricting procedure are evaluated using an agent-based simulation model we implemented in Java Repast in a geographic information system (GIS) environment. The relationship between districting parameters and response variables is studied and better districting plans can be generated. After in-depth evaluations of these plans, we perform a Pareto analysis of the outputs from the simulation to find the non-dominated set of plans on each of the objectives. This paper also includes a case study for the police department of Charlottesville, VA, USA. Simulation results show that patrol performance can be improved compared with the current districting solution.

[1]  Shaw v.,et al.  THE COMPUTATIONAL COMPLEXITY OF AUTOMATED REDISTRICTING : IS AUTOMATION THE ANSWER ? , 2013 .

[2]  Richard C. Larson,et al.  Measuring the Response Patterns of New York City Police Patrol Cars , 1971 .

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

[4]  Matthew Rosenshine,et al.  Contributions to a Theory of Patrol Scheduling , 1970 .

[5]  S. S. Dhanoa.  Police Administration , 1978 .

[6]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

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

[8]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[9]  N. C. Simpson,et al.  Fifty years of operational research and emergency response , 2009, J. Oper. Res. Soc..

[10]  Leen-Kiat Soh,et al.  Redistricting Using Heuristic-Based Polygonal Clustering , 2009, 2009 Ninth IEEE International Conference on Data Mining.

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

[12]  Philip E. Taylor,et al.  A Break from Tradition for the San Francisco Police: Patrol Officer Scheduling Using an Optimization-Based Decision Support System , 1989 .

[13]  Adel A. Aly,et al.  POLICE BRIEFING STATIONS: A LOCATION PROBLEM , 1979 .

[14]  Micah Altman,et al.  The computational complexity of automated redistricting : Is automation the answer ? , 1997 .