نویسنده
Haouari, Mohamed, Serairi, M.
تاریخ انتشار
2009-10
محل انتشار
-
Elsevier
موضوع
Bin-packing problem, Heuristics, Genetic algorithm
نوع
دوره ای
زبان
انگلیسی
دیجیتال
بله
نسخه خطی
خیر
کتابخانه
دانشگاه اوزیغین
شناسه دارایی کتابخانه
0305-0548
شماره ثبت
e0123aec-57c6-4be3-9cc7-1dd5490f3db6
محل کتابخانه
Industrial Engineering
تاریخ
2009-10
یادداشتها
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
متن نمونه
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.
DOI
10.1016/j.cor.2008.12.016
Cilt
36
