رویکرد اکتشافی برای استخراج بردار اولویت در تحلیل سلسله مراتبی
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|6318||2013||9 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 5630 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Applied Mathematical Modelling, Volume 37, Issue 8, 15 April 2013, Pages 5828–5836
This paper proposes an approach for deriving the priority vector from an inconsistent pair-wise comparison matrix through the nearest consistent matrix and experts judgments, which enables balancing the consistency and experts judgments. The developed algorithm for achieving a nearest consistent matrix is based on a logarithmic transformation of the pair-wise comparison matrix, and follows an iterative feedback process that identifies an acceptable level of consistency while complying with experts preferences. Three numerical examples are examined to illustrate applications and advantages of the developed approach.
The Analytic Hierarchy Process (AHP) is one of widely used multi-criteria decision making (MCDM) methods . It structures a decision problem as a hierarchical model consisting of criteria and alternatives. The priority vector needs to be derived from a pair-wise comparison matrix (PCM) that is collected from experts judgments. Extensive studies have been done on how to derive the priority vector from a PCM. For example, Saaty  proposed the eigenvector method (EM). However, the EM was always criticized from prioritization and consistency points of view. Therefore, some other methods have been developed to derive the priority vector from a PCM. Such as: Weighted least-squares method (WLSM) , Logarithmic least squares method (LLSM) , Least squares method (LSM) , Chi-square method (CSM) , Gradient eigenweight method (GEM) and Least distance method (LDM) , Geometric least squares method (GLSM) , Goal programming method (GPM) , Logarithmic goal programming approach (LGPA) , Fuzzy programming method (FPM) , Robust estimation method (REM) , Singular value decomposition approach (SVDA) , Interval priority method (IPM) called Possibilistic AHP for Crisp Data , Correlation coefficient maximization approach (CCMA) , Linear programming models (LPM) . Moreover, Srdjevic  suggested combining different prioritization methods for deriving the priority vector; Wang  conducted an overview of methods for deriving the priority vector from a PCM. Besides, some comparative analysis of above mentioned methods for deriving the priority vector can be found in the literature , , , , , ,  and . It is concluded that there is no prioritization method that is superior to the others in all cases from the comparative analysis. Until now, the issue of their relative superiority is still unresolved though methods mentioned above are available for deriving the priority vector. This controversy was also addressed by Herman and Koczkodaj . However, the priority vector derived from an inconsistent PCM depends strongly on the selected method. Therefore, different method may produce different priority vector. Based on this idea, we propose a new approach for deriving the priority vector that is based on the nearest consistent matrix and experts judgments. The proposed approach, firstly seeks the nearest consistent matrix by minimizing the distance between the given PCM and the required consistent matrix in the sense of the Frobenius norm metric, and then derives the priority vector through the nearest consistent matrix. This approach incorporates an extended version of the described linearization procedure ,  and , and is integrated with AHP for deriving the underling priority vector based on the revised PCM. Theorems and algorithms related with the proposed approach are developed in this paper. The proposed approach has the following advantages: (1) The algorithm for achieving the nearest matrix is fast and precise, and is easy to be implemented; (2) The tradeoff between the validity and the consistency is considered because the validity is very important in decision problems ; (3) The iterative feedback algorithm balances the consistency and experts judgments; (4) The iterative feedback algorithm has the convergence ; (5) The priority vector derived through the nearest consistent matrix is unique; (6) The proposed approach provides an alternative for deriving the priority vector from a PCM in AHP. The rest of this paper is organized as follows. Section 2 presents a three-step algorithm for achieving a nearest consistent matrix from a given inconsistent PCM. Section 3 proposes a convergent iterative feedback algorithm to calculate the nearest consistent matrix. Section 4 concludes this paper.
نتیجه گیری انگلیسی
In this paper, a heuristic approach is proposed to derive the priority vector from an inconsistent PCM, which describes an efficient implementation for the calculations. The proposed approach can avoid calculating orthogonal basis and follows an iterative feedback process, which can also be used to obtain an acceptable level of consistency and the validity while complying to some degree with experts preferences. The proposed approach combines some mathematical theory and definitions related with the PCM. The effectiveness of the developed algorithm has been demonstrated through three examples. Any of all the known methods, such as EM, DLSM, WLSM, LLSM and GPM, can be used to derive the priority vector from the nearest consistent matrix since the priority vector derived from the nearest consistent matrix is always identical. The proposed approach based on the original PCM can help practitioners achieve the nearest consistent matrix that relies on their judgments, and then derive an efficient and reliable priority vector. The proposed approach can be used as a new and reliable method for deriving the priority vector from an inconsistent PCM.