Capacitated emergency facility siting with multiple levels of backup

In many service systems, the primary objective is to provide continuous service and/or service within a prespecified time interval. In the public sector, emergency service systems fit into this category. In the private sector, systems providing repair service to critical production facilities and computers constitute another example. In these systems, the concept of multiple service facilities providing backup to each other becomes an important element in the design process. In this paper, we study the capacitated facility siting problem with multiple levels of backup coverage. The problem is formulated as a mathematical program; an efficient solution procedure is developed and computational experiments are reported.

[1]  Hasan Pirkul,et al.  Distributed Computer System Design for Large Decentralized Organizations , 1986, ICIS.

[2]  Mark S. Daskin,et al.  A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment , 1981 .

[3]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[4]  Hasan Pirkul,et al.  The capacitated maximal covering location problem with backup service , 1990 .

[5]  Hasan Pirkul,et al.  The siting of emergency service facilities with workload capacities and backup service , 1988 .

[6]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[7]  Hasan Pirkul,et al.  An integer programming model for the allocation of databases in a distributed computer system , 1986 .

[8]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[9]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[10]  Charles ReVelle,et al.  Concepts and applications of backup coverage , 1986 .

[11]  Ellis L. Johnson,et al.  A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

[12]  Harvey J. Everett Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[13]  J. Current,et al.  Capacitated Covering Models , 1988 .

[14]  Hasan Pirkul,et al.  Computer and Database Location in Distributed Computer Systems , 1986, IEEE Transactions on Computers.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[17]  Robert E. Markland,et al.  Theory and Application of an Optimizing Procedure for Lock Box Location Analysis , 1981 .

[18]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[19]  Richard L. Church,et al.  A Median Location Model with Nonclosest Facility Service , 1985, Transp. Sci..

[20]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

[21]  H. Pirkul,et al.  The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .

[22]  James E. Storbeck,et al.  Behaviorally Linked Location Hierarchies , 1982 .