1. Form the group of K DMs and determine evaluation criteria (m alternatives, n criteria).
E={e1,e2,…,eK},A={A1,…,Am},C={C1,…,Cn}
2. Each DM k assigns linguistic performance ratings x̃_ijk to action A_i on criterion C_j.
x~ijk=(xijkl,xijkp,xijkq,xijku), i=1..m, j=1..n, k=1..K
3. Each DM k assigns linguistic weights w̃_jk to each criterion C_j.
w~jk=(wjkl,wjkp,wjkq,wjku), j=1..n, k=1..K
4. Convert linguistic evaluations into trapezoidal fuzzy numbers via the predefined linguistic scale (Tables 1-2, Figs. 4-5).
linguistic_term↦(l,p,q,u)
5. Aggregate K DMs' ratings and weights using min-mean-mean-max scheme (Eqs.5-8).
x~ij=(xijl,xijp,xijq,xiju), xijl=kminxijkl, xijp=K1k∑xijkp, xijq=K1k∑xijkq, xiju=kmaxxijku; W~j=(wjl,wjp,wjq,wju) analogously
6. Construct the fuzzy decision matrix Ũ and the fuzzy weight vector W̃.
U~=[x~ij]m×n, W~=[W~1,W~2,…,W~n]
7. Linear-scale normalization to a comparable scale. Benefit criteria (Ω_B): r̃_ij = (l/d_j*, p/d_j*, q/d_j*, u/d_j*) with d_j* = max_i x_ij^u. Cost criteria (Ω_C): r̃_ij = (a_j^-/u, a_j^-/q, a_j^-/p, a_j^-/l) with a_j^- = min_i x_ij^l.
j∈ΩB: r~ij=(dj∗xijl,dj∗xijp,dj∗xijq,dj∗xiju), dj∗=imaxxiju; j∈ΩC: r~ij=(xijuaj−,xijqaj−,xijpaj−,xijlaj−), aj−=iminxijl
8. Construct the weighted normalized fuzzy decision matrix Ṽ = [ṽ_ij] with ṽ_ij = W̃_j (·) r̃_ij (fuzzy product).
v~ij=(vijl,vijp,vijq,viju)=(wjlxijl,wjpxijp,wjqxijq,wjuxiju)
9. For each pair (g, f) and criterion j, compute the Hamming distances d(max(ṽ_gj, ṽ_fj), ṽ_gj) and d(max(ṽ_gj, ṽ_fj), ṽ_fj). Comparison rule: ṽ_gj ≥ ṽ_fj iff d(max, ṽ_fj) ≥ d(max, ṽ_gj).
d(A~,B~)=∫R∣μA~(x)−μB~(x)∣dx
10. Construct the concordance matrix C̃. For each ordered pair (g, f), J_C = {j : ṽ_gj ≥ ṽ_fj} and c̃_gf = Σ_{j∈J_C} W̃_j (fuzzy sum of weights in the concordance set).
c~gf=(cgfl,cgfp,cgfq,cgfu)=(j∈JC∑wjl,j∈JC∑wjp,j∈JC∑wjq,j∈JC∑wju)
11. Construct the discordance matrix D. d_gf is the ratio of the maximum Hamming distance over discordance criteria to the maximum Hamming distance over all criteria (yielding a crisp scalar in [0,1]).
dgf=maxjd(max(v~gj,v~fj), v~fj)maxj∈JDd(max(v~gj,v~fj), v~fj), JD={j:v~gj<v~fj}
12. Construct Boolean matrix B from the average concordance level C̄ = (c^l, c^p, c^q, c^u). b_gf = 1 iff c̃_gf ≥ C̄ (compared by Hamming distance, since both are TrFNs); else b_gf = 0.
Cˉ=(cl,cp,cq,cu), c∗=m(m−1)1f=1∑mg=1∑mcgf∗ for ∗∈{l,p,q,u}; bgf=1[c~gf⪰Cˉ]
13. Construct Boolean matrix H from the average discordance level D̄. h_gf = 1 iff d_gf < D̄; else 0.
Dˉ=m(m−1)1f=1∑mg=1∑mdgf; hgf=1[dgf<Dˉ]
14. Global matrix Z = B ⊗ H (Hadamard product, z_gf = b_gf · h_gf). Build the outranking decision graph G = (V, J): vertex per alternative; an arc A_g → A_f exists iff z_gf = 1. Pairs with z_gf = z_fg = 1 are indifferent; with z_gf = 0 = z_fg are incomparable.
Z=B⊗H, zgf=bgf⋅hgf; AgSAf⇔zgf=1