A hybrid approach to solve a model of closed-loop supply chain (Q1664866)

Summary: This paper investigates a closed-loop supply chain network, including plants, demand centers, as well as collection centers, and disposal centers. In forward flow, the products are directly sent to demand centers, after being produced by plants, but in the reverse flow, reused products are returned to collection centers and, after investigating, are partly sent to disposal centers and the other part is resent to plants for remanufacturing. The proposed mathematical model is based on mixed-integer programming and helps minimizing the total cost. Total costs include the expenditure of establishing new centers, producing new products, cargo transport in the network, and disposal. The model aims to answer these two questions. (1) What number and in which places the plants, collection centers, and disposal centers will be constructed. (2) What amount of products will be flowing in each segment of the chain, in order to minimize the total cost. Four types of tuned metaheuristic algorithms were used, which are hybrid forms of genetic and firefly algorithms. Finally an adequate number of instances are generated to analyse the behavior of proposed algorithms. Computational results reveal that iterative sequentialization hybrid provides better solution compared with the other approaches in large size.