In this study, multi-floor facility layout problem is examined. Benders decomposition algorithm is used to solve the problem Better results were found in all of the test problems In this study, Benders decomposition algorithm is used to solve the multi-floor facility layout problem (MFLP). There has not been any article which has solved this problem by using Benders decomposition algorithm in the literature so far to the best of author's knowledge. Figure A. The scheme of the two-stage approach Purpose: Originality of this study; The benders decomposition algorithm which has not been found in the MFLP literature was firstly applied to solve the problem in this study. Theory and Methods: The used method in the study consists of two stages. As can be seen in Figure A, in the first stage, while the departments are assigned to the floors, in the second stage, the locations of the departments are determined to minimize the total material handling cost between the department pairs for each floor. At this stage, the mathematical model of the MFLP is divided into two parts, the main problem and the sub-problem, by sticking to the principles of Block Angular Linear Programming (BALP). Results: In order to test the developed Benders decomposition algorithm, a total of eight problems have been solved, five of which are known in the literature, three of which are adapted to the MFLP by us. When the experimental results are evaluated, it has been seen that developed Benders decomposition algorithm has found better results than all five problems which are the best solution in the literature. Conclusion: It is seen that the proposed algorithm is a more effective solution method than the previous methods compared with the objective function values. In this study, three problems were solved for the first time as MFLP and these problems were introduced to the literature as MFLP test problems.