A heuristic method for the multi-story layout problem
type: Item
instance of: scholarly article
title: A heuristic method for the multi-story layout problem
zbMATH Open document ID: 0652.90032
DOI: 10.1016/0377-2217(88)90202-0
author: Bharat K. Kaku
author: G. L. Thompson
author: Ilker Baybars
published in: European Journal of Operational Research
publication date: 1988-01-01T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4064726
zbMATH Keywords: facility location
zbMATH Keywords: heuristic
zbMATH Keywords: large layout problem
zbMATH Keywords: multi-story setting
zbMATH Keywords: K-median subroutine
zbMATH Keywords: groupings of facilities
MaRDI profile type: Publication
full work available at URL: 0377-2217(88)90202-0
OpenAlex ID: W2070001070
cites work: A branch-and-bound-based heuristic for solving the quadratic assignment problem
cites work: Numerical investigations on quadratic assignment problems
cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: An Algorithm for the Quadratic Assignment Problem
cites work: Assignment Problems and the Location of Economic Activities
cites work: The quadratic assignment problem
cites work: The Efficiency of Computer Algorithms for Plant Layout
description: scientific article; zbMATH DE number 4064726