Placement of two- and three-dimensional irregular shapes for inertia moment and balance

We present a heuristic for the problem of placing irregular shapes in two or three dimensions within a container, such that the placement of the shapes is optimized for balance and inertia moment and no two shapes overlap. The heuristic is based on a technique that iteratively removes overlap, which has previously proven successful for bin-packing problems with rectangular objects and strip-packing problems with irregular shapes. We extend this method and demonstrate its ability to optimize an objective function related to the individual position of each shape. The approach iteratively reduces an augmented objective function, which is the sum of balance, inertia moment and overlap and uses the metaheuristic Guided Local Search.

[1]  Kamlesh Mathur.  An integer-programming-based heuristic for the balanced loading problem , 1998, Oper. Res. Lett..

[2]  E. Tsang,et al.  Guided Local Search , 2010 .

[3]  Jens Egeblad,et al.  Translational packing of arbitrary polytopes , 2009, Comput. Geom..

[4]  Michael Eley,et al.  Solving container loading problems by block arrangement , 2002, Eur. J. Oper. Res..

[5]  Toshihide Ibaraki,et al.  Hybrid Metaheuristics for Packing Problems , 2008, Hybrid Metaheuristics.

[6]  Eberhard E. Bischoff,et al.  Weight distribution considerations in container loading , 1999, Eur. J. Oper. Res..

[7]  David Pisinger,et al.  Guided Local Search for the Three-Dimensional Bin-Packing Problem , 2003, INFORMS J. Comput..

[8]  David Pisinger,et al.  Guided Local Search for Final Placement in VLSI Design , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[9]  John H. Vande Vate,et al.  Balanced Loading , 1992, Oper. Res..

[10]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[11]  Jens Egeblad,et al.  Heuristic approaches for the two- and three-dimensional knapsack packing problem , 2009, Comput. Oper. Res..

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

[13]  Jens Egeblad,et al.  Fast neighborhood search for two- and three-dimensional nesting problems , 2007, Eur. J. Oper. Res..

[14]  Hong-fei Teng,et al.  Layout optimization for the objects located within a rotating vessel - a three-dimensional packing problem with behavioral constraints , 2001, Comput. Oper. Res..

[15]  Giorgio Fasano.  A MIP approach for some practical packing problems: Balancing constraints and tetris-like items , 2004, 4OR.

[16]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..