Application of the Bellman and Zadeh's principle for identifying the fuzzy decision in a network with intermediate storage

Abstract:
In most of the real-life applications we deal with the problem of transporting some special fruits, as banana, which has particular production and distribution processes. In this paper we restrict our attention to formulating and solving a new bi-criterion problem on a network in which in addition to minimizing the traversing costs, admissibility of the quality level of fruits is a main objective. However, the fruits are possibly stored at some intermediate node for practical purposes. We call the new model the best shipping pattern problem with intermediate storage. Here, it is assumed that both arc costs and times are crisp numbers. The main contribution of this model is an actual interpretation of the given fuzzy trapezoidal number, as the quality of delivered commodities. Since the presented problem has a fuzzy structure, the Bellman and Zadeh's max-min criterion can be used to treat it as a crisp single-objective problem, which is easily solvable. An illustrative example is solved, to explain the presented details.
Language:
English
Published:
International Journal of Mathematical Modelling & Computations, Volume:6 Issue: 3, Summer 2016
Page:
243
magiran.com/p1556327  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!