کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892769 | 699174 | 2016 | 38 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A joint replenishment problem considering multiple trucks with shipment and resource constraints
ترجمه فارسی عنوان
یک مشکل مجدد مشترک با توجه به کامیون های متعدد با محدودیت های حمل و نقل و منابع
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
دوباره پر کردن مشترک، الگوریتم ژنتیک، محدودیت حمل و نقل، کامیون های چندگانه،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
A joint replenishment problem (JRP) is presented to determine the optimal reordering policy for multi-items with a percentage of defective items. This JRP also has several constraints, such as shipment constraint, budget constraint, and transportation capacity constraint. At the meantime, multiple trucks, each with a fixed transportation cost, are considered and also order quantities of restricted items are not shared among the trucks during the shipment. The objective is to minimize the total expected cost per unit time. A two-dimensional genetic algorithm (GA) is provided to determine an optimal family cycle length and the reorder frequencies. A numerical example is presented and the results are discussed. Extensive computational experiments are performed to test the performance of the GA. The JRP is also solved by using an evolutionary algorithm (EA) and the results obtained from GA and EA are compared.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 74, October 2016, Pages 53-63
Journal: Computers & Operations Research - Volume 74, October 2016, Pages 53-63
نویسندگان
Y. Chen, M.I.M. Wahab, P. Ongkunaruk,