Multiple order-up-to policy for mitigating bullwhip effect in supply chain network
- Publisher:
- Springer Verlag
- Publication Type:
- Journal Article
- Citation:
- Annals of Operations Research, 2018, 269, (1-2), pp. 361-386
- Issue Date:
- 2018
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| s10479-017-2527-y.pdf | Published version | 1.68 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017 Springer Science+Business Media New YorkThis paper proposes a multiple order-up-to policy based inventory replenishment scheme to mitigate the bullwhip effect in a multi-stage supply chain scenario, where various transportation modes are available between the supply chain (SC) participants. The proposed policy is similar to the fixed order-up-to policy approach where replenishment decision ¿how much to order¿ is made periodically on the basis of the pre-decided order-up-to inventory level. In the proposed policy, optimal multiple order-up-to levels are assigned to each SC participants, which provides decision making reference point for deciding the transportation related order quantity. Subsequently, a mathematical model is established to define optimal multiple order-up-to levels for each SC participants that aims to maximize overall profit from the SC network. In parallel, the model ensures the control over supply chain pipeline inventory, high satisfaction of customer demand and enables timely utilization of available transportation modes. Findings from the various numerical datasets including stochastic customer demand and lead times validate that¿the proposed optimal multiple order-up-to policy based inventory replenishment scheme can be a viable alternative for mitigating the bullwhip effect and well-coordinated SC. Moreover, determining the multiple order-up-to levels is a NP hard combinatorial optimization problem. It is found that the implementation of new emerging optimization algorithm named bacterial foraging algorithm (BFA) has presented superior optimization performances. The robustness and applicability of the BFA algorithm are further validated statistically by employing the percentage heuristic gap and two-way ANOVA analysis.
Please use this identifier to cite or link to this item: