An Algorithm for Deploying a Crime Directed (Tactical) Patrol Force

Kenneth Chelst
Additional contact information
Kenneth Chelst: Wayne State University

Management Science, 1978, vol. 24, issue 12, 1314-1327

Abstract: This paper presents an algorithm for deploying a crime directed patrol force. The optimization problem is formulated as the allocation of N patrol among R high crime regions so as to maximize the weighted probability of a patrol intercept of a crime. The algorithm has full sensitivity analysis capabilities. This capability is critical because the model's input parameters include (1) crime weights, which in general will have a subjective component, (2) crime descriptive data, which are difficult to estimate, and (3) crime frequency data, which are likely to change with time. The paper presents an illustrative application of the algorithm. The resultant allocation is compared to a strategy which allocates patrol units in direct proportion to each region's total crime rate. The optimal allocation significantly increased the probability of an intercept.

Keywords: government: services; police; search and surveillance; probability: stochastic model applications (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.12.1314 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:24:y:1978:i:12:p:1314-1327

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().