Abstract
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 Co place and its orientation are proposed and tested. Different objective functions are also proposed to evaluate and compare partial solutions. A total of 126 variants of the algorithm, generated by the complete set of combinations of criteria and objective functions, are computationally tested. The computational experiments are based on data sets published in the literature or provided by other authors. In some cases this new algorithm generates better solutions than the best known (published) solutions.