Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Understanding the structure of bin packing problems through principal component analysis
Author(s): Lopez-Camacho, Eunice
Terashima-Marin, Hugo
Ochoa, Gabriela
Conant-Pablos, Santiago Enrique
Contact Email:
Keywords: Heuristics
Bin packing problem
Principal component analysis
Algorithm selection
Knowledge discovery
Issue Date: Oct-2013
Date Deposited: 13-Jan-2014
Citation: Lopez-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.
Abstract: This 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.
DOI Link: 10.1016/j.ijpe.2013.04.041
Rights: The 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.
Licence URL(s):

Files in This Item:
File Description SizeFormat 
1-s2.0-S0925527313002053-main.pdfFulltext - Published Version1.39 MBAdobe PDFUnder Embargo until 3000-01-01    Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.

This item is protected by original copyright

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

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

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