Simulated Annealing Combined with a Constructive Algorithm for Optimising Assembly Workcell Layout

This paper addresses the development of a tool for optimising assembly workcell layout in the context of an industrial robotic CAD/CAM/CAE software product. The criterion to be minimised is the cycle time for completing a given sequence of operations, which is achieved by determining the relative positions of peripheral machines on the cell floor. The algorithm is constructive: the machines are placed one at a time in the robot neighbourhood, by means of a modified simulated annealing (SA) method. This method yields several possible and optimal positions for a machine, and several layouts are thus obtained at the end of execution. The optimisation tool has been implemented in IGRIP, and a case study illustrates its performance.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  Jonathan Cagan,et al.  A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout , 1998, Comput. Aided Des..

[3]  Pei-Yung Hsiao,et al.  VLSI circuit placement with rectilinear modules using three-layer force-directed self-organizing maps , 1997, IEEE Trans. Neural Networks.

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Peter Ross,et al.  A Study of Genetic Algorithm Hybrids for Facility Layout Problems , 1995, ICGA.

[6]  M. Bazaraa,et al.  A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .

[7]  Bryan Kok Ann Ngoi,et al.  A fast spatial representation method (applied to fixture design) , 1993 .

[8]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[9]  Alice E. Smith,et al.  Genetic Optimization Using A Penalty Function , 1993, ICGA.

[10]  Carl Sechen.  Chip-planning, placement, and global routing of macro/custom cell integrated circuits using simulated annealing , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[11]  K. Y. Tam,et al.  A simulated annealing algorithm for allocating space to manufacturing cells , 1992 .

[12]  Henry Joseph Sommer,et al.  LAYOUT DESIGN FOR ROBOTIC ASSEMBLY WORKCELLS. , 1986 .

[13]  Roger C. Vergin,et al.  A Cluster-Analytic Approach to Facility Layout , 1985 .

[14]  Myunghwan Kim,et al.  Stepwise-overlapped parallel annealing and its application to floorplan designs , 1991, Comput. Aided Des..

[15]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[16]  Andrew Kusiak,et al.  The facility layout problem , 1987 .

[17]  Philippe Wenger,et al.  Design and positioning of a robot in an environment with obstacles using optimal research , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[18]  A. Liegeois,et al.  Development of Optimisation Tools in the Context of an Industrial Robotic CAD Software Product , 1999 .

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

[20]  Zvi Drezner,et al.  On Optimizing Bin Picking and Insertion Plans for Assembly Robots , 1984 .

[21]  K. Y. Tam,et al.  Genetic algorithms, function optimization, and facility layout design , 1992 .

[22]  Tim Lüth.  Automated planning of robot workcell layouts , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[23]  R. Burkard,et al.  Numerical investigations on quadratic assignment problems , 1978 .