.png){kind=icon}
.png){kind=icon}
Return
An efficient tabu algorithm for the single row facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.11.034.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The general goal of the facility layout problem is to arrange a given number of facilities to minimize the total cost associated with the known or projected interactions between them. One of the special classes of the facility layout problem is the Single Row Facility Layout Problem (SRFLP), which consists of finding an optimal linear placement of rectangular facilities with varying dimensions on a straight line. This paper first presents and proves a theorem to find the optimal Solution of a special case of SRFLP. The results obtained by this theorem prove to be very useful in reducing the computational efforts when a new algorithm based on tabu search for the SRFLP is proposed in this paper. Computational results of the proposed algorithm oil benchmark problems show the greater efficiency of the algorithm compared to the other heuristics for solving the SRFLP. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Facilities planning and design
Linear ordering problem
Tabu search
Integer programming
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W