Graph theory and computer aided facilities design
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.
If 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.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.