Extension card · Spherical
Spherical fuzzy SAW (Kutlu Gündoğdu and Yörükoğlu, 2021)
Spherical fuzzy SAW is the form of SAW used when criterion scores are given as three separate numbers stating a judgement's degree of support, rejection and hesitancy. The calculation still comes down to a single weighted sum at the end; a larger value is better.
Base method
SAW →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Spherical →
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 decision logic does not.
Cells. In crisp SAW every cell is a single number. In the spherical fuzzy form every cell consists of three degrees: support (μ), rejection (ν) and hesitancy (π). The expert supplies all three directly; hesitancy is not computed here as a residual share. The only constraint is that the sum of the three degrees' squares cannot exceed 1. Weights come from outside DecisionMind as crisp numbers; the method does not generate weights. The source book chapter also includes a group-decision step that merges several experts' judgements; DecisionMind does not support group decisions in this family, and the user enters a single, already merged decision matrix.
Scale equalisation. In crisp SAW every column is scaled against its own best value, because criteria are in different units. In the spherical fuzzy form there is no separate "scale against the best value" step; every cell is already on the same 0–1 scale across three degrees. Instead, the method reduces every cell to a single number with the source chapter's own score function: Score(α) = (3μ − π/2)² − (ν − π/2)². This scoring is the spherical fuzzy counterpart of crisp SAW's "use the criterion column directly" logic; it is not a column-wise division but a cell-wise crisping.
Weighted sum. As in crisp SAW, every crisped cell is multiplied by its criterion's weight and summed along the row: SV_i = Σ_j x̄_ij · w_j. This step carries exactly the same summation logic as crisp SAW; the only difference is that the input (x̄_ij) is now a score already crisped from three degrees.
Result and crisping. As in crisp SAW, a larger SV value is better, and ranking runs from highest to lowest value; this direction does not change. Uncertainty is not consumed within SAW itself here, but at the crisping step, the score function; the summation already operates on numbers that have already been crisped.
DecisionMind holds the source chapter's score function ((3μ − π/2)² − (ν − π/2)²) fixed in this family. Weights are crisp numbers. The step that merges several experts' scores does not run in this implementation.
How to Read the Output
The total score is read as in crisp SAW: it is not a percentage, it cannot be compared with a different analysis, and a larger score is better. The difference is here. The score is now a weighted sum of a value already reduced from three degrees to one, and how the hesitancy share feeds into the score is not directly visible.
Thus instead of writing:
"A high score in SF-SAW also shows the experts' firm certainty"
the report should read:
"The score has been calculated after the three degrees were crisped by the score function; which criterion still carries a high hesitancy share cannot be read from the score itself, and the raw triple table must be consulted"
When to Prefer This over the Base Method
Use this extension when experts give the degrees of support, rejection and hesitancy for a judgement separately. If these three pieces of information run too high to fit the picture fuzzy structure's constraint, that is, their sum being at most 1, the spherical fuzzy form is needed. A criterion that is directly measured (price, time) is not expanded into three degrees by force. The boundary that must not be confused with neighbouring types (Pythagorean, picture fuzzy) is set out on the data-type card.
SAW's exit condition applies here too: if no compromise at all is acceptable on one criterion, this extension is also compensatory and will not eliminate anything below a threshold. The matrix must be of a single type; some criteria cannot be written as crisp and others as spherical fuzzy.
Mistakes Specific to This Extension
Confusing the value-space constraint. The constraint is the sum of the squares of the three degrees: μ² + ν² + π² ≤ 1. It is not the sum of the three degrees themselves; that is the picture fuzzy structure's constraint. Nor is hesitancy a share derived as 1 − μ − ν.
Changing the score function. Every cell is crisped with the source chapter's own score function. Carrying over the Pythagorean family's or another family's score function gives a different score, and in some tables a different rank.
Failing to apply the cost direction. If the support and rejection degrees are not swapped on a "lower is better" criterion, the score is computed in the wrong direction. The worst alternative on that criterion then looks like the best.
Computing hesitancy afterwards and writing it into the spherical structure. If the expert did not supply the third degree, the data belongs to the intuitionistic or Pythagorean fuzzy structure. The spherical structure should not be forced onto such data.
The governing principle is this:
In spherical fuzzy SAW, uncertainty is crisped at cell level by the score function and then combined with SAW's own direct summation logic. Any implementation that changes the constraint or the score function blurs the point where these two steps are meant to stay separate.
Cases
The first case is DecisionMind's validation example. It is a small table with three alternatives and three criteria; it is not the source chapter's own numerical example (an insurance-option assessment), but has been built by running the engine itself, faithfully to the formulas. The second case is an illustrative construction.
1. Illustrative example: Spherical fuzzy assessment of three alternatives on three criteria (DecisionMind validation example)
Three alternatives are assessed with spherical fuzzy triples on three criteria; all three are "higher is better" criteria. Weights are crisp numbers.
| Alternative | K1 | K2 | K3 |
|---|---|---|---|
| A1 | (0.70; 0.20; 0.50) | (0.80; 0.10; 0.40) | (0.60; 0.30; 0.50) |
| A2 | (0.90; 0.10; 0.30) | (0.60; 0.30; 0.60) | (0.80; 0.20; 0.40) |
| A3 | (0.50; 0.40; 0.60) | (0.70; 0.20; 0.50) | (0.70; 0.10; 0.50) |
| Direction | higher is better | higher is better | higher is better |
| Weight | 0.40 | 0.35 | 0.25 |
The method reduces every cell to a single number with the formula Score(α) = (3μ − π/2)² − (ν − π/2)², then multiplies these numbers by the criterion weight and sums them.
| Alternative | Total score (SV) | Rank |
|---|---|---|
| A2 | 4.5975 | 1 |
| A1 | 3.6585 | 2 |
| A3 | 2.6190 | 3 |
The result reads as follows. A2 has the highest support and the lowest rejection-hesitancy triple on K1 (0.40), the most heavily weighted criterion, and its score on that criterion (6.50) is clearly higher than the others'; this advantage carries the total. A1 is strong on the second criterion (0.80; 0.10; 0.40) but trails A2 on K1. A3 is not the best on any criterion and finishes last.
The board's hesitation: if K1's weight is lowered from 0.40 to 0.20 and K2's weight raised from 0.35 to 0.55 (with K3 fixed at 0.25), A1 moves ahead (3.9405 against A2's 3.7475; independently calculated). A2's first place depends on K1 remaining the most heavily weighted criterion.
In the report: "With the given weights (K1=0.40, K2=0.35, K3=0.25), A2 has obtained the highest total score (4.5975). If K1's weight is lowered below K2's (K1=0.20, K2=0.55), A1 moves ahead; the ranking is sensitive to which criterion carries the most weight."
Source: DecisionMind's SF-SAW validation example. The steps rest on the score function and weighted-sum step from Kutlu Gündoğdu and Yörükoğlu's (2021) book chapter; the figures were independently calculated in Python by this card's author and matched against the engine's own output.
2. Care homes: Choosing among three residential care providers
A family will choose among three residential care homes for an elderly relative. Three criteria have been set: adequacy of healthcare staff, the social activity programme, and suitability of the daily fee. After each visit the family answered three separate questions instead of giving a single score: "this is suitable" (support), "this is not suitable" (rejection) and "I am undecided, a second visit is needed" (hesitancy); all three could be marked at once.
The method crisps every care home's triple on the three criteria with the score function and computes the weighted sum. Suppose the result placed first a care home that received strong support on healthcare-staff adequacy but where the family remained undecided on fee suitability, and placed second a home that was strong on the social activity programme but weak on staff adequacy.
The family's hesitation lies here: the high hesitancy share on the fee criterion for the first-ranked home has dissolved inside the total score. Before trusting the ranking, the family should also ask where this hesitancy about fees comes from, whether it is unclear contract terms or unsettled additional-service charges.
In the report: "The care home that is strongest on healthcare-staff adequacy is ranked first. This home's hesitancy share on the fee criterion has remained high relative to the other criteria and should be clarified separately before signing a contract."
3. What Not to Do
In the illustrative example, ignoring the hesitancy degree (π) and running an intuitionistic fuzzy SAW with only the support and rejection degrees would give different scores, and could make A2's advantage on K1 look larger or smaller than it is. The second error is reducing the triples on criterion K2 to a single number from the outset (taking only μ) and running crisp SAW; the hesitancy share is then left out of the calculation entirely. The third error is changing A1's triple on K2, (0.80; 0.10; 0.40), to a value such as (0.80; 0.10; 0.60) without checking the constraint; the sum of the squares becomes 0.64+0.01+0.36=1.01, exceeding the constraint.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/sf-saw
Kutlu Gündoğdu, F., & Yörükoğlu, M. (2021). Simple additive weighting and weighted product methods using spherical fuzzy sets. In C. Kahraman & F. Kutlu Gündoğdu (Eds.), Decision Making with Spherical Fuzzy Sets: Theory and Applications (Studies in Fuzziness and Soft Computing, Vol. 392, pp. 241–258). Springer. DOI: 10.1007/978-3-030-45461-6_10
Kutlu Gündoğdu, F., & Kahraman, C. (2019). Spherical fuzzy sets and spherical fuzzy TOPSIS method. Journal of Intelligent & Fuzzy Systems, 36(1), 337–352. DOI: 10.3233/JIFS-181401
Fishburn, P. C. (1967). Additive utilities with incomplete product sets: Application to priorities and assignments. Operations Research, 15(3), 537–542. DOI: 10.1287/opre.15.3.537
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