Optimized packing clusters of objects in a rectangular container
Summary: 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.
- A fully general, exact algorithm for nesting irregular shapes
- Approximate packing: integer programming models, valid inequalities and nesting
- Constraints in container loading -- a state-of-the-art review
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- scientific article; zbMATH DE number 6698326 (Why is no real title available?)
- scientific article; zbMATH DE number 1786500 (Why is no real title available?)
- Iterated tabu search for the circular open dimension problem
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- On the global minimum in a balanced circular packing problem
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal clustering of a pair of irregular objects
- Optimized object packings using quasi-phi-functions
- Packing circular-like objects in a rectangular container
- Packing ellipsoids by nonlinear optimization
- Packing equal circles into a circle with circular prohibited areas
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Phi-functions for 2D objects formed by line segments and circular arcs
- Quasi-phi-functions and optimal packing of ellipses
- The complexity of cutting complexes
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Optimal clustering of a pair of irregular objects
- Parallel computing technologies for solving optimization problems of geometric design
- On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
- Phase field approach to optimal packing problems and related Cheeger clusters
- Optimized object packings using quasi-phi-functions
- Packing convex 3D objects with special geometric and balancing conditions
- Solution methods of clustering 2D-objects into a circle of the minimal radius
This page was built for publication: Optimized packing clusters of objects in a rectangular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298400)
