The region filled algorithm for the circles cutting stock problem

摘要

Pointing to the circles cutting stock problem, this paper proposes the region filled algorithm, which syncretizes the idea of subsection layout, interlace arrangement algorithm and filling algorithm. The main idea of the region filled algorithm is to continuously divide the stock into two sections by a local optimal principle, then allocate the left parts by the way of interlace arrangement and fill the blank area until the stock has been lined with. The experimental results show that the region filled algorithm not only allocates the circles more regulation, but also can get a more satisfied layout result.