کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481409 | 1446169 | 2008 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch and bound algorithm for class based storage location assignment
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A branch and bound algorithm for class based storage location assignment A branch and bound algorithm for class based storage location assignment](/preview/png/481409.png)
چکیده انگلیسی
Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 189, Issue 2, 1 September 2008, Pages 492–507
Journal: European Journal of Operational Research - Volume 189, Issue 2, 1 September 2008, Pages 492–507
نویسندگان
Venkata Reddy Muppani (Muppant), Gajendra Kumar Adil,