Adaptive algorithms for circular cutting/packing problems (Q1040631)

Summary: The Circular Cutting (CC)/packing problem is studied. Its objective is to cut/pack a set of circular pieces into a rectangular plate \(R\) of dimensions \(L\times W\). Each piece's type \(i, i = 1, \dots,m,\) is characterised by its radius \(r_{i}\) and its demand \(b_{i}\). This problem is solved using an adaptive algorithm that combines Beam Search (BS) and various hill-climbing strategies. Decisions at each node of the truncated tree are based on the so-called best local position using a Minimum Local-Distance Position (MLDP) rule. The computational results show, on a set of problem instances of the literature, the effectiveness of the proposed algorithm.