PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem

Authors:
P. Subramanian;N. Ramkumar;T. T. Narendran;K. Ganesh
Affiliations:
Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, PA 16802, USA;Department of Management Studies, Indian Institute of Technology Madras, Chennai 600036, Tamilnadu, India;Department of Management Studies, Indian Institute of Technology Madras, Chennai 600036, Tamilnadu, India;Global Business Services - Global Delivery, IBM India Private Limited, Bandra East, Mumbai 400051, Maharashtra, India
Venue:
Applied Soft Computing
Year:
2013

Citing 9
Cited 0

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
Genetic Algorithms and Manufacturing Systems Design

Genetic Algorithms and Manufacturing Systems Design
Genetic Algorithms

Genetic Algorithms
Closed-Loop Supply Chain Models with Product Remanufacturing

Management Science
A steady-state genetic algorithm for multi-product supply chain network design

Computers and Industrial Engineering
A genetic algorithm approach for multi-objective optimization of supply chain networks

Computers and Industrial Engineering
A closed-loop logistic model with a spanning-tree based genetic algorithm

Computers and Operations Research
A memetic algorithm for bi-objective integrated forward/reverse logistics network design

Computers and Operations Research
A stochastic model for forward-reverse logistics network design under risk

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.