TY - JOUR ID - 133512 TI - Sustainable closed-loop supply chain network: Mathematical modeling and Lagrangian relaxation JO - Journal of Industrial Engineering and Management Studies JA - JIEMS LA - en SN - 2476-308X AU - Khorshidvand, Behrooz AU - Soleimani, Hamed AU - Seyyed Esfahani, Mir Mehdi AU - Sibdari, Soheil AD - Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran. AD - Faculty of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran. AD - Charlton College of Business, University of Massachusetts, Dartmouth, USA. Y1 - 2021 PY - 2021 VL - 8 IS - 1 SP - 240 EP - 260 KW - Sustainable Closed-loop Supply Chain KW - pricing KW - Lagrangian Relaxation DO - 10.22116/jiems.2020.215206.1330 N2 - This paper addresses a novel two-stage model for a Sustainable Closed-Loop Supply Chain (SCLSC). This model, as a contribution, provides a balance among economic aims, environmental concerns, and social responsibilities based on price, green quality, and advertising level. Therefore, in the first stage, the optimal values of price are derived by considering the optimal level of advertising and greening. After that, in the second stage, multi-objective Mixed-Integer Linear Programming (MOMILP) is extended to calculate Pareto solutions. The objectives are include maximizing the profit of the whole chain, minimizing the environmental impacts due to CO2 emissions, and maximizing employee safety. Besides, a Lagrangian relaxation algorithm is developed based on the weighted-sum method to solve the MOMILP model. The findings demonstrate that the proposed two-stage model can simultaneously cope with coordination decisions and sustainable objectives. The results show that the optimal price of the recovered product equals 75% of the new product price which considerably encourages customers to buy it. Moreover, to solve the MOMILP model, the proposed algorithm can reach to exact bound with an efficiency gap of 0.17% compared to the optimal solution. Due to the use of this algorithm, the solution time of large-scale instances is reduced and simplified by an average of 49% in comparison with the GUROBI solver.  UR - https://jiems.icms.ac.ir/article_133512.html L1 - https://jiems.icms.ac.ir/article_133512_7563f7b5d31318d27ea7859b27836d54.pdf ER -