Algorithms for automated three-dimensional facility layout problem.

摘要

The problem of assigning n departments without shape distortion to a one or multiple story building is investigated. The literature concerning facility location problems, packing problems and facility layout problems is reviewed. This paper develops {dollar}O(nsp3){dollar} algorithm to construct a cut tree for facility layout generated by Gomory-Hu algorithm.; To construct automated facility design for one or multiple story structures, eigenvector approach and cut tree approach are employed. A branch and bound computer code developed by Tillinghast is modified to optimize the cut tree approach and find the feasible fits of departments in the plant rectangle. Rectilinear distance measures and aisle distance measures are used so as to calculate the objective function. For the aisle structure, the shortest path algorithm is applied and door locations of departments are considered. The grouping algorithm for the multiple story problem is developed and elevator is considered to move between floors. Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance and aisle distance for one or multiple story buildings.