A two-stage stochastic programming method for designing multi-stage global supply chains with stochastic demand

2010 ◽  
Vol 9 (4) ◽  
pp. 409 ◽  
Author(s):  
Behnaz Saboonchi ◽  
Guoqing Zhang
2018 ◽  
Vol 28 (3) ◽  
pp. 1107-1124 ◽  
Author(s):  
Tooraj Khosrojerdi ◽  
Seyed Hamed Moosavirad ◽  
Shahram Ariafar ◽  
Mahnaz Ghaeini-Hessaroeyeh

Omega ◽  
2019 ◽  
Vol 83 ◽  
pp. 123-138 ◽  
Author(s):  
Christoph Weskamp ◽  
Achim Koberstein ◽  
Frank Schwartz ◽  
Leena Suhl ◽  
Stefan Voß

Author(s):  
R. Dhanalakshmi ◽  
P. Parthiban ◽  
K. Ganesh ◽  
T. Arunkumar

In many multi-stage manufacturing supply chains, transportation related costs are a significant portion of final product costs. It is often crucial for successful decision making approaches in multi-stage manufacturing supply chains to explicitly account for non-linear transportation costs. In this article, we have explored this problem by considering a Two-Stage Production-Transportation (TSPT). A two-stage supply chain that faces a deterministic stream of external demands for a single product is considered. A finite supply of raw materials, and finite production at stage one has been assumed. Items are manufactured at stage one and transported to stage two, where the storage capacity of the warehouses is limited. Packaging is completed at stage two (that is, value is added to each item, but no new items are created), and the finished goods inventories are stored which is used to meet the final demand of customers. During each period, the optimized production levels in stage one, as well as transportation levels between stage one and stage two and routing structure from the production plant to warehouses and then to customers, must be determined. The authors consider “different cost structures,” for both manufacturing and transportation. This TSPT model with capacity constraint at both stages is optimized using Genetic Algorithms (GA) and the results obtained are compared with the results of other optimization techniques of complete enumeration, LINDO, and CPLEX.


Author(s):  
R. Dhanalakshmi ◽  
P. Parthiban ◽  
K. Ganesh ◽  
T. Arunkumar

In many multi-stage manufacturing supply chains, transportation related costs are a significant portion of final product costs. It is often crucial for successful decision making approaches in multi-stage manufacturing supply chains to explicitly account for non-linear transportation costs. In this article, we have explored this problem by considering a Two-Stage Production-Transportation (TSPT). A two-stage supply chain that faces a deterministic stream of external demands for a single product is considered. A finite supply of raw materials, and finite production at stage one has been assumed. Items are manufactured at stage one and transported to stage two, where the storage capacity of the warehouses is limited. Packaging is completed at stage two (that is, value is added to each item, but no new items are created), and the finished goods inventories are stored which is used to meet the final demand of customers. During each period, the optimized production levels in stage one, as well as transportation levels between stage one and stage two and routing structure from the production plant to warehouses and then to customers, must be determined. The authors consider “different cost structures,” for both manufacturing and transportation. This TSPT model with capacity constraint at both stages is optimized using Genetic Algorithms (GA) and the results obtained are compared with the results of other optimization techniques of complete enumeration, LINDO, and CPLEX.


2019 ◽  
Vol 1 (1) ◽  
pp. 18-21
Author(s):  
Hashnayne Ahmed

Stochastic Programming is an asset for the next world researchers due to its uncertainty calculations, which has been skipped in deterministic world experiments as it includes complicated calculations. Two-stage stochastic programming concerns two time period decisions based on some random parameters obtained from past experience or some sort of survey. The objective function for formulating two-stage stochastic programming with fixed recourse includes two parts: first-stage forecast and second-stage fixed decisions based on the experiment results. The constraints are similar to the normal optimization techniques rather some adjustments of requirements and technology assets. The fixed recourse decisions are sort of decisions from the deterministic world.  Formulation techniques of two-stage stochastic programming with fixed recourse may be used for further complications arises in stochastic programming like complete recourse problems, multi-stage problems, etc. And that’s why Two-stage stochastic programming with fixed recourse is called the primary model for stochastic programming.


Sign in / Sign up

Export Citation Format

Share Document