Application of exact and multi-heuristic approaches to a sustainable closed loop supply chain network design

Khan, Abdul Salam and Khalid, Qazi Salman and Naeem, Khawar and Ahmad, Rafiq and Khan, Razaullah and Saleem, Waqas and Pruncu, Catalin Iulian (2021) Application of exact and multi-heuristic approaches to a sustainable closed loop supply chain network design. Sustainability (Switzerland), 13 (5). 2433. ISSN 2071-1050 (

[thumbnail of Khan-etal-Sustainability-2021-Application-of-exact-and-multi-heuristic-approaches-to-a-sustainable-closed]
Text. Filename: Khan_etal_Sustainability_2021_Application_of_exact_and_multi_heuristic_approaches_to_a_sustainable_closed.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (2MB)| Preview


Closed-loop supply chains (CLSC) are gaining popularity due to their efficiency in addressing economic, environmental, and social concerns. An important point to ponder in the distribution of CLSC is that imperfect refrigeration and bad road conditions may result in product non-conformance during the transit and thus such products are to be returned to the supply node. This may hinder the level of customer satisfaction. This paper presents a sustainable closed-loop supply chain framework coupled with cross-docking subject to product non-conformance. A cost model is proposed to investigate the economic and environmental aspects of such systems. The transportation cost is analyzed in terms of total carbon emissions. A set of metaheuristics are administered to solve the model and a novel lower bound is proposed to relax the complexity of the proposed model. The results of different size problems are compared with the branch and bound approach and the proposed lower bound. The results indicate that the proposed research framework, mathe-matical model, and heuristic schemes can aid the decision-makers in a closed-loop supply chain context.


Khan, Abdul Salam, Khalid, Qazi Salman, Naeem, Khawar, Ahmad, Rafiq, Khan, Razaullah, Saleem, Waqas and Pruncu, Catalin Iulian ORCID logoORCID:;