An Optimizing Nesting Algorithm with Heuristic Search Based on Binary Trees

This paper proposes an optimizing nesting algorithm with heuristic search, which expresses the nesting process of rectangular blocks by building binary trees. With the combination rule and adjacency rule being applied, the algorithmic complexity can be decreased rapidly and nesting solutions can also be improved greatly to satisfy industrial demands.