Header menu link for other important links
X
PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem
T. T. Narendran
Published in Elsevier Ltd
2013
Volume: 13
   
Issue: 2
Pages: 1121 - 1135
Abstract
Concerns over environmental degradation, legislative requirements and growing needs of business have fueled the growth of Closed Loop Supply Chains (CLSC). We consider a CLSC and address the issues of designing the network and of optimizing the distribution. Four variants of the problem are considered. The problem is modeled as an Integer Linear Program (ILP). We develop a constructive heuristic based on Vogel's approximation method-total opportunity cost method to provide good initial solutions to a priority-based simulated annealing heuristic, to accelerate its convergence. Trials on a set of hypothetical datasets have yielded encouraging results. The methodology is also tested using a case study data of a company producing electronic products. Implications for sustainability are discussed. © 2012 Elsevier B.V. All rights reserved.
About the journal
JournalData powered by TypesetApplied Soft Computing Journal
PublisherData powered by TypesetElsevier Ltd
ISSN15684946
Open AccessNo
Concepts (14)
  •  related image
    Approximation theory
  •  related image
    Integer programming
  •  related image
    Simulated annealing
  •  related image
    Supply chains
  •  related image
    Sustainable development
  •  related image
    Closed-loop supply chain
  •  related image
    CLOSED-LOOP SUPPLY CHAIN NETWORK DESIGNS
  •  related image
    CLOSED-LOOP SUPPLY CHAINS (CLSC)
  •  related image
    CONSTRUCTIVE HEURISTIC
  •  related image
    HYPOTHETICAL DATASETS
  •  related image
    Integer linear programs
  •  related image
    LEGISLATIVE REQUIREMENTS
  •  related image
    TOTAL OPPORTUNITY COST
  •  related image
    Heuristic methods