2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems

• A general problem generator for all two-dimensional rectangular cutting problems is described and made available.
• A full characterization of every problem, in terms of input data, is given.
• Instances’ properties are controlled by a beta probability distribution, reflecting real-world characteristics.

Cutting and packing problems have been extensively studied in the literature in recent decades, mainly due to their numerous real-world applications while at the same time exhibiting intrinsic computational complexity. However, a major limitation has been the lack of problem generators that can be widely and commonly used by all researchers in their computational experiments. In this paper, a problem generator for every type of two-dimensional rectangular cutting and packing problems is proposed. The problems are defined according to the recent typology for cutting and packing problems proposed by Wäscher, Haußner, and Schumann (2007) and the relevant problem parameters are identified. The proposed problem generator can significantly contribute to the quality of the computational experiments run with cutting and packing problems and therefore will help improve the quality of the papers published in this field.