Abstract
The closed-loop supply chain (CLSC) network design has become one of the most critical issues due to the importance of resource optimization. Moreover, increasing competition in commercial markets leads to the diversity of a brand’s product portfolio to meet the customer’s demand. Hence, this paper develops a multi-period, multi-brand stochastic mixed-integer linear programming (MILP) model with direct and indirect distribution for the proposed CLSC network. Because of the uncertain nature of demand, the uncertainties for new and second-hand product demand are considered. Besides, a chance-constraint optimization (CCO) approach is applied to deal with uncertainty. Moreover, the accelerated Benders decomposition (BD) algorithm is designed to solve the proposed model. Several test problems are created and used to solve the accelerated BD compared with the conventional BD algorithm to investigate this model. Finally, the results are compared and described analytically, and some future research is suggested.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.