Please use this identifier to cite or link to this item:
|Title:||Multi-period reverse logistics network design||Authors:||Alumur, Sibel A.
Large household appliances
|Issue Date:||2012||Publisher:||Elsevier||Abstract:||The configuration of the reverse logistics network is a complex problem comprising the determination of the optimal sites and capacities of collection centers, inspection centers, remanufacturing facilities, and/or recycling plants. In this paper, we propose a profit maximization modeling framework for reverse logistics network design problems. We present a mixed-integer linear programming formulation that is flexible to incorporate most of the reverse network structures plausible in practice. In order to consider the possibility of making future adjustments in the network configuration to allow gradual changes in the network structure and in the capacities of the facilities, we consider a multi-period setting. We propose a multi-commodity formulation and use a reverse bill of materials in order to capture component commonality among different products and to have the flexibility to incorporate all plausible means in tackling product returns. The proposed general framework is justified by a case study in the context of reverse logistics network design for washing machines and tumble dryers in Germany. We conduct extensive parametric and scenario analysis to illustrate the potential benefits of using a dynamic model as opposed to its static counterpart, and also to derive a number of managerial insights. (C) 2012 Elsevier B.V. All rights reserved.||URI:||https://doi.org/10.1016/j.ejor.2011.12.045
|Appears in Collections:||Endüstri Mühendisliği Bölümü / Department of Industrial Engineering|
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show full item record
checked on Sep 23, 2022
WEB OF SCIENCETM
checked on Sep 24, 2022
checked on Feb 6, 2023
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.