Constructive Heuristics for Solving the Three-Dimensional Cutting-Packing Problem

The tasks of rational cutting-packaging have long attracted the attention of researchers and practitioners in various industries. They are classified as NP-complete problems. In this paper, three-dimensional orthogonal cutting-packing is considered as the main one. The mathematical model is given. The paper presents a heuristic algorithm. The features of the method are the direct solution of the problem, and not its reduction to problems of a smaller dimension; the use of layered strategies; filling in the so-called priority axes; analysis of voids and consideration of ways to combine them; use of several parallelepipeds. The performed computational experiments confirm the effectiveness of the proposed method.