Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/18264
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLopez-Camacho, Eunice-
dc.contributor.authorTerashima-Marin, Hugo-
dc.contributor.authorOchoa, Gabriela-
dc.contributor.authorConant-Pablos, Santiago Enrique-
dc.date.accessioned2014-10-31T23:50:55Z-
dc.date.issued2013-10-
dc.identifier.urihttp://hdl.handle.net/1893/18264-
dc.description.abstractThis paper uses a knowledge discovery method, Principal Component Analysis (PCA), to gain a deeper understanding of the structure of bin packing problems and how this relates to the performance of heuristic approaches to solve them. The study considers six heuristics and their combination through an evolutionary hyper-heuristic framework. A wide set of problem instances is considered, including one-dimensional and two-dimensional regular and irregular problems. A number of problem features are considered, which are reduced to the subset of nine features that more strongly relate with heuristic performance. PCA is used to further reduce the dimensionality of the instance features and produce 2D maps. The performance of the heuristics and hyper-heuristics is then super-imposed into these maps to visually reveal relationships between problem features and heuristic behavior. Our analysis indicates that some instances are clearly harder to solve than others for all the studied heuristics and hyper-heuristics. The PCA maps give a valuable indication of the combination of features characterizing easy and hard to solve instances. We found indeed correlations between instance features and heuristic performance. The so-called DJD heuristics are able to best solve a large proportion of instances, but simpler and faster heuristics can outperform them in some cases. In particular when solving 1D instances with low number of pieces, and, more surprisingly, when solving some difficult 2D instances with small areas with low variability. This analysis can be generalized to other problem domains where a set of features characterize instances and several problem solving heuristics are available.en_UK
dc.language.isoen-
dc.publisherElsevier-
dc.relationLopez-Camacho E, Terashima-Marin H, Ochoa G & Conant-Pablos SE (2013) Understanding the structure of bin packing problems through principal component analysis, International Journal of Production Economics, 145 (2), pp. 488-499.-
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.-
dc.subjectHeuristicsen_UK
dc.subjectHyper-heuristicsen_UK
dc.subjectBin packing problemen_UK
dc.subjectPrincipal component analysisen_UK
dc.subjectAlgorithm selectionen_UK
dc.subjectKnowledge discoveryen_UK
dc.titleUnderstanding the structure of bin packing problems through principal component analysisen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2999-12-31T00:00:00Z-
dc.rights.embargoreasonThe publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.-
dc.identifier.doihttp://dx.doi.org/10.1016/j.ijpe.2013.04.041-
dc.citation.jtitleInternational Journal of Production Economics-
dc.citation.issn0925-5273-
dc.citation.volume145-
dc.citation.issue2-
dc.citation.spage488-
dc.citation.epage499-
dc.citation.publicationstatusPublished-
dc.citation.peerreviewedRefereed-
dc.type.statusPublisher version (final published refereed version)-
dc.author.emailgabriela.ochoa@stir.ac.uk-
dc.contributor.affiliationMonterrey Institute of Technology and Higher Education (Tecnológico de Monterrey)-
dc.contributor.affiliationMonterrey Institute of Technology and Higher Education (Tecnológico de Monterrey)-
dc.contributor.affiliationComputing Science - CSM Dept-
dc.contributor.affiliationMonterrey Institute of Technology and Higher Education (Tecnológico de Monterrey)-
dc.rights.embargoterms2999-12-31-
dc.rights.embargoliftdate2999-12-31-
dc.identifier.isi000324844300005-
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
1-s2.0-S0925527313002053-main.pdf1.39 MBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



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

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.