TY - JOUR
T1 - On risk management of a two-stage stochastic mixed 0–1 model for the closed-loop supply chain design problem
AU - Baptista, Susana
AU - Barbosa-Póvoa, Ana Paula
AU - Escudero, Laureano F.
AU - Gomes, Maria Isabel
AU - Pizarro, Celeste
N1 - This work was partially supported by the Portuguese National Science Foundation through CMA/FCT/UNL under project UID/MAT/00297/2013, the Spanish Ministry of Economy and Competitiveness under the projects MTM2015-63710-P and MT M2015-65317 -P, and the European Commission under the COST action TD1207.
PY - 2019/4/1
Y1 - 2019/4/1
N2 - In this work, the design and operation planning of a multi-period, multi-product closed-loop supply chain is addressed. Recovered end-of-life products from customers are evaluated in disassembly centers and accordingly are sent back to factories for remanufacturing, or leave the network either by being sold to third parties or by being sent to disposal. Typical uncertain parameters are product demand, production cost, and returned product volume and evaluation, among others. So, stochastic optimization approaches should be used for problem solving, where different topology decisions on the timing, location and capacity of some entities (factories, and distribution and sorting centers) are to be considered along a time horizon. A two-stage multi-period stochastic mixed 0–1 bilinear optimization model is introduced, where the combined definition of the available entities at the periods and the products’ flow among the entities, maximizes the net present value of the expected total profit along the time horizon. A version of the mixture of chance-constrained and second order stochastic dominance risk averse measures is considered for risk management at intermediate periods of the time horizon. Given the high dimensions of the model it is unrealistic to look for the optimality of the solution in an affordable computing effort for current hardware and optimization software resources. So, a decomposition approach is considered, namely a Fix-and-Relax decomposition algorithm. For assessing the computational validation of the modeling and algorithmic proposals, pilot cases are taken from a real-life glass supply chain network whose main features are retained.
AB - In this work, the design and operation planning of a multi-period, multi-product closed-loop supply chain is addressed. Recovered end-of-life products from customers are evaluated in disassembly centers and accordingly are sent back to factories for remanufacturing, or leave the network either by being sold to third parties or by being sent to disposal. Typical uncertain parameters are product demand, production cost, and returned product volume and evaluation, among others. So, stochastic optimization approaches should be used for problem solving, where different topology decisions on the timing, location and capacity of some entities (factories, and distribution and sorting centers) are to be considered along a time horizon. A two-stage multi-period stochastic mixed 0–1 bilinear optimization model is introduced, where the combined definition of the available entities at the periods and the products’ flow among the entities, maximizes the net present value of the expected total profit along the time horizon. A version of the mixture of chance-constrained and second order stochastic dominance risk averse measures is considered for risk management at intermediate periods of the time horizon. Given the high dimensions of the model it is unrealistic to look for the optimality of the solution in an affordable computing effort for current hardware and optimization software resources. So, a decomposition approach is considered, namely a Fix-and-Relax decomposition algorithm. For assessing the computational validation of the modeling and algorithmic proposals, pilot cases are taken from a real-life glass supply chain network whose main features are retained.
KW - Closed-loop
KW - Design and production planning
KW - Risk averse strategy
KW - Supply chain management
KW - Two-stage stochastic optimization
UR - http://www.scopus.com/inward/record.url?scp=85054728624&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2018.09.041
DO - 10.1016/j.ejor.2018.09.041
M3 - Article
AN - SCOPUS:85054728624
SN - 0377-2217
VL - 274
SP - 91
EP - 107
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -