The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Selection of Transportation Channels in Closed-Loop Supply Chain Using Meta-Heuristic Algorithm
|
Author(s): Sonu Rajak (National Institute of Technology, Tiruchirappalli, India), P. Parthiban (National Institute of Technology, Tiruchirappalli, India)and R. Dhanalakshmi (National Institute of Technology, Nagaland, India)
Copyright: 2020
Pages: 24
Source title:
Supply Chain and Logistics Management: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-7998-0945-6.ch034
Purchase
|
Abstract
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.
Related Content
Hamed Nozari.
© 2024.
13 pages.
|
Maryam Rahmaty.
© 2024.
13 pages.
|
Mahmonir Bayanati.
© 2024.
13 pages.
|
Kamalendu Pal.
© 2024.
33 pages.
|
Kamalendu Pal.
© 2024.
35 pages.
|
Aminmasoud Bakhshi Movahed, Ali Bakhshi Movahed, Hamed Nozari.
© 2024.
31 pages.
|
Esmael Najafi, Iman Atighi.
© 2024.
11 pages.
|
|
|