GRA for Multi Attribute Decision Making in Neutrosophic Cubic Set Environment

Authors

  • Durga Banerjee Ranaghat Yusuf Institution, P. O. Ranaghat,Dist. Nadia, West Bengal, Pin Code-741201, India
  • Bibhas C. Giri Department of Mathematics, Nandalal Ghosh B.T. College, Panpur, PO-Narayanpur, and District: North 24 Parganas, Pin Code: 743126, West Bengal, India
  • Surapati Pramanik Department of Mathematics, Nandalal Ghosh B.T. College, Panpur, PO-Narayanpur, and District: North 24 Parganas, Pin Code: 743126, West Bengal, India
  • Florentin Smarandache Department of Mathematics, University of New Mexico, Gallup, NM 87301, USA

Keywords:

Grey relational coefficient, interval valued neutrosophic set, multi attribute decision making, neutrosophic set,, neutrosophic cubic set, relative closeness coefficien

Abstract

In this paper, multi attribute decision making problem based on grey relational analysis in neutrosophic cubic set environment is investigated. In the decision making situation, the attribute weights are considered as single valued neutrosophic sets. The neutrosophic weights are converted into crisp weights. Both positve and negative GRA coefficients, and weighted GRA coefficients are determined. Hamming distances for weighted GRA coefficients and standard (ideal) GRA coefficients are determined. The relative closeness coefficients are derived in order to rank the alternatives. The relative closeness coefficients are designed in ascending order. Finally, a numerical example is solved to demonstrate the applicability of the proposed approach

Downloads

Download data is not yet available.

Downloads

Published

2017-02-15

Issue

Section

SI#1,2024: Neutrosophical Advancements And Their Impact on Research

How to Cite

Banerjee, D. ., Giri, B. C. ., Pramanik, S., & Smarandache, F. (2017). GRA for Multi Attribute Decision Making in Neutrosophic Cubic Set Environment. Neutrosophic Sets and Systems, 15, 60-69. https://fs.unm.edu/nss8/index.php/111/article/view/375

Most read articles by the same author(s)

<< < 3 4 5 6 7 8 9 10 11 12 > >>