Cargando…
TOPSIS Method for Probabilistic Linguistic MAGDM with Entropy Weight and Its Application to Supplier Selection of New Agricultural Machinery Products
In multiple attribute group decision making (MAGDM) problems, uncertain decision information is well-represented by linguistic term sets (LTSs). These LTSs are easily converted into probabilistic linguistic sets (PLTSs). In this paper, a TOPSIS method is proposed for probabilistic linguistic MAGDM i...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514284/ http://dx.doi.org/10.3390/e21100953 |
Sumario: | In multiple attribute group decision making (MAGDM) problems, uncertain decision information is well-represented by linguistic term sets (LTSs). These LTSs are easily converted into probabilistic linguistic sets (PLTSs). In this paper, a TOPSIS method is proposed for probabilistic linguistic MAGDM in which the attribute weights are completely unknown, and the decision information is in the form of probabilistic linguistic numbers (PLNs). First, the definition of the scoring function is used to solve the probabilistic linguistic entropy, which is then employed to objectively derive the attribute weights. Second, the optimal alternatives are determined by calculating the shortest distance from the probabilistic linguistic positive ideal solution (PLPIS) and on the other side the farthest distance of the probabilistic linguistic negative ideal solution (PLNIS). This proposed method extends the applications range of the traditional entropy-weighted method. Moreover, it doesn’t need the decision-maker to give the attribute weights in advance. Finally, a numerical example for supplier selection of new agricultural machinery products is used to illustrate the use of the proposed method. The result shows the approach is simple, effective and easy to calculate. The proposed method can contribute to the selection of suitable alternative successfully in other selection problems. |
---|