الگوریتم دو مرحله ای برای ایجاد توافق در تصمیم گیری تحلیل سلسله مراتبی ـ گروهی
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|6319||2013||13 صفحه PDF||سفارش دهید||7310 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Applied Mathematical Modelling, Volume 37, Issues 10–11, 1 June 2013, Pages 6670–6682
Group decision making through the AHP has received significant attention in contemporary research, the primary focus of which has been on the issues of consistency and consensus building. In this paper, we concentrate on the latter and present a two-phase algorithm based on the optimal clustering of decision makers (members of a group) into sub groups followed by consensus building both within sub groups and between sub groups. Two-dimensional Sammon’s mapping is proposed as a tool for generating an approximate visualization of sub groups identified in multidimensional vector space, while the consensus convergence model is suggested for reaching agreement amongst individuals in and between sub groups. As a given, all decision makers evaluate the same decision elements within the AHP framework and produce individual scores of these decision elements. The consensual scores are obtained through the iterative procedure and the final scores are declared as the group decision. The results of two selected numerical examples are compared with two sets of results: the results obtained by the commonly used geometric mean aggregation method and also the results obtained if the consensus convergence model is applied directly without the prior clustering of the decision makers. The comparisons indicated the expected differences among the aggregation schemes and the final group scores. The matrices of respect values in the consensus convergence model, obtained for cases when the decision makers are optimally clustered and when they are not, show that in the latter case the decision makers receive lower weights of respect from other members in the group. Various tests showed that our approach is efficient in cases when no clusters can be visually and undoubtedly identified, especially if the number of group members is high.
The Analytic Hierarchy Process (AHP)  is a widely used multi-criteria tool in group decision making. It involves the structuring of a decision problem as a hierarchy and pair-wise comparisons between decision elements to obtain their weights of importance. The final result is a hierarchy with the vector of alternatives’ weights at the bottom level and a goal at the top hierarchy level. The philosophy of AHP is to synthesize in a downward direction the weights computed from local pair-wise comparison matrices created by the decision maker (DM) at all levels of a hierarchy. The DM can be a personalized individual or a virtual individual representing a group of personalized individuals. In either case, AHP assumes dealing with a hierarchy of at least three levels (goal-criteria-alternatives) and a weighted synthesis of local vectors until the bottom level containing the alternatives is reached. The final vector has entries being global weights of alternatives with respect to a goal. At the local level of a hierarchy, one comparison matrix is considered at a time. By using a certain ratio scale, i.e. Saaty’s 9-point scale, the DM mutually compares decision elements. Any of the prioritization methods described in Ref.  can be employed to derive the weights of compared elements and consider these weights as entries of the so-called local priority vector. Unless a complete hierarchy is considered, the described process can be labeled as ‘deriving priorities of decision elements in the manner of AHP’. Only the synthesis of more local priority vectors, which actually occurs if there are at least three levels in a hierarchy, deserves to be declared as ‘deriving priorities of alternatives by the AHP’. In both cases it is common that at a given stage there will be a computed priority vector w = (w1, w2, … , wn) containing the weights of the compared n decision elements, and this is a starting point for the proposed two-stage algorithm for building consensus in AHP-group decision making. The group decision making context implies that any group or sub group of DMs can set the weights of elements in a hierarchy through compromise, consensus, voting, direct weighted arithmetic or geometric mean aggregation, individual judgments or priorities, or by other such means. Any of these methods can be time consuming and can produce different final results, or, in some cases, may end-up without a final decision. On the other hand, well-known weighted arithmetic and geometric aggregation schemes require prior definition of the weights of importance of the members in a group and may lead to a final result which the participants do not feel to be their own. Assigning weights to the participants is even more problematic if there are many of them. An option in group decision making is to derive the final group decision by building a consensus, classically defined as the full and unanimous agreement of all the DMs regarding all the possible alternatives . There are formal mathematical methods for reaching the consensus. Inspired by Chiclana et al.’s  framework for integrating individual consistency into consensus models, Dong et al.  developed two AHP consensus models under the row geometric mean method . The consensus indices are defined to measure the degree of consensus among judgment matrices (or DMs) and simulation experiments are presented which show that the proposed models can improve the consensus indices of judgment matrices and help AHP decision makers reach a consensus. It is argued that their proposal has two desired features: firstly, that in reaching a consensus, the adjusted judgment matrix has a better individual consistency index (i.e. geometric consistency index) than the corresponding original judgment matrix; and secondly, that their proposal satisfies the Pareto principle of social choice theory. Both arguments, in our opinion, deserve continued discussion. Namely, our experiments with Dong et al.’s  consensus model showed that adjustments of judgment matrices for larger groups of decision makers can be very time consuming. That is, the convergence process is very slow because of too many iterations. On the other hand, satisfaction of the Pareto principle in an AHP-group context is an issue that is weakly connected with the social choice theory, which also deserves attention in future research. There are other mathematical models aimed to build consensus of individuals participating in the decision making group, such as consensus convergence modeling or central tendency methods (middle ‘value’ is measured using the mean, median or mode). One of the best known formal models is the consensus convergence model , where, by repeatable mathematical procedure and through a mutual respect based on local or final priority vectors of decision elements, the decision makers do not only achieve consensus on the issue under consideration but also agree on the overall relative weight of each group member. This model is considered as a suitable conflict resolution method in management problems because its mathematical structure captures a typical situation of disagreement, and refusing to change one’s opinion would, in mathematical terms, be equivalent to assigning a null weight to all other members and full weight to one’s self . However, this situation is one of pure dogmatism that is unacceptable in modern decision making. In reality, a group is usually heterogeneous, i.e. composed of DMs different in age, gender, attitudes, interests and/or knowledge regarding the problem at hand. Although diversity stimulates creativity and leads in turn to improved decision making, making a true decision becomes a difficult task and is sometimes confusing due to that same diversity. If DMs provide more or less homogeneous responses, decision making becomes more realistic and consistent . There are many different approaches employed in order to cluster DMs, recently based on data envelopment analysis , genetic algorithms , variable precision rough set model , and fuzzy sets  and . Although it would aid in identifying optimal decision groups to visualize clusters of DMs identified within the decision group, only a few papers concentrate on this issue , ,  and . For example, in Condon et al.  Sammon’s mapping is used to cluster eight DMs from the government agency in order to recognize outliers and to encourage DMs to be forthcoming and objective. The major objective of this paper is to point out how information obtained by the decision makers, namely their local or final priority vectors, can be aggregated, i.e. used to reach the consensus based group decision. We propose to gather DMs into an optimal number of clusters (sub groups) by using their individually computed priority vectors at a given level of the AHP hierarchy. If the number of entries in a vector is n, an optimal clustering should be performed in original n-dimensional (nD) vector space rather than in 2D space, which is possible, e.g., if Sammon’s mapping is employed. Given optimally created sub groups of DMs, the final group decision (the group priority vector) is derived by the consensus convergence model in two phases: firstly, by reaching consensus within each sub group, and secondly, by reaching consensus between sub groups. The paper is organized as follows. In Section 2, preliminary knowledge on AHP is briefly presented, followed by a short description of the main features of the multidimensional optimal clustering we used in our approach and two dimensional (Sammon’s) mapping, which is convenient and especially useful for visualizing positions of DMs and their clusters. The second part of the section focuses on the main features of the consensus convergence model. Section 3 presents a detailed description of the proposed two-phase consensus building algorithm in AHP-group decision making. Two numerical examples are described in Section 4, the first one being a real-life decision making problem with a complete three-level AHP hierarchy. The results of the applied two-phase algorithm are presented for a fully structured problem and the participation of six DMs in evaluating four irrigation technologies against six conflicting criteria. The second example is provided for a single judgment matrix with five decision elements and 12 DMs. Although this example also comes from a practice, it is presented herein only in numerical form for proof-of-concept reasons. Main conclusions and a review of pertinent literature are given at the end of the paper.
نتیجه گیری انگلیسی
The decision making process nowadays involves many, usually conflicting, criteria with different metrics and also multiple actors. One of the most widely used multi-criteria methods in the group decision making context is the Analytic Hierarchy Process (AHP). In this method, the decision makers express their preferences using judgment matrices (i.e. multiplicative preference relations) and by so-called prioritizations they come up with the cardinal values (i.e. weights) of decision elements used in expressing their preferences. For the given sets of weights derived for each decision maker participating in a group, we developed an approach as a two-phase algorithm that exploits multidimensional optimal clustering of the decision makers’ outputs (priority vectors) and then builds consensus both inside the clusters and between clusters. This way, the final group decision is obtained as a consensual one, with an imposed association of weights of respect during the consensus building process. The core of the developed algorithm is the consensus convergence formal mathematical method that uses philosophical foundations in the structure of negotiation and in consensus building to aggregate group members’ values in a way that guarantees convergence towards a single consensual value which summarizes the group position. If the group is homogeneous, the decision making process becomes more realistic and consistent, so we used AHP derived priorities as points in multidimensional vector space to cluster decision makers prior to the application of the consensus convergence model. In turn, we suggested employing Sammon’s mapping as well to enable visualization of clusters and belonging points (decision makers).The proposed algorithm has been applied on a real case study that dealt with selection of the most suitable irrigation technology by six DMs. It was easy to implement the algorithm in computerized form and to make it fully transparent to participating individuals. The results are compared with the group decision obtained if the weighted geometric mean aggregation of individual priorities is performed, and if the consensus convergence model is applied without clustering. Comparisons indicated differences in the ranking of the irrigation technologies. Inspection of matrices of respect within an algorithm application framework showed that if DMs are optimally clustered, they receive higher weights of respect by other participants than if they act as individuals. An additional numerical example is provided for the proof-of-concept reasons with the intention of pointing out the cases that involve when clustering DMs is not obvious by only implementing Sammon’s mapping, but rather by employing a multidimensional clustering algorithm and directly identifying the optimal number of clusters and their belonging elements (decision makers). For the sake of completeness, it should be noted that the presented algorithm is directly applicable if there are priority vectors for a given set of individuals participating in the decision making group, regardless of any previous knowledge on which prioritization method is used or how consistent decision makers were. In addition, the proposed algorithm can be combined with Dong et al.’s  consensus model if the logarithmic least square (LLS) method is used for prioritization, and consistency controlled adjustments of judgment matrices are performed within sub groups once they are optimally identified. Future research focused on the effectiveness of coupling our two consensual AHP-group approaches could be very promising.