A hybrid heuristic for the facilities layout problem

DOI10.1016/0305-0548(91)90026-NMaRDI QIDQ2276871zbMATH OpenOpenAlexFDO

Authors Bharat K. Kaku, G. L. Thompson, Thomas E. Morton

Publication date 1991

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(91)90026-n

zbMATH Keywords

facilities layoutheuristicSteinberg problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Recommendations

• Large-scale layout of facilities using a heuristic hybrid algorithm
• A heuristic method for the multi-story layout problem
• The facility layout problem
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• A Heuristic Procedure for the Layout of a Large Number of Facilities

Cites work

• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• A Review of the Placement and Quadratic Assignment Problems
• An Algorithm for the Quadratic Assignment Problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• An exact algorithm for the general quadratic assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• Hospital Layout as a Quadratic Assignment Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Note—Comment on “A Perturbation Scheme to Improve Hillier's Solution to the Facilities Layout Problem”
• Numerical investigations on quadratic assignment problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Quadratic assignment problems
• The Backboard Wiring Problem: A Placement Algorithm
• The Efficiency of Computer Algorithms for Plant Layout
• The facility layout problem
• The quadratic assignment problem
• The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies

Cited in

(27)

• A heuristic method for the multi-story layout problem
• Layout design for flexible manufacturing systems
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
• Comment on ``The facility layout problem
• Large-scale layout of facilities using a heuristic hybrid algorithm
• A genetic approach to the quadratic assignment problem
• A heuristic procedure for the single-row facility layout problem
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
• An integrated method to solve the healthcare facility layout problem under area constraints
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• A supervised learning-driven heuristic for solving the facility location and production planning problem
• A new heuristic for the linear placement problem
• A Heuristic Procedure for the Layout of a Large Number of Facilities
• A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices
• A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
• FALSA-Facilities allocation by statistical analysis Part II. An heuristic algorithm to the problem of facilities design
• Note—Comment on “A Perturbation Scheme to Improve Hillier's Solution to the Facilities Layout Problem”
• A Cluster-Analytic Approach to Facility Layout
• A framework for hierarchical interactive generation of cellular layout*
• A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
• Machine layout problem in modern manufacturing facilities
• Tabu search based heuristics for multi-floor facility layout
• Locating cells with bottleneck machines in cellular manufacturing systems
• A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach
• An efficient two-staged approach for generating block layouts
• A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem

This page was built for publication: A hybrid heuristic for the facilities layout problem

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