Research on Two-dimensional Cutting Problem with Defects

The packing problem is an optimization problem often encountered in industrial production. It plays a vital role in improving work efficiency, reducing waste, increasing revenue, and promoting industrial automation. This paper studies the sub-problem of the packing problem -the two-dimensional cutting problem with defects. Based on the priority heuristic algorithm, we propose the CIP algorithm and the CATS algorithm for the processing of defects. The CIP algorithm adopts the defect collision processing strategy, and the CATS algorithm adopts the strategy of removing defects in advance. The experimental results of the two algorithms have their own advantages. But overall, the CIP algorithm performs better in most cases, and is much simpler from a data structure perspective. Our research results are of great value in practical applications.