A new data envelopment analysis method for priority determination and group decision making in the analytic hierarchy process

The DEAHP method for weight deviation and aggregation in the analytic hierarchy process (AHP) has been found flawed and sometimes produces counterintuitive priority vectors for inconsistent pairwise comparison matrices, which makes its application very restrictive. This paper proposes a new data envelopment analysis (DEA) method for priority determination in the AHP and extends it to the group AHP situation. In this new DEA methodology, two specially constructed DEA models that differ from the DEAHP model are used to derive the best local priorities from a pairwise comparison matrix or a group of pairwise comparison matrices no matter whether they are perfectly consistent or inconsistent. The new DEA method produces true weights for perfectly consistent pairwise comparison matrices and the best local priorities that are logical and consistent with decision makers (DMs)’ subjective judgments for inconsistent pairwise comparison matrices. In hierarchical structures, the new DEA method utilizes the simple additive weighting (SAW) method for aggregation of the best local priorities without the need of normalization. Numerical examples are examined throughout the paper to show the advantages of the new DEA methodology and its potential applications in both the AHP and group decision making.     

Fuzzy analytic hierarchy process: A logarithmic fuzzy preference programming methodology

Fuzzy analytic hierarchy process (AHP) proves to be a very useful methodology for multiple criteria decision-making in fuzzy environments, which has found substantial applications in recent years. The vast majority of the applications use a crisp point estimate method such as the extent analysis or the fuzzy preference programming (FPP) based nonlinear method for fuzzy AHP priority derivation. The extent analysis has been revealed to be invalid and the weights derived by this method do not represent the relative importance of decision criteria or alternatives. The FPP-based nonlinear priority method also turns out to be subject to significant drawbacks, one of which is that it may produce multiple, even conflict priority vectors for a fuzzy pairwise comparison matrix, leading to entirely different conclusions. To address these drawbacks and provide a valid yet practical priority method for fuzzy AHP, this paper proposes a logarithmic fuzzy preference programming (LFPP) based methodology for fuzzy AHP priority derivation, which formulates the priorities of a fuzzy pairwise comparison matrix as a logarithmic nonlinear programming and derives crisp priorities from fuzzy pairwise comparison matrices. Numerical examples are tested to show the advantages of the proposed methodology and its potential applications in fuzzy AHP decision-making.     

Fractional Minmax Goal Programming: A Unified Approach to Priority Estimation and Preference Analysis in MCDM

A special minmax goal programming model with fractional goals is formulated and then used as the basis for developing two specific MCDM methods: (1) a method to derive priorities for decision elements from pairwise comparison matrices in the AHP framework; (2) a method to assess an additive value function by analysing some preference information expressed over the set of alternatives on a ratio scale. For both methods a common iterative solution procedure is proposed by using a linear programming formulation.     

A fuzzy ranking method with range reduction techniques

For ranking alternatives based on pairwise comparisons, current analytic hierarchy process (AHP) methods are difficult to use to generate useful information to assist decision makers in specifying their preferences. This study proposes a novel method incorporating fuzzy preferences and range reduction techniques. Modified from the concept of data envelopment analysis (DEA), the proposed approach is not only capable of treating incomplete preference matrices but also provides reasonable ranges to help decision makers to rank decision alternatives confidently.     

The synthetic hierarchy method: An optimizing approach to obtaining priorities in the AHP

A new method of synthesizing local and criteria priorities into global priorities is suggested. This approach is a development of the Analytic Hierarchy Process enabling the united consideration of all horizontal and vertical connections of a hierarchical system in a single optimizing objective function based on statistical models of the synthesis process. The solution can be reduced to a linear system or to an eigenproblem of a special matrix constructed as a combination of Kronecker's sums and products of pairwise judgement matrices. A numerical example shows that the optimizing approach produces a ranking of global priorities that may be different from the ranking produced by the classical AHP.     

A new approach for weight derivation using data envelopment analysis in the analytic hierarchy process

Recently, some researches have been carried out in the context of using data envelopment analysis (DEA) models to generate local weights of alternatives from pairwise comparison matrices used in the analytic hierarchy process (AHP). One of these models is the DEAHP. The main drawback of the DEAHP is that it generates counter-intuitive priority vectors for inconsistent pairwise comparison matrices. To overcome the drawbacks of the DEAHP, this paper proposes a new procedure entitled Revised DEAHP, and it will be shown that this procedure generates logical weights that are consistent with the decision maker's judgements and is sensitive to changes in data of the pairwise comparison matrices. Through a numerical example, it will be shown that the Revised DEAHP not only produces correct weights for inconsistent matrices but also does not suffer from rank reversal when an irrelevant alternative is added or removed.     

Estimation of missing judgments in AHP pairwise matrices using a neural network-based model

Selecting relevant features to make a decision and expressing the relationships between these features is not a simple task. The decision maker must precisely define the alternatives and criteria which are more important for the decision making process. The Analytic Hierarchy Process (AHP) uses hierarchical structures to facilitate this process. The comparison is realized using pairwise matrices, which are filled in according to the decision maker judgments. Subsequently, matrix consistency is tested and priorities are obtained by calculating the matrix principal eigenvector. Given an incomplete pairwise matrix, two procedures must be performed: first, it must be completed with suitable values for the missing entries and, second, the matrix must be improved until a satisfactory level of consistency is reached. Several methods are used to fill in missing entries for incomplete pairwise matrices with correct comparison values. Additionally, once pairwise matrices are complete and if comparison judgments between pairs are not consistent, some methods must be used to improve the matrix consistency and, therefore, to obtain coherent results. In this paper a model based on the Multi-Layer Perceptron (MLP) neural network is presented. Given an AHP pairwise matrix, this model is capable of completing missing values and improving the matrix consistency at the same time.     

Interval estimation of priorities in the AHP

This paper extends and modifies the Analytic Hierarchy Process (AHP) and the Synthetic Hierarchy Method (SHM) of priority estimation to accommodate random data in the pairwise comparison matrices. It employs a Cauchy distribution to describe the pairwise comparison of alternatives in Saaty matrices, and shows how to modify these matrices in order to handle random data. The use of random data yields Saaty matrices that are not reciprocally symmetrical. Several variants of the AHP are then modified (i) to accommodate reciprocally asymmetric matrices, and (ii) to allow each priority estimate to be expressed on an interval of possible values, rather than as a single discrete point. The merits of interval estimation are illustrated by an example.     

A probabilistic interpretation of the final rankings in AHP

The Analytic Hierarchy Process (AHP) has become a popular and practical tool for dealing with complex decision problems. It provides a ranking for the decision alternatives. This article recommends treating the pairwise comparison input data as random variables. This will allow the determination of whether the differences between alternatives are statistically significant.     

Multi-criteria decision making with fuzzy linguistic preference relations

Although the analytic hierarchy process (AHP) and the extent analysis method (EAM) of fuzzy AHP are extensively adopted in diverse fields, inconsistency increases as hierarchies of criteria or alternatives increase because AHP and EAM require rather complicated pairwise comparisons amongst elements (attributes or alternatives). Additionally, decision makers normally find that assigning linguistic variables to judgments is simpler and more intuitive than to fixed value judgments. Hence, Wang and Chen proposed fuzzy linguistic preference relations (Fuzzy LinPreRa) to address the above problem. This study adopts Fuzzy LinPreRa to re-examine three numerical examples. The re-examination is intended to compare our results with those obtained in earlier works and to demonstrate the advantages of Fuzzy LinPreRa. This study demonstrates that, in addition to reducing the number of pairwise comparisons, Fuzzy LinPreRa also increases decision making efficiency and accuracy.     

A Thurstonian view of the analytic hierarchy process

The application of deterministic decision models in situations characterized by noise and uncertainty is likely to produce results of questionable value. In this paper, some very simple probabilistic models are developed and substituted for the deterministic scales used in the Analytic Hierarchy Process (AHP). It is shown that the use of these probabilistic models can extend the domain of AHP to situations, such as consensual or group decision making, that possess significant amounts of uncertainty. In addition, explicit measures of the variation present in the evaluation of decision alternatives and attributes are obtained.     

Strong reciprocity and strong consistency in pairwise comparison matrix with fuzzy elements

The decision making problem considered in this paper is to rank n alternatives from the best to the worst, using the information given by the decision maker in the form of an \(n\times n\) pairwise comparison matrix. Here, we deal with pairwise comparison matrices with fuzzy elements. Fuzzy elements of the pairwise comparison matrix are applied whenever the decision maker is not sure about the value of his/her evaluation of the relative importance of elements in question. We investigate pairwise comparison matrices with elements from abelian linearly ordered group (alo-group) over a real interval. The concept of reciprocity and consistency of pairwise comparison matrices with fuzzy elements have been already studied in the literature. Here, we define stronger concepts, namely the strong reciprocity and strong consistency of pairwise comparison matrices with fuzzy intervals as the matrix elements (PCF matrices), derive the necessary and sufficient conditions for strong reciprocity and strong consistency and investigate their properties as well as some consequences to the problem of ranking the alternatives.     

A simulation approach for handling uncertainty in the analytic hierarchy process

Uncertainty considerations are introduced into the analytic hierarchy process (AHP). The rank order of decision alternatives depends on two types of related uncertainties: (1) uncertainty regarding the future characteristics of the decision making environment described by a set of scenarios, and (2) uncertainty associated with the decision making judgment regarding each pairwise comparison. A simulation approach for handling both types of related uncertainties in the AHP is described. The example introduced by Saaty and Kearns (1985) is extended here to include uncertainty considerations.     

A geometric averaging procedure for constructing supertransitive approximation to binary comparison matrices

The usefulness of encoding the fuzzy evaluations of alternatives and the importance weights of criteria, in a multiple objective decision problem through binary comparison matrices (or pairwise judgment matrices) is receiving considerable attention. The methodology for identifying the best alternative in a given decision problem involves the computation of the principal eigenvectors of the binary comparison matrices. The eigenvectors transform the fuzzy evaluations of the importance of the criteria and the ratings of the alternatives into a ratio scale. A difficulty that is often experienced in using this approach in practice, is the inconsistency of the binary evaluations. This paper proposes a simple averaging procedure to construct a supertransitive approximation to a binary comparison matrix, where inconsistency is a problem. It is further suggested that such an adjustment might be necessary to more closely reflect the inherent fuzziness of the evaluations contained in a binary comparison matrix. The procedure is illustrated by means of examples.     

A fuzzy programming method for deriving priorities in the analytic hierarchy process

The estimation of the priorities from pairwise comparison matrices is the major constituent of the Analytic Hierarchy Process (AHP). The priority vector can be derived from these matrices using different techniques, as the most commonly used are the Eigenvector Method (EVM) and the Logarithmic Least Squares Method (LLSM). In this paper a new Fuzzy Programming Method (FPM) is proposed, based on geometrical representation of the prioritisation process. This method transforms the prioritisation problem into a fuzzy programming problem that can easily be solved as a standard linear programme. The FPM is compared with the main existing prioritisation methods in order to evaluate its performance. It is shown that it possesses some attractive properties and could be used as an alternative to the known prioritisation methods, especially when the preferences of the decision-maker are strongly inconsistent.     

On the use of information criteria in analytic hierarchy process

In this article, we discuss how the model-selection procedures such as Akaike's information criteria (AIC) can be used for selecting the most appropriate one out of several existing statistical models in the literature for the judgment data used in analytic hierarchy process (AHP). Furthermore, once the appropriate model is selected, a procedure is proposed on the basis of AIC for statistical ranking of the alternatives. This ranking procedure does not suffer from the problem of intransitivity and can be based on non-normal distribution. It enables one to obtain the detailed pattern for the ordered priorities of the alternatives in the decision process involving AHP.     

The Analytic Hierarchy Process in an uncertain environment: A simulation approach

Traditionally, decision makers were forced to converge ambiguous judgments to a single point estimate in order to describe a pairwise relationship between alternatives relative to some criterion for use in the Analytic Hierarchy Process (AHP). Since many circumstances exist which make such a convergence difficult, confidence in the outcome of an ensuing AHP synthesis may be reduced. Likewise, when a group of decision makers cannot arrive at a consensus regarding a judgment, some members of the group may simply lose confidence in the overall synthesis if they lack faith in some of the judgments. The AHP utilizes point estimates in order to derive the relative weights of criteria, sub-criteria, and alternatives which govern a decision problem. However, when point estimates are difficult to determine, distributions describing feasible judgments may be more appropriate. Using simulation, we will demonstrate that levels of confidence can be developed, expected weights can be calculated and expected ranks can be determined. It will also be shown that the simulation approach is far more revealing than traditional sensitivity analysis.     

An intelligent decomposition of pairwise comparison matrices for large-scale decisions

A Pairwise Comparison Matrix (PCM) has been used to compute for relative priorities of elements and are integral components in widely applied decision making tools: the Analytic Hierarchy Process (AHP) and its generalized form, the Analytic Network Process (ANP). However, PCMs suffer from several issues limiting their applications to large-scale decision problems. These limitations can be attributed to the curse of dimensionality, that is, a large number of pairwise comparisons need to be elicited from a decision maker. This issue results to inconsistent preferences due to the limited cognitive powers of decision makers. To address these limitations, this research proposes a PCM decomposition methodology that reduces the elicited pairwise comparisons. A binary integer program is proposed to intelligently decompose a PCM into several smaller subsets using interdependence scores among elements. Since the subsets are disjoint, the most independent pivot element is identified to connect all subsets to derive the global weights of the elements from the original PCM. As a result, the number of pairwise comparison is reduced and consistency is of the comparisons is improved. The proposed decomposition methodology is applied to both AHP and ANP to demonstrate its advantages.     

A comparative study of the numerical scales and the prioritization methods in AHP

In the analytic hierarchy process (AHP), a decision maker first gives linguistic pairwise comparisons, then obtains numerical pairwise comparisons by selecting certain numerical scale to quantify them, and finally derives a priority vector from the numerical pairwise comparisons. In particular, the validity of this decision-making tool relies on the choice of numerical scale and the design of prioritization method. By introducing a set of concepts regarding the linguistic variables and linguistic pairwise comparison matrices (LPCMs), and by defining the deviation measures of LPCMs, we present two performance measure algorithms to evaluate the numerical scales and the prioritization methods. Using these performance measure algorithms, we compare the most common numerical scales (the Saaty scale, the geometrical scale, the Ma–Zheng scale and the Salo–Hämäläinen scale) and the prioritization methods (the eigenvalue method and the logarithmic least squares method). In addition, we also discuss the parameter of the geometrical scale, develop a new prioritization method, and construct an optimization model to select the appropriate numerical scales for the AHP decision makers. The findings in this paper can help the AHP decision makers select suitable numerical scales and prioritization methods.