Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/11316
Title: Data mining based framework to assess solution quality for the rectangular 2D strip-packing problem
Authors: Alvaro Luiz Júnior
José Fernando Oliveira
Carlos Manuel Soares
António Miguel Gomes
Elsa Marília Silva
Issue Date: 2019
Abstract: In this paper, we explore the use of reference values (predictors) for the optimal objective function value of hard combinatorial optimization problems, instead of bounds, obtained by data mining techniques, and that may be used to assess the quality of heuristic solutions for the problem. With this purpose, we resort to the rectangular two-dimensional strip-packing problem (2D-SPP), which can be found in many industrial contexts. Mostly this problem is solved by heuristic methods, which provide good solutions. However, heuristic approaches do not guarantee optimality, and lower bounds are generally used to give information on the solution quality, in particular, the area lower bound. But this bound has a severe accuracy problem. Therefore, we propose a data mining-based framework capable of assessing the quality of heuristic solutions for the 2D-SPP. A regression model was fitted by comparing the strip height solutions obtained with the bottom-left-fill heuristic and 19 predictors provided by problem characteristics. Random forest was selected as the data mining technique with the best level of generalisation for the problem, and 30,000 problem instances were generated to represent different 2D-SPP variations found in real-world applications. Height predictions for new problem instances can be found in the regression model fitted. In the computational experimentation, we demonstrate that the data mining-based framework proposed is consistent, opening the doors for its application to finding predictions for other combinatorial optimisation problems, in particular, other cutting and packing problems. However, how to use a reference value instead of a bound, has still a large room for discussion and innovative ideas. Some directions for the use of reference values as a stopping criterion in search algorithms are also provided. © 2018 Elsevier Ltd
URI: http://repositorio.inesctec.pt/handle/123456789/11316
http://dx.doi.org/10.1016/j.eswa.2018.10.006
metadata.dc.type: Publication
article
Appears in Collections:CEGI - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00P-RAK.pdf2.18 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.