Supply chain design under uncertainty using sample average approximation and dual decomposition
We present a supply chain design problem modeled as a sequence of splitting and combining processes. We formulate the problem as a two-stage stochastic program. The first-stage decisions are strategic location decisions, whereas the second stage consists of operational decisions. The objective is to minimize the sum of investment costs and expected costs of operating the supply chain. In particular the model emphasizes the importance of operational flexibility when making strategic decisions. For that reason short-term uncertainty is considered as well as long-term uncertainty. The real-world case used to illustrate the model is from the Norwegian meat industry. We solve the problem by sample average approximation in combination with dual decomposition. Computational results are presented for different sample sizes and different levels of data aggregation in the second stage.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
- A. M. Geoffrion & G. W. Graves, 1974. "Multicommodity Distribution System Design by Benders Decomposition," Management Science, INFORMS, vol. 20(5), pages 822-844, January.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:199:y:2009:i:2:p:409-419. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.