A hypercube queuing model for facility location and redistricting in urban emergency services

Abstract This paper develops computationally efficient algorithms for studying the analytical behavior of a multi-server queuing system with distinguishable servers. The model is intended for analyzing problems of vehicle location and response district design in urban emergency services, includes interdistrict as well as intradistrict responses, and allows computation of several pointspecific as well as area-specific performance measures.

[1]  Jan M. Chaiken,et al.  Methods for Allocating Urban Emergency Units: A Survey , 1972 .

[2]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[3]  Richard C. Larson,et al.  Urban Police Patrol Analysis , 1972 .

[4]  Ralph E. Strauch,et al.  When a Queue Looks the Same to an Arriving Customer as to an Observer , 1970 .

[5]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[6]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .

[7]  Saul I. Gass,et al.  On the division of police districts into patrol beats , 1968, ACM National Conference.

[8]  Richard C. Larson,et al.  On Insensitivities in Urban Redistricting and Facility Location , 1972, Oper. Res..


[10]  Jan M. Chaiken,et al.  Response Areas for Two Emergency Units , 1972, Oper. Res..

[11]  Philip M. Morse,et al.  Queues, Inventories, And Maintenance , 1958 .

[12]  P. Stein,et al.  On the Solution of Linear Simultaneous Equations By Iteration , 1948 .

[13]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[14]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[15]  Louis C Santone A Computer model for the evaluation of fire station location , 1969 .

[16]  S. Hakimi Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .