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

DOI10.1287/opre.33.5.1091zbMath0574.90022OpenAlexW1997298427MaRDI QIDQ3693214

J. W. Giffin, Les R. Foulds, 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 experiencelogisticsfacilities layoutefficient layout designgraph theoretic heuristicsmaximum weight planar graph

Mathematics Subject Classification ID

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

Related Items (17)

The facility layout problem ⋮ Location and layout planning. A survey ⋮ Two new heuristic algorithms for the maximal planar layout problem ⋮ An algorithm for quadratic assignment problems ⋮ Branch-and-bound techniques for the maximum planar subgraph problem^∗ ⋮ TESSA—A new greedy heuristic for facilities layout planning ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Integrating facility layout with process selection and capacity planning ⋮ An interactive layout heuristic based on hexagonal adjacency graphs ⋮ Facilities layout design optimization with single loop material flow path configuration ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ 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 ⋮ Facilities layout generalized model solved by n-boundary shortest path heuristics ⋮ A continuous approach to considering uncertainty in facility design ⋮ Analysis of heuristics for finding a maximum weight planar subgraph ⋮ 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