This page is published in English.
Ranking
LPF-CRITIC-EDAS - Linguistic Pythagorean Fuzzy EDAS with CRITIC weighting (Akram-Ramzan-Deveci 2023)
Linguistic Pythagorean fuzzy ranking - LPFN (I_ψ, I_ζ) with ψ²+ζ² ≤ τ²
Akram, M., Ramzan, N., Deveci, M.2023doi:10.1016/j.engappai.2022.105777 ↗
Overview
LPF-EDAS uses linguistic Pythagorean fuzzy numbers (LPFN: (I_ψ, I_ζ) with ψ²+ζ² ≤ τ²) to encode expert linguistic judgments at granularity τ. Group judgments are aggregated via LPFHWA (Hamacher weighted average; algebraic at κ=1). CRITIC derives objective criterion weights from inter-criterion correlation and standard deviation. EDAS structure (PDA/NDA distances from average solution) produces the final appraisal score. The score function S(α) = √((τ²+ψ²−ζ²)/2) defuzzifies LPFNs throughout.
- Output
- utility, higher is better
- Data
- Linguistic Pythagorean, linguistic tuples complete
- Weights
- Derived internally, no weight source needed
- Size
- 2+ alternatives, 3-10 criteria works best
- Used for
- Group MCDM under linguistic uncertainty, MAGDM with Pythagorean-constrained fuzziness, Medical / engineering selection with multi-expert linguistic judgments, Sustainability / supplier evaluation with hedged preferences
How it works
- 1
Form per-DM linguistic Pythagorean fuzzy decision matrices D^(t) = [d^(t)_pq], where d^(t)_pq = (I_ψ_pq^t, I_ζ_pq^t), ψ²+ζ² ≤ τ², for each decision-maker t = 1,…,T.
Akram 2023 Eq.(4.1); Garg 2018 Definition 2.4 (LPFN definition)
- 2
Aggregate across DMs via LPFHWA (Hamacher weighted average, Akram 2023 Theorem 3.1) with DM weights Γ = (γ_1,…,γ_T): α̃_pq = LPFHWA_Γ(d^(1)_pq,…,d^(T)_pq). At κ=1 (algebraic) this simplifies to ψ̃² = τ²·(1 − ∏_t(1 − (ψ^t/τ)²)^{γ_t}) and ζ̃ = τ·∏_t(ζ^t/τ)^{γ_t}.
Akram 2023 Theorem 3.1, Eq.(3.2); Garg 2018 (algebraic limit at κ=1); Hamacher 1978 (t-norm family)
- 3
CRITIC weights ϖ_r for criteria from the aggregated LPF matrix. (i) Score S(α̃_pq) = √((τ²+ψ̃²−ζ̃²)/2) (Eq.4.3). (ii) Direction-aware standardization E_pr ∈ [0,1] (Eq.4.4): benefit (BA) E_pr = (S_pr − S^−_r)/(S^+_r − S^−_r); cost (CA) E_pr = (S^+_r − S_pr)/(S^+_r − S^−_r). (iii) Correlation λ_{rk} between columns r and k (Eq.4.5). (iv) σ_r = std-dev of column r (Eq.4.6). (v) Information content γ_r = σ_r · Σ_k(1 − λ_{rk}) (Eq.4.7). (vi) Normalize ϖ_r = γ_r / Σ_k γ_k (Eq.4.8); Σ ϖ_r = 1.
Akram 2023 Eqs.(4.3)-(4.8); Diakoulaki et al. 1995 (CRITIC original)
- 4
Compute the LPF Average Solution δ̃ = (δ̃_1,…,δ̃_n) by per-criterion LPFAWA with equal alternative weights 1/m: δ̃_q = LPFAWA_{1/m}(α̃_{1q},…,α̃_{mq}).
Akram 2023 Eq.(4.9); Garg 2018 LPFAWA (κ=1)
- 5
Positive/Negative Distance from AVS using LPFN subtraction (Eq.2.8) and scalar multiplication (Eq.2.11) with direction-aware sign. For benefit criteria: PDA_pq = (α̃_pq ⊖ δ̃_q)/S(δ̃_q) if α̃_pq ≥ δ̃_q else 0̃; NDA_pq symmetric. For cost criteria the roles swap. Division by S(δ̃_q) is the LPFN scalar mult by 1/S(δ̃_q) (Eq.2.11).
Akram 2023 Eqs.(4.10)-(4.13); Eqs.(2.8)+(2.11) for LPFN ⊖ and scalar mult
- 6
Weighted positive/negative LPF distances per alternative via CRITIC weights ϖ_r: WPDA_p = ⊕_q (ϖ_q · PDA_pq); WNDA_p = ⊕_q (ϖ_q · NDA_pq), where ⊕ is LPFN Hamacher addition (Eq.2.9) and ϖ·α is LPFN scalar multiplication (Eq.2.11). At κ=1 these are the algebraic LPFAWA aggregates.
Akram 2023 Eqs.(4.14)-(4.15); Eqs.(2.9)+(2.11) for Hamacher ⊕ and scalar mult
- 7
Defuzzify WPDA/WNDA via score (Eq.4.3): wsp_p = S(WPDA_p), wsn_p = S(WNDA_p). Normalize: NSP_p = wsp_p / max_p wsp_p; NSN_p = 1 − wsn_p / max_p wsn_p.
Akram 2023 Eqs.(4.16)-(4.17); Keshavarz Ghorabaee 2015 Eqs.(8)-(9)
- 8
Appraisal Score S_q^A = (NSP_p + NSN_p)/2 ∈ [0,1].
Akram 2023 Eq.(4.18); Keshavarz Ghorabaee 2015 Eq.(10)
- 9
Rank alternatives in descending order of S^A_p (largest = best).
Akram 2023 §4 Step 9; Keshavarz Ghorabaee 2015 Step 10
Fits when / Look elsewhere when
Fits when
- •Preserves linguistic_pythagorean uncertainty through the pipeline rather than premature crispification at elicitation
- •Native group-decision support (multi-DM aggregation built into the pipeline)
Look elsewhere when
- •Crisp data sufficient - use base EDAS directly (avoid unnecessary uncertainty layer)
- •Decision-makers disagree on linguistic granularity τ - convert to common τ first
- •Number of criteria n < 2 - CRITIC weight derivation degenerates
Assumptions to verify
- All cells satisfy LPFN constraint ψ²+ζ² ≤ τ²
- All decision-makers use the same linguistic term set granularity τ
- DM weights γ_t form a simplex (Σγ_t = 1, γ_t ≥ 0)
- Hamacher parameter κ is chosen explicitly (default κ=1 = algebraic)
Limitations
- •Rank reversal known on alternative-set changes (ref: inherited from crisp EDAS base; cf. Keshavarz Ghorabaee 2015)
Edge cases and pitfalls
- •if α̃_pq ≥ δ̃_q else 0̃; NDA_pq symmetric. For cost criteria the roles swap. Division by S(δ̃_q) is the LPFN scalar mult by 1/S(δ̃_q) (Eq.2.11).
Value-space violation: verify ψ²+ζ² ≤ τ² for every LPFN cell before computation.
Granularity drift: all DMs must use the same τ; mixed-τ matrices are not LPFN-compatible.
Hamacher κ choice: κ=1 (algebraic, default) is most common; κ=2 (Einstein-like) and higher are sensitivity-analysis variants - document κ in reports.
CRITIC degeneracy: if any column of the score matrix is constant, σ_r = 0 and ϖ_r = 0 - that criterion contributes no information; consider dropping or reformulating.
Works with
Commonly takes its weights from
Its derived weights can feed
How to cite
Akram, M.; Ramzan, N.; Deveci, M. (2023). Linguistic Pythagorean fuzzy CRITIC-EDAS method for multiple-attribute group decision analysis. Engineering Applications of Artificial Intelligence. https://doi.org/10.1016/j.engappai.2022.105777
System ID, as it appears in reports and the API
LPF-EDAS