A Cooperative Algorithm for Constrained Two-staged 2D Cutting Problems

In this paper, we propose a cooperative solution procedure for the two-staged two-dimensional cutting stock problem (2TDC). We solve 2TDC by considering two key features: a search strategy and a fast filling procedure. The search strategy uses a beam-search method and the second strategy uses a local filling procedure for improving the quality of the obtained solutions