TITLE:
An Algorithm for Solving Generalized Single Row Facility Layout Problem
AUTHORS:
Mana Meskar, Kourosh Eshghi
KEYWORDS:
Single Row Facility Layout Problem, Facility Location, Plant Layout, Optimization, Cuckoo Optimization Algorithm
JOURNAL NAME:
American Journal of Operations Research,
Vol.10 No.6,
November
27,
2020
ABSTRACT: Layout design
problem is to determine a suitable arrangement for the departments so that the total
costs associated with the flow among departments become least. Single Row Facility
Layout Problem, SRFLP, is one of the layout problems
that have many practical applications. This problem and its specific scenarios are
often used to model many of the raised issues in the field of facility location.
SRFLP is an arrangement of n departments with a specified length in a straight
line so that the sum of the weighted distances between the pairs of departments
is minimized. This problem is NP-hard. In this paper, first, a lower bound for a
special case of SRFLP is presented. Then, a general case of SRFLP is presented in which some new and real assumptions are added
to generate more practical model. Then a lower bound, as well as an algorithm,
is proposed for solving the model. Experimental results on some instances in literature
show the efficiency of our algorithm.