A heuristic method for the multi-story layout problem
We present a heuristic procedure designed expressly for solving a large layout problem in a multi-story setting, where the objective is to minimize total fixed and interaction costs. This is achieved by decomposing the original facilities layout problem into several similar but smaller problems, thus enabling solution of problems with as many as 150 facilities in reasonable time. Some of the novel features of the procedure described are the use of a heuristic K-median subroutine to obtain groupings of facilities, and a simple and fast exchange- improvement method. Computational results for randomly generated problems compare the effectiveness of this method with the space planning heuristic method of \textit{R. S. Liggett} and \textit{W. J. Mitchell} [Computer Aided Design 13, No.5, 277-288 (1981)].
scientific article; zbMATH DE number 4064726