An ILP-embedded Tabu Search heuristic for the design of integrated cellular manfacturing systems with production planning and dynamic system reconfiguration
This paper describes a tabu search algorithm to solve the integrated cellular manufacturing systems design problem. The algorithm makes use of both short term and long term memory aspects, in combination with integer linear programming (ILP), to construct the neighbour solutions. Within the short term memory component, attributive recency based memory is used in tabu lists to determine the tabu status of move operators. Within the long-term memory structures, frequency based memory is used in the form of residency measures to guide the diversification scheme and explicit memory is used to guide the intensification scheme. Computational results show that the tabu search procedure generates good quality solutions and that better solution times are experienced compared to that of state-of-the-art optimization software, hence proves to be a viable algorithm especially for the larger sized problems. <br/
