Single row facility layout problem using a permutation-based genetic algorithm

被引：113

作者：

Datta, Dilip ^{[1
,2
]}

Amaral, Andre R. S. ^{[2
]}

Figueira, Jose Rui ^{[3
]}

机构：

[1] Natl Inst Technol Silchar, Dept Mech Engn, Silchar 788010, India

[2] Univ Tecn Lisboa, Inst Super Tecn, Ctr Management Studies, CEG IST, P-2744016 Porto Salvo, Portugal

[3] Ecole Mines, Lab LORIA, INPL, F-54042 Nancy, France

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2011年 / 213卷 / 02期

关键词：

Single row facility layout problem; Genetic algorithm; Combinatorial optimization; FLEXIBLE MANUFACTURING SYSTEMS; DIMENSIONAL SPACE ALLOCATION;

D O I：

10.1016/j.ejor.2011.03.034

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：388 / 394

页数：7

共 24 条

[1]

Amaral A.R.S., 2008, A polyhedral approach to the single row facility layout problem

[2] An exact approach to the one-dimensional facility layout problem [J].