MCDMAKER-logo

MCDM Methods

Step-by-Step Algorithms

GRA Method

Grey Relational Analysis

1982 Deng Julong 5 Steps

Grey Relational Analysis (GRA) is a prominent Multi-Criteria Decision-Making (MCDM) method rooted in Grey System Theory, originally developed by Deng Julong . It evaluates and ranks alternatives by measuring the degree of similarity and relationship between actual data sequences and an ideal reference sequence.

Video Demonstration

Step-by-Step Algorithm

Calculated cell
Source cells in formula
1

Form the Decision Matrix

Create the decision matrix with $m$ alternatives and $n$ criteria :

\[ X=\begin{bmatrix} x_{11} & x_{12} & \cdots & x_{1n}\\ x_{21} & x_{22} & \cdots & x_{2n}\\ \vdots & \vdots & \ddots & \vdots\\ x_{m1} & x_{m2} & \cdots & x_{mn} \end{bmatrix} \]

\(x_{ij}\) presents the performance value of ith alternative on jth criterion, m and n are the numbers of alternatives and criteria respectively.

Alternative$C_1$$C_2$$C_3$
$A_1$102030
$A_2$152535
$A_3$251535
Criterion type: C₁ Benefit C₂ Cost C₃ Benefit
Weights: $w_1=0.7279$ · $w_2=0.2009$ · $w_3=0.0712$ (Entropy method)
2

Normalize the decision matrix

Formula

For a benefit criterion , where a higher value is better :

$$ x_{ij}^{*}=\frac{x_{ij}-\min_i x_{ij}} {\max_i x_{ij}-\min_i x_{ij}} $$

For a non-benefit criterion , where a lower value is better :

$$ x_{ij}^{*}=\frac{\max_i x_{ij}-x_{ij}} {\max_i x_{ij}-\min_i x_{ij}} $$

After normalization, larger values indicate better performance.

C₁, C₃: benefit (range 15, 5). C₂: cost (range 10).

Alternative$C_1$$C_2$$C_3$
$A_1$0.00000.50000.0000
$A_2$0.33330.00001.0000
$A_3$1.00001.00001.0000
3

Deviation sequence

Formula

The ideal reference sequence is defined as :

$$ X_0=(1,1,\ldots,1) $$

The deviation between alternative \(A_i\) and the reference sequence for criterion \(j\) is :

$$ \Delta_{0ij}=\left|x_{0j}-x_{ij}^{*}\right| $$

Since \(x_{0j}=1\), this can be written as :

$$ \Delta_{0ij}=\left|1-x_{ij}^{*}\right| $$

The minimum and maximum deviations are :

$$ \Delta_{\min}=\min_i\min_j\Delta_{0ij} $$
$$ \Delta_{\max}=\max_i\max_j\Delta_{0ij} $$
Alternative$C_1$$C_2$$C_3$
$A_1$1.00000.50001.0000
$A_2$0.66671.00000.0000
$A_3$0.00000.00000.0000
Deviations summary: $\Delta_{\min}=0.0000$ · $\Delta_{\max}=1.0000$
4

Grey relational coefficient

Formula

The grey relational coefficient measures the closeness of each alternative to the reference sequence :

$$ \xi_{ij}=\frac{ \Delta_{\min}+\delta\Delta_{\max}}{ \Delta_{0ij}+\delta\Delta_{\max}} $$

where \(\delta\) is the distinguishing coefficient, usually :

$$ 0<\delta\le1 $$

A commonly used value is:

$$ \delta=0.5 $$

A higher \(\xi_{ij}\) indicates that alternative \(A_i\) is closer to the ideal reference for criterion \(j\).

Using $\delta=0.5$, $\Delta_{\min}=0$, $\Delta_{\max}=1$. Each $\xi_{ij}$ relates to its deviation cell.

Alternative$C_1$$C_2$$C_3$
$A_1$0.33330.50000.3333
$A_2$0.42860.33331.0000
$A_3$1.00001.00001.0000
5

Grey relational grade and ranking

Formula

The grey relational grade aggregates the grey relational coefficients of all criteria :

$$ \Gamma_i=\sum_{j=1}^{n} w_j\xi_{ij} $$

where \(w_j\) is the weight of criterion \(j\), satisfying :

$$ \sum_{j=1}^{n}w_j=1 $$

If all criteria have equal weights, the grey relational grade becomes :

$$ \Gamma_i=\frac{1}{n} \sum_{j=1}^{n}\xi_{ij} $$

The alternatives are ranked according to their grey relational grades :

$$ \Gamma_i>\Gamma_k \quad\Longrightarrow\quad A_i >A_k $$
Alternative$\Gamma_i$
$A_1$0.3668
$A_2$0.4502
$A_3$1.0000
Grey relational grades: $\Gamma_3=1.0000 >\Gamma_2=0.4502 >\Gamma_1=0.3668$
Final ranking: $A_3 \succ A_2 \succ A_1$

GRA Algorithm Flowchart