TOPSIS

The Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is a multi-criteria decision analysis method, which was originally developed by Ching-Lai Hwang and Yoon in 1981^[1] with further developments by Yoon in 1987,^[2] and Hwang, Lai and Liu in 1993.^[3] TOPSIS is based on the concept that the chosen alternative should have the shortest geometric distance from the positive ideal solution (PIS) and the longest geometric distance from the negative ideal solution (NIS).^{[citation needed]} A dedicated book in the fuzzy context was published in 2021 ^[4]

Description

It is a method of compensatory aggregation that compares a set of alternatives, normalising scores for each criterion and calculating the geometric distance between each alternative and the ideal alternative, which is the best score in each criterion. The weights of the criteria in TOPSIS method can be calculated using Ordinal Priority Approach, Analytic hierarchy process, etc. An assumption of TOPSIS is that the criteria are monotonically increasing or decreasing. Normalisation is usually required as the parameters or criteria are often of incongruous dimensions in multi-criteria problems.^[5][6] Compensatory methods such as TOPSIS allow trade-offs between criteria, where a poor result in one criterion can be negated by a good result in another criterion. This provides a more realistic form of modelling than non-compensatory methods, which include or exclude alternative solutions based on hard cut-offs.^[7] An example of application on nuclear power plants is provided in.^[8]

TOPSIS method

The TOPSIS process is carried out as follows:

Step 1

Create an evaluation matrix consisting of m alternatives and n criteria, with the intersection of each alternative and criteria given as [math]\displaystyle{ x_{ij} }[/math], we therefore have a matrix [math]\displaystyle{ ( x_{ij} )_{m \times n} }[/math].

Step 2

The matrix [math]\displaystyle{ ( x_{ij} )_{m \times n} }[/math] is then normalised to form the matrix

[math]\displaystyle{ R = ( r_{ij} )_{m \times n} }[/math], using the normalisation method

[math]\displaystyle{ r_{ij} = \frac {x_{ij}} {\sqrt{\sum_{k=1}^m x_{kj}^2 }}, \quad i = 1, 2, \ldots, m, \quad j = 1, 2, \ldots, n }[/math]

Step 3

Calculate the weighted normalised decision matrix

[math]\displaystyle{ t_{ij}= r_{ij}\cdot w_j, \quad i=1,2,\ldots,m, \quad j=1,2,\ldots,n }[/math]

where [math]\displaystyle{ w_j = W_j \Big/ \sum_{k=1}^n W_k, j = 1, 2, \ldots, n }[/math] so that [math]\displaystyle{ \sum_{i=1}^n w_i = 1 }[/math], and [math]\displaystyle{ W_j }[/math] is the original weight given to the indicator [math]\displaystyle{ v_j, \quad j = 1, 2, \ldots, n. }[/math]

Step 4

Determine the worst alternative [math]\displaystyle{ (A_w) }[/math] and the best alternative [math]\displaystyle{ (A_b) }[/math]:

[math]\displaystyle{ A_w = \{ \langle \max(t_{ij} \mid i = 1,2,\ldots,m) \mid j \in J_- \rangle, \langle \min(t_{ij} \mid i = 1,2,\ldots,m) \mid j \in J_+ \rangle \rbrace \equiv \{ t_{wj} \mid j= 1,2,\ldots,n \rbrace, }[/math]

[math]\displaystyle{ A_b = \{ \langle \min(t_{ij} \mid i = 1,2,\ldots,m) \mid j \in J_- \rangle, \langle \max(t_{ij} \mid i = 1,2,\ldots,m) \mid j \in J_+ \rangle \rbrace \equiv \{ t_{bj} \mid j= 1,2,\ldots,n \rbrace, }[/math]

where,

[math]\displaystyle{ J_+ = \{ j = 1,2,\ldots,n \mid j\} }[/math] associated with the criteria having a positive impact, and

[math]\displaystyle{ J_- = \{ j = 1,2,\ldots,n \mid j\} }[/math] associated with the criteria having a negative impact.

Step 5

Calculate the L²-distance between the target alternative [math]\displaystyle{ i }[/math] and the worst condition [math]\displaystyle{ A_w }[/math]

[math]\displaystyle{ d_{iw} = \sqrt{\sum_{j=1}^n (t_{ij} - t_{wj})^2}, \quad i = 1, 2, \ldots, m, }[/math]

and the distance between the alternative [math]\displaystyle{ i }[/math] and the best condition [math]\displaystyle{ A_b }[/math]

[math]\displaystyle{ d_{ib} = \sqrt{\sum_{j=1}^n (t_{ij} - t_{bj})^2}, \quad i = 1, 2, \ldots , m }[/math]

where [math]\displaystyle{ d_{iw} }[/math] and [math]\displaystyle{ d_{ib} }[/math] are L²-norm distances from the target alternative [math]\displaystyle{ i }[/math] to the worst and best conditions, respectively.

Step 6

Calculate the similarity to the worst condition:

[math]\displaystyle{ s_{iw}= d_{iw} / (d_{iw} + d_{ib}), \quad 0 \le s_{iw} \le 1, \quad i = 1, 2, \ldots , m. }[/math]

[math]\displaystyle{ s_{iw} = 1 }[/math] if and only if the alternative solution has the best condition; and

[math]\displaystyle{ s_{iw} = 0 }[/math] if and only if the alternative solution has the worst condition.

Step 7

Rank the alternatives according to [math]\displaystyle{ s_{iw} \,\, (i = 1, 2, \ldots, m). }[/math]

Normalisation

Two methods of normalisation that have been used to deal with incongruous criteria dimensions are linear normalisation and vector normalisation.

Linear normalisation can be calculated as in Step 2 of the TOPSIS process above. Vector normalisation was incorporated with the original development of the TOPSIS method,^[1] and is calculated using the following formula:

[math]\displaystyle{ r_{ij} = \frac {x_{ij}} {\sqrt{\sum_{k=1}^m x_{kj}^2 }}, \quad i = 1, 2, \ldots, m, \quad j = 1, 2, \ldots, n }[/math]

In using vector normalisation, the non-linear distances between single dimension scores and ratios should produce smoother trade-offs.^[9]

Online tools

• [1] : DeciGen A free MCDA Plugin for Grasshopper [2].
• Decision Radar : A free online TOPSIS calculator written in Python.
• Yadav, Vinay; Karmakar, Subhankar; Kalbar, Pradip P.; Dikshit, A.K. (January 2019). "PyTOPS: A Python based tool for TOPSIS". SoftwareX 9: 217–222. doi:10.1016/j.softx.2019.02.004. Bibcode: 2019SoftX...9..217Y. 

References

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/TOPSIS. Read more