Optimized packing clusters of objects in a rectangular container

DOI10.1155/2019/4136430MaRDI QIDQ2298400zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/4136430

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Optimized object packings using quasi-phi-functions
• Optimal clustering of a pair of irregular objects
• Packing ellipses in an optimized convex polygon
• Quasi-phi-functions and optimal packing of ellipses
• Solution methods of clustering 2D-objects into a circle of the minimal radius

Cites work

• scientific article; zbMATH DE number 6698326 (Why is no real title available?)
• scientific article; zbMATH DE number 1786500 (Why is no real title available?)
• 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
• 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

Cited in

(8)

• Optimized object packings using quasi-phi-functions
• Solution methods of clustering 2D-objects into a circle of the minimal radius
• Parallel computing technologies for solving optimization problems of geometric design
• Phase field approach to optimal packing problems and related Cheeger clusters
• Optimal clustering of a pair of irregular objects
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
• Packing convex 3D objects with special geometric and balancing conditions

Describes a project that uses

Uses Software

• Ipopt

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)