2019
DOI: 10.1016/j.eswa.2018.10.006
|View full text |Cite
|
Sign up to set email alerts
|

Data mining based framework to assess solution quality for the rectangular 2D strip-packing problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 46 publications
0
7
0
Order By: Relevance
“…In problem characterization (Step 3), the independent variables are predictors based on variations of problem characteristics. A total of 19 predictors (Table 1) were developed by (Neuenfeldt et al, 2019) for the 2D-SPP, based on information collected from cutting and packing problems generators and with an observation of literature instances. Variations in the rectangles and the strip dimensions, in addition to intrinsic instances information, were used to develop the 19 predictors (Neuenfeldt et al, 2017).…”
Section: Fig 1 Methodological Frameworkmentioning
confidence: 99%
See 2 more Smart Citations
“…In problem characterization (Step 3), the independent variables are predictors based on variations of problem characteristics. A total of 19 predictors (Table 1) were developed by (Neuenfeldt et al, 2019) for the 2D-SPP, based on information collected from cutting and packing problems generators and with an observation of literature instances. Variations in the rectangles and the strip dimensions, in addition to intrinsic instances information, were used to develop the 19 predictors (Neuenfeldt et al, 2017).…”
Section: Fig 1 Methodological Frameworkmentioning
confidence: 99%
“…Table 1 Predictors' definition. Source: (Neuenfeldt et al, 2019;Neuenfeldt et al, 2017) Predictor Definition areacomp…”
Section: Fig 1 Methodological Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, 36 instances were selected from bwmv [ 35 ], C [ 36 ], cgcut [ 37 ], gcut [ 38 ], ngcut [ 39 ], path [ 34 ], and pt [ 40 ]. The characteristics and corresponding scenarios of each instance are detailed in Table B.1, located in S2 Appendix .…”
Section: Computational Experimentsmentioning
confidence: 99%
“…Both ar pi and ht pi are characterization variables based on complex characteristics used to verify how a single problem instance can be diverse in the rectangles and strip geometries, which is easily used to define its level of complexity, especially when reasonable amounts of empty spaces are allowed in the optimal packing layout. Thus, scenarios are established with the four characterization variables’ average values, using as a reference 790 benchmark problem instances with a maximum of 50 rectangles and W pi ≤ 500 mm from the scientific literature datasets C [ 38 ], N [ 7 ], cx [ 39 ], gcut [ 40 ], cgcut [ 41 ], ngcut [ 42 ], bwmv [ 43 , 44 ], beng [ 45 ], nice/path [ 37 ], and pt [ 46 ]. Therefore, the mean characterization variables values used as a reference for the scenarios are ht pi = 20, W pi = 200 mm , ht pi = 0.6, and ar pi = 1.0.…”
Section: Comparisonmentioning
confidence: 99%