Graph theory and computer aided facilities design
AbstractFour 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 6 (1978)
Issue (Month): 4 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.