Optimal Packing Configuration Design with Finite-Circle Method

The Finite-circle Method (FCM) is further developed to solve 2D and 3D packing optimization problems with system compactness and moment of inertia constraints here. Instead of using the real geometrical shape as in existing solutions, we approximate the components and the design domain with circles of variant radii. Such approximation makes it possible to transform the original problem into a basic packing problem of FCM approximated components. Meanwhile, the overlapping between different components can be easily avoided by limiting the distance between corresponding circles in terms of their radii. With this formulation, the FCM provides a general and systematic approach and makes gradient-based optimization algorithms applicable. Furthermore, FCM has been extended to 3D packing problems by simply replacing circles with spheres in this paper. Several examples designing the compactness and moment of inertia of the component systems are presented to show the effect of FCM.

[1]  Y. Radovcic,et al.  BOSS QUATTRO: an open system for parametric design , 2002 .

[2]  Duanbing Chen,et al.  A new heuristic algorithm for rectangle packing , 2007, Comput. Oper. Res..

[3]  Kikuo Fujita,et al.  Hybrid Approach to Plant Layout Design Using Constraint-Directed Search and an Optimization Technique , 1994 .

[4]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

[5]  V. Braibant,et al.  Structural optimization: A new dual method using mixed variables , 1986 .

[6]  Manuel Iori,et al.  A hybrid genetic algorithm for the two-dimensional single large object placement problem , 2007, Eur. J. Oper. Res..

[7]  R. Balling,et al.  Optimal packaging of complex parametric solids according to mass property criteria , 1994 .

[8]  Jonathan Cagan,et al.  A survey of computational approaches to three-dimensional layout problems , 2002, Comput. Aided Des..

[9]  László Pál,et al.  A genetic algorithm for the two-dimensional Single Large Object Placement Problem , 2006 .

[10]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[11]  P. Meehan,et al.  PLACEMENT OF SHAPEABLE BLOCKS , 1988 .

[12]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Computer Graphics and Image Processing.

[13]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

[14]  A. Moore.  The circle tree - a hierarchical structure for efficient storage, access and multi-scale representation of spatial data , 2002 .

[15]  Weihong Zhang,et al.  Finite-circle method for component approximation and packing design optimization , 2009 .

[16]  Yoshiko Wakabayashi,et al.  Two- and three-dimensional parametric packing , 2005, Electron. Notes Discret. Math..

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

[18]  Jacques Carlier,et al.  A new exact method for the two-dimensional bin-packing problem with fixed orientation , 2007, Oper. Res. Lett..

[19]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[20]  Stephen Cameron,et al.  Approximation hierarchies and S-bounds , 1991, SMA '91.