翻訳と辞書
Words near each other
・ Tor (disambiguation)
・ Tor (genus)
・ Tor (research station)
・ Tor (rock formation)
・ Tor Ahlsand
・ Topshop
・ Topshur
・ Topsia
・ Topsia Cola
・ Topside
・ Topside (Brooksville, Maine)
・ Topside Glacier
・ Topside, Wisconsin
・ Topsider
・ Topsides
TOPSIS
・ Topsite
・ Topsite (warez)
・ Topsite Templating System
・ Topslip
・ Topsmead State Forest
・ Topsoil
・ TopSolid
・ Topspin
・ Topspin (disambiguation)
・ Topspin (Transformers)
・ Topspin Media
・ Topspinner
・ Topspinner (disambiguation)
・ Topsport Vlaanderen-Baloise


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

TOPSIS : ウィキペディア英語版
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 Hwang and Yoon in 1981 with further developments by Yoon in 1987, and Hwang, Lai and Liu in 1993.
TOPSIS is based on the concept that the chosen alternative should have the shortest geometric distance from the positive ideal solution and the longest geometric distance from the negative ideal solution. 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. 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. 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.
==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 x_, we therefore have a matrix ( x_ )_.
;Step 2: The matrix ( x_ )_ is then normalised to form the matrix
R = ( r_ )_, using the normalisation method
r_ = \frac ^ x_^2 }}, i = 1, 2, . . ., m, j = 1, 2, . . ., n
;Step 3: Calculate the weighted normalised decision matrix
T =(t_)_ = ( w_jr_ )_, i = 1, 2, . . ., m
:Where w_j = W_j / \sum_^W_j, j = 1, 2, . . ., n so that \sum_^ w_j = 1, and W_j is the original weight given to the indicator v_j, j = 1, 2, . . ., n.
;Step 4: Determine the worst alternative (A_w) and the best alternative (A_b):
A_w = \ | i = 1,2,...,m)| j \in J_+ \rangle \rbrace \equiv \ | i = 1,2,...,m)| j \in J_- \rangle, \langle max(t_ | i = 1,2,...,m)| j \in J_+ \rangle \rbrace \equiv \ = \sqrt(t_ - t_)^2}, i = 1, 2, . . ., m ,
and the distance between the alternative i and the best condition A_b
: d_ = \sqrt(t_ - t_)^2}, i = 1, 2, . . ., m
:where d_ and d_ are L2-norm distances from the target alternative i to the worst and best conditions, respectively.
;Step 6: Calculate the similarity to the worst condition:
s_= d_ / (d_ + d_), 0 \le s_ \le 1, i = 1, 2, . . ., m .
s_ = 1 if and only if the alternative solution has the best condition; and
s_ = 0 if and only if the alternative solution has the worst condition.
; Step 7: Rank the alternatives according to s_ (i = 1, 2, . . ., m).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「TOPSIS」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.