A closed loop based facility layout design using a cuckoo search algorithm

被引:24
作者
Kang, Sumin [1 ]
Kim, Minhee [1 ]
Chae, Junjae [1 ]
机构
[1] Korea Aerosp Univ, Sch Air Transport Transportat & Logist, 76 Hanggongdaehang Ro, Goyang Si 10540, Gyeonggi Do, South Korea
关键词
Facility layout design; Closed loop layout; Cuckoo search; Flexible manufacturing system; SIMULATED ANNEALING ALGORITHM; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM;
D O I
10.1016/j.eswa.2017.10.038
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Facility layout problems (FLPs) are design problems that involve determining the most favorable arrangement of facilities in a given space. The closed loop layout problem (CLLP) is an FLP that employs a closed loop guided configuration. This type of layout is commonly discussed when designing a flexible manufacturing system (FMS). The CLLP is concerned with determining the efficient arrangement of manufacturing cells on a central loop based material handling system. Because the material flow between cells must pass through the loop path, distance is not measured in the conventional manner (i.e. the rectilinear or Euclidean distance). The problem is more complicated than a generic FLP because there are additional constraints that restrict cell shape and orientation as well as the positions of the pick-up and drop-off points. In this study, we propose a random-key and cuckoo search (CS) based approach to solve the CLLP. CS is a rather recently developed algorithm, and it has not yet been applied to FLPs in the literature. To evaluate the present algorithm, computational experiments are conducted using benchmark problems from a previous study. The obtained results show the remarkable performance of the proposed approach. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:322 / 335
页数:14
相关论文
共 59 条
[31]  
Maadi M., 2016, J ARTIFICIAL INTELLI, V4
[32]   FAST, ACCURATE ALGORITHM FOR NUMERICAL-SIMULATION OF LEVY STABLE STOCHASTIC-PROCESSES [J].
MANTEGNA, RN .
PHYSICAL REVIEW E, 1994, 49 (05) :4677-4683
[33]   Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan [J].
Marichelvam, M. K. ;
Prabaharan, T. ;
Yang, X. S. .
APPLIED SOFT COMPUTING, 2014, 19 :93-101
[34]   Simulated annealing and genetic algorithms for the facility layout problem: A survey [J].
Mavridou, TD ;
Pardalos, PM .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 7 (01) :111-126
[35]   The facility layout problem: Recent and emerging trends and perspectives [J].
Meller, RD ;
Gau, KY .
JOURNAL OF MANUFACTURING SYSTEMS, 1996, 15 (05) :351-366
[36]   Meta-heuristics from nature for the loop layout design problem [J].
Nearchou, AC .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 101 (02) :312-328
[37]   Modified migrating birds optimization algorithm for closed loop layout with exact distances in flexible manufacturing systems [J].
Niroomand, Sadegh ;
Hadi-Vencheh, Abdollah ;
Sahin, Ramazan ;
Vizvari, Bela .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (19) :6586-6597
[38]   A mixed integer linear programming formulation of closed loop layout with exact distances [J].
Niroomand, Sadegh ;
Vizvari, Bela .
JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2013, 30 (03) :190-201
[39]   Random-key cuckoo search for the travelling salesman problem [J].
Ouaarab, Aziz ;
Ahiod, Belaid ;
Yang, Xin-She .
SOFT COMPUTING, 2015, 19 (04) :1099-1106
[40]   Discrete cuckoo search algorithm for the travelling salesman problem [J].
Ouaarab, Aziz ;
Ahiod, Belaid ;
Yang, Xin-She .
NEURAL COMPUTING & APPLICATIONS, 2014, 24 (7-8) :1659-1669