DecisionMind Mühürlü, doğrulanabilir reprodüksiyon

Kullanım alanları

LPF-EDAS

LPF-CRITIC-EDAS - CRITIC ağırlıklı Dilsel Pisagor Bulanık EDAS (Akram-Ramzan-Deveci 2023)

Dilsel Pisagor bulanık sıralama - LPFN (I_ψ, I_ζ), ψ²+ζ² ≤ τ²

Formül adımları

Analiz motorunun yöntem bildirimindeki (manifest F.steps) adımlar; raporlardaki formüllerle aynı kaynaktır.

  1. Adım 1 — Her karar verici t = 1,…,T için d^(t)_pq = (I_ψ_pq^t, I_ζ_pq^t), ψ²+ζ² ≤ τ² olan dilsel Pisagor bulanık karar matrisleri D^(t) = [d^(t)_pq] oluşturulur.

    D(t)=[dpq(t)]m×n,dpq(t)=(Iψpqt,Iζpqt),(ψpqt)2+(ζpqt)2≤τ2
    LaTeX D^{(t)} = [d^{(t)}_{pq}]_{m \times n}, \; d^{(t)}_{pq} = (I_{\psi^t_{pq}}, I_{\zeta^t_{pq}}), \; (\psi^t_{pq})^2 + (\zeta^t_{pq})^2 \le \tau^2
  2. Adım 2 — DM ağırlıkları Γ = (γ_1,…,γ_T) ile LPFHWA (Hamacher ağırlıklı ortalama, Akram 2023 Teorem 3.1) üzerinden karar vericiler arası birleştirme: α̃_pq = LPFHWA_Γ(d^(1)_pq,…,d^(T)_pq). κ=1'de (cebirsel) sadeleşir.

    α~pq=LPFHWAΓ(dpq(1),…,dpq(T));(κ=1)ψ~pq=τ1−∏t=1T(1−(ψpqt/τ)2)γt,ζ~pq=τ∏t=1T(ζpqt/τ)γt
    LaTeX \tilde{\alpha}_{pq} = LPFHWA_\Gamma\big(d^{(1)}_{pq},\ldots,d^{(T)}_{pq}\big); \;\;\text{(κ=1)}\;\; \tilde{\psi}_{pq} = \tau\sqrt{1 - \prod_{t=1}^{T}\big(1 - (\psi^t_{pq}/\tau)^2\big)^{\gamma_t}}, \;\; \tilde{\zeta}_{pq} = \tau \prod_{t=1}^{T}(\zeta^t_{pq}/\tau)^{\gamma_t}
  3. Adım 3 — Birleştirilmiş LPF matrisinden CRITIC ile kriter ağırlıkları ϖ_r. (i) Skor S(α̃_pq) = √((τ²+ψ̃²−ζ̃²)/2) (Eq.4.3). (ii) Yön-farkındalı standartlaştırma E_pr ∈ [0,1] (Eq.4.4): fayda (BA) E_pr = (S_pr − S^−_r)/(S^+_r − S^−_r); maliyet (CA) E_pr = (S^+_r − S_pr)/(S^+_r − S^−_r). (iii) Korelasyon λ_{rk} (Eq.4.5). (iv) σ_r std-sapma (Eq.4.6). (v) Bilgi içeriği γ_r = σ_r · Σ_k(1 − λ_{rk}) (Eq.4.7). (vi) Normalize ϖ_r = γ_r / Σ_k γ_k (Eq.4.8); Σ ϖ_r = 1.

    S(α~)=(τ2+ψ~2−ζ~2)/2;Epr={(Spr−Sr−)/(Sr+−Sr−)r∈BA(Sr+−Spr)/(Sr+−Sr−)r∈CA;λrk=∑p(Epr−E¯r)(Epk−E¯k)∑p(Epr−E¯r)2∑p(Epk−E¯k)2;σr=1m∑p(Epr−E¯r)2;γr=σr∑k=1n(1−λrk);ϖr=γr/∑k=1nγk
    LaTeX S(\tilde\alpha) = \sqrt{(\tau^2 + \tilde\psi^2 - \tilde\zeta^2)/2}; \;\; E_{pr} = \begin{cases} (S_{pr} - S^-_r)/(S^+_r - S^-_r) & r \in BA \\ (S^+_r - S_{pr})/(S^+_r - S^-_r) & r \in CA \end{cases}; \;\; \lambda_{rk} = \frac{\sum_p (E_{pr}-\bar E_r)(E_{pk}-\bar E_k)}{\sqrt{\sum_p(E_{pr}-\bar E_r)^2 \sum_p(E_{pk}-\bar E_k)^2}}; \;\; \sigma_r = \sqrt{\tfrac{1}{m}\sum_p(E_{pr}-\bar E_r)^2}; \;\; \gamma_r = \sigma_r \sum_{k=1}^{n}(1-\lambda_{rk}); \;\; \varpi_r = \gamma_r / \sum_{k=1}^{n}\gamma_k
  4. Adım 4 — Kriter bazında eşit alternatif ağırlığı 1/m ile LPFAWA kullanılarak LPF Ortalama Çözüm δ̃ = (δ̃_1,…,δ̃_n) hesaplanır: δ̃_q = LPFAWA_{1/m}(α̃_{1q},…,α̃_{mq}).

    δ~q=(τ1−∏p=1m(1−(ψ~pq/τ)2)1/m,τ∏p=1m(ζ~pq/τ)1/m)
    LaTeX \tilde\delta_q = \Big(\tau\sqrt{1 - \prod_{p=1}^{m}\big(1-(\tilde\psi_{pq}/\tau)^2\big)^{1/m}},\; \tau\prod_{p=1}^{m}(\tilde\zeta_{pq}/\tau)^{1/m}\Big)
  5. Adım 5 — LPFN çıkarma (Eq.2.8) ve skaler çarpma (Eq.2.11) ile AVS'den pozitif/negatif uzaklık. Fayda kriterleri için PDA_pq = (α̃_pq ⊖ δ̃_q)/S(δ̃_q) eğer α̃_pq ≥ δ̃_q aksi halde 0̃; NDA simetrik. Maliyet kriterlerinde roller değişir.

    PDApq={(α~pq⊖δ~q)/S(δ~q)if α~pq⪰δ~q (benefit)(δ~q⊖α~pq)/S(δ~q)if α~pq⪯δ~q (cost)0~otherwise;NDApq symmetric with reversed inequality
    LaTeX \text{PDA}_{pq} = \begin{cases} (\tilde\alpha_{pq} \ominus \tilde\delta_q) / S(\tilde\delta_q) & \text{if } \tilde\alpha_{pq} \succeq \tilde\delta_q \text{ (benefit)} \\ (\tilde\delta_q \ominus \tilde\alpha_{pq}) / S(\tilde\delta_q) & \text{if } \tilde\alpha_{pq} \preceq \tilde\delta_q \text{ (cost)} \\ \tilde 0 & \text{otherwise} \end{cases}; \;\; \text{NDA}_{pq} \text{ symmetric with reversed inequality}
  6. Adım 6 — CRITIC ağırlıkları ϖ_r ile alternatif bazında ağırlıklı pozitif/negatif LPF uzaklıklar: WPDA_p = ⊕_q (ϖ_q · PDA_pq); WNDA_p = ⊕_q (ϖ_q · NDA_pq). κ=1'de cebirsel LPFAWA toplamlarına denk gelir.

    WPDAp=⨁q=1n(ϖq·PDApq);WNDAp=⨁q=1n(ϖq·NDApq)
    LaTeX \text{WPDA}_p = \bigoplus_{q=1}^{n} (\varpi_q \cdot \text{PDA}_{pq}); \;\; \text{WNDA}_p = \bigoplus_{q=1}^{n} (\varpi_q \cdot \text{NDA}_{pq})
  7. Adım 7 — WPDA/WNDA skor (Eq.4.3) ile defuzzify: 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.

    wspp=S(WPDAp);wsnp=S(WNDAp);NSPp=wsppmaxpwspp;NSNp=1−wsnpmaxpwsnp
    LaTeX \text{wsp}_p = S(\text{WPDA}_p); \;\; \text{wsn}_p = S(\text{WNDA}_p); \;\; \text{NSP}_p = \frac{\text{wsp}_p}{\max_p \text{wsp}_p}; \;\; \text{NSN}_p = 1 - \frac{\text{wsn}_p}{\max_p \text{wsn}_p}
  8. Adım 8 — Değerlendirme Skoru S_q^A = (NSP_p + NSN_p)/2 ∈ [0,1].

    SpA=12(NSPp+NSNp)
    LaTeX S^A_p = \tfrac{1}{2}(\text{NSP}_p + \text{NSN}_p)
  9. Adım 9 — Alternatifler S^A_p azalan sıraya göre sıralanır (en büyük = en iyi).

    rank desc by SpA
    LaTeX \text{rank desc by } S^A_p

Yöntem ayrıntıları kaynak kütüphanedeki özgün (İngilizce) metindir.

Sezgi

Linguistic Pythagorean fuzzy ranking - LPFN (I_ψ, I_ζ) with ψ²+ζ² ≤ τ². Output typically utility (higher value = preferred).

Sonucu okuma: 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.

Varsayımlar

  • 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)

Ne zaman kullanılmaz

  • Classical 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

Sınırlılıklar

  • Rank reversal known on alternative-set changes (ref: inherited from crisp EDAS base; cf. Keshavarz Ghorabaee 2015)
  • Assumes: All cells satisfy LPFN constraint ψ²+ζ² ≤ τ²
  • Assumes: All decision-makers use the same linguistic term set granularity τ
  • Assumes: DM weights γ_t form a simplex (Σγ_t = 1, γ_t ≥ 0)
  • Assumes: Hamacher parameter κ is chosen explicitly (default κ=1 = algebraic)

Sık yapılan hatalar

  • Değer-uzayı ihlali: hesaplamadan önce her LPFN hücresi için ψ²+ζ² ≤ τ² doğrulayın.
  • Granülerlik kayması: tüm DM'ler aynı τ'yu kullanmalıdır; karışık-τ matrisler LPFN uyumlu değildir.
  • Hamacher κ seçimi: κ=1 (cebirsel, varsayılan) en yaygın; κ=2 ve üstü duyarlılık varyantları - raporlarda κ belirtilmeli.
  • CRITIC dejenerasyonu: skor matrisinin herhangi bir sütunu sabitse σ_r = 0 ve ϖ_r = 0 - bu kriter bilgi üretmez.

Hesap adımları ve dayanakları

  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.

    Dayanak: 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}.

    Dayanak: 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.

    Dayanak: 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}).

    Dayanak: 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).

    Dayanak: 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.

    Dayanak: 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.

    Dayanak: 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].

    Dayanak: Akram 2023 Eq.(4.18); Keshavarz Ghorabaee 2015 Eq.(10)

  9. Rank alternatives in descending order of S^A_p (largest = best).

    Dayanak: Akram 2023 §4 Step 9; Keshavarz Ghorabaee 2015 Step 10