Hybridizing tabu search with mathematical programming for solving a single row layout problem

Abstract

Single row layout problem is widely implemented in manufacturing systems. In this paper, we study a single row layout problem with consideration of additional clearances between adjacent facilities. The additional clearance is used to store work in process and allow technician access to the side of the facility and may be shared by any two adjacent facilities. A hybrid solution approach that integrates a tabu search with a mathematical programming is proposed to address it. The purpose of tabu search is to optimize the sequence of facilities and mathematical programming is used to find the optimal additional clearances. The hybrid approach is applied to a number of problem instances involving a range of facilities. Experimental results show that the hybrid approach can find the optimal solutions for most of small-size problem instances and good quality solutions for large-size problem instances.