کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10523102 | 956124 | 2005 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An evolutionary algorithm to solve the joint replenishment problem using direct grouping
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An evolutionary algorithm to solve the joint replenishment problem using direct grouping An evolutionary algorithm to solve the joint replenishment problem using direct grouping](/preview/png/10523102.png)
چکیده انگلیسی
There has been much work in establishing a joint replenishment policy to minimize the total cost of inventory replenishment. Most of this work uses the indirect grouping method. Little research has been done with direct grouping methods. In this paper we develop an evolutionary algorithm (EA) that uses direct grouping to solve the joint replenishment problem (JRP). We test the EA and compare these results with results with the best available algorithm. The EA is shown to find a replenishment policy that incurs a lower total cost than the best available algorithm for some problem parameters.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 48, Issue 2, March 2005, Pages 223-235
Journal: Computers & Industrial Engineering - Volume 48, Issue 2, March 2005, Pages 223-235
نویسندگان
Anne L. Olsen,