A Patrol Car Allocation Model

• NCJ Number: 45304
• Author(s): J M Chaiken; P Dormont
• Date Published: June 1976
• Length: 38 pages
• Agencies: Rand Corporation; NIJ-Sponsored

Annotation

AN IMPROVED COMPUTER PROGRAM IS PRESENTED FOR SPECIFYING THE NUMBER OF POLICE PATROL CARS THAT SHOULD BE ON DUTY IN EACH AREA OF A CITY AT VARIOUS TIMES EACH DAY.

Abstract

THE PROGRAM IS A SYNTHESIS OF PREVIOUS PATROL CAR ALLOCATION MODELS WITH SEVERAL IMPROVEMENTS. THE MODEL ALLOCATES CAR-HOURS TO SHIFTS, DEFINED AS A COMBINATION OF A SPECIFIC TOUR ON A SPECIFIC DAY IN A SPECIFIC PRECINCT. THE PURPOSE OF USING CAR-HOURS IS TO PERMIT TOURS TO HAVE ANY DURATION DESIRED, NOT NECESSARILY ALL THE SAME. ITS MAJOR INNOVATION IS THE ABILITY TO PRESCRIBE ALLOCATIONS WHEN ONE TOUR ON EACH DAY IN EACH GEOGRAPHICAL COMMAND OVERLAYS TWO OTHER TOURS. THE PROGRAM ALSO SETS CONSTRAINTS ON PERFORMANCE TO AVOID THE COMMON ERROR OF CONCENTRATING SO MANY CARS IN DENSE AREAS WITH MANY CALLS FOR SERVICE THAT UNACCEPTABLE DELAYS ARE ENCOUNTERED IN SPARSELY POPULATED AREAS WITH RELATIVELY FEW CALLS FOR SERVICE. MATHEMATICAL DEVELOPMENT OF THE MODEL IS EXPLAINED. THE PROGRAM HAS BEEN DESIGNED TO BE INEXPENSIVE AND READILY TRANSFERABLE. A BIBLIOGRAPHY IS APPENDED. (GLR)