https://opendata.uni-kiel.de/receive/fdr_mods_00000263 https://opendata.uni-kiel.de/servlets/MCRFileNodeServlet/fdr_derivate_00000267/rectpacking-evaluation.zip https://opendata.uni-kiel.de/rsc/thumbnail/fdr_mods_00000263.png 2025-08-01 database mixed material Rectangle Packing Evaluation of the Region Packing Problem The data set contains three classes of packing problems. The first class contains only rectangles of the same height. The second class only rectangles of the same height with one very big rectangle and the third class contains two to five big rectangles. The resulting packing was evaluated using a simple heuristic, a novel rectangle packing algorithm "rectpacking", and the optimal solution calculated using a constraint solver. The data was analyzed regarding width, height, area, aspect ratio, and scale measure of the resulting packing. 10.57892/100-263 en 000 his Host institution 2023-07-07 2023-08-14 Kiel 10.122603322264936 54.33882704113168 The dataset consist of three classes with 200 packing problems each in '.elkt' format. Additionally, I included generation files '.elkr' for these classes as well as '.grana' evaluation files to create the data using the KIELER SCCharts tool. The results are in CSV files containing the results of running the algorithms. The CSV files contain the following evaluation data: - File: The name/number of the packing problem - Area (Width): The width - Area (Height): The height - Area (Product): The area - Aspect Ratio - Whitespace (Top-Level) - Whitespace (Hierarchy): Same as top-level - Scale Measure (Linear): Desired aspect ratio - Scale Measure (Scale Measure): The scale measure I evaluated the following strategies using these datasets: - diss_eval_R: Rectpacking heuristic - diss_eval_R2: Rectpacking heuristic with 2 iterations for compaction - diss_eval_RB: Rectpacking heuristic with trying box algorithm first - diss_eval_RR: Rectpacking heuristic with row height reevalation - diss_eval_RX: All optimization together with as many compaction iterations as an improvement can be made (10 is enough). - rectpacking_cplex: Results of the optimization problem capped at 1 hour execution time Additionally, sccharts-packings.zip holds the same evaluation for rectangle packing problems posed by SCCharts models (which cannot be included in this dataset). Here, the following strategies were evaluated: - box-new: The simple heuristic, the box algorithm - cplex-new: Again uses cplex to solve the packing as a optimization problem - rectpacking: Using the rectpacking heuristic - rectpacking-2: Rectpacking heuristic with 2 iterations for compaction - rectpacking-box: Rectpacking heuristic with trying box algorithm first - rectpacking-rowHeight: Rectpacking heuristic with row height reevalation - rectpacking-X: All optimization together with as many compaction iterations as an improvement can be made (10 is enough). - ".grana" file to evaluated the data using the KIELER SCCharts tool aut Author Domrös, Sören Domrös Sören 1201693225 570157704198344440006 0000-0002-8011-8484 Graphenzeichnen Rectangle Packing fdr_mods_00000263 https://opendata.uni-kiel.de/receive/fdr_mods_00000263