TY - JOUR
T1 - Hybrid optimizers to solve a tri-level programming model for a tire closed-loop supply chain network design problem
AU - Fathollahi-Fard, Amir Mohammad
AU - Hajiaghaei-Keshteli, Mostafa
AU - Mirjalili, Seyedali
PY - 2018/9/1
Y1 - 2018/9/1
N2 - The Closed-loop Supply Chain (CLSC) is one way to collect and recycle scraped tires. CLSC consists of a set of suppliers, manufacturers, distributors and customers in a forward system. Collectors and recyclers are formed a reverse one as well. The decisions in such systems are adopted in a hierarchy. Regarding this issue, this study develops a tri-level programming model to design the location-allocation of the tire CLSC for the first time. The proposed model is formulated on the static Stackelberg game between manufacturers, distributors and collectors in the framework of CLSC. The performance of the current exact solutions for this problem suffers from degraded performance when solving large-scale problems. To alleviate this drawback, this study proposes a number of new hybrid optimizers by considering the benefits of recent metaheuristics. An extensive comparative study confirms the efficiency of developed model and the performance of the hybrid optimizers proposed when solving the large-scale problems.
AB - The Closed-loop Supply Chain (CLSC) is one way to collect and recycle scraped tires. CLSC consists of a set of suppliers, manufacturers, distributors and customers in a forward system. Collectors and recyclers are formed a reverse one as well. The decisions in such systems are adopted in a hierarchy. Regarding this issue, this study develops a tri-level programming model to design the location-allocation of the tire CLSC for the first time. The proposed model is formulated on the static Stackelberg game between manufacturers, distributors and collectors in the framework of CLSC. The performance of the current exact solutions for this problem suffers from degraded performance when solving large-scale problems. To alleviate this drawback, this study proposes a number of new hybrid optimizers by considering the benefits of recent metaheuristics. An extensive comparative study confirms the efficiency of developed model and the performance of the hybrid optimizers proposed when solving the large-scale problems.
KW - Hybrid optimizers
KW - Location-Allocation problem
KW - Metaheuristic algorithms
KW - Tire closed-loop supply chain
KW - Tri-level programming
UR - http://www.scopus.com/inward/record.url?scp=85048960619&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2018.06.021
DO - 10.1016/j.asoc.2018.06.021
M3 - Article
AN - SCOPUS:85048960619
SN - 1568-4946
VL - 70
SP - 701
EP - 722
JO - Applied Soft Computing Journal
JF - Applied Soft Computing Journal
ER -