Scribd
Upload
9 views

TOPSIS

Uploaded by

Akhilesh Mandal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

TOPSIS

Uploaded by

Akhilesh Mandal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

TOPSIS-Introduction

Technique for Order Preference by Similarity to Ideal Solution


(TOPSIS) method was developed Hwang and Yoon (1981).
This method is based on the concept that the chosen
alternatives should have the shortest distance from the
positive-ideal solution and the longest distance from the
negative-ideal solution.
For an MADM problem with m alternatives that are evaluated
by n attributes/criteria, the positive-ideal solution is denoted
as
A∗ = (x1∗ , x2∗ , ..., xj∗ , ..., xn∗ ),
where xj∗ is the best value for the j-th attribute among all
available alternatives.
The negative-ideal solution is given as
A− = (x1− , x2− , ..., xj− , ..., xn− ),
where xj− is the worst value for the j-th attribute among all
available alternatives.
TOPSIS-Steps

The method is presented as the following steps:


Step 1: Calculate normalised ratings.
The vector normalisation is used for computing rij as
TOPSIS-Steps

The method is presented as the following steps:


Step 1: Calculate normalised ratings.
The vector normalisation is used for computing rij as

Step 2: Calculate weighted normalised ratings. The weighted


normalised value is calculated as
TOPSIS-Steps

The method is presented as the following steps:


Step 1: Calculate normalised ratings.
The vector normalisation is used for computing rij as

Step 2: Calculate weighted normalised ratings. The weighted


normalised value is calculated as
Step 3: Identify positive-ideal and negative-ideal solutions.
Step 3: Identify positive-ideal and negative-ideal solutions.
A∗ and A− are defined in terms of weighted normalised values
as:
Step 4: Calculate separation measure
The separation of each alternative from the positive-ideal
solution, A∗ , is given by
Step 4: Calculate separation measure
The separation of each alternative from the positive-ideal
solution, A∗ , is given by

Similarly, the separation from the negative-ideal solution, A− ,


is given by
Step 5: Calculate similarities to positive-ideal
solution/Performance value.

Note that 0 ≤ Ci∗ ≤ 1 (or denoted as Pi∗ -Performance value),


where Ci∗ = 0, when Ai = A− ; and Ci∗ = 1, when Ai = A∗ .
Step 5: Calculate similarities to positive-ideal
solution/Performance value.

Note that 0 ≤ Ci∗ ≤ 1 (or denoted as Pi∗ -Performance value),


where Ci∗ = 0, when Ai = A− ; and Ci∗ = 1, when Ai = A∗ .
Step 6: Rank preference order
Choose an alternative with the maximum Ci∗ or rank
alternatives according to Ci∗ in descending order.
Selecting a best mobile phone
Let us have the following criteria matrix:

Convert the linguistic ratings into quantitative scale. Let us


convert using the below 5 point scale.
Normalize the vectors now using the normalization formula.

pPm
For 2
√ price/cost, i=1 xij = √
250 + 200 + 300 + 2752 + 2252 = 318750 = 564.579
2 2 2

Similarly for other criteria, For Storage=53.0659, For Camera=28,


and for Look=8.3666.
Normalized matrix can be computed as below:
Normalized Decision Matrix
Multiply by weights
Normalized performance values or weighted normalized decision
matrix
Ideal values
Calculate the distance from BEST Ideal and WORST Ideal
From BEST Ideal for Mobile 1:S1∗ or S1+ =

Similarly for all others as below:


Performance Score
Ranking on the basis of performance score

You might also like