Design a Fuzzy Goal Programming Model for Optimizing the Cost and Distance of Vehicles in the Four-Echelon Closed-Loop Supply Chain by Using Ant Colony Algorithm

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In today's highly competitive world, closed-loop supply chains (CLSC) have become a major challenge for product recycling. The recycling system has a special place in the supply chain due to the coverage of laws and the reduction of environmental pollution, increasing economic power by creating new jobs and the ability to recover the value of returned products. The purpose of this study is to design fuzzy- goal model for optimizing the cost and distance of vehicles in the four echelon closed-loop supply chain. The closed-loop logistics model could not be easily solved with the base gradient methods due to its NP-Hard problem group, so the ant algorithm was used for optimization. Finally, after implementing the fuzzy goal model of the research, it was found that the goal of minimizing the cost in the model has a higher membership amount than the distance goal, and managers should pay special attention to this goal.
Language:
Persian
Published:
Journal of Modern Research in Decision Making, Volume:6 Issue: 1, 2021
Pages:
148 to 169
magiran.com/p2255953  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!