کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5080558 | 1477574 | 2013 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The optimization of mixed block stacking requiring relocations
ترجمه فارسی عنوان
بهینه سازی جمع کردن بلوک مخلوط که نیاز به جابجایی دارد
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
نقل مکانها، محل ذخیره سازی، الگوریتم ژنتیک، سیستم انباشته بلوک،
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
چکیده انگلیسی
This paper addresses the optimization of a block stacking storage system (BSSS) in which unit loads are stored vertically. One of the important problems in a BSSS is in the relocation required when unit loads are located on top of the next unit load to be picked. Relocations are bound to occur when multiple types of unit loads are mixed in the same stacking area. Relocation is a major source of inefficiency during a BSSS handling operation. This study shows how the number of relocations can be reduced by utilizing the information regarding the arriving unit load type when determining its storage location. For the case where the information is not available, statistical models have been developed that estimate the expected number of relocations. For the case where the information is available and utilized, a method based on a genetic algorithm is suggested for use in determining the storage location for each arriving unit load in such a way that minimizes the expected number of relocations. A discussion is presented regarding how to determine the optimal number of stacks allocated to a set of unit load types which will share the same storage area considering the expected number of relocations.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 143, Issue 2, June 2013, Pages 256-262
Journal: International Journal of Production Economics - Volume 143, Issue 2, June 2013, Pages 256-262
نویسندگان
Dong-Won Jang, Se Won Kim, Kap Hwan Kim,