• ثبت نام
    • ورود به سامانه
    مشاهده مورد 
    •   صفحهٔ اصلی
    • نشریات انگلیسی
    • Journal of New Researches in Mathematics
    • Volume 6, Issue 24
    • مشاهده مورد
    •   صفحهٔ اصلی
    • نشریات انگلیسی
    • Journal of New Researches in Mathematics
    • Volume 6, Issue 24
    • مشاهده مورد
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Measuring the efficiency of a three-stage network using data envelopment analysis approach considering dual boundary

    (ندگان)پدیدآور
    Vaeezi, Ehsan.Najafi, S. Esmail.Haji Maulana, Seyed Mohammad.Hosseinzadeh Lotfi, Farhad,Ahadzadeh Namin, Mahnaz.
    Thumbnail
    دریافت مدرک مشاهده
    FullText
    اندازه فایل: 
    552.0کیلوبایت
    نوع فايل (MIME): 
    PDF
    نوع مدرک
    Text
    research paper
    زبان مدرک
    English
    نمایش کامل رکورد
    چکیده
    This paper presents a method for performance evaluation, ranking and clustering based on the double-frontier view to analyze the complex networks. The model allows us to open the structure of the “black box" and can help to obtain important information about efficient and inefficient points of the system. In this paper, we consider a three-stage network, in respect to the additional desirable and undesirable inputs and outputs and utilize the cooperative approach to measure the efficiency of the overall system. Due to the fact that, a conclusion implying only one of these two, optimistic or pessimistic views is one-sided and incomplete, so, in this paper we used the double-frontier to analyze the network. Moreover, a heuristic technique was used to convert non-linear models into linear models. After obtaining the effective and inefficient points of the network, the DMUs are classified into several clusters by the k-means algorithm.Finally, in this article, in order to apply the proposed model a factory producing dairy products with a production area, warehouse premises and a delivery point are simulated. This factory has been regarded as a dynamic network with a time period of 24 intervals. The results of the ranking showed that, the time periods, (10) and (1) were the best and poorest respectively, in context to the efficiency within 24 phases of time.
    کلید واژگان
    Network DEA
    Cooperative approach
    Clustering
    k-means algorithm
    Double-frontier
    Undesirable outputs

    شماره نشریه
    24
    تاریخ نشر
    2020-07-01
    1399-04-11
    ناشر
    Science and Research Branch, Islamic Azad University
    دانشگاه آزاد اسلامی واحد علوم و تحقیقات
    سازمان پدید آورنده
    PhD Student in Industrial Engineering, Islamic Azad University, Science and Research Branch, Tehran, Iran.
    Assistant Professor, Department of Industrial Engineering, Islamic Azad University, Science and Research Branch
    Assistant Professor, Department of Industrial Engineering, Islamic Azad University, Science and Research Branch, Tehran, Iran
    Professor, Department of Mathematics, Islamic Azad University, Science and Research Branch, Tehran, Iran.
    Department of Mathematics, Ghods City Branch, Islamic Azad University, Tehran, Iran.

    شاپا
    2588-588X
    URI
    http://jnrm.srbiau.ac.ir/article_15462.html
    https://iranjournals.nlai.ir/handle/123456789/453769

    مرور

    همه جای سامانهپایگاه‌ها و مجموعه‌ها بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌هااین مجموعه بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌ها

    حساب من

    ورود به سامانهثبت نام

    آمار

    مشاهده آمار استفاده

    تازه ترین ها

    تازه ترین مدارک
    © کليه حقوق اين سامانه برای سازمان اسناد و کتابخانه ملی ایران محفوظ است
    تماس با ما | ارسال بازخورد
    قدرت یافته توسطسیناوب