On solving linear fractional programming transportation problems with fuzzy numbers

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

In this paper, we present a novel method for solving Fractional Transportation Problems (FTPs) with fuzzy numbers using a ranking function. The proposed method introduces a transformation technique that converts an FTP with fuzzy numbers into an FTP with crisp numbers by employing the robust ranking technique. Subsequently, we formulate two transportation problems, one for maximization and another for minimization, based on the given FTP. The optimal solution for the original FTP is then derived by leveraging the solutions obtained for the formulated transportation problems. By optimizing these single-objective transport problems, our method provides decision-makers with the ability to make satisfactory managerial decisions and evaluate economic operations when confronted with logistic problems involving fractional transportation. To demonstrate the effectiveness of the proposed approach, we present several illustrative examples that showcase its practical application and efficiency.

Language:
English
Published:
Journal of Fuzzy Extension and Applications, Volume:4 Issue: 4, Autumn 2023
Pages:
327 to 339
magiran.com/p2675421  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!