کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476004 699407 2008 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving the one-dimensional bin packing problem with a weight annealing heuristic
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Solving the one-dimensional bin packing problem with a weight annealing heuristic
چکیده انگلیسی

In this paper, we develop a new procedure that uses the concept of weight annealing to solve the one-dimensional bin packing problem. Our procedure is straightforward and easy to follow. We apply it to 1587 instances taken from benchmark problem sets and compare our results to those found in the literature. We find that our procedure produces very high-quality solutions very quickly and generates several new optimal solutions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 35, Issue 7, July 2008, Pages 2283–2291
نویسندگان
, , ,