Abstract
The problem of locating hospital departments so as to minimize the total distance travelled by patients can be formulated as a Quadratic Assignment Problem. In this paper we discuss some practical considerations of the problem, its formulation, we present a heuristic procedure to solve it and comment on our computational experience with the heuristic.
This paper was presented at the ORS Annual Conference, Loughborough, 23-26 Sept. 1975.
This paper was presented at the ORS Annual Conference, Loughborough, 23-26 Sept. 1975.