Extension card · Hesitant
Hesitant MABAC (Mishra, Saha, Rani, Pamučar, Dutta and Hezam, 2022)
This is the form of MABAC for situations where several plausible membership degrees on a criterion are held together. It builds the border approximation area from the sets themselves, and ranks alternatives by their distance to this border.
Base method
MABAC →
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?
Four things change; the logic of comparison against the border area does not.
Cells. In crisp MABAC every cell is a single number. Here every cell is a set that holds several plausible values for the same criterion together. When there is more than one expert, DecisionMind first merges the sets with the experts' weights; with a single expert, this step leaves the sets unchanged. Criterion weights are supplied fully from outside; HF-MABAC does not generate weights.
Scale equalisation. Crisp MABAC places every column into the 0-1 range according to its own smallest and largest value. Because the sets already consist of degrees between 0 and 1, no min-max scaling of that kind is needed here. On a cost criterion, every value in every set is complemented by subtracting it from one (the set itself is reversed); on a benefit criterion, the set is left unchanged. Every set is then scaled by the criterion's weight, using the hesitant weighted-average operation.
The border approximation area. In crisp MABAC the border is the geometric mean of the weighted values shifted by "+1". No such "+1" shift is needed here, because the values in the sets are already positive degrees. The border is built by merging every alternative's scaled sets on that criterion with the hesitant weighted geometric-mean operation. This merger processes, one by one, every possible combination (a Cartesian product) that takes one value from each alternative's set; the border itself is also a set, not a single number.
Distance and defuzzification. In crisp MABAC every alternative's distance to the border is a signed difference and is already a single number. Here the distance is the Cartesian product of the absolute differences between every value in the alternative's set and every value in the border set; this too is a set. The overall evaluation score is the average, across all criteria, of the average of these distance sets. The sets fall to a single number only at this last step, by averaging over every combination; crisp MABAC has no defuzzification step of its own, whereas here defuzzification is deferred to the final step and carried out as an unsigned (absolute) distance, which is why the score here is always positive and never comes out negative as it can in crisp MABAC.
DecisionMind fixes these distance and merging rules (Xia and Xu's hesitant weighted-average/geometric-mean operations) in classical Hesitant MABAC.
How to Read the Output
The evaluation score is read in a way similar to crisp MABAC's score: it shows an alternative's relative position against this set's border. But unlike crisp MABAC, this score is always positive, and its magnitude cannot be read directly as "how far above the border"; the score is the average absolute difference across every possible combination between the sets.
Thus instead of writing:
"Because the Hesitant MABAC score is high, this alternative is definitively better"
the report should read:
"This score is the average absolute difference between the alternative's set and the border set, taken over every plausible combination of values; its magnitude is meaningful only within this set of alternatives"
When to Prefer This over the Base Method
This extension is suitable when there is more than one plausible and defensible degree for the same criterion-alternative pair. The distinction on the data-type card applies here too: if there is a single measured value, a single number is written into the cell, no set is built. DecisionMind asks for the table to hold a single data type. Base MABAC's risk of an unstable border with a small alternative set applies here as well; in addition, sets can differ in length (two values for one alternative, one for another), and this increases the size of the Cartesian product, and hence the computational load.
Mistakes Specific to This Extension
Marking the criterion direction wrongly. Mistaking a cost criterion for a benefit criterion and leaving the set uncomplemented causes the border, and hence the entire ranking, to be built incorrectly.
Leaving a set empty. Every cell must hold at least one value; an empty set cannot enter the Cartesian product.
Comparing the score directly with crisp MABAC's score. Crisp MABAC's score is signed and can be negative; here the score is always a positive average absolute difference. Comparing the magnitude of the two scores misunderstands what the method does.
With more than one expert, computing each expert's set's distance to the border separately before merging the sets, and only then averaging. DecisionMind merges the experts' sets first and only then proceeds to the border and distance calculation; reversing this order produces a different result.
The governing principle is this:
The Hesitant MABAC score is the average absolute difference across every plausible combination between the sets. If a set has no genuine source, or its length was chosen arbitrarily, this average displays extra uncertainty rather than adding genuine information.
Cases
The first case is DecisionMind's validation example. The manifest's own record notes that the founding paper's (Mishra et al., 2022) application case comprises fourteen alternatives and six criteria, first reduced to three with DEA, and that the tables printed in the paper contain numerical inconsistencies; a hand-traceable, formula-faithful closed-form validation example is therefore used instead. The second case is an illustrative fiction.
1. Illustrative example: Two alternatives, two criteria (DecisionMind validation example)
Two alternatives are evaluated on two criteria. The first criterion (C1) is of the benefit type, the second (C2) of the cost type; the weights are equal (0.5; 0.5). A1's set on C1 consists of two values.
| Alternative | C1 (benefit) | C2 (cost) |
|---|---|---|
| A1 | {0.36; 0.84} | {0.36} |
| A2 | {0.64} | {0.16} |
| Weight | 0.5 | 0.5 |
The method first complements C2 (A1: {0.64}; A2: {0.84}), scales every set by its weight, builds the border from the two alternatives' sets for every criterion, and takes the average of the alternative-border absolute differences.
| Alternative | Evaluation score | Rank |
|---|---|---|
| A1 | 0.1449 | 1 |
| A2 | 0.1068 | 2 |
The result reads as follows. A1's set on C1, {0.36; 0.84}, carries two plausible values, and one of these (0.84) is markedly higher than A2's single value (0.64); this enlarges A1's average absolute difference on C1. On C2 (cost, complemented), A1's value (0.64) is lower than A2's value (0.84), meaning A1 is better on this criterion; this contributes positively to A1's score.
In this smallest two-criterion example, the robustness of the decision was tested by varying the weights. A1 stays ahead even when C1's weight is pulled down below 0.5; only once C1's weight falls below roughly 0.043, with C2 taking almost all the weight (for instance C1 = 0.04), does A2 move ahead (0.0609 against 0.0604), while at C1 = 0.045 A1 is still ahead (0.0620 against 0.0618). So A1's first place breaks down only at an extreme where C1 is given almost no weight at all.
In the report: "With equal weights, A1 has the highest evaluation score (0.1449); this ranking is preserved even when C1's weight is lowered from 0.5 down to 0.05, and A2 moves ahead only at an extreme where C1 is given almost no weight at all."
Source: DecisionMind's HF-MABAC manifest, closed-form validation example. The steps follow Equations 12-16 of Mishra, Saha, Rani, Pamučar, Dutta and Hezam (2022). The evaluation scores were verified by this card's author with an independent Python calculation, matching the manifest's closed-form result (within a tolerance of 1e-7, AV(A1) = (√6-1)/10, AV(A2) = (6-√2-√6)/20).
2. Public transport: A municipality's electric bus fleet renewal tender
A municipal transport company will choose among three manufacturer bids to renew its electric bus fleet. The criteria are: range performance, ease-of-maintenance score and delivery time (the last of these "lower is better"). Three members of the technical committee evaluated the bids from the impressions gathered on different test drives; every bid-criterion pair was therefore written not as a single score but as a set holding the several values the members gave.
The method first complements the delivery-time sets, scales the sets with the weights, builds the border for every criterion, and computes every bid's average absolute distance to the border. Suppose the bid with the widest range also has the longest delivery time. It still comes out first, because the range criterion's weight is higher than delivery time's.
The company's hesitation is this. The breadth of the ease-of-maintenance set shows that the committee members did not agree on this point. If this breadth is large, the criterion's contribution spreads over a more uncertain range, and when the gap between bids comes out small, this uncertainty must be stated explicitly in the report.
In the report: "With the high weight given to range performance, the bid with the widest range reaches the highest evaluation score; the committee members' disagreement in the ease-of-maintenance set reflects the uncertainty on this criterion, and small differences between bids should be read together with this uncertainty."
3. What Not to Do
In the illustrative example, had C2 been mistakenly treated as a benefit, that is, had the complementing step been skipped, A1's genuine advantage on C2 (a lower cost) would have been read the wrong way round, and A2 could have moved ahead. The second mistake is reducing A1's set {0.36; 0.84} to its average (0.60) and treating it as a single number; because this erases the set's two plausible values at an early step, it is no longer HF-MABAC at all but reverts to crisp MABAC. The third mistake is reading the score of 0.1449 as "14 per cent suitable"; this score only compares these two alternatives against this set's own border.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/hf-mabac
Mishra, A. R., Saha, A., Rani, P., Pamučar, D., Dutta, D., & Hezam, I. M. (2022). Sustainable supplier selection using HF-DEA-FOCUM-MABAC technique: a case study in the Auto-making industry. Soft Computing, 26, 8821–8840. DOI: 10.1007/s00500-022-07192-8
Pamučar, D., & Ćirović, G. (2015). The selection of transport and handling resources in logistics centers using Multi-Attributive Border Approximation area Comparison (MABAC). Expert Systems with Applications, 42(6), 3016–3028. DOI: 10.1016/j.eswa.2014.11.057
Torra, V. (2010). Hesitant fuzzy sets. International Journal of Intelligent Systems, 25(6), 529–539. DOI: 10.1002/int.20418
Xia, M., & Xu, Z. (2011). Hesitant fuzzy information aggregation in decision making. International Journal of Approximate Reasoning, 52(3), 395–407. DOI: 10.1016/j.ijar.2010.09.002