A novel locust swarm algorithm for the joint replenishment problem considering multiple discounts simultaneously
详细信息 查看全文
- 作者：Ligang Cuia ; cuiligangdj@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Jie Deng ; b ; mabelduo@hotmail.com" class="auth_mail" title="E-mail the corresponding author ; Lin Wang ; c ; wanglin982@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Maozeng Xua ; xmzzrxhy@cqjtu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Yajun Zhangc ; zhangyajun99@163.com" class="auth_mail" title="E-mail the corresponding author
- 关键词：joint replenishment ; quantity discount ; PSO ; locust swarms
- 刊名：Knowledge-Based Systems
- 出版年：2016
- 出版时间：1 November 2016
- 年：2016
- 卷：111
- 期：Complete
- 页码：51-62
- 全文大小：1062 K
文摘
- class="listitem" id="list_celist0009">
- class="label">•
A new JRP model is constructed considering two types of discounts simultaneously.
- class="label">•
A novel locust swarm algorithm is introduced and redesigned to solve the model.
- class="label">•
Different-scaled numerical experiments demonstrate the superiorities of LS.
- class="label">•
Management insights are obtained through revealing the joint effects of multi-discount to JRP decisions.