Heuristic Algorithms For Continuous Dynamic Facility Layout Problem

In this paper,based on the layout planning of workshop equipment in enterprise production, the continuous dynamic facility layout problem is studied. The continuous dynamic facility layout problem is a kind of multi-stage layout optimization problem,which belongs to a kind of NP(Non-deterministic Polynomial)problem. This kind of problem is difficult to obtain the optimal solution by the certainty algorithm. However, because of its importance in the manufacturing industry, it is important to find the optimal layout or approximate optimal layout.Firstly, the mathematical model of the problem is established, including the constraint condition and objective function; and then the heuristic algorithms with global searching ability are used to solve the model; finally, the algorithm is proved.The specific studies are as follows:(1) Wang-Landau sampling algorithm for the continuous dynamic facility layout problem is studied. The Wang-Landau sampling algorithm is an improved Monte Carlo algorithm. By combining the Wang-Landau sampling algorithm with vacant point strategy, pushing strategy and pressuring strategy, a heuristic algorithm based on the Wang-Landau sampling is proposed. The algorithm is verified by four groups of examples, and the experimental results show that the proposed algorithm is effective in solving the continuous dynamic facility layout problem.(2) An improved tabu search algorithm for the continuous dynamic facility layout problem with varying facility area is studied. First of all,the facility and the border of the workshop are supposed to be elastic objects, the principle of elastic force interaction is adopted to solve the problem of the embedded devices, and the gradient algorithm is adopted to implement the process. Secondly, by modifying the tabu object and the acceptance criteria of the tabu search algorithm, and combining the vacant point strategy, a modified tabu search algorithm is proposed. The algorithm is verified by three groups of examples, and the experimental results show that the proposed algorithm is effective in solving the continuous dynamic facility layout problem with varying facility area.