TY - JOUR
ID - 5177
TI - TABU ALGORITHM FOR THE SINGLE ROW FACILITY LAYOUT PROBLEM
JO - Sharif Journal of Industrial Engineering & Management
JA - J65
LA - en
SN - 2676-4741
AU - Samarkand, Hamed
AD - Industrial Engineering, Sharif University of Technology
Y1 - 2010
PY - 2010
VL - Vol.26-1
IS - 2
SP - 35
EP - 45
KW - facility problem
KW - linear ordering problem
KW - tabu search algorithm
DO -
N2 - A special class of facility layout problem is the Single-Row Facility Layout Problem (SRFLP), which consists in finding a linear placement of rectangular facilities with varying dimensions on a straight line. In this research, we first prove a theorem to find the optimal solution of a special case of SRFLP. The theoremsâ€™ results are useful when a new algorithm, based on a tabu search, is presented for the SRFLP in this paper. Computational results of the proposed algorithm show the efficiency of the algorithm compared to other heuristics. The proposed algorithm can easily find near-optimal solutions for instances consisting of 200 departments in less than one minute. However, the largest instances reported to be solved by other methods had only 80 departments and took more than 10 hours to reach the solution.
UR - https://sjie.journals.sharif.edu/article_5177.html
L1 - https://sjie.journals.sharif.edu/article_5177_1db4794e385faf3e71e34e58e6f98db4.pdf
ER -