Loading...

An efficient tabu algorithm for solving the single row facility layoutproblem

Samarghandi, H ; Sharif University of Technology

549 Viewed
  1. Type of Document: Article
  2. Abstract:
  3. 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 otherheuristics. The proposed algorithm can easily find near-optimal solutions inless than one minute for instances consist of 200 departments. However, thelargest instances reported to be solved by the other methods had only 80departments and took more than 10 hours to reach the solution
  4. Keywords:
  5. Integerprogramming ; Tabu search ; Computational results ; Facilities planning and design ; Facility layout problems ; Linear ordering problem ; Linear placement ; Near-optimal solutions ; Optimal solutions ; Special class ; Straight lines ; Tabu algorithm ; Algorithms ; Computational efficiency ; Facilities ; Industrial engineering ; Optimal systems ; Plant layout ; Set theory ; Tabu search
  6. Source: 2009 International Conference on Computers and Industrial Engineering, CIE 2009, 6 July 2009 through 9 July 2009, Troyes ; 2009 , Pages 482-488 ; 9781424441365 (ISBN)
  7. URL: http://ieeexplore.ieee.org/document/5223967