Solution for bi-objective single row facility layout problem using artificial bee colony algorithm

被引：12

作者：

Nagarajan, Lenin ^{[1
]}

Mahalingam, Siva Kumar ^{[2
]}

Gurusamy, Selvakumar ^{[3
]}

Dharmaraj, Vignesh Kumar ^{[4
]}

机构：

[1] Vel Tech Rangarajan Dr Sagunthala R&D Inst Sci &, Mech Engn Dept, Madras 600062, Tamil Nadu, India

[2] Sree Sowdambika Coll Engn, Mech Engn Dept, Aruppukottai 626134, Tamil Nadu, India

[3] SSN Collge Engn, Mech Engn Dept, Madras 603110, Tamil Nadu, India

[4] Natl Engn Coll, Mech Engn Dept, Kovilpatti 628503, Tamil Nadu, India

来源：

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING | 2018年 / 12卷 / 02期

关键词：

single row facility layout problem; SRFLP; bi-objective; linear machine sequence; lms; artificial bee colony; ABC algorithm; total flow distance; total length of the flow line; GENETIC ALGORITHM; DESIGN;

D O I：

10.1504/EJIE.2018.090619

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method.

引用

页码：252 / 275

页数：24

共 22 条

[1] An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems [J].

Baykasoglu, A ;

Dereli, T ;

Sabuncu, I .

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (04) :385-396

[2] An entropy-based algorithm to solve the facility layout design problem [J].

Carmen Gonzalez-Cruz, Ma ;

Gomez-Senent Martinez, Eliseo .

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2011, 27 (01) :88-100

[3] Monte Carlo simulation based procedures for solving block layout problems [J].

Chan, Wai Kin Victor ;

Malmborg, Charles J. .

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2011, 5 (01) :2-21

[4] Monte Carlo simulation methods for dynamic line layout problems with nonlinear movement costs [J].

Chan, Wai Kin Victor ;

Malmborg, Charles J. .

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2010, 4 (01) :40-58

[5] Linear sequencing for machine layouts by a modified simulated annealing [J].

Chen, DS ;

Wang, Q ;

Chen, HC .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (08) :1721-1732

[6] A genetic algorithm for facility layout problems of different manufacturing environments [J].

El-Baz, MA .

COMPUTERS & INDUSTRIAL ENGINEERING, 2004, 47 (2-3) :233-246

[7]

Jannat S, 2010, P 2010 INT C IND ENG

[8]

Karaboga D, 2008, APPL SOFT COMPUT, V8, P687, DOI 10.1016/j.asoc.2007.05.007

[9] A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems [J].

Karaboga, Dervis ;

Akay, Bahriye .

APPLIED SOFT COMPUTING, 2011, 11 (03) :3021-3031

[10] A novel clustering approach: Artificial Bee Colony (ABC) algorithm [J].

Karaboga, Dervis ;

Ozturk, Celal .

APPLIED SOFT COMPUTING, 2011, 11 (01) :652-657

← 1 2 3 →