Download Word
Download Excel
Print
TOPSIS as one of MCDM methods considers both the distance of each alternative from the positive ideal and the distance of each alternative from the negative ideal point. In other words, the best alternative should have the shortest distance from the positive ideal solution (PIS) and the longest distance from the negative ideal.
In this study there are 5 criteria and 5 alternatives that are ranked based on TOPSIS method. The following table describes the criteria
Characteristics of Criteria
| name | type | weight | |
| 1 | Program\n Reputation | Positive | 0.2 |
| 2 | Faculty Quality | Positive | 0.2 |
| 3 | Research Opportunities | Positive | 0.2 |
| 4 | Job Placement Rate | Positive | 0.2 |
| 5 | Cost of Attendance | Positive | 0.2 |
The following table shows the decision matrix.
Decision Matrix
| Program\n Reputation | Faculty Quality | Research Opportunities | Job Placement Rate | Cost of Attendance | |
| Stanford University Computer Science Program | 9 | 8 | 8 | 9 | 3 |
| Massachusetts Institute of Technology (MIT) Computer Science Program | 10 | 9 | 10 | 8 | 2 |
| Carnegie Mellon University Computer Science Program | 8 | 9 | 9 | 9 | 6 |
| University of California | 9 | 8 | 8 | 7 | 5 |
| California Institute of Technology (Caltech) Computer Science Program | 9 | 7 | 7 | 8 | 1 |
The Steps of the TOPSIS Method :
STEP 1: Normalize the decision-matrix.
The following formula can be used to normalize.
The following table shows the normalized matrix.
The normalized matrix
| Program\n Reputation | Faculty Quality | Research Opportunities | Job Placement Rate | Cost of Attendance | |
| Stanford University Computer Science Program | 0.446 | 0.435 | 0.423 | 0.489 | 0.346 |
| Massachusetts Institute of Technology (MIT) Computer Science Program | 0.496 | 0.489 | 0.529 | 0.435 | 0.231 |
| Carnegie Mellon University Computer Science Program | 0.397 | 0.489 | 0.476 | 0.489 | 0.693 |
| University of California | 0.446 | 0.435 | 0.423 | 0.38 | 0.577 |
| California Institute of Technology (Caltech) Computer Science Program | 0.446 | 0.38 | 0.37 | 0.435 | 0.115 |
STEP 2: Calculate the weighted normalized decision matrix.
According to the following formula, the normalized matrix is multiplied by the weight of the criteria.
The following table shows the weighted normalized decision matrix.
The weighted normalized matrix
| Program\n Reputation | Faculty Quality | Research Opportunities | Job Placement Rate | Cost of Attendance | |
| Stanford University Computer Science Program | 0.089 | 0.087 | 0.085 | 0.098 | 0.069 |
| Massachusetts Institute of Technology (MIT) Computer Science Program | 0.099 | 0.098 | 0.106 | 0.087 | 0.046 |
| Carnegie Mellon University Computer Science Program | 0.079 | 0.098 | 0.095 | 0.098 | 0.139 |
| University of California | 0.089 | 0.087 | 0.085 | 0.076 | 0.115 |
| California Institute of Technology (Caltech) Computer Science Program | 0.089 | 0.076 | 0.074 | 0.087 | 0.023 |
STEP 3: Determine the positive ideal and negative ideal solutions.
The aim of the TOPSIS method is to calculate the degree of distance of each alternative from positive and negative ideals. Therefore, in this step, the positive and negative ideal solutions are determined according to the following formulas.
So that
where j1 and j2 denote the negative and positive criteria, respectively.
The following table shows both positive and negative ideal values.
The positive and negative ideal values
| Positive ideal | Negative ideal | |
| Program\n Reputation | 0.099 | 0.079 |
| Faculty Quality | 0.098 | 0.076 |
| Research Opportunities | 0.106 | 0.074 |
| Job Placement Rate | 0.098 | 0.076 |
| Cost of Attendance | 0.139 | 0.023 |
STEP4: distance from the positive and negative ideal solutions
TOPSIS method ranks each alternative based on the relative closeness degree to the positive ideal and distance from the negative ideal. Therefore, in this step, the calculation of the distances between each alternative and the positive and negative ideal solutions is obtained by using the following formulas.
The following table shows the distance to the positive and negative ideal solutions.
Distance to positive and negative ideal points
| Distance to positive ideal | Distance to positive negative | |
| Stanford University Computer Science Program | 0.074 | 0.054 |
| Massachusetts Institute of Technology (MIT) Computer Science Program | 0.093 | 0.05 |
| Carnegie Mellon University Computer Science Program | 0.022 | 0.121 |
| University of California | 0.041 | 0.094 |
| California Institute of Technology (Caltech) Computer Science Program | 0.123 | 0.015 |
STEP 5: Calculate the relative closeness degree of alternatives to the ideal solution
In this step, the relative closeness degree of each alternative to the ideal solution is obtained by the following formula. If the relative closeness degree has value near to 1, it means that the alternative has shorter distance from the positive ideal solution and longer distance from the negative ideal solution.
The following table shows the relative closeness degree of each alternative to the ideal solution and its ranking.
The ci value and ranking
| Ci | rank | |
| Stanford University Computer Science Program | 0.423 | 3 |
| Massachusetts Institute of Technology (MIT) Computer Science Program | 0.351 | 4 |
| Carnegie Mellon University Computer Science Program | 0.844 | 1 |
| University of California | 0.697 | 2 |
| California Institute of Technology (Caltech) Computer Science Program | 0.107 | 5 |
The following figure shows the ci values.
The ci value