MCDMAKER-logo

MCDM Methods

Step-by-Step Algorithms

MARCOS Method

Measurement Alternatives and Ranking According to Compromise Solution

2020 Željko Stević, Dragan Pamučar, Almir Puška, and Prabir Chatterjee 7 Steps

MARCOS (Measurement of Alternatives and Ranking according to COmpromise Solution) is an MCDM method that ranks alternatives by evaluating their relationship with the ideal and anti-ideal solutions. It calculates a utility degree for each alternative and obtains a compromise ranking.

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

Ideal and anti-ideal solutions

Formula

Add the ideal alternative \(AI\) and anti-ideal alternative \(AAI\) to the decision matrix :

$$ X^*=\left[ \begin{array}{c} AAI\\ A_1\\ A_2\\ \vdots\\ A_m\\ AI \end{array} \right] $$

For a benefit criterion :

$$ AI_j=\max_i x_{ij} $$ $$ AAI_j=\min_i x_{ij} $$

For a cost criterion :

$$ AI_j=\min_i x_{ij} $$ $$ AAI_j=\max_i x_{ij} $$

C₁ and C₃ are benefit criteria, C₂ is a cost criterion.

Solution$C_1$$C_2$$C_3$
$AAI$102530
$AI$251535
3

Normalize the extended decision matrix

Formula

For a benefit criterion :

$$ r_{ij}=\frac{x_{ij}}{x_{AI,j}} $$

For a cost criterion :

$$ r_{ij}=\frac{x_{AI,j}}{x_{ij}} $$

where \(x_{AI,j}\) is the ideal value of criterion \(j\).

C₁ and C₃ use benefit normalization. C₂ uses cost normalization (divides ideal by value). The matrix includes $AAI$ and $AI$ rows.

Alternative$C_1$$C_2$$C_3$
$AAI$0.40000.60000.8571
$A_1$0.40000.75000.8571
$A_2$0.60000.60001.0000
$A_3$1.00001.00001.0000
$AI$1.00001.00001.0000
4

Calculate the weighted normalized matrix

Formula

Multiply each normalized value by the corresponding criterion weight :

$$ v_{ij}=r_{ij}w_j $$

Where :

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

Using weights from the Entropy method: $w_1=0.7279$, $w_2=0.2009$, $w_3=0.0712$

Alternative$C_1$$C_2$$C_3$
$AAI$0.29120.12050.0610
$A_1$0.29120.15070.0610
$A_2$0.43670.12050.0712
$A_3$0.72790.20090.0712
$AI$0.72790.20090.0712
5

Calculate Si values

Formula

\(S_i\) is the sum of the weighted normalized values :

$$ S_i=\sum_{j=1}^{n}v_{ij} $$
Alternative$S_i$
$AAI$0.4727
$A_1$0.5029
$A_2$0.6284
$A_3$1.0000
$AI$1.0000
6

Calculate the utility degree

Formula

Calculate the utility degree of each alternative with respect to the anti-ideal and ideal solutions :

$$ K_i^-=\frac{S_i}{S_{AAI}} $$
$$ K_i^+=\frac{S_i}{S_{AI}} $$
Alternative$K_i^-$$K_i^+$
$AAI$1.00000.4727
$A_1$1.06390.5029
$A_2$1.32950.6284
$A_3$2.11551.0000
$AI$2.11551.0000
7

Utility function and ranking

Formula

The utility function of alternative \(A_i\) is :

$$ f(K_i)=\frac{ K_i^+ + K_i^-}{ 1+ \frac{1-f(K_i^+)}{f(K_i^+)} + \frac{1-f(K_i^-)}{f(K_i^-)}} $$

Where the utility functions related to the ideal and anti-ideal solutions are :

$$ f(K_i^+)=\frac{K_i^+} {K_i^+ + K_i^-} $$
$$ f(K_i^-)=\frac{K_i^-} {K_i^+ + K_i^-} $$

Rank the alternatives according to their final utility function values :

$$ f(K_i)>f(K_k) \quad\Longrightarrow\quad A_i >A_k $$
Alternative$f(K_i^+)$$f(K_i^-)$$f(K_i)$
$AAI$0.32100.67900.4104
$A_1$0.32100.67900.4366
$A_2$0.32100.67900.5456
$A_3$0.32100.67900.8682
$AI$0.32100.67900.8682
Utility functions: $f(K_3)=0.8682 >f(K_2)=0.5456 >f(K_1)=0.4366$
Final ranking: $A_3 \succ A_2 \succ A_1$

MARCOS Algorithm Flowchart