A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars

Peter J. Kolesar, Kenneth L. Rider, Thomas B. Crabill and Warren E. Walker
Additional contact information
Peter J. Kolesar: The New York City-Rand Institute, New York, New York
Kenneth L. Rider: The New York City-Rand Institute, New York, New York
Thomas B. Crabill: The New York City-Rand Institute, New York, New York
Warren E. Walker: The New York City-Rand Institute, New York, New York

Operations Research, 1975, vol. 23, issue 6, 1045-1062

Abstract: In any city the arrival rate of calls for police patrol-car service varies considerably through the day. Using queuing theory and integer linear programming, we present a method for scheduling patrol cars so that specified service standards are met at each hour of the day. Two models are used. The first is an M / M / n queuing model with time-dependent parameters that is solved numerically. The second is an integer linear program in which the decision variables are the number of patrol cars working each tour and the times at which they go out of service for meals. The program's constraints are determined by the output of the queuing model. Use of the method with data from the New York City Police Department indicates that it can lead to substantial improvements in police service.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.6.1045 (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:oropre:v:23:y:1975:i:6:p:1045-1062

Access Statistics for this article

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