外文翻譯--矩陣聚合方法在群體決策過程的應(yīng)用-閱讀頁
2025-01-30 02:20本頁面
【正文】 ablished as above.Step3: Choosing According to the grade deviation matrix E, 6 elements with higher level of consistency are selected: and the undirected connected graph is produced. Figure1. Undirected Connected Graph (F1)Based on Grade deviation Matrix EBecause it does not meet the requirements of undirected connected graph, V1V2V4V5, and V1V2V3 are all in the formation of loop, thus it is needed to follow the broken circle method. Firstly, the elements with larger grade deviation are replaced by adding the remained elements with smaller grade deviation. Omitting the detail processes, the undirected connected graphs Figure 2 and Figure 3 are obtained. 2 3Based on Figure2, the elements selected correspondently from the judgment matrix A1A5 are:In accordance with the additive principle, it is: * * The results is listed as follows：Therefore the initial matrix is established as below:Based on the reflexive principle, and principle that rows and columns are proportional to the others, the missing elements are filled in, hence a consistent judgment matrix A* is constructed.According to the calculation, it es to W= (, , , , , , )T Similarly, for Figure3, by using the same calculation processes, it es to W=（，)T The Application of Matrix Aggregation Based on Hadamard Convex CombinationOn the basis of foundational theory on Hadamard Convex Combination, expert matrix A1，A2，A3，A4，A5 above is selected according to consistent ratio, to take correspondent matrix aggregation. For the purposes of facilitating study, this paper set various expert judgment matrixes on equal weights, that is, let (0 .2, 0 .2 , 0 .2 , 0 .2 , 0 .2 )According to the calculation from,it es to,By using the square law, it es to CR=. Similarly, According to the calculation from，By using the square law, it es to CR=4 Selection and Optimization on Weighting the Results after Matrix AggregationIn summary, by using 4 different kinds of methods, 4 weight vectors are acquired as follows: It is could be seen by paring and analyzing the weight vectors listed above, the importance sorting list on the index system G=(G1,G2,G3,G4,G5,G6,G7) is shown as:① G3G7G1G2G4G6G5；② G3G7G1G2G4G5G6 ③ G3G1G7G2G4G5G6； ④ G3G7G1G2G4G5G6Based on the sorting results above, the errors are focus on G1 and G7 which are listed in the second, third places, and the G5 and G6, in the sixth and seventh respectively.Accordingly and by bining with the 5 sorting results from above schemes, among the sorting results, ①②④ all have the outes G7G1 (G7 is more important than G1), while ③ has the contrary result: G1G7, which can also support that the sorting results ing from adding convex bination have significant difference from that of the other schemes, this result is attached with irrationality and should be removed. Meanwhile, in the results ①②④, ② and ④ both show G5G6, only ① shows G6G5, so that ① should be removed likewise. Therefore this paper supposes that the reasonable sorting scheme is:The abandon of sorting scheme ① and ③ is the discard of undirected connected graph and convex bination in this matrix aggregation essentially
公司管理相關(guān)推薦
鄂ICP備17016276號(hào)-1