IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v6y1978i4p353-361.html
   My bibliography  Save this article

Graph theory and computer aided facilities design

Author

Listed:
  • Carrie, Allan S
  • Moore, James M
  • Roczniak, Marek
  • Seppänen, Jouko J

Abstract

Four variations of an algorithm based upon graph theory are developed for solving the facilities design problem. The facilities design problem involves locating economic activities, each of which requires a given amount of space, on a floor within a building in such a manner to optimize an appropriate measure of effectiveness such as, for example, the total cost of materials handling. This problem has been called the location-allocation problem in some of the earlier management science literature. The algorithm uses strings to represent the graphs in order to be able to handle the computing more effectively. The algorithm is illustrated throughout the article by an example. Experience with both FORTRAN and PL/1 is reported. The topic is likely to be of interest to facilities designers, graph theoreticians and computer scientists.

Suggested Citation

  • Carrie, Allan S & Moore, James M & Roczniak, Marek & Seppänen, Jouko J, 1978. "Graph theory and computer aided facilities design," Omega, Elsevier, vol. 6(4), pages 353-361.
    • Handle: RePEc:eee:jomega:v:6:y:1978:i:4:p:353-361
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(78)90008-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.

    More about this item

    Statistics

    Access and download statistics

    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:eee:jomega:v:6:y:1978:i:4:p:353-361. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.