Next Article in Journal
Fractional-Order Grey Prediction Method for Non-Equidistant Sequences
Previous Article in Journal
Nano-Crystallization of High-Entropy Amorphous NbTiAlSiWxNy Films Prepared by Magnetron Sputtering
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Information-Theoretic-Entropy Based Weight Aggregation Method in Multiple-Attribute Group Decision-Making

School of Humanities and Economic Management, China University of Geosciences, Beijing 100083, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Submission received: 18 March 2016 / Revised: 26 April 2016 / Accepted: 29 April 2016 / Published: 14 June 2016

Abstract

:
Weight aggregation is the key process to solve a multiple-attribute group decision-making (MAGDM) problem. This paper is trying to propose a possible approach to objectivize subjective information and to aggregate information from attribute values themselves and decision-makers’ judgment. An MAGDM problem without information about decision-makers’ and attributes’ weight is considered. In order to define decision-makers’ subjective preference, their utility function is introduced. The attributes value matrix is converted into a subjective attributes value matrix based on their subjective judgment on attribute values. By utilizing the entropy weighting technique, decision-maker’s subjective weight on attributes and objective weight on attributes are determined individually based on the subjective attributes value matrix and attributes value matrix. Based on the principle of minimum cross-entropy, all decision-makers’ subjective weights are integrated into a single weight vector that is closest to all decision-makers’ judgment without any extra information added. Then, by applying the principle of minimum cross-entropy again, a weight aggregation method is proposed to combine the subjective and objective weight of attributes. Finally, an MAGDM example of project choosing is presented to illustrate the procedure of the proposed method.

1. Introduction

Making decisions is a part of our daily routine. However, making the right decision has become more and more complicated as problems are growing in magnitude and longitude. More and more attributes of different alternatives must be considered or a group of decision-makers’ judgment needs to be collected. Multiple-attribute group decision-making (MAGDM) might be the most common, but complex problem in the decision science field, which has been regarded as one of the most significant activities in industry, service, business, etc.
Group decision-making (GDM) or collaborative decision-making is a situation faced when individuals collectively make a choice from the alternatives before them. The decisions made by groups are often different from those made by individuals. There is much debate as to whether this difference results in decisions that are better or worse, and factors that impact other social group behaviors also affect group decisions [1]. Moreover, consensus-reaching processes play an increasingly important role in the resolution of GDM problems: a solution acceptable to all of the experts participating in a problem is necessary in many real-life contexts. A large number of consensus approaches have been proposed to support groups in such processes (see [2,3,4]).
Multiple attribute decision-making (MADM) is an approach employed to solve problems involving selection from among a finite number of alternatives. An MADM method specifies how attribute information is to be processed in order to arrive at a choice. MADM methods require both inter- and intra-attribute comparisons and involve appropriate explicit tradeoffs [5]. Finding the appropriate weight for each attribute is one of the main points in MADM problems [6]. Since there might coexist attributes of a different (cost/benefit) and even a conflicting nature, it cannot be assumed that they all have equal weights, and many subjective and/or objective methods were proposed in the past, such as theanalytic hierarchy process (AHP) method, the weighted least squares method, the Delphi method, the entropy method, multiple objective programming, principle element analysis, etc.
Simply speaking, MAGDM could be regarded as a combination of MADM and GDM. The aim of MAGDM is to obtain the optimal alternative(s) or to rank the predefined alternatives from a given alternative set based on the information given by different decision-makers, where each alternative has multiple attributes [7]. To solve MAGDM problems, one has to consolidate all decision-makers’ preference information upon different attributes for each alternative. During this process, the key procedure is to determine and aggregate the weights of attributes and decision-makers’ power. The fundamental prerequisite of group decision-making is how to aggregate individual experts’ preference information on alternatives [8]. Information aggregation is a technique through which individual experts’ preferences can be combined into an overall one by using a proper aggregation technique.
In order to rank alternatives with more than one attribute, distance-based measures are widely-used approaches, and they have been studied by many researchers [9,10,11,12,13,14,15,16,17,18,19,20,21,22,23], which can be used to compare the alternatives with some ideal results. Through this comparison, the alternative that is closest to the ideal one is assumed to be the best [12,13,14]. Different distance-based measures have the same purpose to measure similarity or divergence between alternatives or attributes. Usually, when using distance measures in decision-making, one could normalize them by using the aggregation operators and obtain some distance measures, such as the Hamming distance measure [9,12], the Euclidean distance measure [13,15], the Minkowski distance measure [16], the ordered weighted distance measure [21,22], etc. All of these measures are applied in many different areas. In this paper, we assumed that distance-based measures are a kind of information divergence between attributes, which can be measured well by the entropy method.
Moreover, a variety of weight aggregation methods have been developed in the past few decades to our best knowledge. Among these methods, the ordered weighted averaging (OWA) operator introduced by [24] is the most widely-used one. The work in [25] introduced a continuous-ordered weighted averaging (COWA) operator in order to aggregate the interval arguments, which has attracted more and more attention from researchers [7,26,27,28,29,30].
From the literature, the different methods of decision-making and weight aggregation are based on different assumptions on the decision system, which, more or less, unavoidably added subjective or extra information to the decision system. Additionally, this added information may lead to an unreliable conclusion, though it may or may not influence the results of the decision. Hence, when solving MAGDM, we should avoid additional information as much as possible. Furthermore, it can be found that weight aggregation is of great importance in solving an MAGDM problem, and methods based on the distance measure have been playing a key role. In order to find an optimal decision in an MAGDM problem, one has to weight the importance of decision-makers and attributes to comprise all decision-makers’ judgment on alternatives and attributes. Therefore, solving an MAGDM problem is a process of integrating objective divergence from data and subjective divergence from decision-makers. First of all, an appropriate measure of divergence or a feasible distance measure is necessary. Cross-entropy is a widely-used approach to measure the divergence from one probability distribution to another without adding extra information. Therefore, this paper, referring to existing practices, views the weight vector as a probability distribution and applies cross-entropy to measure the mentioned divergences in an MAGDM problem. Secondly, in the weight aggregation procedure, it is a fundamental requirement to integrate all information from attributes and decision-makers without additional information. Information-theoretic entropy-based methods, such as the maximum entropy principle, minimum cross-entropy principle and the entropy weighting technique, can meet the requirement correctly. In consideration of this, we will try to utilize the minimum cross-entropy principle and entropy weighting technique to fulfil this demand.
In short, this paper will introduce a utility function to convert the attribute value matrix into the subjective attribute value matrix. Then, by using the entropy weighting technique, we obtain the subjective and objective weight, and by using the principle of minimum cross-entropy, an optimal model is established to aggregate weights in order to minimize the distance measure between subjective and objective weight. This study is completely based on the information entropy method and follows the general research framework of MAGDM, which provides a new way of thinking and a method for solving common MAGDM problems.
The rest of the paper is organized as follows. In Section 2, we briefly describe some preliminaries. Section 3 presents the weight determination method based on the entropy weighting technique and the weight aggregation model based on the principle of minimum cross-entropy. Section 4 provides an illustrative example. Section 5 concludes and summarizes the main conclusions.

2. Preliminaries

In this section, an MAGDM problem is set up and its general solving steps are discussed. Then, we briefly review the entropy weighting technique and the principle of minimum cross-entropy.

2.1. Procedures of Solving MAGDM

A multiple-attribute group decision-making problem can be defined as a quadruple < A , C , D , X > , where:
A = { a i | = 1 , 2 , , m } is the alternative set for every decision-maker and is indexed by i and m 2 ;
C = { c j | j = 1 , 2 , , n } is the attribute set for each alternative, and attributes are assumed to be additive and independent in this paper for simplicity;
D = { d k | k = 1 , 2 , , l } is the decision-maker set; and
X = { x i j | i = 1 , 2 , , m ; j = 1 , 2 , , n } is the normalized value of the j-th attribute for the i-th alternative, i.e.,
X = x 11 x 12 x 1 n x 21 x 22 x 2 n x m 1 x m 2 x m n
The matrix X is the objective value of attributes. However, every decision-maker may have their own judgment on these values based on his or her preference. Hence, all decision-makers’ judgment has to be integrated in order to solve an MAGDM problem. In this paper, we are going to introduce a utility function to express decision-makers’ preference in accordance with the general approach in decision theory. Let u k ( x ) be the k-th decision-maker’s utility function. Therefore, the problem confronted with the k-th decision-maker is:
U k = u k ( X ) = u k ( x 11 ) u k ( x 12 ) u k ( x 1 n ) u k ( x 21 ) u k ( x 22 ) u k ( x 2 n ) u k ( x m 1 ) u k ( x m 2 ) u k ( x m n ) , k = 1 , 2 , , l
which can be viewed as a multiple attribute decision problem for the k-th decision-maker.
The general process to solving an MAGDM problem can be described as follows. Assume that the weight of attributes determined by the k-th decision-maker’s judgment is denoted by β k = ( β 1 k , β 2 k , , β n k ) . Thus, on the basis of the assumption of additivity and the independence of attributes, the valuation of alternative a i by the k-th decision-maker is:
v i k = j = 1 n β j k u k ( x i j ) , i = 1 , 2 , , m
If the decision-makers’ importance is defined by a vector w = ( w 1 , w 2 , , w l ) , then the group decision on different alternatives is:
s i = k = 1 l w k v i k , i = 1 , 2 , , m
Based on the value of s i , the alternatives can be ranked or the optimal alternative can be determined.
In fact, by substituting Equation (3) into Equation (4), we can get that:
s i = k = 1 l w k j = 1 n β j k u k ( x i j ) = F ( w β ) G ( X )
The above equation demonstrates that the essence of solving an MAGDM problem can be formulated into the following four key procedures, which is depicted in Figure 1, as well.
In this paper, we will not investigate all of the procedures in Figure 1. Instead of that, we will focus on the critical procedures of Steps 2 and 3, namely determining and aggregating decision-makers’ and attributes’ weight.

2.2. Entropy Weighting Technique

The entropy weighting technique is a widely-used method to determine the weight of an attribute based on the differences between them without any additional or subjective information. The differences are measured by information-theoretic entropy.
Generally speaking, multiple attribute decision-making has m alternatives, and each alternative has n attributes. Let r i j be a non-negative value of the j-th attribute for the i-th alternative, such that a multiple attribute decision-making problem can be formalized into a matrix R as:
R = r 11 r 12 r 1 n r 21 r 22 r 2 n r m 1 r m 2 r m n
In the entropy weighting technique, the entropy-based difference of the j-th attribute between alternatives is viewed as the foundation to determine the weight of attributes. When the difference of two alternatives about the j-th attribute is small, then this attribute does not provide sufficient information to rank or distinguish the two alternatives. Therefore, the less is the difference, the smaller is the weight. Mathematically, the weight of the j-th attribute in Equation (6) can be calculated out as:
ω j = 1 - E j j = 1 n ( 1 - E j ) , j = 1 , 2 , , n
where E j is an extended and normalized entropy defined as:
E j = - 1 ln m i = 1 m r i j i = 1 m r i j ln r i j i = 1 m r i j , j = 1 , 2 , , n
It is easy to find that 0 ω j 1 and j = 1 n ω j = 1 according to the properties of entropy.

2.3. Principle of Minimum Cross-Entropy

Cross-entropy is a distance measure from one probability distribution to another. The principle of minimum cross-entropy (POMCE) was formulated by [31] and is detailed in [32]. Sometimes, it is also referred to as the Kullback–Leibler (K-L) principle. POMCE is also referred to as the principle of minimum discrimination information, the principle of minimum directed divergence, the principle of minimum distance or the principle of minimum relative entropy.
Let Q = { q 1 , q 2 , , q N } be a probability distribution for a random variable X that takes N values. POMCE is to derive a distribution P = { p 1 , p 2 , , p N } of X that takes all of the given information into consideration and makes the distribution as near to Q as possible. Mathematically, POMCE can be formulated as the following model.
min D ( P | | Q ) = i = 1 n p i ln p i q i s . t . i = 1 N p i = 1 i = 1 N p i f r i = a r , r = 1 , 2 , , k
where D ( P | | Q ) is the definition of cross-entropy, a r is some known information about random variable X and f r i are functions defined with respect to a r . More information and properties of cross-entropy and POMCE can be found in [33].
In fact, although it is often viewed as a metric of distance, the cross-entropy is not a true metric; for example, it is not symmetric: the cross-entropy from P to Q is generally not the same as that from Q to P. In spite of that, the cross-entropy is still a very important basic divergence measure for probability distribution divergence and is applied in many related fields. In this paper, we will continue to take the cross-entropy as the divergence measure to aggregate different information from attributes and decision-makers.

3. Weight Aggregation Model Based on POMCE

In an MAGDM problem, determining decision-makers’ weight and attributes’ weight objectively and aggregating weights plausibly is of great importance. In this paper, we will propose a weight determination and aggregation method based on the entropy weighting technique and the principle of minimum cross-entropy. The framework is presented in Figure 2.
First, the attribute value matrix X will be converted into U k by the decision-makers’ utility function, which is used to show their subjective judgment on different attributes. Second, by utilizing the entropy weighting method, the subjective attribute weight β k can be derived from U k , respectively. β k are viewed as subjective weight vectors because they are obtained from matrix U k , which is different decision-makers’ subjective judgment on attributes. Now, all β k can be formed into a subjective attribute weight matrix β . Then, in order to find a weight vector that can aggregate all decision-makers’ judgment on the attribute weight, a model based on POMCE is developed to integrate β k ’s into β 0 , which is thought of as the subjective weight vector of attributes integrating all decision-makers’ judgment. Meanwhile, objective attribute weight α can be also calculated out by the entropy weighting technique based on the attribute value matrix X. At last, the subjective weight β 0 and the objective weight α are integrated similarly into ω by the established model based on POMCE.
Comparing to the general procedure in Figure 1, the proposed approach has two features. First, instead of using the group utility function, the individual utility function is applied to reflect each decision-maker’s judgment on attributes, which may avoid the influences of some unfavorable situations where some decision-makers tend to compromise their own different opinions to keep consistent with the group. Second, by applying POMCE to integrate all decision-makers’ judgment on the weight of attributes into a subjective weight vector, any subjective or additional information out of the decision system will be excluded, which may assure the plausibility and objectivity of weights.

3.1. Objective Weight of Attributes

By applying the entropy weighting technique onto attribute value matrix X, objective weight of attributes α can be obtained as:
α = ( α 1 , α 2 , , α n )
where:
α j = 1 - E j j = 1 n ( 1 - E j ) , j = 1 , 2 , , n E j = - 1 ln m i = 1 m x i j i = 1 m x i j ln x i j i = 1 m x i j , j = 1 , 2 , , n
This weight vector fully depends on the data from the attribute value matrix without considering decision-makers’ judgment on the value of attributes. Hence, it can be treated as the objective weight.

3.2. Subjective Weight of Attributes

Meanwhile, one has to consider decision-makers’ attitudes about attributes to solve an MAGDM problem reasonably. In accordance with the general approach in decision theory, we use the utility function to reflect different decision-makers’ preferences upon attributes. In the same way, the k-th decision-maker’s subjective weight on attributes can be obtained by using the entropy weighting method for his or her subjective attribute matrix U k as defined in Equation (2).
β k = ( β 1 k , β 2 k , , β n k ) , k = 1 , 2 , , l
Then, all decision-makers’ weight vector can be formulated into a weight matrix β , such that:
β = β 1 1 β 2 1 β n 1 β 1 2 β 2 2 β n 2 β 1 l β 2 l β n l
where:
β j k = 1 - E j k j = 1 n ( 1 - E j k ) , E j k = - 1 ln m i = 1 m u k ( x i j ) i = 1 m u k ( x i j ) ln u k ( x i j ) i = 1 m u k ( x i j ) , j = 1 , 2 , , n ; k = 1 , 2 , , l
The weight vector β k fully depends on the k-th decision-maker’s utility function, which reflects a subjective judgment on the importance of attributes. Hence, we viewed β as a subjective weight matrix.

3.3. Weight Aggregation

In order to combine all decision-makers’ judgment, we introduced a minimum distance method based on POMCE. Let β 0 = ( β 1 0 , β 2 0 , , β n 0 ) be the attribute weight that integrates all decision makers’ attitudes. For this purpose, β 0 should be as close as possible to every β k . Hence, we assume that the weighted sum of the cross-entropy distance of β 0 to β k should be minimized, such that:
min D = k = 1 l w k D k ( β 0 | | β k )
s . t . j = 1 n β j 0 = 1 β j 0 0
where w = ( w 1 , w 2 , , w l ) is the decision-makers’ power vector and:
D k ( β 0 | | β k ) = j = 1 n β j 0 ln β j 0 β j k , k = 1 , 2 , , l
which is the Kullback–Leibler distance or cross-entropy from β 0 to β k .
To solve the above optimization model, define a Lagrange function as:
L ( β 0 , λ ) = k = 1 l w k j = 1 n β j 0 ln β j 0 β j k + ( λ - 1 ) j = 1 n β j 0 - 1
where ( λ - 1 ) is the Lagrange multiplier. The optimality conditions can be obtained by taking partial derivatives of β j 0 ( j = 1 , 2 , , n ) and λ, such that:
L β 0 j = L β 0 j = k = 1 l w k 1 + ln β 0 j β k j + ( λ - 1 ) = k = 1 l w k ln β 0 j β k j + λ = 0
L λ = L λ = j = 1 n β 0 j - 1 = 0
From Equation (16), we can get:
β j 0 = exp k = 1 l w k ln β j k - λ , j = 1 , 2 , , n
By substituting the above equation into Equation (17),
λ = ln j = 1 n exp k = 1 l w k ln β k j
Then, it can be achieved that:
β j 0 = exp k = 1 l w k ln β j k j = 1 n exp k = 1 l w k ln β j k , j = 1 , 2 , , n
By now, the proposed method is proven to be feasible.
In the above model, the decision-makers’ importance is assumed to be known. If it is unknown, the object function can be reformed into:
min D = k = 1 l D k ( β 0 | | β k )
Following the same procedure, it is easy to obtain a similar solution of β 0 . Furthermore, based on the result, the distance from β k to β 0 , namely D k ( β k , β 0 ) , can be calculated out. The smaller is D k ( β k , β 0 ) , the more consistent with the common knowledge is the k-th decision-maker’s judgment. Hence, his or her judgment should be weighted more. Based on this consideration, we propose a method to determine decision-makers’ power as:
w k = 1 - D k ( β k | | β 0 ) k = 1 l ( 1 - D k ( β k | | β 0 ) ) , k = 1 , 2 , , l
Therefore, the above model is feasible whether the decision-makers’ weight is known or not.
Anyway, different decision-makers’ weights of attributes can be aggregated based on the minimum cross-entropy model. Furthermore, β 0 can be viewed as the subjective weight of attributes based on all decision-makers’ judgment. As we proposed earlier, to solve MAGDM, one should combine the subjective weight β 0 and objective weight α . Assuming that the subjective and objective weight have different importance, let γ 0 denote the importance of subjective weight and 1 - γ be the importance of objective weight. The aggregated weight should be close to the subjective and objective weight. Therefore, we establish the following model to combine the subjective and objective weight.
min γ D ( ω | | β 0 ) + ( 1 - γ ) D ( ω | | α )
s . t . j = 1 n ω j = 1 ω j 0
where ω = ( ω 1 , ω 2 , , ω n ) is the aggregated weight. By using the same method as before, it is easy to obtain that:
ω j = exp [ γ ln β j 0 + ( 1 - γ ) ln α j ] j = 1 n exp [ γ ln β j 0 + ( 1 - γ ) ln α j ] , j = 1 , 2 , , n
By now, the weight of attributes is determined by the minimum cross-entropy principle with respect to subjective and objective weight. Then, combining with the value of attributes, the MAGDM problem can be solved by other methods, such as the weighted sum method, the technique for order preference by similarity to ideal solution (TOPSIS) method, and so on.

4. Illustrative Example

In the following, an MAGDM problem of determining what kind of air-conditioning systems should be installed in a library (adapted from [34] and discussed by [35,36]) is used to illustrate the proposed method.
A city is planning to build a municipal library. One of the problems facing the city development commissioner is choosing from five feasible plans ( a 1 , a 2 , a 3 , a 4 , a 5 ) the kind of air-condition system to be installed in the library. The alternatives are to be evaluated by three experts d k ( k = 1 , 2 , 3 ) (whose weight vector is w = ( 0 . 3 , 0 . 2 , 0 . 5 ) under three major factors: economic, functional and operational. Two monetary attributes and six non-monetary attributes are considered. They are:
  • c 1 : owing cost ($/ft 2 );
  • c 2 : operating cost ($/ft 2 );
  • c 3 : performance (*);
  • c 4 : noise level (Db);
  • c 5 : maintainability (*);
  • c 6 : reliability (%);
  • c 7 : flexibility (*);
  • c 8 : safety (*),
where the * unit is from 0–1 scale, the three attributes c 1 , c 2 and c 4 are cost attributes and the other five attributes are benefit attributes.
In the original example, different decision-maker’s judgment are given in Table 1, Table 2 and Table 3. There is no objective value matrix of attributes. In order to apply our approach, assume that the objective value matrix X is the same as U 1 in Table 1, i.e., assume that u 1 ( x ) = x .
Now, we apply the procedure in Figure 2 to solve the given MAGDM problem. The procedure is structured in the following phases.
Step 1.
Apply the entropy weighting technique to the objective value matrix (in Table 1) to obtain the objective weight of attributes. The result is:
α = ( 0 . 2464 , 0 . 0482 , 0 . 0939 , 0 . 1545 , 0 . 1922 , 0 . 0168 , 0 . 1540 , 0 . 0939 )
Step 2.
Again, apply the entropy weighting technique to the subjective value matrices (in Table 1, Table 2 and Table 3) to obtain the subjective weight matrix. The result is:
β = 0 . 2464 0 . 0482 0 . 0939 0 . 1545 0 . 1922 0 . 0168 0 . 1540 0 . 0939 0 . 1931 0 . 0680 0 . 0468 0 . 1287 0 . 2304 0 . 0240 0 . 2171 0 . 0918 0 . 1926 0 . 0801 0 . 1522 0 . 1257 0 . 1420 0 . 0117 0 . 1986 0 . 0971
Step 3.
Apply the weight aggregation model as shown in Equations (12) and (13), where the decision-makers’ weights are set to be w = ( 0 . 3 , . 0 . 2 , 0 . 5 ) . The aggregation result is:
β 0 = ( 0 . 2115 , 0 . 0679 , 0 . 1060 , 0 . 1370 , 0 . 1746 , 0 . 0153 , 0 . 1909 , 0 . 0969 )
Step 4.
Aggregate the objective weight vector α and the subjective vector β 0 by applying the proposed model as in Equation (21), where it is assumed that γ = 0 . 4 . The result is:
ω = ( 0 . 2325 , 0 . 0554 , 0 . 0989 , 0 . 1477 , 0 . 1855 , 0 . 0163 , 0 . 1683 , 0 . 0954 )
Step 5.
Normalize the objective value matrix in Table 1. For benefit attributes, let:
r i j = x i j - min j x i j max j x i j - min j x i j
and for cost attributes, let:
r i j = max j x i j - x i j max j x i j - min j x i j
Then, the normalized decision matrix is obtained as shown in Table 4.
Step 6.
By using the additive weighted aggregation (AWA) operator, the group decision values of the alternatives are:
s 1 = 0 . 4639 , s 2 = 0 . 4285 , s 3 = 0 . 5385 , s 4 = 0 . 6517 , s 5 = 0 . 3988
Step 7.
Rank all alternatives a j ( j = 1 , 2 , 3 , 4 , 5 ) in accordance with the values s i :
s 4 s 3 s 1 s 2 s 5
and the best alternative is a 4 .
Our approach has some different characteristics compared to the approach in [35]. First, the method in [35] modifies every element in the decision matrix of every decision-maker at every step. This means that in reality, every time, the decision-makers have to give new preferences for every element in the decision matrix. However, in our approach, we only need decision-makers to give their preferences once at the beginning. This can reduce a large amount of calculation and is easy to apply in practice. Second, it is well-known that the weighting method is crucial and significant in a multiple attribute group decision-making problem, and different weights probably lead to different results. Hence, more and more attention is paid to objective approaches, which are assumed to be more credible. In our method, all weight vectors are determined by the objective method, even for the determination of the subjective weight vector, which assures the maximum objectivity. However, it is necessary to take decision-makers’ subjectivity into consideration in MAGDM problems. In our approach, decision makers’ subjective attitudes are expressed by their preference function, which is in accordance with the general approach in decision theory. This makes our approach more plausible.

5. Conclusions

Weight aggregation is the key process to solving an MAGDM problem. In this paper, by using the entropy weighting technique and the principle of minimum cross-entropy, the method of weight determination and aggregation is discussed. In accordance with the general approach in decision theory, the decision-makers’ utility functions are introduced to reflect their preferences upon attributes. By using the entropy weighting technique, the subjective and objective weights of attributes are obtained. Then, based on the principle of minimum cross-entropy, an optimization model is developed to aggregate subjective weights and objective weights. The proposed approach presents a new method to objectivize subjective information and to aggregate information from attribute values themselves and decision-makers’ judgment.

Acknowledgments

This work is sponsored by the Fundamental Research Funds for the Central Universities in China (2-9-2015-033).

Author Contributions

Dayi He and Jiaqiang Xu conceived of and designed the experiments. Xiaoling Chen performed the experiments. Xiaoling Chen and Jiaqiang Xu analyzed the data. Dayi He wrote the paper. All authors have read and approved the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest. The founding sponsors had no role in the design of the study; in the collection, analyses or interpretation of data; in the writing of the manuscript; nor in the decision to publish the results.

References

  1. Moscovici, S.; Zavalloni, M. The group as a polarizer of attitudes. J. Personal. Soc. Psychol. 1969, 12, 125–135. [Google Scholar]
  2. Palomares, I.; Estrella, F.J.; Martínez, L.; Herrera, F. Consensus under a fuzzy context: Taxonomy, analysis framework AFRYCA and experimental case of study. Inf. Fusion 2014, 20, 252–271. [Google Scholar] [CrossRef]
  3. Palomares, I.; Estrella, F.J.; Martínez, L.; Herrera, F. A consensus model to detect and manage noncooperative behaviors in large-scale group decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 516–530. [Google Scholar] [CrossRef]
  4. Dong, Y.; Xu, J. Consensus Building in Group Decision Making: Searching the Consensus Path with Minimum Adjustments; Springer: Singapore, Singapore, 2015. [Google Scholar]
  5. Rao, R.V. Introduction to multiple attribute decision-making (MADM) methods. In Decision Making in the Manufacturing Environment: Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods; Springer: London, UK, 2007. [Google Scholar]
  6. Lotfi, F.H.; Fallahnejad, R. Imprecise Shannon’s entropy and multi attribute decision making. Entropy 2010, 12, 53–62. [Google Scholar] [CrossRef]
  7. Zhou, L.; Chen, H.; Liu, J. Continuous ordered weighted distance measure and its application to multiple attribute group decision making. Group Decis. Negot. 2013, 22, 739–758. [Google Scholar] [CrossRef]
  8. Sengupta, A.; Pal, T.K. Fuzzy Preference Ordering of Interval Numbers in Decision Problems; Springer: Berlin/Heidelberg, Germany, 2009; Volume 238. [Google Scholar]
  9. Hamming, R.W. Error detecting and error correcting codes. Bell Syst. Tech. J. 1950, 29, 147–160. [Google Scholar] [CrossRef]
  10. Karayiannis, N.B. Soft learning vector quantization and clustering algorithms based on ordered weighted aggregation operators. IEEE Trans. Neural Netw. 2000, 11, 1093–1105. [Google Scholar] [CrossRef] [PubMed]
  11. Kaufmann, A. Introduction to the Theory of Fuzzy Subsets; Academic Press: New York, NY, USA, 1975. [Google Scholar]
  12. Merigó, J.M.; Casanovas, M. Decision making with distance measures and linguistic aggregation operators. Int. J. Fuzzy Syst. 2010, 12, 190–198. [Google Scholar]
  13. Merigó, J.M.; Casanovas, M. Induced aggregation operators in the Euclidean distance and its application in financial decision making. Expert Syst. Appl. 2011, 38, 7603–7608. [Google Scholar] [CrossRef]
  14. Merigó, J.M.; Casanovas, M. Decision-making with distance measures and induced aggregation operators. Comput. Ind. Eng. 2011, 60, 66–76. [Google Scholar] [CrossRef]
  15. Merigó, J.M.; Gil-Lafuente, A.M. On the use of the OWA operator in the Euclidean distance. Int. J. Comput. Sci. Eng. 2008, 2, 170–176. [Google Scholar]
  16. Merigó, J.M.; Gil-Lafuente, A.M. Using the OWA operator in the Minkowski distance. Int. J. Comput. Sci. 2008, 3, 149–157. [Google Scholar]
  17. Merigó, J.M.; Gil-Lafuente, A.M. OWA operators in generalized distances. Int. J. Appl. Math. Comput. Sci. 2009, 5, 11–18. [Google Scholar]
  18. Szmidt, E.; Kacprzyk, J. Distances between intuitionistic fuzzy sets. Fuzzy Sets Syst. 2000, 114, 505–518. [Google Scholar] [CrossRef]
  19. Xu, Z. Dependent uncertain ordered weighted aggregation operators. Inf. Fusion 2008, 9, 310–316. [Google Scholar] [CrossRef]
  20. Xu, Z. A method based on distance measure for interval-valued intuitionistic fuzzy group decision making. Inf. Sci. 2010, 180, 181–190. [Google Scholar] [CrossRef]
  21. Xu, Z.; Chen, J. Ordered weighted distance measure. J. Syst. Sci. Syst. Eng. 2008, 17, 432–445. [Google Scholar] [CrossRef]
  22. Xu, Z.; Chen, J. An overview of distance and similarity measures of intuitionistic fuzzy sets. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 2008, 16, 529–555. [Google Scholar] [CrossRef]
  23. Yue, Z. Deriving decision maker’s weights based on distance measure for interval-valued intuitionistic fuzzy group decision making. Expert Syst. Appl. 2011, 38, 11665–11670. [Google Scholar] [CrossRef]
  24. Yager, R.R. On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 1988, 18, 183–190. [Google Scholar] [CrossRef]
  25. Yager, R.R. OWA aggregation over a continuous interval argument with applications to decision making. IEEE Trans. Syst. Man Cybern. 2004, 34, 1952–1963. [Google Scholar] [CrossRef]
  26. Chen, H.; Liu, J.; Wang, H. A class of continuous ordered weighted harmonic (C-OWH) averaging operators for interval argument and its applications. Syst. Eng. Theory Pract. 2008, 28, 86–92. [Google Scholar]
  27. Chen, H.; Zhou, L. An approach to group decision making with interval fuzzy preference relations based on induced generalized continuous ordered weighted averaging operator. Expert Syst. Appl. 2011, 38, 13432–13440. [Google Scholar] [CrossRef]
  28. Chen, H.; Zhou, L. A relative entropy approach to group decision making with interval reciprocal relations based on COWA operator. Group Decis. Negot. 2012, 21, 585–599. [Google Scholar] [CrossRef]
  29. Yager, R.R.; Xu, Z. The continuous ordered weighted geometric operator and its application to decision making. Fuzzy Sets Syst. 2006, 157, 1393–1402. [Google Scholar] [CrossRef]
  30. Zhou, L.G.; Chen, H.Y. Continuous generalized OWA operator and its application to decision making. Fuzzy Sets Syst. 2011, 168, 18–34. [Google Scholar] [CrossRef]
  31. Kullback, S.; Leibler, R.A. On information and sufficiency. Ann. Math. Stat. 1951, 22, 79–86. [Google Scholar] [CrossRef]
  32. Cover, T.M.; Thomas, J.A. Information theory and statistics. In Proceedings of the IEEE-IMS Workshop on Information Theory and Statistics, Alexandria, VA, USA, 27–29 October 1994.
  33. Kapur, J.N.; Kesavan, H.K. Entropy Optimization Principles with Applications; Academic Press: San Diego, CA, USA, 1992. [Google Scholar]
  34. Yoon, K. The propagation of errors in multiple-attribute decision analysis: A practical approach. J. Oper. Res. Soc. 1989, 40, 681–686. [Google Scholar] [CrossRef]
  35. Xu, Z. An automatic approach to reaching consensus in multiple attribute group decision making. Comput. Ind. Eng. 2009, 56, 1369–1374. [Google Scholar] [CrossRef]
  36. Xu, J.; Wu, Z. A discrete consensus support model for multiple attribute group decision making. Knowl. Based Syst. 2011, 24, 1196–1202. [Google Scholar] [CrossRef]
Figure 1. The general steps of solving a multiple-attribute group decision-making (MAGDM) problem. Step 1: Convert attribute value matrix X into G ( X ) to eliminate the difference of the unit and direction of attribute value, such as normalization and standardization methods. Step 2: Determine the decision-makers’ weight w and attributes’ weight β . Generally speaking, these weights can be subjective, objective or their combination. Step 3: Aggregate the decision-makers’ weight w and attributes’ weight β , which is denoted as F ( w β ) . Step 4: Integrate the aggregated weight and the value of attributes, which is denoted by F ( w β ) G ( X ) . Then, all alternatives can be ranked by the integration result.
Figure 1. The general steps of solving a multiple-attribute group decision-making (MAGDM) problem. Step 1: Convert attribute value matrix X into G ( X ) to eliminate the difference of the unit and direction of attribute value, such as normalization and standardization methods. Step 2: Determine the decision-makers’ weight w and attributes’ weight β . Generally speaking, these weights can be subjective, objective or their combination. Step 3: Aggregate the decision-makers’ weight w and attributes’ weight β , which is denoted as F ( w β ) . Step 4: Integrate the aggregated weight and the value of attributes, which is denoted by F ( w β ) G ( X ) . Then, all alternatives can be ranked by the integration result.
Entropy 18 00171 g001
Figure 2. Proposed approach of determining and aggregating weight.
Figure 2. Proposed approach of determining and aggregating weight.
Entropy 18 00171 g002
Table 1. Objective value matrix X and decision matrix U 1 .
Table 1. Objective value matrix X and decision matrix U 1 .
c 1 c 2 c 3 c 4 c 5 c 6 c 7 c 8
a 1 460.9350.5950.40.7
a 2 250.5700.4750.80.5
a 3 450.6650.8850.80.6
a 4 640.8400.9900.70.8
a 5 560.7550.6950.50.9
Table 2. Decision matrix U 2 .
Table 2. Decision matrix U 2 .
c 1 c 2 c 3 c 4 c 5 c 6 c 7 c 8
a 1 560.7370.3980.50.4
a 2 250.6740.6700.60.6
a 3 540.5670.9800.60.7
a 4 450.7420.9850.90.6
a 5 370.8540.7900.30.8
Table 3. Decision matrix U 3 .
Table 3. Decision matrix U 3 .
c 1 c 2 c 3 c 4 c 5 c 6 c 7 c 8
a 1 360.9400.6930.40.5
a 2 470.5720.4780.80.7
a 3 650.6750.8890.90.6
a 4 761.0480.8940.60.8
a 5 540.9600.8950.50.9
Table 4. Normalized decision matrix.
Table 4. Normalized decision matrix.
c 1 c 2 c 3 c 4 c 5 c 6 c 7 c 8
a 1 0.50000.00001.00001.00000.20001.00000.00000.5000
a 2 1.00000.50000.00000.00000.00000.00001.00000.0000
a 3 0.50000.50000.25000.14290.80000.50001.00000.2500
a 4 0.00001.00000.75000.85711.00000.75000.75000.7500
a 5 0.25000.00000.50000.42860.40001.00000.25001.0000

Share and Cite

MDPI and ACS Style

He, D.; Xu, J.; Chen, X. Information-Theoretic-Entropy Based Weight Aggregation Method in Multiple-Attribute Group Decision-Making. Entropy 2016, 18, 171. https://0-doi-org.brum.beds.ac.uk/10.3390/e18060171

AMA Style

He D, Xu J, Chen X. Information-Theoretic-Entropy Based Weight Aggregation Method in Multiple-Attribute Group Decision-Making. Entropy. 2016; 18(6):171. https://0-doi-org.brum.beds.ac.uk/10.3390/e18060171

Chicago/Turabian Style

He, Dayi, Jiaqiang Xu, and Xiaoling Chen. 2016. "Information-Theoretic-Entropy Based Weight Aggregation Method in Multiple-Attribute Group Decision-Making" Entropy 18, no. 6: 171. https://0-doi-org.brum.beds.ac.uk/10.3390/e18060171

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop