%0 Journal Article
%T Assessing the Performance of Two Bioinspired Algorithms to Solve Single-Row Layout Problem
%A Berna Haktanirlar Ulutas
%J International Journal of Manufacturing Engineering
%D 2013
%R 10.1155/2013/265904
%X The single-row layout problem (SRLP), also known as the one-dimensional layout problem, deals with arranging a number of rectangular machines/departments with equal or varying dimensions on a straight line. Since the problem is proved to be NP-hard, there are several heuristics developed to solve the problem. This study introduces both a Clonal Selection Algorithm (CSA) and a Bacterial Foraging Algorithm (BFA) for SRLP. The performance of the algorithms is assessed by using three (small, medium, and large sized) well known test problems available in the literature. The promising results illustrated that both algorithms had generated the best known solutions so far for most of the problems or provided better results for a number of problems. 1. Introduction The objective in SRLP is to minimize the total material handling costs (MHC) and to find the optimum layout for machines in one dimension. The SRLP is also known as one-dimensional layout and usually refereed as Linear Ordering Problem, where all machines have unit length. Braglia [1] pointed that the problem is widely implemented in the configuration of manufacturing systems. Kusiak and Heragu [2] stated that the type of material handling device in Flexible Manufacturing System determines the pattern to be used for the layout of machines. Therefore, the design problem that is related with material handling devices such as handling robots and Automated Guided Vehicles (AGV) is usually considered as an SRLP. Further, the problem has applications in real-life applications such as the room arrangement problem along the corridor (i.e., hotels and hospitals) [3]; the arrangement of books on a shelf in a library; the assignment of disk cylinders to files [4]. Suresh and Sahu [5] have identified the problem that has wide application areas, as an NP-complete type. Therefore, several heuristics have been proposed to solve this problem in the literature. The pioneering studies include Karp and Held [6], Nugent et al. [7], Simmons [3], and Hall [8]. Neghabat [9] introduced a procedure where a complete solution is obtained by inserting one machine at a time to the end of the solution yet obtained. Love and Wong [10] presented a linear mixed integer-programming model for the single row layout problem and solved it using the mixed integer-programming algorithm. Drezner [11] introduced a heuristic that is based on the eigenvectors of a transformed flow matrix. Heragu and Kusiak [12] proposed the heuristic where a pair of facilities with the largest adjusted flow is initially laid; and then the partial order is
%U http://www.hindawi.com/journals/ijme/2013/265904/