Ranking
IVIF-ARAS: Interval-Valued Intuitionistic Fuzzy ARAS (Büyüközkan & Göçer 2018)
Atanassov, K. T., Gargov, G. · 1989
Overview
Utility-degree ranking MCDM under Interval-Valued Intuitionistic Fuzzy uncertainty (IVIFN: ⟨[μ⁻,μ⁺],[ν⁻,ν⁺]⟩; μ⁺+ν⁺ ≤ 1): additive sum of weighted-normalized IVIF performance ratings benchmarked against an optimal reference row. Output typically utility_degree (higher value = preferred).
Strengths
- •Method-specific: Utility-degree ranking MCDM under Interval-Valued Intuitionistic Fuzzy uncertainty (IVIFN: ⟨[μ⁻,μ⁺],[ν⁻,ν⁺]⟩; μ⁺+ν⁺ ≤ 1): additive sum of weighted-normalized IVIF performance ratings benchmarked against an optimal reference row
- •Preserves interval_intuitionistic uncertainty through the pipeline rather than premature crispification at elicitation
Limitations
- •Rank reversal known on alternative-set changes (ref: Inherited from crisp ARAS (Zavadskas-Turskis 2010). Optimality function P_i depends on the optimal reference row x̃_0 which is constructed from the alternative set (Eqs. 19-20). Adding or removing alternatives can shift x̃_0 and the Xu-normalization denominator (Eqs. 21-22), changing every alternative's P_i and Q_i = P_i/P_0 simultaneously: known rank-reversal vulnerability of reference-based MCDM methods.)
- •Assumes: Decision matrix entries are valid IVIFNs (μ⁺+ν⁺ ≤ 1)
- •Assumes: Weights are positive and sum to 1
- •Assumes: Defuzzification choice documented (score default vs paper_eq25)
- •Assumes: Optimal reference row x̃_0 has at least one non-trivial criterion
Method assistant
Grounded explanations: it explains the method, it does not compute.
Assumptions to verify
- •Decision matrix entries are valid IVIFNs (μ⁺+ν⁺ ≤ 1)
- •Weights are positive and sum to 1
- •Defuzzification choice documented (score default vs paper_eq25)
- •Optimal reference row x̃_0 has at least one non-trivial criterion
- •Decision-maker accepts utility-degree framing (vs. compromise-ranking VIKOR or distance-to-ideal TOPSIS)
When not to use
- •Crisp data sufficient: use base ARAS (Zavadskas-Turskis 2010) directly
- •Triangular fuzzy data sufficient: use ARAS-F (Turskis-Zavadskas 2010)
- •Grey numbers sufficient: use ARAS-G (Turskis-Zavadskas 2010)
- •Single-valued IFS already provides enough granularity: use IF-ARAS
- •Decision-maker wants prospect-theory loss aversion: use IVIF-TODIM instead
- •Decision-maker wants compromise-ranking with stability conditions: use IVIF-VIKOR instead
Edge cases
- •IF decision matrix x̃_ij and prepend an optimal performance row x̃_0 (Eq. 18). For benefit criterion j ∈ J1: μ^L(x̃_0j) = max_i μ^L(x̃_ij), μ^U(x̃_0j) = max_i μ^U(x̃_ij), ν^L(x̃_0j) = min_i ν^L(x̃_ij)
- •IF scalar multiplication (Eq. 10 with λ = w_j) to obtain the weighted-normalized matrix R̂ (Eq. 23). Step 13: Sum the weighted-normalized IVIFN cells across criteria (IVIF sum Eq. 6) to get the optim
Common pitfalls
- •Hatalı: 'IVIF-ARAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix entries are valid IVIFNs (μ⁺+ν⁺ ≤ 1)
- •Hatalı: 'IVIF-ARAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Weights are positive and sum to 1
- •Hatalı: 'IVIF-ARAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Defuzzification choice documented (score default vs paper_eq25)
- •Hatalı: 'IVIF-ARAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Optimal reference row x̃_0 has at least one non-trivial criterion
- •Hatalı: 'IVIF-ARAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision-maker accepts utility-degree framing (vs. compromise-ranking VIKOR or distance-to-ideal TOPSIS)
- •Hatalı: IVIF-ARAS'yi 'Crisp data sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
- •Hatalı: IVIF-ARAS'yi 'Triangular fuzzy data sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
- •Hatalı: IVIF-ARAS'yi 'Grey numbers sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
Worked example
- 1.Adım 1 (F1): Step 10: Build the IVIF decision matrix x̃_ij and prepend an optimal performance row x̃_0 (Eq. 18). For benefit criterion j ∈ J1: μ^L(x̃_0j) = max_i μ^L(x̃_ij), μ^U(x̃_0j) = max_i μ^U(x̃_ij), ν^L(x̃_0j) = min_i ν^L(x̃_ij), ν^U(x̃_0j) = min_i ν^U(x̃_ij). For cost criterion j ∈ J2: reverse (min on μ, max on ν). Büyüközkan-Göçer 2018 Eqs. 19-20. Formül: X̃ = [x̃_0j; x̃_ij] (m+1) × n matrix with optimal row prepended [Eq.(18)] For j ∈ J1 (benefit): μ^L(x̃_0j) = max_i μ^L(x̃_ij), μ^U(x̃_0j) = max_i μ^U(x̃_ij) ν^L(x̃_0j) = min_i ν^L(x̃_ij), ν^U(x̃_0j) = min_i ν^U(x̃_ij) [Eq.(19)] For j ∈ J2 (cost): μ^L(x̃_0j) = min_i μ^L(x̃_ij), μ^U(x̃_0j) = min_i μ^U(x̃_ij) ν^L(x̃_0j) = max_i ν^L(x̃_ij), ν^U(x̃_0j) = max_i ν^U(x̃_ij) [Eq.(20)] Anchor: Büyüközkan-Göçer 2018 §3.2 Steps 10 + Eqs.(18)-(20)
- 2.Adım 2 (F2): Step 11: Normalize each criterion column j across alternatives (including the optimal row x̃_0) using the Xu vector normalization (Eqs. 21-22). Each component of the IVIFN is divided by the L2 norm of its column. Formül: a_ij^L = μ_ij^L / sqrt(Σ_{l=0}^m ((μ_lj^L)^2 + (μ_lj^U)^2)) [Eq.(21)] a_ij^U = μ_ij^U / sqrt(Σ_{l=0}^m ((μ_lj^L)^2 + (μ_lj^U)^2)) b_ij^L = ν_ij^L / sqrt(Σ_{l=0}^m ((ν_lj^L)^2 + (ν_lj^U)^2)) [Eq.(22)] b_ij^U = ν_ij^U / sqrt(Σ_{l=0}^m ((ν_lj^L)^2 + (ν_lj^U)^2)) Result: r̃_ij = ⟨[a_ij^L, a_ij^U], [b_ij^L, b_ij^U]⟩, i ∈ {0,1,...,m}, j ∈ {1,...,n}. Anchor: Büyüközkan-Göçer 2018 §3.2 Step 11 + Eqs.(21)-(22)
- 3.Adım 3 (F3): Step 12: Apply criterion weights via IVIF scalar multiplication (Eq. 10 with λ = w_j) to obtain the weighted-normalized matrix R̂ (Eq. 23). Step 13: Sum the weighted-normalized IVIFN cells across criteria (IVIF sum Eq. 6) to get the optimality function P̃_i (Eq. 24). Defuzzify P̃_i → P_i using the score function (μ^L + μ^U + (1-ν^L) + (1-ν^U))/4 ∈ [0,1] (default), or paper Eq. 25 variant. Formül: Step 12: Weighted-normalized matrix (IVIF scalar mult Eq. 10): λã = ⟨[1-(1-μ^L)^λ, 1-(1-μ^U)^λ], [(ν^L)^λ, (ν^U)^λ]⟩ [Eq.(10)] R̂_ij = w_j ⊗_λ r̃_ij [Eq.(23)] Step 13: Optimality function (IVIF sum Eq. 6): ã ⊕ b̃ = ⟨[μ_a^L+μ_b^L - μ_a^L·μ_b^L, μ_a^U+μ_b^U - μ_a^U·μ_b^U], [ν_a^L·ν_b^L, ν_a^U·ν_b^U]⟩ [Eq.(6)] P̃_i = ⊕_{j=1}^n r̂_ij [Eq.(24)] Defuzzification (default: Hwang-Lin-style score, [0,1]-bounded, monotonic, best=1): P_i = (μ^L(P̃_i) + μ^U(P̃_i) + (1-ν^L(P̃_i)) + (1-ν^U(P̃_i))) / 4 Paper Eq. 25 variant available via parameter defuzzification_method='paper_eq25'. Anchor: Büyüközkan-Göçer 2018 §3.2 Steps 12-13 + Eqs.(6),(10),(23)-(25)
- 4.Adım 4 (F4): Step 14: Compute the utility degree Q_i = P_i / P_0 (Eq. 26), the ratio of each alternative's defuzzified optimality to that of the optimal reference row. Step 15: Rank alternatives by descending Q_i; the alternative with the highest Q_i is the best. Formül: Q_i = P_i / P_0 (i = 1, ..., m) [Eq.(26)] where P_0 is the defuzzified optimality of the optimal reference row x̃_0. Rank: Q_{[1]} ≥ Q_{[2]} ≥ ... ≥ Q_{[m]} (descending). Best alternative = A_{[1]}, worst = A_{[m]}. Anchor: Büyüközkan-Göçer 2018 §3.2 Steps 14-15 + Eq.(26)
Commonly paired with
- •AHP + IVIF-ARAS (common)
- •IF-ENTROPY + IVIF-ARAS (occasional)
- •BWM + IVIF-ARAS (occasional)
How to cite
Atanassov, K. T.; Gargov, G. (1989). Interval valued intuitionistic fuzzy sets. Fuzzy Sets and Systems. https://doi.org/10.1016/0165-0114(89)90205-4