The Efficiency of Computer Algorithms for Plant Layout

Larry P. Ritzman
Additional contact information
Larry P. Ritzman: Ohio State University

Management Science, 1972, vol. 18, issue 5-Part-1, 240-248

Abstract: This paper presents the results of comparing experimentally the performance of four of the more promising computer algorithms for the plant layout problem. CDC 3600 computer programs are tested with twenty-six test problems. The resulting solutions are evaluated in respect to both computer time requirements and objective function values. The experiment shows how these two performance measures vary with the algorithm used and various test problem characteristics. With the exception of two studies [Hillier, F. S., M. N. Connors. 1966. Quadratic assignment problem algorithms and the location of indivisible facilities. Management Sci. 13 (1, September) 42-57; Nugent, C. E., T. E. Vollman, J. Ruml. 1968. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. XVI (1, January-February) 150-173.], information on comparative performances of layout algorithms is very limited.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.5.240 (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:ormnsc:v:18:y:1972:i:5-part-1:p:240-248

Access Statistics for this article

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