Please use this identifier to cite or link to this item:
|Title: ||Designing multi-period supply chain network considering risk and emission: a multi-objective approach|
|Authors: ||Kumar, Ravi Shankar|
Choudhary, Alok K.
Babu, Soudagar A. K. Irfan
Kumar, Sri K.
Tiwari, Manoj K.
|Keywords: ||Supply chain network|
|Issue Date: ||2017|
|Publisher: ||Springer / © The Authors|
|Citation: ||KUMAR, R.S. ... et al, 2017. Designing multi-period supply chain network considering risk and emission: a multi-objective approach. Annals of Operations Research, 250 (2), pp. 427–461.|
|Abstract: ||This research formulates a multi-objective problem (MOP) for supply chain network (SCN) design by incorporating the issues of social relationship, carbon emissions, and supply chain risks such as disruption and opportunism. The proposed MOP includes three conflicting objectives: maximization of total profit, minimization of supply disruption and opportunism risks, and minimization of carbon emission considering a number of supply chain constraints. Furthermore, this research analyses the effect of social relationship levels between different tiers of SCN on the profitability, risk, and emission over the time. In this regard, we focus on responding to the following questions. (1) How does the evolving social relationship affect the objectives of the supply chain (SC)? (2) How do the upstream firms’ relationships affect the relationships of downstream firms, and how these relationships influence the objectives of the SC? (3) How does the supply disruption risk interact with the opportunism risk through supply chain relationships, and how these risks affect the objectives of the SC? (4) How do these three conflicting objectives trade-off? A Pareto-based multi-objective evolutionary algorithm–non-dominated sorting genetic algorithm-II (NSGA-II) has been employed to solve the presented problem. In order to improve the quality of solutions, tuning parameters of the NSGA-II are modulated using Taguchi approach. An illustrative example is presented to manifest the capability of the model and the algorithm. The results obtained evince the robust performance of the proposed MOP.|
|Description: ||This article is distributed under the terms of the Creative Commons Attribution 4.0 International
License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution,
and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source,
provide a link to the Creative Commons license, and indicate if changes were made.|
|Publisher Link: ||http://dx.doi.org/10.1007/s10479-015-2086-z|
|Appears in Collections:||Published Articles (Business School)|
Files associated with this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.