Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
computer science
Heuristics for the variable sized bin-packing problem
Computers and Operations Research, Volume 36, No. 10, Year 2009
Notification
URL copied to clipboard!
Description
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 requiring extremely short CPU times. © 2009 Elsevier Ltd. All rights reserved.
Authors & Co-Authors
Haouari, Mohamed
Turkey, Istanbul
Özyeğin Üniversitesi
Tunisia, La Marsa
University of Carthage, Ecole Polytechnique de Tunisie
Serairi, Mehdi
Tunisia, La Marsa
University of Carthage, Ecole Polytechnique de Tunisie
Statistics
Citations: 98
Authors: 2
Affiliations: 2
Identifiers
Doi:
10.1016/j.cor.2008.12.016
ISSN:
03050548