.png){kind=icon}
.png){kind=icon}
Return
Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12865.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motivated by the recovery of modular-structured products, this study addresses the flexible design of a reverse supply chain (RSC) over a planning horizon while incorporating the dynamic uncertain behavior of product returns. The stochastic parameter is modeled as a scenario tree and therefore the concerned problem is formulated as a multistage mixed-integer stochastic program. To alleviate the computational complexity of the proposed model, it is decomposed into smaller scenario cluster submodels associated with a number of subtrees that share a certain number of predecessor nodes in the original scenario tree. The submodels are coordinated into an implementable solution via a Lagrangian-progressive hedging-based method that employs a viable Benders decomposition based algorithm for solving each scenario cluster submodel. Based on a realistic scale case, computational results indicate the superiority of the proposed flexible dynamic RSC design model compared to the existing models. Results also demonstrate the efficiency of the proposed solution approach.
Keywords:
flexible reverse supply chain design
multistage stochastic programming
scenario clustering decomposition
Benders decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K