MCDMAKER-logo

MCDM Methods

Step-by-Step Algorithms

CILOS Method

Criterion Impact Loss

2016 Zavadskas and Podvezko 7 Steps

The Criterion Impact Loss (CILOS) method is an objective criterion weighting technique for Multi-Criteria Decision-Making (MCDM), introduced by Zavadskas and Podvezko in 2016. It estimates criterion weights by evaluating the relative impact loss associated with each criterion, using only the decision matrix and without requiring expert judgments.

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$304015
$A_2$101020
$A_3$202535
Criterion type: C₁ Benefit Cā‚‚ Cost Cā‚ƒ Benefit
2

Construct the transformed matrix

Since the CILOS method requires all criteria to be benefit criteria, each cost criterion is transformed into a benefit criterion.

Formula

Convert all cost criteria into benefit criteria .

$$ x'_{ij}=\begin{cases} x_{ij}, & \text{if criterion}j\text{ is a benefit criterion}, \\[10pt] \dfrac{\min_i(x_{ij})}{x_{ij}}, & \text{if criterion}j\text{ is a cost criterion.} \end{cases} $$

The transformed matrix is

$$ 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} $$
Alternative$C_1$$C_2$$C_3$
$A_1$300.250015
$A_2$101.000020
$A_3$200.400035
3

Normalize the decision matrix

Formula

Normalize every column using the column sum.

$$ r_{ij}=\frac{x'_{ij}} {\displaystyle\sum_{i=1}^{m}x'_{ij}} $$

The normalized matrix is

$$ R=[r_{ij}]=\begin{bmatrix} r_{11}&r_{12}&\cdots&r_{1n}\\ r_{21}&r_{22}&\cdots&r_{2n}\\ \vdots&\vdots&\ddots&\vdots\\ r_{m1}&r_{m2}&\cdots&r_{mn} \end{bmatrix} $$
Alternative$C_1$$C_2$$C_3$
$A_1$0.50000.15150.2143
$A_2$0.16670.60610.2857
$A_3$0.33330.24240.5000
4

Square matrix

Formula

Find the maximum value for every criterion.

$$ a_j=\max_i(r_{ij}) $$

If alternative \(k_j\) contains the maximum value of criterion \(j\), select that entire row to build the square matrix.

$$ A=\begin{bmatrix} r_{k_1 1}&r_{k_1 2}&\cdots&r_{k_1 n}\\ r_{k_2 1}&r_{k_2 2}&\cdots&r_{k_2 n}\\ \vdots&\vdots&\ddots&\vdots\\ r_{k_n 1}&r_{k_n 2}&\cdots&r_{k_n n} \end{bmatrix} $$

The diagonal elements satisfy

$$ a_{jj}=\max_i(r_{ij}) $$
Metric$C_1$$C_2$$C_3$
Max value ($a_j$)0.50000.60610.5000
Alternative ($k_j$)$A_1$$A_2$$A_3$

Square matrix $A$: row $k_j$ is the entire row of alternative $k_j$ from the normalized matrix.

Row$C_1$$C_2$$C_3$
$k_1$ ($A_1$)0.50000.15150.2143
$k_2$ ($A_2$)0.16670.60610.2857
$k_3$ ($A_3$)0.33330.24240.5000
5

Relative impact loss matrix

Formula
$$ P=[p_{ij}], \qquad i,j=1,2,\ldots,n $$

Where

$$ p_{ij}=\frac{a_{jj}-a_{ij}} {a_{jj}} $$

The diagonal elements are

$$ p_{ii}=0 $$

Thus, the relative impact loss matrix is

$$ P=\begin{bmatrix} 0 & p_{12} & \cdots & p_{1n}\\ p_{21} & 0 & \cdots & p_{2n}\\ \vdots & \vdots & \ddots & \vdots\\ p_{n1} & p_{n2} & \cdots & 0 \end{bmatrix} $$
$P$$C_1$$C_2$$C_3$
$C_1$0.00000.75000.5714
$C_2$0.66670.00000.4286
$C_3$0.33330.60000.0000
6

Weights system matrix

Formula

Construct the weights system matrix

$$ F=[f_{ij}] $$

Where

$$ f_{ii}=-\sum_{i=1}^{n} p_{ij} $$

and

$$ f_{ij}=p_{ij}, \qquad i \ne j. $$

Hence,

$$ F=\begin{bmatrix} -\displaystyle\sum_{i=1}^{n}p_{i1} & p_{12} & \cdots & p_{1n} \\ p_{21} & -\displaystyle\sum_{i=1}^{n}p_{i2} & \cdots & p_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ p_{n1} & p_{n2} & \cdots & -\displaystyle\sum_{i=1}^{n}p_{in} \end{bmatrix} $$
$F$$C_1$$C_2$$C_3$
$C_1$-1.00000.75000.5714
$C_2$0.6667-1.35000.4286
$C_3$0.33330.6000-1.0000
7

Weights of criteria

Formula

The objective weights are obtained by solving the following homogeneous system of equations:

$$ Fq=0 $$

subject to the normalization constraint

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

and the non-negativity constraint

$$ q_j \ge 0, \qquad j=1,2,\ldots,n. $$

The resulting objective weight vector is

$$ q=\begin{bmatrix} q_1\\ q_2\\ \vdots\\ q_n \end{bmatrix} $$

Where each \(q_j\) is the objective weight of criterion \(j\).

CriterionWeight ($q_j$)
$C_1$0.3971
$C_2$0.2941
$C_3$0.3088
Objective weights: $q_1=0.3971 >q_3=0.3088 >q_2=0.2941$
Verification: $q_1 + q_2 + q_3=0.3971 + 0.2941 + 0.3088=1.0000$ āœ“

CILOS Algorithm Flowchart