Hybrid optimizers to solve a tri-level programming model for a tire closed-loop supply chain network design problem

Amir Mohammad Fathollahi-Fard, Mostafa Hajiaghaei-Keshteli, Seyedali Mirjalili

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)701-722
Number of pages22
JournalApplied Soft Computing Journal
Volume70
DOIs
Publication statusPublished - 1 Sep 2018
Externally publishedYes

    Fingerprint

Keywords

  • Hybrid optimizers
  • Location-Allocation problem
  • Metaheuristic algorithms
  • Tire closed-loop supply chain
  • Tri-level programming

Cite this