Contributions to a Theory of Patrol Scheduling

The problem considered in this paper is that of scheduling police patrols in a random pattern. This involves generating patrol routes as well as schedules for dispatching patrol vehicles. A solution to this problem is obtained by specifying minimum average patrol requirements on each route segment i...

Full description

Saved in:
Bibliographic Details
Published in:Operational Research Quarterly (1950) 1970-03, Vol.21 (1), p.99-106
Main Author: Rosenshine, Matthew
Format: Article
Language:English
Subjects:
Business and Management
General Paper
Management
Operations Research/Decision Theory
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem considered in this paper is that of scheduling police patrols in a random pattern. This involves generating patrol routes as well as schedules for dispatching patrol vehicles. A solution to this problem is obtained by specifying minimum average patrol requirements on each route segment in a network and then developing a procedure which meets these requirements while minimizing the total patrol effort. Introducing vehicles into the network in a Poisson stream results in Poisson streams in each route segment and so ensures that an observer cannot use previous history for predicting arrival patterns. This solution also has the property that the number of patrol cars in the network is a Poisson random variable for which the steady-state can be achieved immediately. The steady-state distribution function is also used to determine the number of patrol cars required.
ISSN:0160-5682
1473-2858
1476-9360
DOI:10.1057/jors.1970.21