Selection of Transportation Channels in Closed-Loop Supply Chain Using Meta-Heuristic Algorithm

Selection of Transportation Channels in Closed-Loop Supply Chain Using Meta-Heuristic Algorithm

Sonu Rajak, P. Parthiban, R. Dhanalakshmi
DOI: 10.4018/IJISSCM.2018070104
(Individual Articles)
No Current Special Offers


This article presents a closed-loop supply chain (CLSC) network design problem consisting of both forward and reverse material flows. Here, a four-echelon single-product system is introduced in which multiple transportation channels are considered between the nodes of each echelon. Each design is analyzed for the optimum cost, time and environmental impact which form objective functions. The problem is modeled as a tri-objective mixed integer linear programming (MILP) model. The cost objective aggregates the opening cost (fixed cost) and the variable costs in both forward and reverses material flow. The time objective considers the longest transportation time from plants to customers and reverse. Factors of environmental impact are categorized and weighed using an analytic network process (ANP) which forms the environmental objective function. A genetic algorithm (GA) has been applied as a solution methodology to solve the MILP model. Ultimately, a case problem is also used to illustrate the model developed and concluding remarks are made regarding the results.
Article Preview

Literature Review

Supply chain designs have been studied by many authors (Beamon, 1998; Melo et al., 2009; Thomas & Griffin, 1996; Vidal & Goetschalckx, 1997). In the Recent past, we can find that reverse logistics and CLSC are not only a cost minimization approach but also a revenue opportunity for the manufacturers and supply chain partners (Guide & Van Wassenhove, 2009). CLSC design has been the subject of study of many authors (Georgiadi et al., 2006; Atasu et al., 2008; Amin & Zhang, 2013; Chen et al., 2015; Giovanni & Zaccour, 2014; Ramezani et al., 2014; Shi et al., 2016; Tsao et al., 2016; Yang et al., 2009; Zohal & Soleimani., 2016; Chen et al., 2016; O'Reilly & Kumar, 2016).

Complete Article List

Search this Journal:
Volume 16: 1 Issue (2023)
Volume 15: 7 Issues (2022): 6 Released, 1 Forthcoming
Volume 14: 4 Issues (2021)
Volume 13: 4 Issues (2020)
Volume 12: 4 Issues (2019)
Volume 11: 4 Issues (2018)
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing