کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10346557 698798 2011 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Efficient lower bounds and heuristics for the variable cost and size bin packing problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Efficient lower bounds and heuristics for the variable cost and size bin packing problem
چکیده انگلیسی
We consider the variable cost and size bin packing problem, a generalization of the well-known bin packing problem, where a set of items must be packed into a set of heterogeneous bins characterized by possibly different volumes and fixed selection costs. The objective of the problem is to select bins to pack all items at minimum total bin-selection cost. The paper introduces lower bounds and heuristics for the problem, the latter integrating lower and upper bound techniques. Extensive numerical tests conducted on instances with up to 1000 items show the effectiveness of these methods in terms of computational effort and solution quality. We also provide a systematic numerical analysis of the impact on solution quality of the bin selection costs and the correlations between these and the bin volumes. The results show that these correlations matter and that solution methods that are un-biased toward particular correlation values perform better.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 11, November 2011, Pages 1474-1482
نویسندگان
, , , ,