Volume 24, Issue 1 (IJIEPR 2013)                   IJIEPR 2013, 24(1): 47-58 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Bashiri M, Rezaei H. Reconfiguration of Supply Chain: A Two Stage Stochastic Programming. IJIEPR 2013; 24 (1) :47-58
URL: http://ijiepr.iust.ac.ir/article-1-395-en.html
1- Shahed University , bashiri.m@gmail.com
2- Shahed University
Abstract:   (8359 Views)
In this paper, we propose an extended relocation model for warehouses configuration in a supply chain network, in which uncertainty is associated to operational costs, production capacity and demands whereas, existing researches in this area are often restricted to deterministic environments. In real cases, we usually deal with stochastic parameters and this point justifies why the relocation model under uncertainty should be evaluated. Albeit the random parameters can be replaced by their expectations for solving the problem, but sometimes, some methodologies such as two-stage stochastic programming works more capable. Thus, in this paper, for implementation of two stage stochastic approach, the sample average approximation (SAA) technique is integrated with the Bender's decomposition approach to improve the proposed model results. Moreover, this approach leads to approximate the fitted objective function of the problem comparison with the real stochastic problem especially for numerous scenarios. The proposed approach has been evaluated by two hypothetical numerical examples and the results show that the proposed approach can find better strategic solution in an uncertain environment comparing to the mean-value procedure (MVP) during the time horizon.
Full-Text [PDF 758 kb]   (3698 Downloads)    
Type of Study: Research | Subject: Logistic & Apply Chain
Received: 2012/01/28 | Accepted: 2014/07/21 | Published: 2014/07/21

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.