Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem

Abstract

In this study, for the first time, the classical single row facility layout problem is extended to its dynamic type by considering several planning periods. This new problem consists of two types of costs e.g. material handling cost and rearrangement cost of the departments at the beginning of each period. The problem is formulated by a mixed integer linear programming model. Because of the high complexity of the problem, two well-known meta-heuristic algorithms e.g. the GA and the SA are proposed to solve the problem. In addition, both of the algorithms are hybridized considering the restart and acceptance probability strategies. In order to study the performance of the proposed algorithms, 20 benchmark problems are generated randomly. Considering one of the generated benchmarks, the parameters of the algorithms are tuned by a typical method and final experiments are performed accordingly. The obtained results strongly prove the superiority of the SA hybridized by the restart strategy as it shows much better performance comparing to other proposed algorithms in more than 60% of the benchmarks.