Loading...

An efficient tabu algorithm for the single row facility layout problem

Samarghandi, H ; Sharif University of Technology | 2010

521 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.ejor.2009.11.034
  3. Publisher: 2010
  4. Abstract:
  5. 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 on benchmark problems show the greater efficiency of the algorithm compared to the other heuristics for solving the SRFLP
  6. Keywords:
  7. Bench-mark problems ; Computational effort ; Computational results ; Facilities planning and design ; Facility layout problems ; Linear ordering problem ; Linear orderings ; Linear placement ; Optimal solutions ; Special class ; Straight lines ; Tabu algorithm ; Total costs ; Algorithms ; Computational efficiency ; Dynamic programming ; Integer programming ; Plant layout ; Set theory ; Tabu search
  8. Source: European Journal of Operational Research ; Volume 205, Issue 1 , 2010 , Pages 98-105 ; 03772217 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0377221709009072?np=y