Research And Application Of The Tabu Search Algorithm For Single Row Facility Layout Problem

Facility layout problem is a very important issue in manufacturing systems, whether is reasonable or not directly affects the economic efficiency of enterprises. The reasonable layout can improve the efficiency of material handling, reduce the accumulation time of the products, can save10%to30%cost of material handling. Facility layout as a NP-hard problem, it is difficult to precisely solving by the conventional method. Therefore, business and academia pay much attention to the facilities layout problem.Base on the research status of the single-line facility layout and analyze the inadequacies of the study, then work out the direction of the research. The Unidirectional loop layout problem and single row layout problem were mainly studied, and combined with intelligent optimization algorithm and tabu search algorithm to solve and optimize the allocation of equipment layout.For Unidirectional loop layout problem, the paper adopted the total of all the parts in minimum reverse order number as the objective function of the layout after analyzing the layout of the merits of the target manifestation. An efficient tabu search algorithm was proposed to solve the layout optimization problem. In this model of the layout, insertion method was used to generate initial solution according to the characteristic of the layout when designing the tabu search algorithm,2-opt was adopted to generate neighborhood structure, based on the exchange of two devices to build tabu lists; the step of the algorithm was described, then write related program model calculations. The algorithm was proved the effectiveness and efficiency by Examples of different sizes to solve the authentication. Finally, through the practical application proved the practicability of the algorithm.For single row layout problem, first analyze the advantages and disadvantages of the layout and the difficulties of the layout, and then an improved tabu search algorithm was proposed to solve the layout problem. There is a change in the distance after the device was swaped, the computational complexity was increased. So when the algorithm was designed, this paper used insertion method to generate initial solution,when designing neighborhood structure and candidate solutions, diversity and centralized search strategy was applied, and the global optimum was achieved by dynamic adjustment. The algorithm is shown effectively by examples of different sizes and compared with other algorithms verification. Finally, its application in practical problems, proved the practicability of the algorithm.Unidirectional loop layout problem and single row layout problem are cornerstone of the facility layout problem and also the member of complex facility layout problems. Tabu search algorithm can be fast and efficient for solving the layout problem, therefore, this study has important theoretical significance and practical value.