MCDMAKER-logo

MCDM Methods

Step-by-Step Algorithms

MABAC Method

Multi-Attributive Border Approximation Area Comparison

2015 Dragan Pamučar and Goran Ćirović 6 Steps

MABAC (Multi-Attributive Border Approximation Area Comparison) is an MCDM ranking method that evaluates alternatives by measuring their distance from the Border Approximation Area (BAA). Alternatives positioned above the border are considered more favorable, while those below it are less favorable.

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$ (given)
2

Normalize the decision matrix

Formula

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

$$ r_{ij}=\frac{x_{ij}-x_j^{-}} {x_j^{+}-x_j^{-}} $$

For a cost criterion , where a lower value is preferred :

$$ r_{ij}=\frac{x_{ij}-x_j^{+}} {x_j^{-}-x_j^{+}} $$

Where \(x_j^{+}\) and \(x_j^{-}\) are respectively the maximum and minimum values of criterion \(j\).

C₁: $x_1^{+}=25,\;x_1^{-}=10$ (benefit) · C₂: $x_2^{+}=25,\;x_2^{-}=15$ (cost) · C₃: $x_3^{+}=35,\;x_3^{-}=30$ (benefit)

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

Weighted normalized decision matrix

Formula

Using the criterion weights \(w_j\), calculate :

$$ v_{ij}=w_j(r_{ij}+1) $$

Where :

$$ \sum_{j=1}^{n}w_j=1, \qquad w_j\geq0 $$

The weighted matrix incorporates the relative importance of each criterion.

Using weights: $w_1=0.7279$, $w_2=0.2009$, $w_3=0.0712$

Alternative$C_1$$C_2$$C_3$
$A_1$0.72790.30140.0712
$A_2$0.97050.20090.1424
$A_3$1.45580.40180.1424
4

Calculate the border approximation area (BAA)

Formula

For each criterion \(j\), calculate the geometric mean of the weighted normalized values :

$$ g_j=\left( \prod_{i=1}^{m}v_{ij} \right)^{\frac{1}{m}} $$

The Border Approximation Area matrix is :

$$ G=[g_1,g_2,\ldots,g_n] $$

The BAA represents the boundary against which the alternatives are compared.

Metric$C_1$$C_2$$C_3$
BAA ($g_j$)1.00940.28970.1130
5

Calculate the distance from the BAA

Formula

Calculate the distance of each alternative from the border approximation area :

$$ q_{ij}=v_{ij}-g_j $$

The matrix of distances is :

$$ Q=[q_{ij}]_{m\times n} $$

A positive \(q_{ij}\) means that the alternative is above the BAA for criterion \(j\), while a negative value means that it is below the BAA.

Alternative$C_1$$C_2$$C_3$
$A_1$-0.28150.0117-0.0418
$A_2$-0.0389-0.08880.0294
$A_3$0.44640.11210.0294
6

Total distances from the border approximation area and ranking

Formula

For each alternative, sum its distances from the BAA :

$$ S_i=\sum_{j=1}^{n}q_{ij} $$

Where \(S_i\) is the overall MABAC score of alternative \(A_i\).


Rank the alternatives according to their MABAC scores :

$$ S_i>S_k \quad\Longrightarrow\quad A_i >A_k $$

A positive $S_i$ means the alternative is above the BAA (desirable). A negative $S_i$ means it is below (undesirable).

AlternativeMABAC Score ($S_i$)
$A_1$-0.3116
$A_2$-0.0983
$A_3$0.5879
MABAC scores: $S_3=0.5879 >S_2=-0.0983 >S_1=-0.3116$
Final ranking: $A_3 \succ A_2 \succ A_1$

MABAC Algorithm Flowchart