کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477513 | 1446166 | 2008 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Replenishment routing problems between a single supplier and multiple retailers with direct delivery
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Replenishment routing problems between a single supplier and multiple retailers with direct delivery Replenishment routing problems between a single supplier and multiple retailers with direct delivery](/preview/png/477513.png)
چکیده انگلیسی
We consider the replenishment routing problems of one supplier who can replenish only one of multiple retailers per period, while different retailers need different periodical replenishment. For simple cases satisfying certain conditions, we obtain the simple routing by which the supplier can replenish each retailer periodically so that shortage will not occur. For complicated cases, using number theory, especially the Chinese remainder theorem, we present an algorithm to calculate a feasible routing so that the supplier can replenish the selected retailers on the selected periods without shortages.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 190, Issue 2, 16 October 2008, Pages 412–420
Journal: European Journal of Operational Research - Volume 190, Issue 2, 16 October 2008, Pages 412–420
نویسندگان
Jing-An Li, Yue Wu, Kin Keung Lai, Ke Liu,