Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics

DOI10.1287/OPRE.33.5.1091MaRDI QIDQ3693214zbMATH OpenOpenAlexFDO

Authors Les R. Foulds, J. W. Giffin, Peter B. Gibbons

Publication date 1985

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.33.5.1091

zbMATH Keywords

computational experienceefficient layout designfacilities layoutgraph theoretic heuristicslogisticsmaximum weight planar graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 568799
• scientific article; zbMATH DE number 1206315
• A New Graph-Theoretic Heuristic for Facility Layout
• Maximally weighted graph theoretic facilities design planning
• scientific article; zbMATH DE number 4008427

Cited in

(23)

• Analysis of heuristics for finding a maximum weight planar subgraph
• The facility layout problem
• An algorithm for quadratic assignment problems
• Integrating facility layout with process selection and capacity planning
• An interactive layout heuristic based on hexagonal adjacency graphs
• Location and layout planning. A survey
• Two new heuristic algorithms for the maximal planar layout problem
• A heuristic procedure for the single-row facility layout problem
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• A continuous approach to considering uncertainty in facility design
• A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
• Two graph-theoretic procedures for an improved solution to the facilities layout problem
• Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
• scientific article; zbMATH DE number 4008427 (Why is no real title available?)
• TESSA—A new greedy heuristic for facilities layout planning
• Facilities layout design optimization with single loop material flow path configuration
• Maximally weighted graph theoretic facilities design planning
• A note on 'Maximally weighted graph theoretic facilities design planning'
• Branch-and-bound techniques for the maximum planar subgraph problem^∗
• scientific article; zbMATH DE number 844203 (Why is no real title available?)
• Constructing an optimal facility layout to maximize adjacency as a function of common boundary length
• Efficient models for the facility layout problem

This page was built for publication: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics

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