The package consists several S4 objects that are used in set of functions. For each object various validation conditions are checked in order to ensure that objects are valid and that their usage in functions will provide valid result. Each problem that can occur is described as best as possible in the error message which should help with solving the issue.
The pairwise comparison matrix can either be loaded from a file or inputted manually. Since the version 0.6.9 the values can be represented as either character or double. However, the character representation seem as slightly better idea because it allows printing more comprehensible output. The matrix needs to be squared reciprocal matrix with maximal value smaller or equal to 9.
The matrix in text file can have the following form.
;"crit1";"crit2";"crit3"
"crit1";"1";"9";"5"
"crit2";"1/9";"1";"1/3"
"crit3";"1/5";"3";"1"Since version 0.9.0 it is also possible to use only upper or lower triangle of the pairwise comparison matrix (including the main diagonal). So the definition above can also look like this:
;"crit1";"crit2";"crit3"
"crit1";"1";"9";"5"
"crit2";"";"1";"1/3"
"crit3";"";"";"1"In case of numerical matrix the values representing undefined
comparisons is either 0 or NA.
The loading is then done as:
matrixFile = "comparison_matrix.csv"
comparisonMatrix = read.csv(matrixFile, sep = ";",
stringsAsFactors = FALSE, header = TRUE, row.names = 1, strip.white = TRUE)
comparisonMatrix = as.matrix(comparisonMatrix)If the matrix is inputted manually then it can be done by following commands:
comparisonMatrixValues = c(1,9,5,
NA,1,1/3,
NA,NA,1)
comparisonMatrix = matrix(comparisonMatrixValues, nrow = 3, ncol = 3, byrow = TRUE)In the case that the values are represented as double. If the values are represented as character then the code looks like this:
comparisonMatrixValues = c("1","9","5",
"","1","1/3",
"","","1")
comparisonMatrix = matrix(comparisonMatrixValues, nrow = 3, ncol = 3, byrow = TRUE)Either way the comparison matrix is created using command pairwiseComparisonMatrix. After printing we can see that the S4 object contains two representation of the matrix, one as characters and other one as numeric as well as slot for variables names, which in this case is filled automatically.
## An object of class "PairwiseComparisonMatrix"
## Slot "valuesChar":
## [,1] [,2] [,3]
## [1,] "1" "9" "5"
## [2,] "1/9" "1" "1/3"
## [3,] "1/5" "3" "1"
##
## Slot "values":
## [,1] [,2] [,3]
## [1,] 1.0000000 9 5.0000000
## [2,] 0.1111111 1 0.3333333
## [3,] 0.2000000 3 1.0000000
##
## Slot "variableNames":
## [1] "C_1" "C_2" "C_3"The textual representation of the pairwise comparison matrix can be obtained as:
## C_1 C_2 C_3
## C_1 1 9 5
## C_2 1 1/3
## C_3 1The whole parameter specifies if the full matrix is
printed or only the upper triangle including main diagonal. Setting the
parameter to TRUE is equal to using:
## C_1 C_2 C_3
## C_1 1 9 5
## C_2 1/9 1 1/3
## C_3 1/5 3 1There are three consistency checks implemented in FuzzyAHP package. The first is consistency ratio as defined by T. L. Saaty (1980). The functions output short message summarizing the calculation and provides value of the consistency ratio. The consistency ration can be calculated for matrices with size up to 15 × 15 according to Thomas L. Saaty and Tran (2007).
## Consistency ratio is: 0.0279459296138796. The pairwise comparison matrix is consistent for calculations.## [1] 0.02794593## [1] 0.02794593Another check is a weak consistency that checks if for aij > 1 and ajk > 1 applies that aik > = max (aij, ajk) for every i, j, k = 1, 2, …, n, where n is a size of matrix a (Stoklasa, Jandová, and Talašová 2013). The functions returns TRUE if the matrix passes the test or FALSE if it fails and print short message (warning message summarizing the issues, if they exist, is printed as well).
## The comparison matrix is weakly consistent.Strict consistency is much stronger prerequisite that is generally true only for absolutely consistent evaluator. It might be problematic to fulfill this condition for more complex matrices. However, it seems reasonable to try this verification just to study the outcome. The strict consistency checks that aik = aij × ajk for every i, j, k = 1, 2, …, n, where n is a size of matrix a (Basile and D’Apuzzo 1997). Again TRUE or FALSE value is returned along with short message.
## Comparison matrix isn't strictly consistent. These indeces violate the condition:
## [1,3] != ([1,2]*[2,3]) -- 5 != 3
## [1,2] != ([1,3]*[3,2]) -- 9 != 15
## [2,3] != ([2,1]*[1,3]) -- 0.333333333333333 != 0.555555555555556
## [2,1] != ([2,3]*[3,1]) -- 0.111111111111111 != 0.0666666666666667
## [3,2] != ([3,1]*[1,2]) -- 3 != 1.8
## [3,1] != ([3,2]*[2,1]) -- 0.2 != 0.333333333333333If the matrix is consistent for calculation according to users conditions subsequent calculations can be made. First step is obtaining weights of criteria. The weights are calculated as geometric mean of each row of the pairwise comparison matrix.
## w_C_1 w_C_2 w_C_3
## 0.7514 0.0704 0.1782To calculate the AHP some data are needed. As mentioned in the description the FuzzyAHP package is prepared for data that uses scale (categorical) ranking of alternatives (the higher the value the better), although classic AHP can be calculated as well. In order to calculate AHP we need matrix of data that has the same number of columns as there are weights.
Data that have even one element equal to NA are to taken
into account at all, the result is automatically determined as
NA.
values = c(4,5,3,
1,3,9,
8,6,4,
3,2,7,
6,7,5,
4,5,3,
NA,9,9,
NA,NA,NA)
values = matrix(values, nrow = length(values)/length(weights@weights), ncol = length(weights@weights), byrow = TRUE)Now we can calculate the result according to the weights. The values with higher resulting value are better solutions of the AHP problem.
## result
## [1,] 3.892240
## [2,] 2.566257
## [3,] 7.146454
## [4,] 3.642293
## [5,] 5.892240
## [6,] 3.892240
## [7,] NA
## [8,] NAIf we wan to rank solutions from the best to the worst, we can do that.
## [,1]
## [1,] 3
## [2,] 6
## [3,] 1
## [4,] 5
## [5,] 2
## [6,] 3
## [7,] NA
## [8,] NAIt is also possible to put the results together to produce better outcome.
result = cbind(values, result, rank)
colnames(result) = c("crit1", "crit2", "crit3", "result_value", "ranking")
print(result)## crit1 crit2 crit3 result_value ranking
## [1,] 4 5 3 3.892240 3
## [2,] 1 3 9 2.566257 6
## [3,] 8 6 4 7.146454 1
## [4,] 3 2 7 3.642293 5
## [5,] 6 7 5 5.892240 2
## [6,] 4 5 3 3.892240 3
## [7,] NA 9 9 NA NA
## [8,] NA NA NA NA NAObviously, since AHP is a hierarchical process the result from one calculation can be merged with outcomes from another calculation (ie. using cbind command) and used as input to another AHP calculation.
The fuzzy pairwise comparison matrix is an extended version of pairwise comparison matrix constructed with respect to fuzzy scale. Details about fuzzy AHP are provided in several articles by Laarhoven and Pedrycz (1983) and Chang (1996).
comparisonMatrixValues = c("1","9","5",
"1/9","1","1/3",
"1/5","3","1")
comparisonMatrix = matrix(comparisonMatrixValues, nrow = 3, ncol = 3, byrow = TRUE)
comparisonMatrix = pairwiseComparisonMatrix(comparisonMatrix)Due to the fact, that checking of fuzzy comparison matrix consistency is relatively complicated, it is simpler to check the non fuzzy matrix and assume that if non fuzzy matrix is consisted than so is the fuzzy matrix. The checks are described above.
The comparison matrix is fuzzified with respect to the fuzzy scale. Default fuzzy scale ranging from 1 to 9 with width of fuzzy number equal to 2 is provided. However, user can specify his own fuzzy scale. For the details please see documentation.
fuzzyComparisonMatrix = fuzzyPairwiseComparisonMatrix(comparisonMatrix)
print(fuzzyComparisonMatrix)## C_1 C_2 C_3
## C_1 (1;1;1) (8;9;9) (4;5;6)
## C_2 (1/9;1/9;1/8) (1;1;1) (1/4;1/3;1/2)
## C_3 (1/6;1/5;1/4) (2;3;4) (1;1;1)With the fuzzy comparison matrix the result of AHP process can be calculated in the same way as with classic comparison matrix. The weights of fuzzy comparison matrix are calculated by approach described by Krejčí, Pavlačka, and Talašová (2016).
The resulting values have issue of representing uncertain value. Such values are hard to present to user directly. Even though it is possible. The user can extract singe fuzzy numbers from the set.
## minimal modal maximal
## [1,] 2.17584 2.566257 3.055858It might be reasonable for user to either defuzzify the values into single output or rank then using fuzzy ranking methods. Defuzzification can be done using several approaches, here Yager’s index is used as described by Tesfamariam and Sadiq (2006). The results of defuzzification can be ranked as classic results of AHP.
## [,1]
## [1,] 3.897250
## [2,] 2.599318
## [3,] 7.135438
## [4,] 3.654089
## [5,] 5.899425
## [6,] 3.897250
## [7,] NA
## [8,] NArank = (nrow(values)+1) - sum(is.na(defuzzified)) - rank(defuzzified, na.last = "keep", ties.method= "max")
print(rank)## [1] 3 6 1 5 2 3 NA NARanking of fuzzy numbers can be done using various approaches. One of them is Chen’s method described by Tesfamariam and Sadiq (2006).
## [,1]
## [1,] 0.3241398
## [2,] 0.1067964
## [3,] 0.8682673
## [4,] 0.2849724
## [5,] 0.6625851
## [6,] 0.3241398
## [7,] NA
## [8,] NAAnother possibility is the utilization of possibility theory as described by Dubois and Prade (1983). These indices work very well if there is a relatively bigger set of very good solutions. Unlike defuzzification or other methods these indices can rank them very well. However, if there is only one dominant best solution the result might not be very descriptive.
For large datasets the calculation might take a while. Because of that a graphical progress-bar can be printed if it is turn on by progress-bar parameter.
ranked = compareFuzzyNumbers(result, "possibilityTheory")
# ranked = compareFuzzyNumbers(result, "possibilityTheory", progressBar = TRUE)## possiblity necessity
## [1,] 0 0
## [2,] 0 0
## [3,] 1 1
## [4,] 0 0
## [5,] 0 0
## [6,] 0 0
## [7,] NA NA
## [8,] NA NASince version 0.8.0 three methods for determination of fuzzy weights were added to the package. These are implemented in function:
and should only be used for comparison to the new approach proposed by Krejčí, Pavlačka, and Talašová (2016). All three methods do not provide optimal outputs and significantly overestimate the amount of uncertainty of fuzzy weights in fuzzy AHP. The implemented methods are from publications Chang (1996), Tesfamariam and Sadiq (2006) and Wang, Luo, and Hua (2008).
All three mentioned methods are often used to calculate so called weighting (or priority) vector of crisp weights based on comparisons of fuzzy weights (Chang (1996)). However, Wang, Luo, and Hua (2008) showed that the priority vector can assign irrational weights at specific situations and thus is not suitable for practical calculations. For the purpose of comparison the method for determination of fuzzy vector is implemented as: