کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347438 | 699224 | 2013 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An effective shaking procedure for 2D and 3D strip packing problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Strip packing intends to minimise the height required for placing a set of rectangular items into a strip with infinite height. The present paper introduces a fast, yet effective shaking algorithm for the two- and three-dimensional strip packing problems, which are both NP-hard. The proposed heuristic procedure starts from an ordered item list, from which it alternates between forward and backward construction phases. The algorithm builds upon the common (deepest) bottom-left-fill algorithm, but shows significantly better results. Improvements on the solution quality of more than 9% can be observed. Moreover, applying the shaking procedure as a post processing algorithm to existing high performance heuristics also leads to improvements.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 11, November 2013, Pages 2662-2669
Journal: Computers & Operations Research - Volume 40, Issue 11, November 2013, Pages 2662-2669
نویسندگان
Tony Wauters, Jannes Verstichel, Greet Vanden Berghe,