Title: Modelling robust closed loop supply chain network by applying the Benders decomposition algorithm
Authors: Seyed Farid Mousavi; Arash Apornak
Addresses: Department of Information Technology and Operations Management, Kharazmi University, Tehran, Iran ' Department of Industrial Engineering, University of Tehran, Tehran, Iran
Abstract: This paper presents a mixed-integer linear optimisation programming for a 9-echelon closed-loop supply chain network design with seasonal raw materials and product demand. The objective function minimises total fixed and operational costs. Here, the demand, suppliers' capacities, and fixed setup costs are uncertain, and use is made of the robust optimisation based on the box and polyhedral uncertainty set to model uncertainties. Since closed-loop supply chain network design model is among NP-hard problems the solutions of which in large scales are very difficult, use has been made of the Benders exact solution algorithm to find the optimal solution of the proposed model. Results found from appliance industrial case study have revealed that the robust model performs worse than the deterministic model with nominal data. In addition, Benders algorithm has been quite efficient in reducing the computation time to find the exact optimal solution.
Keywords: Benders decomposition algorithm; closed-loop supply chain network design; robust optimisation.
DOI: 10.1504/IJMCP.2026.150686
International Journal of Management Concepts and Philosophy, 2026 Vol.19 No.1, pp.104 - 129
Received: 31 May 2024
Accepted: 17 Jun 2024
Published online: 22 Dec 2025 *