IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v33y1985i5p1091-1106.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • L. R. Foulds & P. B. Gibbons & J. W. Giffin, 1985. "Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics," Operations Research, INFORMS, vol. 33(5), pages 1091-1106, October.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:5:p:1091-1106
    DOI: 10.1287/opre.33.5.1091
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.5.1091
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.5.1091?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    2. Paul D. Dowling & R. F. Love, 1990. "Floor layouts using a multifacility location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 945-952, December.
    3. H-L Li & M-C Hsieh, 1998. "Solving Facility-Layout Optimization Problems with Clustering Constraints," Environment and Planning B, , vol. 25(2), pages 299-308, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:33:y:1985:i:5:p:1091-1106. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.