Extension card · Hesitant
Dual hesitant fuzzy VIKOR (An, Zhang, Liu and Zuo, 2025)
This is the form of VIKOR for situations where several decision-makers each give both a support and a rejection value for every criterion, and the weight of some criteria is not fully fixed in advance. It combines the decision-makers' votes, completes the missing weights with an optimisation, and ranks the result by a rule that is the exact opposite of classical VIKOR's: the HIGHEST Q counts as best.
Base method
VIKOR →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Hesitant →
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?
Five things change; the most important is the direction of ranking in the last item.
Cells and the number of decision-makers. In crisp VIKOR every cell is a single number. Here every cell carries a support set and a rejection set; every element of each set belongs to one of K decision-makers (K = 3 in this extension). If a decision-maker has no opinion on a cell, that slot is marked "/" and left blank; the gaps in the support and rejection sets are independent of one another, so one decision-maker's support may be missing while their rejection is recorded, or the reverse. The decision-makers' own weights (λ) are normalised to sum to 1.
Decision-maker aggregation. DecisionMind first scales every cell by decision-maker weight (Ē = λ⊗E): each decision-maker's given support and rejection value is multiplied by their own λ, and blank slots are dropped after this scaling. With a single decision-maker this step changes nothing.
A direction-sensitive reference point. Crisp VIKOR reads the genuine best and worst value on every criterion from the column. Here the reference point is not read from the data; it is defined directly: for a benefit criterion the ideal is ⟨{1},{0}⟩ (full support, no rejection at all) and the anti-ideal is ⟨{0},{1}⟩; for a cost criterion the two swap. Every option's distance to these two fixed points is measured with a hybrid hesitant distance (the sets' most extreme elements plus the difference between the sets' means).
From partly known weight to full weight. Crisp VIKOR takes the weight fully from outside. Here the senior manager knows the weight of only some criteria (in this example, only one criterion); the rest are unknown. DecisionMind completes the unknown weights through an optimisation that combines each decision-maker's own subjective weight estimate with a data-based objective that best separates the options, balanced by a coefficient α. α = 1 rests on the data alone, α = 0 on the decision-makers' subjective estimate alone; the default of 0.5 weighs the two equally. The user may also enter all weights directly, in which case the optimisation does not run at all.
Result and ranking direction: the reverse of crisp VIKOR. S (group utility) and R (individual regret) are defined as in crisp VIKOR: S is the sum of weighted distances, R is the largest of them. Q is a compromise coefficient β's normalised combination of S and R; β plays the same role as v in classical VIKOR. But An and colleagues (2025) scale S and R here, in their own normalisation, against the largest value. They rank in DESCENDING order of Q: the HIGHEST Q is the best option. This is the exact opposite of the classical Opricovic-Tzeng rule, where the lowest Q is best. DecisionMind applies this reversal exactly as given, and does not silently convert it back to the classical rule. Neither of crisp VIKOR's two compromise conditions (acceptable advantage, acceptable stability) appears in this extension; the engine does not compute them and the manifest does not define them. An and colleagues' own method rests on the Q ranking alone.
How to Read the Output
In this extension, a large Q is good, not a small one. This is the exact opposite of every other VIKOR extension in the family (and of crisp VIKOR itself) and must be stated explicitly in the report every time; otherwise a reader will bring the "lowest Q wins" habit and pick the wrong option. S and R must be read separately: a small S shows overall closeness to the ideal, a small R shows little loss on the worst criterion, exactly as in crisp VIKOR; the difference is that these two values feed into Q in the DESCENDING direction. Classical VIKOR's two compromise conditions are absent here; the distinction between "a single compromise solution" and "a compromise set" is never drawn in this extension, there is only a ranking.
Thus instead of writing:
"According to dual hesitant fuzzy VIKOR, the option with the lowest Q wins"
the report should read:
"In this extension, by An and colleagues' (2025) own definition, the HIGHEST Q is the best option; this runs opposite to classical VIKOR, and the difference must be stated explicitly in the report"
When to Prefer This over the Base Method
This extension is appropriate when several decision-makers' opinions have been collected separately, some decision-makers have not given an opinion on some criteria, and part of the criterion weights has been fixed by management while the rest needs to be derived from the data and from the decision-makers' subjective estimates. If a single decision-maker has filled in a table with complete information, this complexity is not necessary; HF-VIKOR or crisp VIKOR is sufficient. Crisp VIKOR's exit condition applies here too: if no compromise at all is acceptable on one criterion, this extension limits regret but does not eliminate it.
Mistakes Specific to This Extension
Reversing the ranking direction. In this extension the highest Q is best; taking the engine's output and saying, out of habit, "take the lowest Q" reads the result the wrong way round from the start. This is a warning the manifest states of its own accord.
Treating a blank "/" slot as zero. A slot where a decision-maker gave no opinion is marked "/" and never enters the calculation; reading it as 0 adds a false signal, as if that decision-maker had said "I do not support this at all".
Assuming that gaps in support and rejection travel together. One decision-maker's support may be missing while their rejection is recorded, or the reverse; Case 1's table contains exactly such disjoint examples. Treating the two as present or absent together in the same slot causes a loss of information.
Mistaking the optimisation-derived weight for a simple average. The partly known weights are combined with the decision-makers' subjective estimates and a data-based objective through a balance coefficient (α); this is not a plain average of the decision-makers' subjective weights. Saying "the weights are an average" without changing α is incorrect.
Still looking here for classical VIKOR's two conditions. Acceptable advantage and acceptable stability are neither computed nor defined in this extension; the term "compromise set" is not used here.
The governing principle is this:
In this extension a large Q is good; this reversal is An and colleagues' (2025) own definition, not an error, but if it is not stated explicitly every time, the reader is misled towards the wrong option.
Cases
The first case is a genuine literature case: An, Zhang, Liu and Zuo's (2025) property-service-quality evaluation example, with real figures. The second case is an illustrative construction.
1. Property Management: Comparing three property-service companies (An, Zhang, Liu and Zuo, 2025)
A property-management evaluation compares three property-service companies (A1 = Poly Property, A2 = Country Garden Life Service, A3 = Shenzhen Qianhai Field Intelligence) on three criteria: staff (C1), technology (C2), equipment (C3); all three are higher-is-better. Three decision-makers evaluate: a site manager (D1), a property-owner representative (D2) and an industry expert (D3); their weights are λ = (0.35, 0.35, 0.30). Every cell's support and rejection set carries the three decision-makers' (D1;D2;D3) values in order; "/" shows that no opinion was given.
| Company | C1: support (D1;D2;D3) / rejection (D1;D2;D3) | C2: support / rejection | C3: support / rejection |
|---|---|---|---|
| A1 | {0.5; /; 0.3} / {0.4; /; 0.3} | {0.5; 0.6; 0.4} / {0.3; 0.4; 0.2} | {0.3; 0.2; 0.1} / {0.6; /; 0.5} |
| A2 | {/; 0.4; /} / {/; 0.5; 0.4} | {0.7; 0.6; 0.4} / {0.3; 0.2; 0.2} | {0.6; 0.5; 0.4} / {0.1; 0.3; 0.2} |
| A3 | {0.5; 0.5; 0.4} / {0.4; 0.2; 0.2} | {/; 0.6; 0.4} / {/; 0.2; 0.2} | {0.4; 0.3; 0.2} / {0.6; 0.5; 0.5} |
The senior manager knows only C3's weight (0.30); C1 and C2 are unknown. Each decision-maker's own subjective weight estimate (D1: 0.50/0.20/0.30; D2: 0.40/0.30/0.30; D3: 0.30/0.40/0.30) is combined with an objective drawn from the data itself, with a balance coefficient α = 0.5, to give the comprehensive weight ω = (0.465, 0.235, 0.300); C1 emerges as the most heavily weighted criterion.
The method scales every decision-maker's vote by λ, computes the hybrid hesitant distance to the fixed ideal/anti-ideal points, builds the group utility S and individual regret R with these weights, and computes Q with β = 0.5.
| Company | S | R | Q (β = 0.5) | Rank |
|---|---|---|---|---|
| A1 | 0.523 | 0.236 | 0.944 | 1 |
| A2 | 0.489 | 0.237 | 0.500 | 2 |
| A3 | 0.503 | 0.227 | 0.206 | 3 |
The highest Q is best; the ranking is A1 ≻ A2 ≻ A3. A1's first place comes from having the highest S (0.523); this looks contradictory against classical VIKOR's habit that "a small S is good", but in An and colleagues' (2025) own normalisation, S and R are scaled against the largest value and feed into Q in the ascending, not the descending, direction. A3, despite having the lowest R (0.227), finishes last because its S is not the lowest.
The team's hesitation is sensitive to β. As long as β stays roughly between 0.108 and 0.708, the ranking is A1 ≻ A2 ≻ A3. This range overlaps with the range An and colleagues (2025) report in their paper (0 to 0.75). A full-precision computation, run directly on the kernel by this card's author, gives an upper bound of about 0.708 rather than 0.75. This small difference comes from the paper's own rounded S and R values; it has been separately verified that the engine applies the formula exactly as given. If β falls below 0.108, A2 moves ahead of A1. If β exceeds 0.708, A1 keeps first place, but A2 and A3 swap.
In the report: "With β = 0.5 (the default), the option with the highest Q, and therefore the best option, is A1 (Q = 0.944); in this extension a large Q means good. The ranking is stable as A1-A2-A3 for β roughly between 0.11 and 0.71; outside this range, second and third place, or first place, may change."
Source: An, Zhang, Liu and Zuo (2025), Section 4.4, Tables 3-7 (the property-service-quality numerical example). The S, R and Q values were independently computed by this card's author by running DecisionMind's DHF-VIKOR engine, and the result's order matches the paper's own reported order (A1, A2, A3); the engine's full-precision S and R values carry small decimal differences from the paper's rounded values (S≈0.52/0.49/0.50; R≈0.24/0.24/0.23), a discrepancy separately noted in the manifest, and DecisionMind's engine takes the formula itself as authoritative.
2. Elder Care: A family's choice of care home
A family will choose among three care homes for an elderly relative. Three criteria apply: hygiene standard, care-staff adequacy, and monthly fee (lower is better). Three decision-makers evaluate: the family itself, an independent elder-care consultant, and a local-authority officer who has previously inspected the homes. The consultant gave no opinion on the monthly fee, because they had no access to this information; this slot is left blank with "/".
The method combines the three decision-makers' votes with their own weights, computes the distance to the fixed ideal/anti-ideal points, completes the partly known weights, builds S and R, and computes Q with β = 0.5. Suppose the care home with the strongest support on hygiene standard also received a high rejection value on monthly fee; it still comes out with the highest Q, because the comprehensive weight on hygiene standard is high.
The family's hesitation is this: the consultant's blank slot on monthly fee means that only two decision-makers (the family and the local-authority officer) contributed a vote on this criterion; the result might have differed had the consultant given an opinion. The family should also ask whether β should stay at its default of 0.5 or be set according to its own priorities (whether care quality or cost matters more to them).
In the report: "The care home with the highest Q, considered the best in this extension, is this one; it has also been noted that the consultant gave no opinion on the monthly fee, and that only two decision-makers' votes were used for this criterion."
3. What Not to Do
In the property-management example, declaring the company with the lowest Q (A3, Q = 0.206) the "winner": in this extension a large Q is good, and the correct answer in this example is A1. The second error is treating the blank slot in A1's "{0.5;/;0.3}" support set on C1 as 0 and computing the set as {0.5; 0; 0.3}; this adds a false piece of information, as if the second decision-maker had said "I do not support this at all". The third error is assuming the comprehensive weight ω = (0.465, 0.235, 0.300) is a plain average of the three decision-makers' subjective weights; this weight comes from an optimisation combining the partly known leader weight, the subjective estimates and the data-based objective.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/dhf-vikor
An, J., Zhang, X., Liu, L., & Zuo, W. (2025). A dual hesitation fuzzy VIKOR method with incomplete attribute weights for property service quality evaluation. International Journal of Strategic Property Management, 29(3), 174–195. DOI: 10.3846/ijspm.2025.24035
Ren, Z., Xu, Z., & Wang, H. (2017). Dual hesitant fuzzy VIKOR method for multi-criteria group decision making based on fuzzy measure and new comparison method. Information Sciences, 388–389, 1–16. DOI: 10.1016/j.ins.2017.01.024
Zhu, B., Xu, Z., & Xia, M. (2012). Dual hesitant fuzzy sets. Journal of Applied Mathematics, 2012, 1–13. DOI: 10.1155/2012/879629
Torra, V. (2010). Hesitant fuzzy sets. International Journal of Intelligent Systems, 25(6), 529–539. DOI: 10.1002/int.20418
Opricovic, S. (1998). Multicriteria Optimization of Civil Engineering Systems (Višekriterijumska optimizacija sistema u građevinarstvu). PhD thesis, University of Belgrade, Faculty of Civil Engineering. (no DOI)
Opricovic, S., & Tzeng, G.-H. (2004). Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS. European Journal of Operational Research, 156(2), 445–455. DOI: 10.1016/S0377-2217(03)00020-1