A Grey Interval Relational Degree-Based Dynamic Multiattribute Decision Making Method and Its Application in Investment Decision Making

The purpose of this paper is to propose a three-dimensional grey interval relational degree model for dynamic Multiattribute decision making. In the model, the observed values are interval grey numbers. Elements are selected in the system as the points in an m-dimensional linear space. Then observation data of each element to different time and objects are as the coordinates of point. An optimization model is employed to obtain each scheme’s affiliate degree for the positive and negative ideal schemes. And a three-dimensional grey interval relational degree model based on time, index, and scheme is constructed in the paper. The result shows that the three-dimensional grey relational degree simplifies the traditional dynamic multiattribute decision making method and can better resolve the dynamic multiattribute decision making problem of interval numbers. The example illustrates that the method presented in the paper can be used to deal with problems of uncertainty such as dynamic multiattribute decision making.


Introduction
Grey relational analysis (GRA) is one of the main contents of grey system theory [1], which is an analytical method based on grey relation topological space.Its basic idea is to judge the interfactor relation degree according to the proximity and similarity degree of the order change between curves.As we all know, the method of grey relation degree does not impose high requirements for the size of samples and does not need typical distribution rules.And computational amount is small.Results of qualitative and quantitative analysis can be matched well, which can be widely applied in the decision making fields [2,3].
In the social and economic systems, there exist a large number of comprehensive decision making problems of complicated system influenced by dynamic multiattribute indexes.The basic features of such kind of problems are to add the time space on the basis of decision space and target space, which are three-dimension decision sequential problems of time, index, and scheme.As for such problems, we can not directly use the method of grey relation degree.Fan and Xiao [4] combined the ideal point method of multiattribute decision making with the extended grey relation degree applying the GRA to the dynamic multiattribute decision making for the first time.Yang [5] utilized the square and minimum of relational dissimilarity degree to ascertain the affiliate degree and improved the resolution of ordering results.Zeng and Luo [6] gave three kinds of relational coefficients and selected different types of relational coefficients according to features of different indexes, then gave results of decision sorting and total sequencing in each time quantum.However, this method has strong subjective elements, and ordering results are different from those of Fan and Xiao [4].Wang [7] took development character into consideration and utilized the "rewards and punishment" principle to a preliminary process of indexes and constructed an optimized index system to ensure that the weight of each index is in the optimized index system.Owing to the difference of index weights, the ordering result is also different from Fan and Xiao [4].Dang et al. [8] used the vague concept and the theoretical ideas of set pair analysis to propose a linear transformation operator [−1, 1], which is easy to be calculated.This method is quite practical and could be used to seek a negative/positive ideal scheme in each time quantum and it established a decision making model based on the dynamic multiattribute GRA.
The existing interval number decision-making models [9][10][11][12][13] separate the interval number decision matrix into upper-bound and lower-bound matrixes.For the upperbound and lower-bound matrixes, their relations with the virtual positive ideal scheme and negative ideal scheme could be used to set up optimized decision model.By doing this, the original interval number is separated purposefully and which makes the result not match reality.According to the theory of grey relational degree, the nearer the geometric distance of the sequence distance is, the bigger the grey relational degrees are.A grey interval relational model based on three dimensions of time, index, and scheme is constructed.Combining with ideal point method of the multiattribute decision making, through the computation of interval number relational degree in order to set up an optimized affiliate degree model, this paper tries to seek the best decision scheme of the dynamic multiattribute decision problem with interval numbers.The remainder of this paper is organized as follows.In Section 2, the methods for standardization of the interval number decision matrix are presented.Section 3 presents the method of three-dimensional grey interval relational degrees.Section 4 discusses the dynamic multiattribute decision making method of interval number based on three-dimensional grey interval relation degree.An example analysis is presented in Section 5. Conclusions are drawn in Section 6.

Methods for Standardization of an Interval Number Decision Matrix
The index attribute set  = { 1 ,  2 , . . .,   } generally can be divided into two types, namely, "beneficial type" and "cost type".The "beneficial type" index means that the larger the value, the better the value; while the "cost type" index means that the smaller the value, the better the value.
Owing to the fact that the centralized indexes have different dimensions, when making a decision, it is hard to compare them directly.Then we need to have a normalization process with the original decision making matrix.
The structure of a three-dimensional decision making system.
If   is a beneficial type index, then If   is a cost type index, then This normalization method makes the normalization transformation of the decision matrix X get the normalization decision making matrix R: where is the interval number effect vector for scheme .Obviously, the normalization decision matrix R's elements are    ,    ∈ [0, 1] ( = 1, 2, . . ., ;  = 1, 2, . . ., ).
A grey relational space is composed of a distance space and a topological space.The "distance" in the distance space is a measure in multiple comparisons, while the point set topology is a neighborhood and complete comparison.Then the combination of the two constructs the complete comparison with measurement, which is also the basic feature of grey relational decision making.We will take each element in the system as the point in the -dimensional linear space and take its observation data of different time and objects as the coordinates of the point.And a calculation formula of grey interval relational degree which is suitable for the three-dimensional decision making system is presented in the paper.
Elements in the interval number decision-making matrix have been changed by a normalization process.This process could lead to consistent changes for "benefit type" and "cost type" indexes in the matrix.The bigger the index is, the better the scheme is after the interval numbers through a normalization process.So when we construct the optimized scheme, we should choose the scheme which has the largest corresponding interval number in the interval number normalization decision matrix as the best scheme.And we could use a mean number of the upper and lower bounds of an interval number as the specific number value.We can construct the best scheme selection method for a multiattribute decision making problem in the following.

Definition 5. Assume that
and thus is believed to be the positive ideal scheme.
Mathematical Problems in Engineering Definition 6. Assume that ( = 1, 2, . . ., ;  = 1, 2, . . ., ) , (10) and thus is believed to be the negative ideal scheme.Assume that, through the Delphi method and AHP method, the corresponding weight vector of each time quantum is Each index's weigh vector is The relational coefficient of the  scheme and the positive ideal scheme   0+ is ( The relational coefficient of the  scheme and the negative ideal scheme   0− is The three-dimensional grey interval number relational degrees of the  scheme for positive/negative ideal schemes are below: Obviously, the bigger  + ( 0+ ,   ) is, the closer between decision making scheme   and positive ideal scheme  + is; then the significance of  − ( 0− ,   ) goes the opposite way and is lower.So the best decision making scheme should have the highest relational degree with the positive ideal scheme while having the lowest relational degree with the negative ideal scheme.Assume that the affiliate values of th scheme   for positive/negative ideal schemes are   and 1−  , so we get the objective function and then we have According to magnitude of   , we arrange all the schemes in sequence.The bigger   is, the closer the evaluated scheme and ideal optimized scheme are, so the decision making scheme   is better.We should also emphasize that the special cases will occur in the following situation.Only when the distance between the alternative and PIS is equal to the distance between the alternative and NIS, the degree of grey relational coefficient of alternative from PIS is equal to the degree of grey relational coefficient of alternative from NIS.

A Case Analysis
An investment bank decides to make an investment in three enterprises.The expert team investigates and takes part in the evaluation of the three enterprises' social benefit index, environment pollution (also called benefit index), and economic benefit index from 2010 to 2012.It is convenient to select the focused investment subject according to the comprehensive evaluation of the three indexes.The expert team's evaluation results of each index are in the form of interval numbers (only give an approximate range).We assume that the three enterprises are three schemes   ( = 1, 2, 3).The interval number decision making matrixes during the three years are below: (20) Step 2. Construct the positive and negative ideal schemes at each time quantum: Step 3. Through Delphi method or AHP method, we make sure of the corresponding weight vectors of each index and time quantum.In order to simplify the analytic process, we assume that  1 =  2 =  3 = 1/3 and  1 =  2 =  3 = 1/3.And we should calculate the interval correlation degree of each scheme to positive/negative ideal scheme according to ( 14) and (15) (assume  = 2): 2 ) = 0.6947 Step 4. According to (16), we calculate the three-dimensional grey interval number relational degree of th scheme   ( = 1, 2, 3) to positive/ negative ideal scheme, respectively, are: Step 5.According to (18), we calculate the affiliate value   ( = 1, 2, 3) of th scheme   to positive ideal scheme:  1 = 0.5904,  2 = 0.7508,  3 = 0.8299.
Step 6.According to the magnitude of   ( = 1, 2, 3), we should arrange the schemes in sequence and select the best.The bigger the affiliate value   is, the closer the th scheme and the ideal optimized scheme  + are, and the better the decision scheme   is.Then we could get the result as  3 >  2 >  1 .In terms of the above steps, we could get the preferred sequence as  3 ≻  2 ≻  1 .The primary investment subject is  3 , followed by  2 and  1 respectively.In fact, compared to the traditional MCDM problems, the superiority of our proposed method lies in the way of measuring merits of alternatives.The traditional MCDM model measures the merit of alternatives by distance formula.And the method proposed in the paper measures the merit of alternatives by grey relational formula in which all the factors could be included.

Conclusions and Future Work
This paper takes elements in a system as the points in the -dimensional linear space and regards the observation data of each element at different time and objects as the coordinates of point.Then a three-dimensional grey interval relation degree model based on time, index, and scheme is constructed according to the presented method in the paper.And the method is applied in the interval number dynamic multiattribute index decision making in an investment scheme selection.The method presented in the paper makes the traditional decision method simplify a lot and could deal with some uncertain problems.At the same time, we can further study the determination method of index weight and hybrid dynamic decision problem on the basis of this paper.As for the uncertain interval number decision problem, we can also use the fuzzy interval method to resolve it.However, the affiliate function of each scheme must be given previously, so this will bring some difficulties to the uncertain decision making in practical applications.Some comparisons between the traditional MCDM model and the model presented in this paper will be carried out in future research.
So the distance of -dimensional interval number sequence is the extension of the distance of -dimensional real number sequences.And the interval [, ] is called the environment of sequence X .andare the low-environment parameter and up-environment parameter of sequence X , respectively.Environment parameters  and  express the completeness of the system, and generally  = min  ( 0 ,   ),  = max  ( 0 ,   ), which makes the relational degree of the two sequences not only depend on themselves but also depend on other element sequences.Sequence   is an effect measurement (EM) after the grey generation, which has uniform polarities.Assume that    ( = 0, 1, ..., ) is regarded as the  + 1 points in the -dimensional linear space; each element's data observation of different time and objects are regarded as coordinates.And the interrelations among elements are studied in the specific -dimensional linear space.An improved grey relational degree model which is similar toDeng's grey relational degree model is constructed.min  min    (  0 ,    ) + max  max    (  0 ,    )   (  0 ,    ) + max  max    (  0 ,    ) )is the distance between sequence  and sequence  of dimensional interval numbers.When p = 2, then  2 (, ) is an Euclidean distance.When A and B are real number sequences, that is,   =    ,    =    ,  = 1, 2, ...,,  2 (, ) represents the Euclidean distance between real numbers  and .(2),..., x  ()} ,where  = 0, 1, 2, ..., .(6)Let the obscure set include core [ . . .⨀ . ..] and become the grey area of sequence set X = { X ,  = 0, 1, . . ., }.
Owing to the fact that the three indexes are all benefit type indexes, we have a normalization process of decision making matrixes  1 ,  2 ,  3 according to (2); then we get normalization interval number decision matrix below: