کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4946505 | 1439290 | 2016 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A novel locust swarm algorithm for the joint replenishment problem considering multiple discounts simultaneously
ترجمه فارسی عنوان
یک الگوریتم جدید زاد و ولد برای مشکل دوباره پرورش مشترک با توجه به تخفیف های متعدد به طور همزمان
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
چکیده انگلیسی
In B2C E-Commerce operations, multiple quantity discount offers are commonly practiced in the multi-item replenishment environment. In this paper, a novel joint replenishment model (JRP) is presented considering two quantity discounts, all-unit quantity discount, incremental quantity discount, simultaneously. A novel swarms search technique, locust swarms algorithm (LS) is introduced and redesigned to solve the novel formulated JRP model. Numerical experiments and parameter sensitivity analyses reveal that LS is an effective and efficient algorithm for solving the proposed model in terms of solution quality and searching stableness comparing to some other meta-heuristic algorithms, such as GA, DE and PSO. Moreover, management insights such as the mutual effects of multiple quantity discounts to the total cost, and the role of multiple quantity discounts to different stakeholders in replenishment are outlined.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Knowledge-Based Systems - Volume 111, 1 November 2016, Pages 51-62
Journal: Knowledge-Based Systems - Volume 111, 1 November 2016, Pages 51-62
نویسندگان
Ligang Cui, Jie Deng, Lin Wang, Maozeng Xu, Yajun Zhang,