Algorithms for Alleviating Saturation of New York City's Computerized SPRINT Police Dispatching System.
ResearchPublished 1975
ResearchPublished 1975
In order to alleviate possible saturation of the New York City Police Department's computer-assisted dispatching system (SPRINT), a future version of the system will shunt certain low-priority jobs to the precincts for service by units that are not dispatched by SPRINT. In this report, we develop shunting procedures designed to achieve this objective. We focus on congestion at the dispatching station and overload to the patrol cars in the field. Two algorithms are proposed. Their form is based on congestion and delay computations made using queueing models of dispatching and patrol operations. The algorithms are of simple structure and have modest data and computational requirements. Hence, they should be easy to implement. 23 pp. Ref.
This publication is part of the RAND report series. The report series, a product of RAND from 1948 to 1993, represented the principal publication documenting and transmitting RAND's major research findings and final research.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.