A Patrol Car Allocation Model: Capabilities and Algorithms

Jan M. Chaiken and Peter Dormont
Additional contact information
Jan M. Chaiken: The Rand Corporation, Santa Monica, California
Peter Dormont: Mathematica, Inc., Princeton, New Jersey

Management Science, 1978, vol. 24, issue 12, 1291-1300

Abstract: A computer program has been designed for specifying the number of police patrol cars that should be on duty in each geographical command of a city at various times of day on each day of the week. It incorporates, by user option, nearly all the desirable features of earlier allocation programs, together with several improvements. It calculates performance statistics for the current allocation of patrol cars or any allocation proposed by the user. In addition, it has two prescriptive capabilities: (1) determining the minimum number of patrol cars needed during each tour in each command to meet specified constraints on performance measures, and (2) allocating a specified total number of car-hours by time and/or geography so as to optimize one of several available objective functions. The main technical innovation in the model is that it allows one tour in each day to overlay two other tours. A heuristic algorithm allocates car-hours when there is such an overlay tour; it is optimal when the overlay tour has the same duration as the tours it overlays.

Keywords: government: services; police; programming: multiple criteria; queues: applications (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.12.1291 (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:1291-1300

Access Statistics for this article

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