The Efficiency of Computer Algorithms for Plant Layout

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.