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

Novel EDAS Methodology Based on Single-Valued Neutrosophic Aczel-Alsina Aggregation Information and Their Application in Complex Decision-Making

Author

Listed:
  • Shahzaib Ashraf
  • Shakoor Ahmad
  • Muhammad Naeem
  • Muhammad Riaz
  • Md. Ashraful Alam
  • Zeljko Stevic

Abstract

In this article, we proposed an extended EDAS (Evaluation based on Distance from Average Solution) method based on the single-valued neutrosophic (SVN) Aczel-Alsina aggregation information. The fundamental concept of a single-valued neutrosophic (SVN) set is a universal mathematical tool for effectively managing uncertain and imprecise information. To accomplish our goal, we first extend the Aczel-Alsina t-norm and t-conorm to SVN scenarios and introduce a few new SVN operations on which we construct novel SVN aggregation operators. Furthermore, a decision support strategy is built in the SVN framework using the EDAS methodology and the suggested Aczel-Alsina aggregation operators. This method computes the aggregated outcomes of each investigated alternative, as well as their score values. Finally, to demonstrate the functionality of the developed SVN- EDAS, an application has been made related to the role of commercial banks in providing loans to their customers, which has recently affected our world, and the results are compared with other existing methods. The results suggest that the proposed method may overcome the inadequacies of the existing decision method’s lack of decision flexibility by using SVN aggregation operators.

Suggested Citation

  • Shahzaib Ashraf & Shakoor Ahmad & Muhammad Naeem & Muhammad Riaz & Md. Ashraful Alam & Zeljko Stevic, 2022. "Novel EDAS Methodology Based on Single-Valued Neutrosophic Aczel-Alsina Aggregation Information and Their Application in Complex Decision-Making," Complexity, Hindawi, vol. 2022, pages 1-18, October.
  • Handle: RePEc:hin:complx:2394472
    DOI: 10.1155/2022/2394472
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/2394472.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/2394472.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/2394472?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:2394472. 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.