Multistage approach to solving the optimization problem of packing nonconvex polyhedra (Q2215293): Difference between revisions

The problem of packing nonconvex polyhedra into a container of minimum volume is solved by constructing an exact mathematical model using continuous translations and rotations. The algorithm is based on the method of \(\Phi\)-functions [\textit{N. Chernov} et al., Comput. Geom. 43, No. 5, 535--553 (2010; Zbl 1228.05117)], using nonlinear programming techniques. The problem solution is decomposed into two stages in order to reduce large computing and time costs: the preparatory stage and multiple-run stage. A number of nonlinear programming auxiliary problems are implemented at the preparatory stage, obtaining data for the construction of the initial points of the main problem. The multiple run stage consists in generating different initial feasible points and constructing their corresponding local minima, in a procedure of searching for approximations of the global minima. Numerical examples are given.