Citation

Olson DG, Wright GP. Oper. Res. Q. 1975; 26(4, Pt. 1): 703-715.

Copyright

(Copyright © 1975, Operational Research Society, Publisher Pergamon Press)

DOI

unavailable

PMID

unavailable

Abstract

This paper develops models that maximize the expected number of occasions per unit of time that a police patrol unit enters a street segment during the time that a crime is visible. Constraints are added that insure a minimum patrol coverage to all streets. The successive visits from street-to-street form a Markov chain. The solution that maximizes the objective function gives a stochastic decision rule which is used with Monte Carlo techniques to generate a random patrol schedule. The problem is posed with one car and several cars patrolling the same region.