Computational aspects of the facility layout design problem

This paper focuses on constructive graph theoretic based heuristics. We con sider the facility layout problem where the objective is to maximize benefi t. We briefly review the literature heuristics and present a new algorithm. Computational results, based on 600 randomly uniform generated problems, d emonstrate good support for our new algorithm. We also present the performa nce of each algorithm when various initial solutions are applied.