Facility Location Model Research Articles

Note—Dynamic Facility Location and Simple Network Models

Wesolowsky [Wesolowsky, G. O. 1973. Dynamic facility location. Management Sci. 19 (11, July) 1241–1248.] has examined a dynamic version of the location problem for a single facility, obtained by allowing relocation of the facility over time to optimize a cost or benefit expression. This problem is essentially one of facility replacement, and may be expressed and solved through a simple network model as in deterministic equipment replacement situations ([Veinott, A. F., Jr., H. M. Wagner. 1962. Optimal capacity and scheduling—I. Oper. Res. 10 (4, July–August) 518–532 and Wagner, H. M. 1969. Principles of Operations Research. Prentice-Hall, Englewood Cliffs, New Jersey, pp. 180–181 and pp. 340–342.]).

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

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.

Heuristic Methods for Location-Allocation Problems

Heuristic Methods for Location-Allocation Problems