An Algorithm for Solving Generalized Single Row Facility Layout Problem

• 作者: Kourosh Eshghi Mana Meskar
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 数学
• 关键词: Single Row Facility Layout Problem Facility Location Plant Layout Optimization Cuckoo Optimization Algorithm
• 年，卷（期）: 2020,（6）
• 页码范围: 299-320
• 页数: 22页
• 分类号: O17

摘要

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 </span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">the </span></span></span><span><span><span style="font-family:""><span style="font-family:Verdana;">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 </span><i><span style="font-family:Verdana;">n</span></i><span style="font-family:Verdana;"> 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 </span><span style="font-family:Verdana;">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.