ABSTRACT

We consider the problem of finding the most efficientlayout of department that are to be placed in the multi-floorfacility. It is known that the Facility Layout Problem (FLP)is a class of NP-hard problem, and thus, is difficult to solve.Multi-Floor Facility Problem, in fact, is much more difficult thansingle-floor problem due to the large number of combinationof binary variables that specify on which floor to assign eachdepartments. Thus, most of the algorithm cannot be applied tothe large size problem where there are typically more than 30departments. In this paper, we proposed a heuristics method thatcan be applicable to such large sized problem. We developeda heuristic inspired by SEQUENCE, that outperformed manyother algorithms in single-floor FLP and expand it to multifloorproblem. In the computational experiments, we applied ourmethod to the problem with 44 departments and showed howthis problem can be solved by our algorithm efficiently.