Presenting a multi-objective model for location-routing problem with considering minimal risk and maximal demand covering

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

Locational decisions, routing and allocation in supply chain management philosophy is undoubtedly one of the most important issues that affect the frequency of the supply chain cost reduction and customer satisfaction. This paper presents an integrated approach to the distribution network. The objective function of the proposed mathematical model consists of minimizing the total costs associated with transportation and warehouse rental costs and also minimize the risk of system. The model has high computational complexity and the exact method of solving it is not possible in a reasonable time. The result is an innovative multi-objective algorithm known as the objective harmony search algorithm is presented. To demonstrate the effectiveness and efficiency of the proposed algorithm to solve the model using the Taguchi method algorithm parameters are adjusted in the best possible rates. Then a random sample of the issues and the performance of the proposed algorithm with NSGA-ǁ and NRGA evaluated.

Language:
Persian
Published:
Journal of Industrial Management Studies, Volume:18 Issue: 58, 2020
Pages:
105 to 138
magiran.com/p2176294  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!