Extension card · m-Polar
m-Polar Hesitant TOPSIS (Akram, Adeel and Alcantud, 2019)
This is the form of TOPSIS for situations where a criterion is assessed from several independent viewpoints (poles), and each viewpoint is itself hesitant, carrying more than one plausible value.
Base method
TOPSIS →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
m-Polar →
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 is a single number. Here every cell carries m independent poles, and each pole is itself a hesitant set, that is, it holds more than one plausible membership value. For example, a brand-name proposal's "clarifying identity" criterion is treated with four sub-features (vision, mission, values, direction) as separate poles, and each sub-feature is written with its own hesitant set, holding together the values several assessors have given. Different poles within the same cell can carry hesitant sets of different lengths. DecisionMind completes these to a common length; the completion can be optimistic (repeating the largest value) or conservative (repeating the smallest value), and the user chooses which. Criterion weights are crisp numbers, taken from outside.
Scale equalisation. The values in the hesitant sets are already degrees between 0 and 1, so crisp TOPSIS's step of dividing by column magnitude is absent here. In its place runs the length-completion just described; every pole's every hesitant set is brought to the same length.
Weighting. In crisp TOPSIS, weighting is applied to the whole column. Here every hesitant value in every pole is multiplied separately by its own criterion's weight; the pole and hesitancy structure is preserved, only the values shrink.
Distance and the result. The ideal and anti-ideal are built, for every criterion, from the best and worst value at every hesitancy rank of every pole separately. Distance is an averaged Euclidean distance taken over every pole and every hesitancy rank. The closeness coefficient is again a single number between 0 and 1.
DecisionMind fixes, for this extension, the number of poles, the rule for equalising hesitancy length, and the averaged distance. The direction of completion is chosen by the user and must be stated in the report.
How to Read the Output
The closeness coefficient is read as in crisp TOPSIS, only it ranks this particular set of alternatives. The difference is here: the result can also carry the opinion of more than one independent decision-maker, because the poles can be different assessors. Where two alternatives' scores are close, looking at which pole carries the disagreement gives more information than looking at the score alone.
Thus instead of writing:
"m-Polar hesitant TOPSIS gives the most balanced result because it uses several viewpoints together"
the report should read:
"The score melts the agreement or disagreement between the poles into a single number; which pole carries the disagreement should be examined separately, and this disagreement should be reported for close-scoring alternatives"
When to Prefer This over the Base Method
This extension is appropriate where a criterion genuinely comes from several independent viewpoints, for instance several assessor groups or sub-features, and hesitancy exists among experts within every viewpoint as well. Where there is more than one viewpoint but each viewpoint carries a single crisp value, the pole layer can still be used, and the hesitancy layer is then unnecessary. Where there is only a single viewpoint but hesitancy exists, HF-TOPSIS is sufficient. Where a criterion is measured, the base method should be kept; DecisionMind asks that the table hold a single data type.
Mistakes Specific to This Extension
Changing the number of poles from cell to cell. Every cell must hold the same number of poles; three poles in one cell and four in another leaves the construction of the ideal and anti-ideal undefined.
Copying a single-source score across the poles. Poles represent independent viewpoints; writing a single assessor's score into all four poles in the same way looks like using the pole structure without actually using it.
Weighting through a different operation. In this kernel, weighting is the direct multiplication of every hesitant value by the criterion's weight; using a different combination rule does not reproduce the paper's figures.
Choosing the weight distribution without justification. As Case 1 shows, how the weights are distributed across criteria can change the order of close-scoring alternatives.
The governing principle is this:
Every pole must carry the data of its own independent viewpoint, the weight distribution must not be chosen without justification, and the sensitivity of close-scoring alternatives to this choice must be shown in the report.
Cases
The first case is the brand-name selection example from Akram, Adeel and Alcantud (2019); the figures are the paper's own and have been independently recomputed with DecisionMind's engine. The second case is an illustrative construction.
1. Brand name: Choosing among five brand-name proposals (Akram, Adeel and Alcantud, 2019)
A company will choose one of five brand-name proposals. Three criteria apply, all "higher is better": clarifying identity, brainstorming, and testing. Every criterion is made up of four independent sub-features (poles), and every pole carries several assessors' plausible values as a hesitant set. Weights: clarifying identity 0.23, brainstorming 0.34, testing 0.43. The completion direction is optimistic (the largest value is repeated); every hesitant set is completed to length 3.
Every cell is given as four hesitant sets, one per pole, in sequence and separated by a slash.
| Brand name | Clarifying identity | Brainstorming | Testing |
|---|---|---|---|
| Bn1 | {0.40;0.50;0.50} / {0.30;0.60;0.70} / {0.20;0.70;0.70} / {0.30;0.70;0.80} | {0.30;0.70;0.70} / {0.40;0.50;0.80} / {0.60;0.80;0.80} / {0.70;0.80;0.80} | {0.40;0.60;0.60} / {0.70;0.80;0.80} / {0.30;0.50;0.50} / {0.60;0.70;0.90} |
| Bn2 | {0.60;0.70;0.70} / {0.30;0.70;0.70} / {0.50;0.60;0.60} / {0.40;0.60;0.80} | {0.10;0.20;0.30} / {0.50;0.60;0.60} / {0.10;0.50;0.50} / {0.60;0.80;0.80} | {0.30;0.40;0.60} / {0.20;0.20;0.20} / {0.40;0.70;0.70} / {0.20;0.30;0.50} |
| Bn3 | {0.40;0.40;0.40} / {0.40;0.50;0.80} / {0.20;0.30;0.50} / {0.60;0.80;0.80} | {0.10;0.15;0.15} / {0.20;0.50;0.50} / {0.40;0.40;0.40} / {0.70;0.80;0.90} | {0.30;0.50;0.70} / {0.50;0.80;0.80} / {0.60;0.90;0.90} / {0.50;0.70;0.70} |
| Bn4 | {0.70;0.80;0.80} / {0.60;0.80;0.80} / {0.50;0.50;0.50} / {0.70;0.80;0.90} | {0.40;0.50;0.50} / {0.65;0.70;0.70} / {0.40;0.70;0.70} / {0.70;0.80;0.80} | {0.20;0.50;0.50} / {0.10;0.25;0.25} / {0.60;0.80;0.80} / {0.50;0.60;0.80} |
| Bn5 | {0.40;0.60;0.60} / {0.55;0.70;0.70} / {0.40;0.50;0.70} / {0.75;0.80;0.80} | {0.45;0.50;0.50} / {0.50;0.70;0.70} / {0.10;0.20;0.20} / {0.50;0.60;0.70} | {0.60;0.80;0.90} / {0.50;0.60;0.60} / {0.70;0.70;0.70} / {0.20;0.30;0.35} |
| Direction | higher is better | higher is better | higher is better |
The method completes every pole's every hesitant set to length 3 optimistically, multiplies by the weights, builds the ideal and anti-ideal brand name, and computes every proposal's closeness coefficient.
| Brand name | Closeness coefficient | Rank |
|---|---|---|
| Bn1 | 0.641 | 1 |
| Bn3 | 0.536 | 2 |
| Bn4 | 0.514 | 3 |
| Bn5 | 0.503 | 4 |
| Bn2 | 0.302 | 5 |
The result reads as follows. Bn1 holds strong, consistent pole values across all three criteria. Bn3, Bn4 and Bn5 sit fairly close to one another; the gap between them does not exceed 0.033. Bn2 holds the clearly lowest pole values on the testing criterion and finishes last.
The company's hesitation is this. If the weights shift from 0.23/0.34/0.43 to 0.35/0.34/0.31, that is, the testing criterion's weight is lowered and the clarifying-identity criterion's weight is raised, Bn3 drops to fourth place and both Bn4 and Bn5 overtake it. Bn1 stays first. This shows that the order of the third- and fourth-place proposals is sensitive to the weight distribution.
In the report: "With the weights given, Bn1 has the highest closeness coefficient (0.641) and this ranking is robust. The order among Bn3, Bn4 and Bn5 is sensitive to the weight distribution; lowering the testing criterion's weight drops Bn3 back."
Source: Akram, Adeel and Alcantud (2019), §3.1, Tables 3–5, pp. 14–16. The closeness coefficients are taken from the paper's own tables, and have been verified by independently re-running DecisionMind's MPF-HF-TOPSIS engine; the values the engine produces match the paper's published values exactly.
2. Parks and gardens: Choosing among three proposals for a new city park design
A municipality will choose one of three landscape design proposals for a new city park. Three criteria apply, all "higher is better": accessibility, green-space density, and maintenance-cost efficiency. Every criterion has been gathered as poles from four independent stakeholder groups (walkers, cyclists, families with children, older residents), and within every group several survey results form a hesitant set.
The method computes every design's distance to the ideal and anti-ideal design, pole by pole and hesitancy rank by hesitancy rank, and converts it into a closeness coefficient. Suppose the design with the highest green-space density scored lowest on the accessibility criterion in the older-residents pole, and for this reason came second.
The municipality's hesitation is this: the low score in the older-residents pole rests on only a few surveys, and this pole's value could rise if the completion direction is changed. The municipality should check the amount of data behind this pole separately before deciding.
In the report: "The design with the highest green-space density is second because of a low score in the older-residents group's accessibility assessment. This group's data is limited; additional surveys are recommended before the decision."
3. What Not to Do
In the first case, arbitrarily narrowing the hesitant set of one of the poles in Bn1's testing criterion as if it reflected a single assessor's indecision loses the true source of the set. The second mistake is writing a report without stating the weight distribution; the order among Bn3, Bn4 and Bn5 is sensitive to the weight distribution and reverses under one scenario. The third mistake is treating Bn2's four poles on the testing criterion as if they were a copy of a single expert's score; poles must represent independent viewpoints.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/mpf-hf-topsis
Akram, M., Adeel, A., & Alcantud, J. C. R. (2019). Multi-Criteria Group Decision-Making Using an m-Polar Hesitant Fuzzy TOPSIS Approach. Symmetry, 11(6), 795. DOI: 10.3390/sym11060795
Chen, J., Li, S., Ma, S., & Wang, X. (2014). m-Polar fuzzy sets: An extension of bipolar fuzzy sets. The Scientific World Journal, 2014, 416530. DOI: 10.1155/2014/416530
Torra, V. (2010). Hesitant fuzzy sets. International Journal of Intelligent Systems, 25(6), 529–539. DOI: 10.1002/int.20418
Hwang, C. L., & Yoon, K. (1981). Multiple Attribute Decision Making: Methods and Applications — A State-of-the-Art Survey. Springer-Verlag. DOI: 10.1007/978-3-642-48318-9