The paper considers the problem of packing non-convex polytopes of arbitrary spatial shapes into a parallelepiped of minimal height. The polytopes are oriented, rotation is not permitted. A mathematical model of the problem is developed and some of its peculiarities are analyzed. Due to these peculiarities a solution method is proposed which is based on a meta-heuristic to find some approximation of a global minimum solution. Within the solution process a sequence of local minima is computed. Some examples and computational results are also given.

PDF,

Back