To calculate TOPSIS
Project description
TOPSIS
It is a method of compensatory aggregation that compares a set of alternatives by identifying weights for each criterion, 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.
TopsisPy
TopsisPy is a Python Package implementing Topsis method used for multi-criteria decision analysis. Topsis stands for 'Technique for Order of Preference by Similarity to Ideal Solution'.
TopsisPy intends to make the process of TOPSIS simple in python. Key features of the package are -
- Easy to use
- Numpy based
- Ideal for Students
Topsis for decision making
Step 1. Construct the decision matrixes and determine the weights of criteria for k-decision makers.
Step 2. Calculate the normalized decision matrix for each decision maker.
This step transforms various attribute dimensions into non-dimensional attributes which allows comparisons across criteria. Because various criteria are usually measured in various units, the scores in the evaluation matrix X have to be transformed to a normalized scale. The normalization of values can be carried out by one of the several known standardized formulas.
Step 3. Determine the positive ideal and negative ideal solutions for each decision maker
The weighted normalized value v is calculated by multiplying it with weight.
Step 4. Calculate the separation measures from the positive ideal solution and the negative ideal solution.
Identify the positive ideal alternative (extreme performance on each criterion) and identify the negative ideal alternative (reverse extreme performance on each criterion). The ideal positive solution is the solution that maximizes the benefit criteria and minimizes the cost criteria whereas the negative ideal solution maximizes the cost criteria and minimizes the benefit criteria.
Step 5. Calculate the separation measures.
In the TOPSIS method a number of distance metrics can be applied.
Step 6. Calculate the relative closeness to the positive ideal solution.
Step 7. Rank the preference order or select the alternative closest to 1.
A set of alternatives now can be ranked by the descending order of the value of Ri.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file TOPSIS_DishaSharma_101803637-0.0.1-py3-none-any.whl.
File metadata
- Download URL: TOPSIS_DishaSharma_101803637-0.0.1-py3-none-any.whl
- Upload date:
- Size: 4.2 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.2.0 pkginfo/1.5.0.1 requests/2.24.0 setuptools/49.2.0.post20200714 requests-toolbelt/0.9.1 tqdm/4.47.0 CPython/3.8.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
71fd32693e9b0c31b9bb55a5658f171b4028e16d757d0eeb3c0bc6ea8ecbc948
|
|
| MD5 |
ea135b11b8b7ea2ceea920bd5db64912
|
|
| BLAKE2b-256 |
bdb146b8eaeb7b97100b2cd0c185d704f3be5cf1131f9295fbae593da36e8d00
|