A novel locust swarm algorithm for the joint replenishment problem considering multiple discounts simultaneously

作者：

Highlights：

• A new JRP model is constructed considering two types of discounts simultaneously.

• A novel locust swarm algorithm is introduced and redesigned to solve the model.

• Different-scaled numerical experiments demonstrate the superiorities of LS.

• Management insights are obtained through revealing the joint effects of multi-discount to JRP decisions.

摘要

•A new JRP model is constructed considering two types of discounts simultaneously.•A novel locust swarm algorithm is introduced and redesigned to solve the model.•Different-scaled numerical experiments demonstrate the superiorities of LS.•Management insights are obtained through revealing the joint effects of multi-discount to JRP decisions.

论文关键词：joint replenishment,quantity discount,PSO,locust swarms

论文评审过程：Received 10 December 2015, Revised 27 July 2016, Accepted 5 August 2016, Available online 17 August 2016, Version of Record 23 September 2016.

论文官网地址：https://doi.org/10.1016/j.knosys.2016.08.007