In this paper we present a new constructive algorithm for nesting problems. The layout is built by successively adding a new piece to a partial solution, i.e. to the set of pieces previously nested. Several criteria to choose the next piece to place and its orientation are proposed and tested....

The paper presents a heuristic for multiple container loading problems. The method is suited for three-dimensional bin packing problems and for three-dimensional knapsack problems as well. In order to select containers to be loaded and boxes to be packed into a chosen container in an appropriate...