A heuristic method for the multi-story layout problem

DOI10.1016/0377-2217(88)90202-0MaRDI QIDQ1107411zbMATH OpenOpenAlexFDO

Authors Bharat K. Kaku, G. L. Thompson, Ilker Baybars

Publication date 1988

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(88)90202-0

zbMATH Keywords

facility locationgroupings of facilitiesheuristicK-median subroutinelarge layout problemmulti-story setting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Applications of mathematical programming (90C90)

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)].

Recommendations

• A hybrid heuristic for the facilities layout problem
• A Heuristic Procedure for the Layout of a Large Number of Facilities
• The facility layout problem
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• Automatic computation and drawing of facility layouts with logical aisle structures

Cites work

• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• An Algorithm for the Quadratic Assignment Problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Assignment Problems and the Location of Economic Activities
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Numerical investigations on quadratic assignment problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• The Efficiency of Computer Algorithms for Plant Layout
• The quadratic assignment problem

Cited in

(15)

• Large-scale layout of facilities using a heuristic hybrid algorithm
• A new heuristic for the linear placement problem
• A hybrid heuristic for the facilities layout problem
• An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
• Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
• A Heuristic Procedure for the Layout of a Large Number of Facilities
• scientific article; zbMATH DE number 4062816 (Why is no real title available?)
• A new simulated annealing algorithm for the facility layout problem
• MULTI-HOPE: A tool for multiple floor layout problems
• An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
• Tabu search based heuristics for multi-floor facility layout
• A class of genetic algorithms for multiple-level warehouse layout problems
• The multi-story space assignment problem
• Flexibility in manufacturing system design: a review of recent approaches from operations research
• A new mixed integer programming formulation for facility layout design using flexible bays

This page was built for publication: A heuristic method for the multi-story layout problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107411)