The current work considers the problem of arrangement optimization of non-convex polyhedrons into a minimal height parallelepiped container. The no-fit polyhedron based algorithm is proposed to solve described task. The no-fit polyhedrons are used not only for providing conditions of the polyhedrons mutual non-intersection but also for finding the placement points. The current paper provides the block diagrams and the pseudo code of the algorithm. Some examples and computational results are also given for public input data.
Keywords: packing, no-fit polyhedron, non-intersection, optimization, arrangement
Information about authors of issue №4 (2008)