Optimized Packing Clusters of Objects in a Rectangular Container

A packing (layout) problem for a number of clusters (groups) composed of convex objects (e.g., circles, ellipses, or convex polygons) is considered. The clusters have to be packed into a given rectangular container subject to nonoverlapping between objects within a cluster. Each cluster is represented by the convex hull of objects that form the cluster. Two clusters are said to be nonoverlapping if their convex hulls do not overlap. A cluster is said to be entirely in the container if so is its convex hull. All objects in the cluster have the same shape (different sizes are allowed) and can be continuously translated and rotated. The objective of optimized packing is constructing a maximum sparse layout for clusters subject to nonoverlapping and containment conditions for clusters and objects. Here the term sparse means that clusters are sufficiently distant one from another. New quasi-phi-functions and phi-functions to describe analytically nonoverlapping, containment and distance constraints for clusters are introduced. The layout problem is then formulated as a nonlinear nonconvex continuous problem. A novel algorithm to search for locally optimal solutions is developed. Computational results are provided to demonstrate the efficiency of our approach. This research is motivated by a container-loading problem; however similar problems arise naturally in many other packing/cutting/clustering issues.

[1]  Charlie C. L. Wang,et al.  Minimum Area Convex Packing of Two Convex Polygons , 2006, Int. J. Comput. Geom. Appl..

[2]  Igor Litvinchev,et al.  Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting , 2015 .

[3]  Yuriy Stoyan,et al.  Optimized Object Packings Using Quasi-Phi-Functions , 2015 .

[4]  Yu. G. Stoyan,et al.  Quasi-phi-functions and optimal packing of ellipses , 2016, J. Glob. Optim..

[5]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[6]  José Mario Martínez,et al.  Packing ellipsoids by nonlinear optimization , 2015, Journal of Global Optimization.

[7]  I. Litvinchev,et al.  Packing circular-like objects in a rectangular container , 2015 .

[8]  Yu. G. Stoyan,et al.  Phi-Functions for 2D Objects Formed by Line Segments and Circular Arcs , 2012, Adv. Oper. Res..

[9]  Andreas Bortfeldt,et al.  Constraints in container loading - A state-of-the-art review , 2013, Eur. J. Oper. Res..

[10]  Maria Antónia Carravilla,et al.  The Dotted-Board Model: A new MIP model for nesting irregular shapes , 2013 .

[11]  Yuriy Stoyan,et al.  Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization , 2016, J. Oper. Res. Soc..

[12]  Yuriy Stoyan,et al.  Packing equal circles into a circle with circular prohibited areas , 2012, Int. J. Comput. Math..

[13]  Julia A. Bennell,et al.  Packing of concave polyhedra with continuous rotations using nonlinear optimisation , 2018, Eur. J. Oper. Res..

[14]  Mhand Hifi,et al.  An augmented beam search-based algorithm for the circular open dimension problem , 2009, 2009 International Conference on Computers & Industrial Engineering.

[15]  Donald R. Jones A fully general, exact algorithm for nesting irregular shapes , 2014, J. Glob. Optim..

[16]  Leonidas J. Guibas,et al.  The complexity of cutting complexes , 1989, Discret. Comput. Geom..

[17]  Guntram Scheithauer,et al.  On the global minimum in a balanced circular packing problem , 2016, Optim. Lett..

[18]  Zhipeng Lü,et al.  Iterated tabu search for the circular open dimension problem , 2012, Eur. J. Oper. Res..

[19]  Igor Litvinchev,et al.  Packing ellipses in an optimized rectangular container , 2018, Wirel. Networks.

[20]  Julia A. Bennell,et al.  Optimal clustering of a pair of irregular objects , 2015, J. Glob. Optim..

[21]  Steffen Rebennack,et al.  Cutting ellipses from area-minimizing rectangles , 2014, J. Glob. Optim..

[22]  Josef Kallrath,et al.  Cutting circles and polygons from area-minimizing rectangles , 2009, J. Glob. Optim..