Applying Tabu search algorithm for solving topological layout optimization in shipyard facilities

This paper conducts a study on topological optimization of shipyard layouts using the tabu search algorithm, taking into account adjacency and non-adjacency constraints, wherein some departments must be close together while others must be far apart. The objective is to minimize material handling cost (MHC). Traditionally, shipyard layouts are arranged based on the experience and knowledge of practitioners in the field. Therefore, this paper aims to design a systematic method for arranging workshops in shipyards. The workshops will be placed into several horizontal zones, or bays, with the sequence determined by the tabu search algorithm. The workshop comprises 25 units, featuring a variety of ship production facilities, some of which must be arranged in a specific order. The arrangement is done in an unequal area layout, considering the actual shapes of each workshop. Based on computational results from 1000 iterations, the tabu search algorithm achieved an MHC efficiency improvement of 22.654% from the initial solution. At the end of this paper, a performance graph of the tabu search algorithm is presented, showing that the algorithm converges quickly, requiring relatively few iterations to approach an optimal solution. This demonstrates that the model is capable of finding near-optimal solutions in a relatively short amount of time.