Fatehi Kivi, A., Atashi Abkenar, A., alipour, H. (2018). Fuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain. Journal of Optimization in Industrial Engineering, 11(1), 133-141. doi: 10.22094/joie.2018.268
Amir Fatehi Kivi; Amir aydin Atashi Abkenar; Hossin alipour. "Fuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain". Journal of Optimization in Industrial Engineering, 11, 1, 2018, 133-141. doi: 10.22094/joie.2018.268
Fatehi Kivi, A., Atashi Abkenar, A., alipour, H. (2018). 'Fuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain', Journal of Optimization in Industrial Engineering, 11(1), pp. 133-141. doi: 10.22094/joie.2018.268
Fatehi Kivi, A., Atashi Abkenar, A., alipour, H. Fuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain. Journal of Optimization in Industrial Engineering, 2018; 11(1): 133-141. doi: 10.22094/joie.2018.268
Fuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain
1Instructor, Young researchers and elite clud, Khalkhal branch, Islamic azad university, khalkhal, iran,
2MSc, Young researchers and elite clud, Khalkhal branch, Islamic azad university, khalkhal, iran,
3Assistant Professor, Industrial Eng. Dept., Khalkhal Branch, Islamic Azad University, Khalkhal, Iran
Abstract
The aim of lot sizing problems is to determine the periods where production takes place and the quantities to be produced in order to satisfy the customer demand while minimizing the total cost. Due to its importance on the efficiency of the production and inventory systems, Lot sizing problems are one of the most challenging production planning problems and have been studied for many years with different modeling features. In this paper, we propose a fuzzy mathematical model for the single-item capacitated lot-sizing problem in closed-loop supply chain. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the form of mixed integer linear programming (MILP), which can be solved by existing solver in crisp environment to find optimal solution. Due to the complexity of the problems harmony search (HS) algorithm and genetic algorithm (GA) have been used to solve the model for fifteen problem. To verify the performance of the algorithm, we computationally compared the results obtained by the algorithms with the results of the branch-and-bound method. Additionally, Taguchi method was used to calibrate the parameters of the meta-heuristic algorithms. The computational results show that, the objective values obtained by HS are better from GA results for large dimensions test problems, also CPU time obtained by HS are better than GA for Large dimensions.
Top
