Extension card · Hesitant
Dual hesitant fuzzy TOPSIS (Wang, Li, Zhang and Han, 2020)
This is the form of TOPSIS for situations where a cell holds more than one possible degree of support and more than one possible degree of rejection, recorded separately and independently. It measures the distance to the ideal and anti-ideal point through these two sets, and ranks the result with a closeness coefficient.
Base method
TOPSIS →
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?
Three things change; the idea of closeness to the ideal does not.
Cells. In plain hesitant TOPSIS every cell carries a single set, several possible degrees of support. In dual hesitant TOPSIS the cell consists of two sets: a support set (h) and an independent rejection set (g). Just as "how strongly do I support this airline's check-in speed" can have more than one plausible answer, "how strongly do I reject it" can have more than one plausible, independent answer as well. The sum of the two sets' largest elements cannot exceed 1. If the rejection set is empty (g = ∅), the cell reduces to the same information as in the plain hesitant structure; the dual structure only adds something where independent hesitation genuinely exists on the rejection side too. Weights are given from outside; if they are not known, DecisionMind can derive them from the set itself with a distance-based maximisation model.
No normalisation. Crisp TOPSIS's first step is column normalisation. There is no separate normalisation step for dual hesitant sets, because the support and rejection degrees already lie between 0 and 1; the cells are processed directly as they stand.
Ideal and anti-ideal point, distance. For every criterion, the ideal point is built from the largest element of the column's support sets and the smallest element of its rejection sets (the roles swap for a cost criterion); the anti-ideal is the exact opposite. The distance between two sets is measured with a generalised distance that uses both the sets' means (G_m, G_n) and their spread (V_m, V_n, how "wide" the set is). This distance can compare support and rejection sets of different lengths directly, without equalising them (without adding a repeated element to either set); crisp TOPSIS has no such equalising problem because its cells are already single numbers.
DecisionMind uses fixed values, for this family, for the coefficients α and β that set the relative weight of the mean and the spread (summing to 1, default 0.5-0.5) and for λ, which sets the degree of the distance; these three parameters can be changed by the user and must be stated in the report.
How to Read the Output
The closeness coefficient is read as in crisp TOPSIS: it states how close one is to the ideal, given this set of options and these weights. The difference lies here: this coefficient comes from both the sets' means and their width (weighted by α and β), and the parameter λ determines how the distance is computed. The same data, with a different choice of α, β and λ, can give a different coefficient, even a different ranking.
Thus instead of writing:
"According to dual hesitant fuzzy TOPSIS, this option is the best"
the report should read:
"This coefficient has been computed with the given values of α, β and λ; if the coefficient gap between two options is small, this gap may be sensitive to the choice of parameters, and the report should show this"
When to Prefer This over the Base Method
This extension is appropriate when both support and rejection on a criterion are expressed, independently of one another, with more than one plausible degree. Example: part of an expert panel strongly supports an option, another part holds independent reservations about the same option for separate reasons, and the two groups' views are to be preserved without being collapsed into one shared number. If there is no separate hesitation on the rejection side, that is, if rejection is always computed as "1 minus support", plain hesitant TOPSIS is sufficient and the dual structure carries no extra information. Crisp TOPSIS's exit condition applies here too: if no compromise is acceptable on one criterion, this extension is also compensatory.
Mistakes Specific to This Extension
Deriving the rejection set from the support set. Filling the g set as "1 minus h" effectively collapses the dual structure into the plain hesitant structure and erases the independent information on the rejection side; the condition γ⁺+η⁺≤1 (γ⁺ the support set's largest element, η⁺ the rejection set's) must be checked in every cell.
Reporting without stating α, β and λ. Wang and colleagues' (2020) own paper shows that these three parameters can change the ranking; the values used must always be stated in the report.
Confusing the direction reversal with normalisation. For a cost criterion the ideal and anti-ideal roles swap; this is not a normalisation step, because this family has no separate normalisation step.
Comparing sets by equalising their length. The engine compares sets of different length directly; equalising length by repeating a set's missing element is unnecessary and misleading.
The governing principle is this:
Dual hesitant fuzzy TOPSIS exists to hold support and rejection as two independent sources; if the α, β, λ parameters are not stated in the report, the same data can produce a different ranking.
Cases
The first case is a genuine literature case: Wang, Li, Zhang and Han's (2020) service-quality comparison of four airlines (their Table 2), with weights derived from the paper's own maximisation model. The second case is an illustrative construction.
1. Aviation: Comparing the service quality of four airlines (Wang, Li, Zhang and Han, 2020)
An industry research body compares four airlines (A1-A4) on four criteria: reservation and ticketing, safety and boarding, cabin service, and speed of response to passenger demand (all higher-is-better). Weights were derived with the paper's own maximisation model as 0.2692, 0.2245, 0.3086 and 0.1977; α = β = 0.5, λ = 2 (a Euclidean-type distance) were used. Every cell gives the support set (h) and rejection set (g) separately.
| Airline | Reservation (h; g) | Safety (h; g) | Cabin (h; g) | Response speed (h; g) |
|---|---|---|---|---|
| A1 | {0.6;0.4}; {0.4;0.2;0.1} | {0.7;0.6}; {0.3;0.2;0.1} | {0.9;0.7;0.5}; {0.1} | {0.6;0.4}; {0.3;0.2} |
| A2 | {0.4;0.3;0.2}; {0.4} | {0.6;0.5;0.4}; {0.2;0.1} | {0.6;0.5;0.4;0.2}; {0.2;0.1} | {0.8;0.5}; {0.2} |
| A3 | {0.6;0.4}; {0.3;0.2} | {0.8;0.4}; {0.2;0.1} | {0.5;0.3}; {0.4;0.2} | {0.6;0.4}; {0.3;0.2} |
| A4 | {0.8;0.4}; {0.2;0.1} | {0.8;0.5}; {0.2;0.1;0.0} | {0.6;0.4}; {0.3;0.2;0.1} | {0.7}; {0.2} |
The method builds the ideal and anti-ideal point on every criterion from the support and rejection sets' mean and spread, sums the generalised distance with the weights, and computes the closeness coefficient.
| Airline | Closeness coefficient | Rank |
|---|---|---|
| A1 | 0.532 | 1 |
| A4 | 0.530 | 2 |
| A3 | 0.465 | 3 |
| A2 | 0.447 | 4 |
The result reads as follows. A1 has the highest support sets (notably {0.9;0.7;0.5} on cabin service) and comes out first, but the gap to A4 is below 0.003 in DecisionMind's engine. A2 has relatively low support sets across all four criteria and finishes last.
The body's hesitation is this: with a gap this small between A1 and A4 (0.532 against 0.530), the ranking could easily flip if λ or the α-β balance were changed; Wang and colleagues' (2020) own §5.4 sensitivity analysis also shows that the ranking can change as λ changes. A further caveat is needed: the coefficients the paper itself reports in its Table 2 (A1 = 0.6052, A4 = 0.5279) differ noticeably from the independent computation this card's author obtained by applying DecisionMind's engine formulas (Eqs. 21, 29-31) directly (A1 = 0.532, A4 = 0.530); the internal consistency of the paper's own figures has been separately queried by this card's author, with the detail recorded in the approval note. The ranking (A1 first, A4 second) is the same in both computations.
In the report: "With the given weights and α = β = 0.5, λ = 2, A1 has the highest closeness coefficient (0.532); the gap to A4 (0.003) is very small, and the ranking between these two airlines should be treated as sensitive to the choice of parameters."
Source: Wang, Li, Zhang and Han (2020), Symmetry, Table 2 (the decision table) and Section 5 (weights, ranking). DecisionMind's engine applies the paper's formulas (Eqs. 21, 29-31) directly and produces the same ranking (A1≻A4≻A3≻A2); the magnitude of the coefficients departs from the paper's own table, and this discrepancy has been independently verified by this card's author and recorded in the approval note.
2. Elder Care: A care-home chain's choice of operator for a new facility
A care-home chain will hand the operation of a new facility to one of three external operators. Three criteria apply: care-staff experience, the variety of the daily activity programme, and emergency-response time (lower is better). Part of the evaluation board strongly supports each operator, while another part holds independent reservations for separate reasons (a past complaint record, experience in a different region); support and reservation come from different members.
The method builds the ideal and anti-ideal point on every criterion from the support and rejection sets' mean and spread, and sums the generalised distance. Suppose the most experienced operator also has the widest rejection set; it still comes out first, because the weight on experience is high.
The board's hesitation is this: the rejection set for this operator is wide, and some members have separately flagged a past incident. This width does not show in the closeness coefficient. Because this is a sensitive service area, the board should look not only at the coefficient but also at the source of the reservation.
In the report: "With the weight on experience, the most experienced operator stands out; the rejection set for this operator is wide, and its source should be investigated separately before signing the contract."
3. What Not to Do
Filling every cell's rejection set as "1 minus the support set" in the illustrative table, for example adding a rejection set of {0.4;0.6} opposite A1's reservation support set of {0.6;0.4}, effectively collapses the dual structure into plain hesitant TOPSIS. The second error is reporting "A1 is first" without stating α, β and λ; the gap between A1 and A4 is sensitive to these parameters. The third error is presenting the paper's own Table 2 coefficients (0.6052 / 0.5279) as if they were DecisionMind's engine output; the engine's independent computation produces coefficients of a different magnitude (0.532 / 0.530).
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/dhf-topsis
Wang, R., Li, W., Zhang, T., & Han, Q. (2020). New distance measures for dual hesitant fuzzy sets and their application to multiple attribute decision making. Symmetry, 12(2), 191. DOI: 10.3390/sym12020191
Zhu, B., Xu, Z., & Xia, M. (2012). Dual hesitant fuzzy sets. Journal of Applied Mathematics, 2012, Article 879629. 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
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