Extension card · Picture
Picture fuzzy TOPSIS (Sindhu, Rashid and Kashif, 2019)
Picture Fuzzy TOPSIS is the form of TOPSIS used when criterion scores come from a committee's or a survey's yes-abstain-no vote distribution. It runs the calculation directly on these three-degree votes and still ranks the result with a closeness score.
Base method
TOPSIS →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Picture →
What this data type is, when to use it, how to write it in a cell: the family's full account is here.
What Changes from the Base Method?
Four things change. The decision logic stays the same.
Cells. In crisp TOPSIS every cell holds a single number. Here every cell holds three degrees: support (yes), abstention and rejection (no). The sum of these three degrees cannot exceed 1. This triple does not come from an expert score; it comes from a committee's or a survey's vote distribution on the same judgement. For example, for the judgement "this supplier is reliable," what percentage said yes, what percentage stayed undecided and what percentage said no are counted separately. This member in DecisionMind does not itself merge the votes of several experts; the committee vote is already entered as a single pooled triple. Weights come from outside as single numbers and must sum to 1.
Scale equalisation. Crisp TOPSIS divides every column by the square root of the sum of its squares, because criteria are expressed in different units: lira, days and points cannot be summed in the same column. Picture fuzzy triples already lie between 0 and 1 and all share the same structure, so no such division is needed; this step is skipped entirely. Instead, two hypothetical references are built for every criterion column. The positive ideal carries the highest support, the lowest abstention and the lowest rejection seen in that column. The negative ideal carries the lowest support, the lowest abstention and the highest rejection. For a cost criterion these two references are built differently, which is exactly the point most often confused; this is explained further below.
Distance. In crisp TOPSIS the gap between two points is the difference of a single number, and Euclidean distance is computed. Here the similarity between two picture fuzzy triples is measured differently: the sum of the differences of the three components is taken, and to this is added the largest of these differences. So it is not only the total difference that is penalised, but also the single component that deviates most among the three degrees. An alternative's similarity to the positive ideal and to the negative ideal is computed with this measure, weighted across the criteria.
Result and defuzzification. The closeness ratio is found by dividing the similarity to the negative ideal by the sum of the two similarities. This is the same definition as in crisp TOPSIS. The result is again a single number between 0 and 1. Uncertainty is not defuzzified; it dissolves inside the similarity calculation.
DecisionMind fixes, for this member, that weights come from outside as fixed numbers. This member does not implement the founding paper's option of deriving weights through linear programming; the user must supply the weight.
How to Read the Output
The closeness ratio is read as in crisp TOPSIS: it is not a percentage, it is not compared with a different analysis, and the reference points change when the alternative set changes. What differs is this: beneath the score there now sits an uncertainty coming from a vote distribution. If the three degrees sum to less than 1, there is a portion of opinion that did not commit either way. A large abstention share feeds into the score, but the score itself does not show this.
Thus instead of writing:
"This supplier's closeness score is high because the committee trusts it"
the report should read:
"This supplier's closeness score is high because its support share is high while its abstention and opposing-vote shares are low; the uncertainty in the vote distribution has also entered the calculation"
An alternative with a large abstention share can reach the same closeness score as one with a lower but decisive support share. The report keeps these two apart.
When to Prefer This over the Base Method
Use this extension when criterion evaluations come from a committee's, survey's or panel's yes, abstain, no vote distribution on the same judgement, and these three shares can be counted separately. The picture fuzzy data-type card explains that the abstention share must be a separately counted share, distinct from indecision. Deriving the other two degrees from a single support percentage erases this extension's sole contribution.
There is no need to expand a measured criterion, such as price or duration, into a picture fuzzy triple. DecisionMind requires a single data type. If a measured value is nonetheless to be carried as a triple, this does not mean the value is "approximate"; it means it is the voted form of a measured judgement, such as "is this price acceptable." Pythagorean fuzzy and spherical fuzzy data types use similar triple or pair structures. The difference lies in the constraint form: on those cards the sum of squares cannot exceed 1, here the sum of the degrees themselves cannot exceed 1. The two must not be confused with one another.
The exit condition is the same as for crisp TOPSIS. If no compromise is acceptable on one criterion, this extension too is compensatory and will not eliminate anything below a threshold.
Mistakes Specific to This Extension
Violating the value space. In every cell the sum of support, abstention and rejection must not exceed 1. This check must be made before the positive and negative ideals are built. If one cell exceeds it, the references built from it are also invalid.
Getting the abstention degree wrong for the negative ideal on a cost criterion. For a benefit criterion, the negative ideal takes the lowest abstention. For a cost criterion, the negative ideal also takes the lowest abstention. If intuition says "it should be reversed for cost" and the highest abstention is taken instead, the abstention polarity is inverted. This is the most easily misunderstood step in the founding paper.
Skipping the largest-difference term in the similarity measure. If similarity is computed only from the sum of the three components' differences, it collapses into an ordinary Hamming distance and the ranking can change. The single largest deviation term must also be included.
Defuzzifying first and then running crisp TOPSIS. Reducing the three degrees to a single number from the outset, for example to the support share alone, and then applying the crisp method is not this extension. The abstention and opposing-vote information is erased at the first step.
Deriving a triple from a single ratio. Saying "there is 60 per cent support, so 40 per cent opposition" zeroes out the abstention share. As the picture fuzzy data-type card explains, every degree must be counted separately.
The governing principle is this:
Picture fuzzy TOPSIS exists to carry the abstention share of a committee's or survey's vote distribution through to the final score. Any implementation that fabricates a degree, skips the abstention, or crisps the input from the outset destroys the method's sole contribution.
Cases
The first case is a literature case. It is the 3rd example in Sindhu, Rashid and Kashif's (2019) paper; the table and weights are taken from the paper. The result figures are verified by independently re-running DecisionMind's PIF-TOPSIS engine. The second case is an illustrative construction.
1. Illustrative example: Choosing among five candidate technicians (Sindhu, Rashid and Kashif, 2019)
An institution evaluates five candidate technicians (S1-S5) on four criteria. The criteria are technology advancement level (K1), market potential (K2), supplier capability (K3) and innovativeness (K4); all four are higher is better. Every cell carries a vote distribution for how much the evaluation committee supported that candidate on that criterion: support, abstention, opposition. The committee set the weights at 0.20 for K1, 0.10 for K2, 0.30 for K3 and 0.40 for K4.
| Candidate | K1 | K2 | K3 | K4 |
|---|---|---|---|---|
| S1 | (0.56; 0.34; 0.10) | (0.90; 0.07; 0.03) | (0.40; 0.33; 0.19) | (0.09; 0.79; 0.03) |
| S2 | (0.70; 0.10; 0.09) | (0.10; 0.66; 0.20) | (0.06; 0.81; 0.12) | (0.72; 0.14; 0.09) |
| S3 | (0.88; 0.09; 0.03) | (0.08; 0.10; 0.06) | (0.05; 0.83; 0.05) | (0.65; 0.25; 0.07) |
| S4 | (0.80; 0.07; 0.04) | (0.70; 0.15; 0.11) | (0.03; 0.88; 0.05) | (0.07; 0.82; 0.05) |
| S5 | (0.85; 0.06; 0.03) | (0.64; 0.07; 0.22) | (0.06; 0.88; 0.05) | (0.13; 0.77; 0.09) |
| Direction | higher is better | higher is better | higher is better | higher is better |
| Weight | 0.20 | 0.10 | 0.30 | 0.40 |
The method finds the best and worst triple seen in each criterion column. It then computes each candidate's weighted similarity to these two references and builds the closeness ratio.
| Candidate | Closeness ratio | Rank |
|---|---|---|
| S3 | 0.5387 | 1 |
| S2 | 0.5285 | 2 |
| S1 | 0.5019 | 3 |
| S5 | 0.4821 | 4 |
| S4 | 0.4769 | 5 |
The result reads as follows. S3 shows strong support on the two heaviest criteria, K3 and K4, and also holds the highest support on K1. It is weak on K2, but because this criterion's weight is only 0.10, S3 still stays ahead. The gap between S2 and S3 is 0.0102, a small margin.
The committee's hesitation is this: if the weights of the two heaviest criteria are swapped, that is K3 at 0.40 and K4 at 0.30, S3 still comes first, at 0.5257. But S1 and S2 swap places: S1 rises to second with 0.5141, and S2 drops to third with 0.5110. This means the top rank is robust, while the second and third ranks are sensitive to the balance of weight between K3 and K4.
In the report: "With the weights given, S3 has the highest closeness ratio (0.5387). When the K3 and K4 weights are swapped, S3 keeps first place, but S1 and S2 change places."
Source: Sindhu, Rashid and Kashif (2019), the input matrix in Table 1 and the weights in step 5 (0.20, 0.10, 0.30, 0.40). The closeness ratios and the sensitivity scenario were computed by this card's author by independently re-running the paper's algorithm between Eq. (6) and Eq. (12). The figures come from this recomputation, not from the paper's own printed results.
2. Water management: Choosing among three sites for a wastewater reclamation plant
A metropolitan water and sewerage authority will build a reclamation plant to reuse treated water for irrigation, against the risk of drought. Three sites (A1, A2, A3) are evaluated on four criteria: technical feasibility, cost affordability, public acceptance and environmental risk approval; all four are higher is better. Technical feasibility is voted on by an engineering board, cost by the council's budget committee, public acceptance is measured by a survey of neighbourhood representatives, and environmental approval is given by an independent environmental board. The authority gives environmental approval the highest weight: technical feasibility 0.25, cost 0.20, public acceptance 0.20, environmental approval 0.35.
The method finds the best and worst vote distribution seen on each of the four criteria. It then computes each site's weighted similarity to these two references. Suppose the result places A2 first (0.5129), A1 second (0.5024) and A3 third (0.4906). A2 holds the highest support on technical feasibility and also shows strong support on environmental approval.
The authority's hesitation is this: if the weight on public acceptance is raised from 0.20 to 0.45, with the other three criteria's weights reduced accordingly (technical 0.15, cost 0.15, environmental 0.25), A1 moves ahead, at 0.5163, because A1 holds the highest support on the public-acceptance criterion. If the authority presents only the single weight scenario without showing this sensitivity, it conceals that the decision depends on the importance given to public acceptance.
In the report: "With the weights given, A2 has the highest closeness ratio (0.5129). If the weight on public acceptance is raised significantly, A1 moves ahead; the ranking is sensitive to this criterion's weight."
3. What Not to Do
Reducing the five candidates' vote distributions in the illustrative example to the support share alone from the outset, and then running crisp TOPSIS, is wrong. Taking single numbers such as 0.56 for S1 and 0.70 for S2 erases the abstention and opposing-vote information, and the score gaps become unrealistically larger or smaller. The second error is taking the highest abstention when building the negative ideal for criterion K3. K3 is also a higher-is-better criterion, and the correct value is again the lowest abstention; this error shifts the entire negative ideal point and distorts the ranking. The third error is reporting S3's score of 0.5387 as "54 per cent reliable"; the score only ranks these five candidates relative to one another.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/pif-topsis
Sindhu, M. S., Rashid, T., & Kashif, A. (2019). Modeling of linear programming and extended TOPSIS in decision making problem under the framework of picture fuzzy sets. PLOS ONE, 14(8), e0220957. DOI: 10.1371/journal.pone.0220957
Hwang, C. L., & Yoon, K. (1981). Multiple Attribute Decision Making: Methods and Applications — A State-of-the-Art Survey. Lecture Notes in Economics and Mathematical Systems, Vol. 186. Springer-Verlag. DOI: 10.1007/978-3-642-48318-9
Cuong, B. C., & Kreinovich, V. (2013). Picture fuzzy sets — A new concept for computational intelligence problems. 2013 Third World Congress on Information and Communication Technologies (WICT 2013), 1–6. DOI: 10.1109/WICT.2013.7113099
Cuong, B. C. (2014). Picture fuzzy sets. Journal of Computer Science and Cybernetics, 30(4), 409–420. DOI: 10.15625/1813-9663/30/4/5032