Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/195609 
Erscheinungsjahr: 
2018
Quellenangabe: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 14 [Issue:] 2 [Publisher:] Springer [Place:] Heidelberg [Year:] 2018 [Pages:] 305-326
Verlag: 
Springer, Heidelberg
Zusammenfassung: 
This study aims to discuss the solution methodology for a closed-loop supply chain (CLSC) network that includes the collection of used products as well as distribution of the new products. This supply chain is presented on behalf of the problems that can be solved by the proposed meta-heuristic algorithms. A mathematical model is designed for a CLSC that involves three objective functions of maximizing the profit, minimizing the total risk and shortages of products. Since three objective functions are considered, a multi-objective solution methodology can be advantageous. Therefore, several approaches have been studied and an NSGA-II algorithm is first utilized, and then the results are validated using an MOSA and MOPSO algorithms. Priority-based encoding, which is used in all the algorithms, is the core of the solution computations. To compare the performance of the meta-heuristics, random numerical instances are evaluated by four criteria involving mean ideal distance, spread of non-dominance solution, the number of Pareto solutions, and CPU time. In order to enhance the performance of the algorithms, Taguchi method is used for parameter tuning. Finally, sensitivity analyses are performed and the computational results are presented based on the sensitivity analyses in parameter tuning.
Schlagwörter: 
Closed-loop logistics
NSGA-II
MOPSO
MOSA
Taguchi
Mathematical model
Priority-based
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe
1.75 MB





Publikationen in EconStor sind urheberrechtlich geschützt.