An integrated approach for deriving priorities in analytic network process

A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an inconsistent situation. The weakness of the ANP and fuzzy ANP (FANP) is that the complexity of generating priorities is equal to the number of comparison matrices. In the proposed approach, all sets of crisp priorities for each pairwise comparison matrix can be obtained directly. Moreover, from the outcomes of three examples, the power to reach a limiting supermatrix is less than or equal to the power of the FANP. Thus, the proposed approach can be regarded as an efficient alternative of the fuzzy ANP.     

A chi-square method for obtaining a priority vector from multiplicative and fuzzy preference relations

Decision makers (DMs)’ preferences on decision alternatives are often characterized by multiplicative or fuzzy preference relations. This paper proposes a chi-square method (CSM) for obtaining a priority vector from multiplicative and fuzzy preference relations. The proposed CSM can be used to obtain a priority vector from either a multiplicative preference relation (i.e. a pairwise comparison matrix) or a fuzzy preference relation or a group of multiplicative preference relations or a group of fuzzy preference relations or their mixtures. Theorems and algorithm about the CSM are developed. Three numerical examples are examined to illustrate the applications of the CSM and its advantages.     

On the extent analysis method for fuzzy AHP and its applications

In a paper by Chang [D.Y. Chang, Applications of the extent analysis method on fuzzy AHP, European Journal of Operational Research 95 (1996) 649–655], an extent analysis method on fuzzy AHP was proposed to obtain a crisp priority vector from a triangular fuzzy comparison matrix. It is found that the extent analysis method cannot estimate the true weights from a fuzzy comparison matrix and has led to quite a number of misapplications in the literature. In this paper, we show by examples that the priority vectors determined by the extent analysis method do not represent the relative importance of decision criteria or alternatives and that the misapplication of the extent analysis method to fuzzy AHP problems may lead to a wrong decision to be made and some useful decision information such as decision criteria and fuzzy comparison matrices not to be considered. We show these problems to avoid any possible misapplications in the future.     

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.     

A new method for ranking fuzzy numbers and its application to group decision making

In this paper, a new method for comparing fuzzy numbers based on a fuzzy probabilistic preference relation is introduced. The ranking order of fuzzy numbers with the weighted confidence level is derived from the pairwise comparison matrix based on 0.5-transitivity of the fuzzy probabilistic preference relation. The main difference between the proposed method and existing ones is that the comparison result between two fuzzy numbers is expressed as a fuzzy set instead of a crisp one. As such, the ranking order of n fuzzy numbers provides more information on the uncertainty level of the comparison. Illustrated by comparative examples, the proposed method overcomes certain unreasonable (due to the violation of the inequality properties) and indiscriminative problems exhibited by some existing methods. More importantly, the proposed method is able to provide decision makers with the probability of making errors when a crisp ranking order is obtained. The proposed method is also able to provide a probability-based explanation for conflicts among the comparison results provided by some existing methods using a proper ranking order, which ensures that ties of alternatives can be broken.     

Multi-criteria supplier segmentation using a fuzzy preference relations based AHP

One of the strategic activities of a firm is supplier segmentation, whereby a firm creates groups of suppliers to handle them differently. Existing literature provides several typologies of suppliers, each of which uses different dimensions/variables. In this paper, different typologies are combined by distinguishing two overarching dimensions, the capabilities and the willingness of suppliers to cooperate with a particular firm. These dimensions cover almost all the existing supplier segmentation criteria mentioned in existing literature. For each particular situation, these dimensions can be specified using a multi-criteria decision-making method. A methodology is proposed that includes a fuzzy Analytic Hierarchy Process (AHP) which uses fuzzy preference relations to incorporate the ambiguities and uncertainties that usually exist in human judgment. The proposed methodology is used to segment the suppliers of a broiler company. The result is a segmentation of suppliers based on two aggregated dimensions. Finally some strategies to handle different segments are discussed and concluding remarks and suggestions for future research are provided.     

部分权重信息下对方案有互补偏好的多属性决策法

研究了只有部分权重信息且对方案的偏好信息以模糊互补判断矩阵形式给出的多属性决策问题.首先,基于模糊互补判断矩阵的主观偏好信息,利用转换函数将客观决策信息一致化,建立一个目标规划模型,通过求解该模型得到属性权重,从而利用加性加权法获得各方案的综合属性值,并以此对方案进行排序或择优.提出了一种基于目标规划的多属性决策方法.该方法具有操作简便和易于上机实现的特点.最后,通过实例说明模型及方法的可行性和有效性.     

2-order additive fuzzy measure identification method based on diamond pairwise comparison and maximum entropy principle

Fuzzy measures can flexibly describe the relative importance of decision criterion as well as their interactions in multicriteria decision making. Based on the diamond pairwise comparison, a new identification method of 2-order additive fuzzy measure is proposed. The relative weight and the interaction degree can be obtained simultaneously for every pair of criteria in the diamond pairwise comparison. The Choquet integral-based equivalent alternative curve can help the decision maker estimate the interaction degrees between criteria. The overall importance of each criterion is obtained by the maximum eigenvector method of AHP. According to the maximum fuzzy measure entropy principal, a nonlinear programming is constructed to identify the interaction indices among criteria. Finally, an illustrative example shows the feasibility and validity of the proposed identification method.     

基于模糊语言判断矩阵和FIOWA算子的有限方案决策法

定义一种模糊的导出有序加权平均(FIOWA)算子，给出方案之间比较的模糊语言标度。运用模糊语言标度构造出模糊语言判断矩阵，并提出一种基于模糊语言判断矩阵和FIOWA算子的有限方案决策方法。该法利用FIOWA算子对模糊语言信息进行集结，并利用已有的三角模糊数排序公式求得决策方案的排序。     

A hybrid model for selection of an outsourcing provider

Outsourcing is a good strategy for firms that need to reduce operating costs and improve competitiveness and it is important that firms scientifically select appropriate outsourcing providers. Some efforts have been made to find systematic ways to deal with outsourcing problems, but these efforts incorrectly assumed that the criteria used in the decision process are independent, which is not true in the real world. In this study, we propose a new hybrid multiple criteria decision-making (MCDM) model, which addresses the dependent relationships between the various criteria. The relations-structure among the criteria is built with the aid of the decision-making trial and evaluation laboratory (DEMATEL) method. Decision-makers tend to hold diverse opinions about their preferences due to incomplete information and knowledge, or inherent conflict between various departments. We further used the fuzzy preference programming and the analytic network process (ANP) to form a model for the selection of partners for outsourcing providers. The proposed model can help practitioners improve their decision making process, especially when criteria are numerous and inter-related. The method is demonstrated using data from a Taiwanese airline.     

A fuzzy goal programming approach to multi-objective optimization problem with priorities

In goal programming problem, the general equilibrium and optimization are often two conflicting factors. This paper proposes a generalized varying-domain optimization method for fuzzy goal programming (FGP) incorporating multiple priorities. According to the three possible styles of the objective function, the varying-domain optimization method and its generalization are proposed. This method can generate the results consistent with the decision-maker (DM)’s expectation, that the goal with higher priority may have higher level of satisfaction. Using this new method, it is a simple process to balance between the equilibrium and optimization, and the result is the consequence of a synthetic decision between them. In contrast to the previous method, the proposed method can make that the higher priority achieving the higher satisfactory degree. To get the global solution of the nonlinear nonconvex programming problem resulting from the original problem and the varying-domain optimization method, the co-evolutionary genetic algorithms (GAs), called GENOCOPIII, is used instead of the SQP method. In this way the DM can get the optimum of the optimization problem. We demonstrate the power of this proposed method by illustrative examples.     

Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method

We present a method called Generalized Regression with Intensities of Preference (GRIP) for ranking a finite set of actions evaluated on multiple criteria. GRIP builds a set of additive value functions compatible with preference information composed of a partial preorder and required intensities of preference on a subset of actions, called reference actions. It constructs not only the preference relation in the considered set of actions, but it also gives information about intensities of preference for pairs of actions from this set for a given decision maker (DM). Distinguishing necessary and possible consequences of preference information on the considered set of actions, GRIP answers questions of robustness analysis. The proposed methodology can be seen as an extension of the UTA method based on ordinal regression. GRIP can also be compared to the AHP method, which requires pairwise comparison of all actions and criteria, and yields a priority ranking of actions. As for the preference information being used, GRIP can be compared, moreover, to the MACBETH method which also takes into account a preference order of actions and intensity of preference for pairs of actions. The preference information used in GRIP does not need, however, to be complete: the DM is asked to provide comparisons of only those pairs of reference actions on particular criteria for which his/her judgment is sufficiently certain. This is an important advantage comparing to methods which, instead, require comparison of all possible pairs of actions on all the considered criteria. Moreover, GRIP works with a set of general additive value functions compatible with the preference information, while other methods use a single and less general value function, such as the weighted-sum.     

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.     

Enhanced interactive satisficing method via alternative tolerance for fuzzy goal programming with progressive preference

This paper proposes an enhanced interactive satisficing method via alternative tolerance for fuzzy goal programming with progressive preference. The alternative tolerances of the fuzzy objectives with three types of fuzzy relations are used to model progressive preference of decision maker. In order to improve the dissatisficing objectives, the relaxed satisficing objectives are sacrificed by modifying their tolerant limits. By means of attainable reference point, the auxiliary programming is designed to generate the tolerances of the dissatisficing objectives for ensuring feasibility. Correspondingly, the membership functions are updated or the objective constraints are added. The Max–Min goal programming model (or the revised one) and the test model of the M-Pareto optimality are solved lexicographically. By our method, the dissatisficing objectives are improved iteratively till the preferred result is acquired. Illustrative examples show its power.     

A parametric GP model dealing with incomplete information for group decision-making

We consider a group decision-making problem where preferences given by the experts are articulated into the form of pairwise comparison matrices. In many cases, experts are not able to efficiently provide their preferences on some aspects of the problem because of a large number of alternatives, limited expertise related to some problem domain, unavailable data, etc., resulting in incomplete pairwise comparison matrices. Our goal is to develop a computational method to retrieve a group priority vector of the considered alternatives dealing with incomplete information. For that purpose, we have established an optimization problem in which a similarity function and a parametric compromise function are defined. Associated to this problem, a logarithmic goal programming formulation is considered to provide an effective procedure to compute the solution. Moreover, the parameters involved in the method have a clear meaning in the context of group problems.     

A Goal Programming Method for Generating Priority Vectors

The generation of priority vectors from pairwise comparison information is an integral part of the Analytic Hierarchy Process (AHP). Traditionally, either the right eigenvector method or the logarithmic least squares method have been used. In this paper, a goal programming method (GPM) is presented that has, as its objective, the generation of the priority vector whose associated comparison values are, on average, the closest to the pairwise comparison information provided by the evaluator. The GPM possesses the properties of correctness in the consistent case, comparison order invariance, smoothness, and power invariance. Unlike other methods, it also possesses the additional property that the presence of a single outlier cannot prevent the identification of the correct priority vector. The GPM also has a pair of naturally meaningful consistency indicators that offer the opportunity for empowering the decision maker. The GPM is thus an attractive alternative to other proposed methods.     

Inferring consensus weights from pairwise comparison matrices without suitable properties

Pairwise comparison is a popular method for establishing the relative importance of n objects. Its main purpose is to get a set of weights (priority vector) associated with the objects. When the information gathered from the decision maker does not verify some rational properties, it is not easy to search the priority vector. Goal programming is a flexible tool for addressing this type of problem. In this paper, we focus on a group decision-making scenario. Thus, we analyze different methodologies for getting a collective priority vector. The first method is to aggregate general pairwise comparison matrices (i.e., matrices without suitable properties) and then get the priority vector from the consensus matrix. The second method proposes to get the collective priority vector by formulating an optimization problem without determining the consensus pairwise comparison matrix beforehand.     

Fuzzy goal programming with nested priorities

This paper proposes a new approach to formulating fuzzy priorities in a goal programming problem. The proposed methodology remedies certain shortcomings of the composite membership function approach discussed in previous works [7, 10]. The principal advantage of the proposed method is that it leads to a formulation in which tradeoffs between goals more closely reflect the decision maker's intentions than in other noninteractive approaches [8, 9, 10, 14], in some of which a fixed hierarchy of goals is assumed.     

Extension of the LINMAP for multiattribute decision making under Atanassov’s intuitionistic fuzzy environment

The aim of this article is further extending the linear programming techniques for multidimensional analysis of preference (LINMAP) to develop a new methodology for solving multiattribute decision making (MADM) problems under Atanassov’s intuitionistic fuzzy (IF) environments. The LINMAP only can deal with MADM problems in crisp environments. However, fuzziness is inherent in decision data and decision making processes. In this methodology, Atanassov’s IF sets are used to describe fuzziness in decision information and decision making processes by means of an Atanassov’s IF decision matrix. A Euclidean distance is proposed to measure the difference between Atanassov’s IF sets. Consistency and inconsistency indices are defined on the basis of preferences between alternatives given by the decision maker. Each alternative is assessed on the basis of its distance to an Atanassov’s IF positive ideal solution (IFPIS) which is unknown a prior. The Atanassov’s IFPIS and the weights of attributes are then estimated using a new linear programming model based upon the consistency and inconsistency indices defined. Finally, the distance of each alternative to the Atanassov’s IFPIS can be calculated to determine the ranking order of all alternatives. A numerical example is examined to demonstrate the implementation process of this methodology. Also it has been proved that the methodology proposed in this article can deal with MADM problems under not only Atanassov’s IF environments but also both fuzzy and crisp environments.     

Deriving crisp and consistent priorities for fuzzy AHP-based multicriteria systems using non-linear constrained optimization

Fuzzy optimization models are used to derive crisp weights (priority vectors) for the fuzzy analytic hierarchy process (AHP) based multicriteria decision making systems. These optimization models deal with the imprecise judgements of decision makers by formulating the optimization problem as the system of constrained non linear equations. Firstly, a Genetic Algorithm based heuristic solution for this optimization problem is implemented in this paper. It has been found that the crisp weights derived from this solution for fuzzy-AHP system, sometimes lead to less consistent or inconsistent solutions. To deal with this problem, we have proposed a consistency based constraint for the optimization models. A decision maker can set the consistency threshold value and if the solution exists for that threshold value then crisp weights can be derived, otherwise it can be concluded that the fuzzy comparison matrix for AHP is not consistent for the given threshold. Three examples are considered to demonstrate the effectiveness of the proposed method. Results with the proposed constraint based fuzzy optimization model are more consistent than the existing optimization models.