Multiobjective layout optimization of robotic cellular manufacturing systems

This paper proposes a multiobjective layout optimization method for the conceptual design of robot cellular manufacturing systems. Robot cellular manufacturing systems utilize one or more flexible robots which can carry out a large number of operations, and can conduct flexible assemble processes. The layout design stage of such manufacturing systems is especially important since fundamental performances of the manufacturing system under consideration are determined at this stage. In this paper, the design criteria for robot cellular manufacturing system layout designs are clarified, and objective functions are formulated. Next, layout design candidates are represented using a sequence-pair scheme to avoid interference between assembly system components, and the use of dummy components is proposed to represent layout areas where components are sparse. A multiobjective genetic algorithm is then used to obtain Pareto optimal solutions for the layout optimization problems. Finally, several numerical examples are provided to illustrate the effectiveness and usefulness of the proposed method.

[1]  Ernesto G. Birgin,et al.  Orthogonal packing of identical rectangles within isotropic convex regions , 2010, Comput. Ind. Eng..

[2]  A. Liegeois,et al.  Simulated Annealing Combined with a Constructive Algorithm for Optimising Assembly Workcell Layout , 2001 .

[3]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  ChangYao-Wen,et al.  Modern floorplanning based on B*-tree and fast simulated annealing , 2006 .

[5]  Bryan Kok Ann Ngoi,et al.  Optimising robot workcell layout , 1996 .

[6]  R. Meller,et al.  A sequence-pair representation and MIP-model-based heuristic for the facility layout problem with rectangular departments , 2007 .

[7]  Pinaki Mazumder,et al.  VLSI cell placement techniques , 1991, CSUR.

[8]  Hamed Samarghandi,et al.  A Particle Swarm Optimization for the Single Row Facility Layout Problem , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[9]  T. Koide,et al.  An adaptive genetic algorithm for VLSI floorplanning based on sequence-pair , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[10]  Tsuneo Yoshikawa,et al.  Manipulability of Robotic Mechanisms , 1985 .

[11]  Yao-Wen Chang,et al.  Modern floorplanning based on B/sup */-tree and fast simulated annealing , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Ernest S. Kuh,et al.  Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

[14]  Maghsud Solimanpur,et al.  Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm , 2008, Comput. Ind. Eng..

[15]  GenMitsuo,et al.  Evolutionary techniques for optimization problems in integrated manufacturing system , 2009 .

[16]  Wei Xie,et al.  A branch-and-bound algorithm for the continuous facility layout problem , 2008, Comput. Chem. Eng..

[17]  Orhan Türkbey,et al.  A simulated annealing heuristic for the dynamic layout problem with budget constraint , 2010, Comput. Ind. Eng..

[18]  Hanif D. Sherali,et al.  Applying the sequence-pair representation to optimal facility layout designs , 2007, Oper. Res. Lett..

[19]  Hanif D. Sherali,et al.  Enhanced Model Formulations for Optimal Facility Layout , 2003, Oper. Res..

[20]  Maghsud Solimanpur,et al.  Solving facilities location problem in the presence of alternative processing routes using a genetic algorithm , 2010, Comput. Ind. Eng..

[21]  Mitsuo Gen,et al.  Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey , 2009, Comput. Ind. Eng..

[22]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[23]  A. Drakidis,et al.  Packing-based VLSI module placement using genetic algorithm with sequence-pair representation , 2006 .

[24]  Henri Pierreval,et al.  Facility layout problems: A survey , 2007, Annu. Rev. Control..

[25]  Komarudin,et al.  Applying Ant System for solving Unequal Area Facility Layout Problems , 2010, Eur. J. Oper. Res..

[26]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[27]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..