Heuristics for the variable sized bin-packing problem
dc.contributor.author | Haouari, Mohamed | |
dc.contributor.author | Serairi, M. | |
dc.date.accessioned | 2012-05-31T10:29:38Z | |
dc.date.available | 2012-05-31T10:29:38Z | |
dc.date.issued | 2009-10 | |
dc.identifier.issn | 0305-0548 | |
dc.identifier.uri | http://hdl.handle.net/10679/189 | |
dc.identifier.uri | http://www.sciencedirect.com/science/article/pii/S0305054808002748 | |
dc.description | Due to copyright restrictions, the access to the full text of this article is only available via subscription. | |
dc.description.abstract | We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this problem are presented and compared. We analyze their empirical performance on a large set of randomly generated test instances with up to 2000 items and seven bin types. The first contribution of this paper is to provide evidence that a set covering heuristic proves to be highly effective and capable of delivering very-high quality solutions within short CPU times. In addition, we found that a simple subset-sum problem-based heuristic consistently outperforms heuristics from the literature while requir- ing extremely short CPU times. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | Computers & Operations Research | |
dc.rights | restrictedAccess | |
dc.title | Heuristics for the variable sized bin-packing problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0003-0767-8220 & YÖK ID ) Haouari, Mohamed | |
dc.contributor.ozuauthor | Haouari, Mohamed | |
dc.identifier.volume | 36 | |
dc.identifier.issue | 10 | |
dc.identifier.startpage | 2877 | |
dc.identifier.endpage | 2884 | |
dc.identifier.wos | WOS:000265369200020 | |
dc.identifier.doi | 10.1016/j.cor.2008.12.016 | |
dc.subject.keywords | Bin-packing problem | en_US |
dc.subject.keywords | Heuristics | en_US |
dc.subject.keywords | Genetic algorithm | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-62549163791 | |
dc.contributor.authorMale | 1 | |
dc.relation.publicationcategory | Article - International Refereed Journal - Institutional Academic Staff |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
Share this page