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

L. R. Foulds, P. B. Gibbons and J. W. Giffin
Additional contact information
L. R. Foulds: University of Florida, Gainesville, Florida
P. B. Gibbons: University of Auckland, Auckland, New Zealand
J. W. Giffin: University of Arizona, Tucson, Arizona

Operations Research, 1985, vol. 33, issue 5, 1091-1106

Abstract: The facilities layout problem is concerned with laying out facilities on a planar site in order to design systems that are as efficient as possible. One approach to the problem involves the use of REL charts, which are tables that estimate the desirability of locating facilities next to each other, and the construction of a maximum weight planar graph that represents an efficient layout design. This method is not a complete one, however, since it specifies only which facilities are to be adjacent. Nevertheless, whenever the analyst has a great deal of freedom of design, it is a useful tool in the initial stages of laying out a new system. In this paper, we describe three graph theoretic heuristics that attempt to determine an optimal planar adjacency graph from a REL chart. Our computational experience suggests that these methods can provide effective solutions to problems of the size frequently encountered in practice by designers.

Keywords: 184 facilities layout; 482 applied graph theory (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.5.1091 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:5:p:1091-1106

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().