کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
473945 698825 2009 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Heuristics for the variable sized bin-packing problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Heuristics for the variable sized bin-packing problem
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 10, October 2009, Pages 2877–2884
نویسندگان
, ,