A capacitated plant location model for Reverse Logistics Activities

被引:31
作者
Fraga Coelho, Ellen Kenia [1 ]
Mateus, Geraldo Robson [1 ]
机构
[1] Univ Fed Minas Gerais, Ave Presidente Antonio Carlos,6627 Pampulha, BR-31270901 Belo Horizonte, MG, Brazil
关键词
Reverse logistics; Reduction tests; Benders decomposition; Algorithms; BOUND ALGORITHM; NETWORK DESIGN; SUPPLY CHAIN; HEURISTICS;
D O I
10.1016/j.jclepro.2017.07.238
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Product remanufacturing is one of the most profitable activities in reverse logistics. Running a business plan, in which companies take responsibility for the waste generated at their end-of-life products, involves making important strategic decisions. One of the challenges in planning the reverse flow of products is decide where installing the reprocessing facilities. This decision influences directly the transport variables costs and the facilities installation fixed costs. This paper proposes a model for the Capacitated Plant Location Problem in Reverse Logistics (CPL-RL), in which we assume that offered material in each collection center is aimed at a single facility for reprocessing. This restriction includes specific cases where there is no logistic availability in the network to send the collected material to different locations. The Mixed Integer Problem (MILP) is solved using an algorithm in two steps. In the first step, reduction tests are performed, which ones determine a priori which facilities are opened/closed. If all facilities are fixed opened or closed then the solution is optimal. Although not all facilities can have their status defined that way, the resultant problem has a less number of variables and it is solved using Benders method. The dataset was randomly generated and the results showed that the applied techniques are appropriate, achieving the optimal solution for all test problems. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1165 / 1176
页数:12
相关论文
共 47 条
[1]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[2]   Multi-period reverse logistics network design [J].
Alumur, Sibel A. ;
Nickel, Stefan ;
Saldanha-da-Gama, Francisco ;
Verter, Vedat .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 220 (01) :67-78
[3]   A proposed mathematical model for closed-loop network configuration based on product life cycle [J].
Amin, Saman Hassanzadeh ;
Zhang, Guoqing .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 58 (5-8) :791-801
[4]  
Barbosa-Povoa A.P, 2010, DESIGN PLANNING CLOS, P187
[5]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[6]   Reverse supply chains for commercial returns [J].
Blackburn, JD ;
Guide, VDR ;
Souza, GC ;
Van Wassenhove, LN .
CALIFORNIA MANAGEMENT REVIEW, 2004, 46 (02) :6-+
[7]  
Bornstein C. T., 1998, Location Science, V6, P67, DOI 10.1016/S0966-8349(98)00062-X
[8]  
Campelo M, 2001, ELECT NOTES DISCRETE, V7, P102
[9]  
Daskin M.S., 2005, Logistics systems: design and optimization, P39, DOI [10.1007/0-387-24977-X2, DOI 10.1007/0-387-24977-X_2]
[10]  
Dekker R., 2004, Reverse Logistics: Quantitative Models for Closed-Loop Supply Chains, V1, P436, DOI [https://doi.org/10.1007/978-3-540-24803-3, DOI 10.1007/978-3-540-24803-3]