Data set generation for rectangular placement problems

Data set generation for rectangular placement problems

0.00 Avg rating0 Votes
Article ID: iaor20021750
Country: Netherlands
Volume: 134
Issue: 2
Start Page Number: 378
End Page Number: 391
Publication Date: Oct 2001
Journal: European Journal of Operational Research
Authors: ,
Abstract:

This paper describes a recursive process for generating data sets of rigid rectangles that can be placed into rectangular regions with zero waste. The generation procedure can be modified to guarantee that the aspect and area ratios of the rectangles in the generated data sets satisfy user-specified parameters. This recursive process can thus be employed to create a variety of data sets that can be used to evaluate the efficiency and scalability of rectangular cutting and packing algorithms.

Reviews

Required fields are marked *. Your email address will not be published.