U.S. flag

An official website of the United States government, Department of Justice.

NCJRS Virtual Library

The Virtual Library houses over 235,000 criminal justice resources, including all known OJP works.
Click here to search the NCJRS Virtual Library

QUEUING-LINEAR PROGRAMMING APPROACH TO SCHEDULING POLICE PATROL CARS

NCJ Number
34059
Journal
Operations Research Volume: 23 Issue: 6 Dated: (NOVEMBER-DECEMBER 1975) Pages: 1045-1062
Author(s)
P J KOLESAR; K L RIDER; T B CRABILL; W E WALKER
Date Published
1975
Length
18 pages
Annotation
USING QUEUING THEORY AND INTEGER LINEAR PROGRAMMING, THE AUTHORS PRESENT A METHOD FOR SCHEDULING PATROL CARS TO IMPROVE THE CORRESPONDENCE BETWEEN PATROL CAR AVAILABILITY AND DEMANDS FOR SERVICE.
Abstract
IN ANY CITY THE ARRIVAL RATE OF CALLS FOR POLICE PATROLCAR SERVICE VARIES CONSIDERABLY THROUGH THE DAY. THIS METHOD OF SCHEDULING PATROL CARS IS DESIGNED TO ENSURE 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. (AUTHOR ABSTRACT MODIFIED)