IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5510627.html
   My bibliography  Save this article

Integrating an Extended Outranking-TOPSIS Method with Probabilistic Linguistic Term Sets for Multiattribute Group Decision-Making

Author

Listed:
  • Feng Shen
  • Zhiyuan Yang
  • Dongliang Cai
  • Francesco Lo Iudice

Abstract

Group decision-making is a common activity in organizational management and economic conditions. In practice, the opinions of experts may be fuzzy. This paper proposes integrating an extended outranking-TOPSIS method with probabilistic linguistic term sets for multiattribute group decision-making, which is used to solve the real-world public-private partnership (PPP) project selection problem. First, an extended outranking method based on probabilistic linguistic term sets is proposed, and each expert’s ranking of alternatives is obtained according to this method. After the individual ranking is completed, the large-scale expert group is clustered by the K-means clustering method, and then the improved consensus mechanism is used to study the degree of consensus of the expert group. If the consensus of the group is not up to the standard, then, for clusters with a lower degree of consensus with the group, the feedback mechanism is used to adjust the weight between different clusters so that the group consensus can be improved. After achieving the target group consensus, an improved technique for order preference by similarity to an ideal solution (TOPSIS) method is used to synthesize expert opinions, and the ranking results are obtained. Finally, there are cases used to demonstrate the feasibility and rationality of the method.

Suggested Citation

  • Feng Shen & Zhiyuan Yang & Dongliang Cai & Francesco Lo Iudice, 2021. "Integrating an Extended Outranking-TOPSIS Method with Probabilistic Linguistic Term Sets for Multiattribute Group Decision-Making," Complexity, Hindawi, vol. 2021, pages 1-19, June.
  • Handle: RePEc:hin:complx:5510627
    DOI: 10.1155/2021/5510627
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5510627.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5510627.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5510627?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:5510627. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.