Multistage approach to solving the optimization problem of packing nonconvex polyhedra

DOI10.1007/S10559-020-00241-WMaRDI QIDQ2215293zbMATHOpenAlexFDO

Authors A. M. Chugay, Yu. Stoyan

Publication date 11 December 2020

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-020-00241-w

zbMATH Keywords

nonlinear optimizationpackingnonconvex polyhedra\( \Phi \)-function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computer-aided design (modeling of curves and surfaces) (65D17) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Two approaches to modeling and solving the packing problem for convex polytopes
• Optimized packing multidimensional hyperspheres: a unified approach
• A global optimization point of view to handle non-standard object packing problems
• Numerical optimization method for packing regular convex polygons
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• A Multi-sphere Scheme for 2D and 3D Packing Problems
• Inverse convex programming and parallelepiped packing
• A semidefinite programming hierarchy for packing problems in discrete geometry
• A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids

Cites work

• A global optimization point of view to handle non-standard object packing problems
• Mathematical model and efficient algorithms for object packing problem
• Mathematical modeling of the interaction of non-oriented convex polytopes
• Maximum packing densities of basic 3D objects
• Modeling close packing of 3D objects
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
• Packing different cuboids with rotations and spheres into a cuboid
• Packing ellipsoids by nonlinear optimization
• Two approaches to modeling and solving the packing problem for convex polytopes

Cited in

(11)

• Optimization of multiweighing packing proceedings
• Packaging optimization using the dynamic vector fields method
• Inverse convex programming and parallelepiped packing
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
• A mathematical model and a method of solution the packing optimization problem for arbitrary 2D objects in rectangular domains
• A Multi-sphere Scheme for 2D and 3D Packing Problems
• Two approaches to modeling and solving the packing problem for convex polytopes
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• A problem of packing homothetic convex polytopes
• A global optimization point of view to handle non-standard object packing problems

Describes a project that uses

Uses Software

• Ipopt

This page was built for publication: Multistage approach to solving the optimization problem of packing nonconvex polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215293)