Loading...
Search for:
integerprogramming
0.008 seconds
An efficient tabu search algorithm for the single row facility location problem [electronic resource]
, Article European Journal Of Operational Research ; Vol. 205, No. 1, pp. 98-105 ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
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...
An efficient tabu algorithm for solving the single row facility layoutproblem
, Article 2009 International Conference on Computers and Industrial Engineering, CIE 2009, 6 July 2009 through 9 July 2009, Troyes ; 2009 , Pages 482-488 ; 9781424441365 (ISBN) ; Eshghi, K ; Sharif University of Technology
Abstract
Single-Row Facility Layout Problem (SRFLP) is a http://library.sharif.ir/web-manage/catalog/resource.do?method=edit&flowLastAction=view&id=447751special class of facilitylayout problems, consists of finding an optimal linear placement of rectangularfacilities with varying dimensions on a straight line. In this research, wefirst present a theorem to find the optimal solution of a special case of SRFLP.The results obtained by this theorem are very useful in reducing thecomputational efforts when, later on, a new algorithm based on tabu search ispresented for SRFLP. Computational results of the proposed algorithm onbenchmark problems show the efficiency of the algorithm compared to the...