کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6893144 | 699353 | 2013 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems](/preview/png/6893144.png)
چکیده انگلیسی
The three-dimensional multiple bin-size bin packing problem, MBSBPP, is the problem of packing a set of boxes into a set of bins when several types of bins of different sizes and costs are available and the objective is to minimize the total cost of bins used for packing the boxes. First we propose a GRASP algorithm, including a constructive procedure, a postprocessing phase and some improvement moves. The best solutions obtained are then combined into a Path Relinking procedure for which we have developed three versions: static, dynamic and evolutionary. An extensive computational study, using two- and three-dimensional instances, shows the relative efficiency of the alternatives considered for each phase of the algorithm and the good performance of our algorithm compared with previously reported results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 12, December 2013, Pages 3081-3090
Journal: Computers & Operations Research - Volume 40, Issue 12, December 2013, Pages 3081-3090
نویسندگان
R. Alvarez-Valdes, F. Parreño, J.M. Tamarit,