Solving a Multi-Item Supply Chain Network Problem by Three Meta-heuristic Algorithms
Publish Year: 1400
نوع سند: مقاله ژورنالی
زبان: English
View: 490
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-14-2_010
تاریخ نمایه سازی: 17 فروردین 1400
Abstract:
The supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of production planning and maintenance. The problem is formulated as a mixed-integer linear programming model. Because of its NP-hardness, three meta-heuristic algorithms(i.e., tabu search, harmony search and genetic algorithm) are used to solve the given problem. Also, theTaguchi method is used to choose the best levels of the parameters of the proposedmeta-heuristic algorithms. The results show that HS has abetter solution quality than two other algorithms.
Keywords:
Authors
Amir Fatehi Kivi
Young researchers and elite clud, Khalkhal branch Islamic azad university, khalkhal, iran,
Esmaeil Mehdizadeh
Islamic Azad University, Qazvin Branch
Reza Tavakkoli-Moghaddam
North Karegar Street School of Industrial Engineering, College of Engineering, University of Tehran
Seyed Esmaeil Najafi
Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran