Open AccessArticle

A Robust Single-Valued Neutrosophic Soft Aggregation Operators in Multi-Criteria Decision Making

Chiranjibe Jana

and

Madhumangal Pal

Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721102, India

Author to whom correspondence should be addressed.

Symmetry 2019, 11(1), 110; https://doi.org/10.3390/sym11010110

Submission received: 14 December 2018 / Revised: 9 January 2019 / Accepted: 17 January 2019 / Published: 18 January 2019

(This article belongs to the Special Issue New types of Neutrosophic Set/Logic/Probability, Neutrosophic Over-/Under-/Off-Set, Neutrosophic Refined Set, and their Extension to Plithogenic Set/Logic/Probability, with Applications)

Download Versions Notes

Abstract

Molodtsov originated soft set theory that was provided a general mathematical framework for handling with uncertainties in which we meet the data by affix parameterized factor during the information analysis as differentiated to fuzzy as well as neutrosophic set theory. The main object of this paper is to lay a foundation for providing a new approach of single-valued neutrosophic soft tool which is considering many problems that contain uncertainties. In present study, a new aggregation operators of single-valued neutrosophic soft numbers have so far not yet been applied for ranking of the alternatives in decision-making problems. To this propose work, single-valued neutrosophic soft weighted arithmetic averaging (SVNSWA) operator, single-valued neutrosophic soft weighted geometric averaging (SVNSWGA) operator have been used to compare two single-valued neutrosophic soft numbers (SVNSNs) for aggregating different single-valued neutrosophic soft input arguments in neutrosophic soft environment. Then, its related properties have been investigated. Finally, a practical example for Medical diagnosis problems provided to test the feasibility and applicability of the proposed work.

Keywords:

single-valued neutrosophic soft number and its operations; SVN soft weighted arithmetic averaging operator; SVN soft weighted geometric averaging operator; decision-making

1. Introduction

Multi-criteria decision-making (MCDM) problems seek great attention in modern decision science. The method is addressed to select the best alternative among the finite set of alternatives as claimed by decision makers under the preference values of the alternatives. MCDM problems extensively applied with quantitative or qualitative attribute values and have a board application in medical diagnosis [1,2], ecology [3], sensor network [4] management science and engineering [5,6], economic [7], market prediction and engineering technology [8], transport service problem [9] etc. As our modern society move forward with the decision-making process, so it always faces imprecise, vague and uncertain facts to take a decision in solving decision-making problems. In order to solve imprecise and uncertain data, [10] initiated the idea of intuitionistic fuzzy set (IFS), a powerful extension of fuzzy set (FS) [11]. Even though (FS) and (IFS) are very powerful set to model decision problems containing uncertainties, in some cases these sets are not sufficient to overcome indeterminate and inconsistent statistics experience in real world problems. As SVNS [12] have strong acceptance for modeling of problems including the incomplete, indeterminate and inconsistent data. The aggregated information for the execution of the criteria for alternatives, weighted and order weighted aggregation operators [13,14,15,16,17,18,19,20,21,22] takes a significant role during the combination of the information process. The above aggregation operators based decision-making problems are not enough for the solution of real-world problems because they have insufficient of parameterizations. In real life problems involve different parameters. Most of MCDM problems, researchers can not consider parameterizations factor when they aggregate the information of the alternatives. Therefore, there are lack of information of the alternatives about the involves parameter. Motivated by the aforementioned limitations, this research developed a novel fuzzy-based MCDM approach for the evaluation of medical diagnosis problems. Initially, we introduced the SVSNs to quantify evaluation information on criteria and alternatives. We combined the SVNNs with the concept of soft set. Subsequently, this study proposed single-valued neutrosophic soft weighted averaging (SVNSWA) operator and single-valued neutrosophic soft weighted geometric (SVNSWG) operator to aggregate criteria by considering their parameterizations factors. We haved studied idempotency, boundedness, shift-invariance and Homogeneity property of these two kinds of soft weighted aggregation operators. The main advantage of these operators is that they are able to make smooth description of the real-world problems by the use of parameterizations factor. In order to rank the alternatives, aggregation operators lead to aggregate the over all information of the objects for the preferences of the decision maker into a collective one and hence find to a desirable according to its score values. To the best of our knowledge, the research developed on FSS and SVNSS is only about their basic theory and its applications, but, there have been no research done on single-valued neutrosophic soft aggregation numbers. So, it is a new issue and have a scope for future development in decision science. Therefore, decision-making problems in single-valued neutrosophic soft environment under proposed aggregation operators which makes us enough motivation to develop the propose problems. The main object of this article is to exhibit some aggregation operators under SVN data called as single-valued neutrosophic soft aggregation for collect the distinct priorities of the choices of this technique.

The remainder of this paper is organized as: In next Section, briefly survey some essential ideas of the FSS and SVNSS. In Section 3, we define some operational principles of single-valued neutrosophic soft numbers and then define single-valued neutrosophic soft weighted averaging (SVNSWA) operator, single-valued neutrosophic soft weighted geometric (SVNSWGA) operator and established its related properties. In next Section, we utilize those operators to create single-valued neutrosophic soft multi-criteria group decision-making problems. An interpretative case is specified for the selection of most illness patient in Section 5. In Section 6, a comparative analysis has been made between the existing works and the proposed study. Finally, in Section 7, follows a remark.

2. Literature Review

Neutrosophic set (NS) a tremendous branch of philosophy was proposed by Smarandache [23,24]. This proposed approach is characterized by three functions called (truth-, indeterminacy-,falsity)- membership functions. Therefore, (NS) has strong acceptance to develop models carrying indeterminate and inconsistent data. However, since codomain of membership functions of a (NS) is real standard or nonstandard subsets of

]^{-} 0, 1^{+} [

, in some applications areas engineering and real scientific fields they have some difficulties in modeling of problems. To overcome difficulties in these areas, Wang et al. [12] defined the view of single-valued neutrosophic set (SVNs). As (SVNs) have strong acceptance for modeling of problems including the incomplete, indeterminate and inconsistent data. So, scholars have been investigating on how to find a proper one alternative and have obtained some achievements. Ye utilized [25] arithmetic and geometric aggregation functions under simplified neutrosophic numbers to develop MCDM problems. Garg and Nancy [26] have followed to the study of linguistic SVN prioritized aggregation function to propose a MADM problem. Wan et al. [27] introduced Frank Choquet Bonferroni mean operators and utilized this operator develop MCDM problems in single-valued bipolar neutrosophic environment. Shi and Ye [28] introduced Dombi aggregation operator to originate neutrosophic cubic Dombi (NCD) aggregation functions to study a decision-making problems. Wei and Zhang [29] utilized combination of power averaging and Bonferroni mean operator to developed SVN Bonferroni power aggregation operators to develop a MADM problem. Ulucay et al. [30] developed a decision-making problem using similarity measure method under bipolar neutrosophic environment. Abdel-Basset et al. [31] studied MCGDM based on neutrosophic hierarchy method. Abdel-Basset et al. [32] proposed strategic planning and decision-making based on neutrosophic AHP-SWOT analysis. Dalapati et al. [33] proposed cross entropy based MAGDM based on interval neutrosophic information. In [34], Bausys and Zavadskas provided VIKOR method based MCDM problems using interval neutrosophic numbers. Biswas et al. [35] utilized TOPSIS method for MCDM problems under SVN environment. Broumi et al. [36] introduced an algorithm to solve a neutrosophic shortest problems from source node to destination node. Sahin and Liu [37] derived correlation coefficient between two SVN hesitant fuzzy numbers. Jana et al. [38] studied trapezoidal neutrosophic aggregation functions and utilized these operators develop MADM problems. Recently, researchers have drawn attention to model interval rough sets with their application problems [39].

But the technique of the above papers are not enough for the solution of real-world problems because they have insufficient of parameterizations. In that context, soft set theory plays an important role to overcome such barrier and effectively applied to solve the conditions. Maji et al. [40,41] provided with the bridge connection between FS and IFS with soft sets theory [42]. Some hybrid models together with soft set theory have been develop in various uncertain environments such as on fuzzy soft set theory with parameterizations [43,44], fuzzy soft expert sets [45], generalized intuitionsitic fuzzy soft sets [46], IVIF soft sets [47,48] and its applications, bipolar intuitionistic fuzzy soft sets and decision-making [49], Hesitant fuzzy soft sets [50]. Jana and pal [51,52] have studied soft intersection

B C K / B C I

-algebras, and soft intersection group structure based on

(α, β)

-soft intersectional sets. Selvachandran and Peng [53] has found a modified TOPSIS method using vauge parameterized vegue soft set and gave its application in decision making. Recently, Arora and Garg [54] provided a new approach of aggregation operator using parameterized factor in intuitionistic fuzzy soft environment. In the same time, a tool combination of neutrosophic set and soft set have gave a momentum to the solution of real life problems in many directions. Karaaslan [55] used possibility theory to develop PNS-decision-making method using neutrosophic soft OR-product and AND-product. Broumi and Samarandache [56] proposed single-valued neutrosophic soft expert set and its application in decision-making. Ali et al. [57] gave an application of bipolar neutrosophic soft sets in decision making in the environment of bipolar neutrosophic set. Deli et al. [58] motivated to develop a decision-making method called ivnpivn-soft sets using neutrosophic information. In [59], Khalid and Abbas used soft set theory in distance measure.

In this study, multi-criteria decision-making approach is characterized by single-valued neutrosophic soft numbers (SVNSNs). The SVNSWA and SVNSWG aggregation operators are presented. Then, a medical diagnosis problems is solved by using these proposed operators.

3. Basic Concepts of FSS and SVNSS

In what follows, U, E and

P (U)

respectively denote universal set, parameter set and power set of U. Also, A

\subseteq E

Definition 1 ([11]).

Let X be a non-empty set. A fuzzy set μ of X is defined as a mapping

μ : X \to [0, 1],

where

[0, 1]

is the usual interval of real numbers. We take

F (X)

as the set of all fuzzy subsets of X.

Definition 2

([42]). A pair

(F, E)

is called a soft set over U if

F

is a mapping given by

F : E \to P (U) .

In other words, a soft over the universe U is a parameterized family of subsets of the universal set U. For

ε \in A

F (ε)

may be considered as the set of ε-elements of the soft

(F, A)

, or as the set of ε-approximate elements of the soft set.

The following example illustrate the above idea.

Example 1.

Let

(X, τ)

be a topological space, i.e. τ is a family of subsets of the set X called the open sets of X. Then, the family of open neighborhood

N (x)

of point x, where

N (x) = {V \in τ | x \in V}

, may be consider as the soft set

(N (x), τ)

Definition 3

([40]). Let U be the universe set and E be the set of parameters. Let

P (U)

be the power set of U and

A \subseteq E

, and

P (U)

is the collection of all fuzzy subsets of U, then

(F, A)

is called fuzzy soft set, where

F : A \to P (U) .

Example 2.

Let

U = {M_{1}, M_{2}, M_{3}, M_{4}}

be the set of four mobiles under consideration and

E = {b e a u t i f u l (e_{1}), c o s t l y (e_{2}), b a t t e r y b a c k u p (e_{3}) a n d a p p s (e_{4})}

be a set of parameters then FSS for describing “attractiveness of the mobiles"

(F, A) = {F_{e_{1}}, F_{e_{2}}, F_{e_{3}}}

, where

A = {e_{1}, e_{2}, e_{3}} \subseteq E

and

(F, A)

can be defined as:

F_{e_{1}} = {(M_{1}, 0.6), (M_{2}, 0.4), (M_{3}, 0.5), (M_{4}, 0.3)}

F_{e_{2}} = {(M_{1}, 0.7), (M_{2}, 0.6), (M_{3}, 0.5), (M_{4}, 0.4)}

and

F_{e_{3}} = {(M_{1}, 0.9), (M_{2}, 0.5), (M_{3}, 0.3), (M_{4}, 0.6)} .

Definition 4

([23]). Let X be finite, with a generic element in X denoted by x. A NS

\tilde{c}

in X is defined by

\tilde{C} = \{〈 T_{C} (x), I_{C} (x), F_{C} (x) 〉 | x \in X\},

where its truth-function

T_{C}

is presented by

T_{C} : X \to] 0^{-}, 1^{+} [

, indeterminacy-function

I_{C}

presented

I_{C} : X \to] 0^{-}, 1^{+} [

, and falsity- function

{\hat{F}}_{C}

interpreted as

F_{C} : X \to] 0^{-}, 1^{+} [

. Also,

T_{C}

I_{C}

and

F_{C}

are real standard or non-standard subsets of

] 0^{-}, 1^{+} [

. There is no restriction on the sum of

T_{C}

I_{C}

and

F_{C}

, and so

0^{-} \leq T_{C} + I_{C} + F_{C} \leq 3^{+}

For real applications of NS, Wang et al. [12] introduced SVNs in the following definition.

Definition 5

([12]). Let X be a finite set, with a generic element in X denoted by x. A SVNS is defined as:

\tilde{C} = \{〈 T_{C} (x), I_{C} (x), F_{C} (x) 〉 | x \in X\},

where

T_{C} : X \to [0, 1]

indicated the truth,

I_{C} : X \to [0, 1]

is the indeterminacy and

F_{C} : X \to [0, 1]

is the falsity function of x to C with the condition

0 \leq T_{C} + I_{C} + F_{C} \leq 3

Definition 6.

Let U be universal set and E be the parameter set. For

N \subset E

. Let

P (U)

called the subsets of single-valued neutrosophic sets of U. The term

(F_{C}, C)

is called single-valued neutrosophic soft sets of U, where

F_{C}

is a function follows as,

F_{C} : N \to P (U)

Example 3.

Let

U = {O_{1}, O_{2}, O_{3}, O_{4}}

be the set of four mobiles under consideration and

E = {b e a u t i f u l (e_{1}), c o s t l y (e_{2}), b a t t e r y b a c k u p (e_{3}) a n d a p p s (e_{4})}

be a set of parameters under SVNSS for describing “attractiveness of the mobiles" is

(C, N) = {F_{e_{1}}, F_{e_{2}}, F_{e_{3}}}

, where

A = {e_{1}, e_{2}, e_{3}} \subseteq E

and

(\tilde{C}, N)

can be defined as:

{\tilde{C}}_{e_{1}} = {(O_{1}, 0.6, 0.4, 0.2), (O_{2}, 0.4, 0.5, 0.1), (O_{3}, 0.5, 0.2, 0.3), (O_{4}, 0.3, 0.6, 0.1)}

{\tilde{C}}_{e_{2}} = {(O_{1}, 0.7, 0.1, 0.2), (O_{2}, 0.6, 0.3, 0.1), (O_{3}, 0.5, 0.3, 0.3), (O_{4}, 0.4, 0.4, 0.1)}

and

{\tilde{C}}_{e_{3}} = {(O_{1}, 0.9, 0.1, 0.3), (O_{2}, 0.5, 0.2, 0.2), (O_{3}, 0.3, 0.5, 0.1), (O_{4}, 0.6, 0.4, 0.4)} .

For the sake of simplicity, we denote the pair of

{\tilde{C}}_{e_{t}} (x_{c}) = {〈 T_{c} (x), I_{c} (x), F_{c} (x) 〉 | x_{s} \in U}

, i.e.,

{\tilde{C}}_{e_{s t}} = 〈 T_{s t}, I_{s t}, F_{s t} 〉

is called as single-valued neutrosophic soft (SVNSN) numbers. For the application purpose, it is necessary to define score function for ranking it. For this, a score function of

{\tilde{C}}_{e_{s t}}

is defined as

\begin{matrix} Ψ ({\tilde{C}}_{e_{s t}}) = T_{s t} - F_{s t} \end{matrix}

(1)

where,

Ψ ({\tilde{C}}_{e_{s t}}) \in [0, 1]

. By this definition, it is clear that the larger the

Ψ ({\tilde{C}}_{e_{s t}})

, the larger is SVNSN

{\tilde{C}}_{e_{s t}}

Example 4.

Let

{\tilde{C}}_{e_{11}} = 〈 0.6, 0.2, 0.2 〉

and

{\tilde{C}}_{e_{12}} = 〈 0.3, 0.5, 0.5 〉

be two SVNSNs, then by Equation (2), we get

Ψ ({\tilde{C}}_{e_{11}}) = 0.4

and

Ψ ({\tilde{C}}_{e_{12}}) = - 0.2

. Since

Ψ ({\tilde{C}}_{e_{11}}) > Ψ ({\tilde{C}}_{e_{12}})

which imply

{\tilde{C}}_{e_{11}} > {\tilde{C}}_{e_{12}}

However, there are some situation, where above function can not be used to compare SVNSNs. For example, let

{\tilde{C}}_{e_{11}} = 〈 0.6, 0.2, 0.2 〉

and

{\tilde{C}}_{e_{12}} = 〈 0.5, 0.1, 0.1 〉

, then it is not possible to compare SVNSNs, which one of them is bigger as

Ψ ({\tilde{C}}_{e_{11}}) = Ψ ({\tilde{C}}_{e_{12}})

. To overcome this situation, we define accuracy function of

{\tilde{C}}_{e_{s t}}

as follows:

\begin{matrix} H ({\tilde{C}}_{e_{s t}}) = T_{s t} + I_{s t} + F_{s t} \end{matrix}

(2)

where,

H ({\tilde{C}}_{e_{s t}}) \in [0, 1]

. Based on score function Ψ and accuracy function

H

, defined order relation on two SVNSNs

{\tilde{P}}_{e_{s t}}

and

{\tilde{Q}}_{e_{s t}}

as follows:

(i)

Ψ ({\tilde{P}}_{e_{s t}}) < Ψ ({\tilde{Q}}_{e_{s t}})

, then

{\tilde{P}}_{e_{s t}} ≺ {\tilde{Q}}_{e_{s t}}

(ii)

Ψ ({\tilde{P}}_{e_{s t}}) > Ψ ({\tilde{Q}}_{e_{s t}})

, then

{\tilde{P}}_{e_{s t}} ≻ {\tilde{Q}}_{e_{s t}}

(iii)

Ψ ({\tilde{P}}_{e_{s t}}) = Ψ ({\tilde{Q}}_{e_{s t}})

, then

(1): If $H ({\tilde{P}}_{e_{s t}}) < H ({\tilde{Q}}_{e_{s t}})$ , then ${\tilde{P}}_{e_{s t}} ≺ {\tilde{Q}}_{e_{s t}}$ .
(2): If $H ({\tilde{P}}_{e_{s t}}) > H ({\tilde{Q}}_{e_{s t}})$ , then ${\tilde{P}}_{e_{s t}} ≻ {\tilde{Q}}_{e_{s t}}$ .
(3): If $H ({\tilde{P}}_{e_{s t}}) = H ({\tilde{Q}}_{e_{s t}})$ , then ${\tilde{P}}_{e_{s t}} \sim {\tilde{Q}}_{e_{s t}}$ .

4. Single-Valued Neutrosophic Soft Weighted Arithmetic Averaging (SVNSWAA) Operator

In this Section, an aggregation operators namely single-valued neutrosophic soft weighted averaging (SVNSWA) operator and single-valued neutrosophic soft weighted geometric averaging (BFSWGA) operator for neutrosophic soft numbers (SVNSNs) are proposed.

4.1. Operational Law for SVNSNs

Definition 7.

Let

{\tilde{C}}_{e} = 〈 T, I, F 〉

and

{\tilde{C}}_{e_{11}} = 〈 T_{11}, I_{11}, F_{11} 〉)

and

{\tilde{C}}_{e_{12}} = 〈 T_{12}, I_{12}, F_{12} 〉)

be the three SVNSNs over the universe X, then following operations are defined as follows:

(i): ${\tilde{C}}_{e_{11}} \oplus {\tilde{C}}_{e_{12}} = (〈T_{11} + T_{12} - T_{11} T_{12}, I_{11} I_{12}, F_{11} F_{12}〉)$
(ii): ${\tilde{C}}_{e_{11}} \otimes {\tilde{C}}_{e_{12}} = (〈T_{11} T_{12}, I_{11} + I_{12} - I_{11} I_{12}, F_{11} + F_{12} - F_{11} F_{12}〉)$
(iii): $λ {\tilde{C}}_{e} = (1 - {(1 - T)}^{λ}, I^{λ}, F^{λ})$
(iv): ${\tilde{C}}_{e}^{λ} = (T^{λ}, 1 - {(1 - I)}^{λ}, 1 - {(1 - F)}^{λ})$ .

Definition 8.

Let

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

(

s = 1, 2, \dots, m; t = 1, 2, \dots, n)

be a number of SVNSNs and

ϕ_{t}

θ_{s}

are the are weight vectors for the parameter

e_{t}

’s and expert

y_{s}

’s respectively, satisfying

ϕ_{t} \geq 0

θ_{s} \geq 0

such that

\sum_{t = 1}^{n} ϕ_{t} = 1

and

\sum_{s = 1}^{m} θ_{s} = 1

. Then single-valued neutrosophic soft weighted averaging (SVNSWA) operator is function

S V N S W A : {\tilde{C}}^{n} \to \tilde{C}

such that

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = ⨁_{t = 1}^{n} ϕ_{t} (⨁_{s = 1}^{m} θ_{s} {\tilde{C}}_{e_{s t}}) . \end{matrix}

(3)

We get the following theorem that follows on SVNSWA operator.

Theorem 1.

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

(

s = 1, 2, \dots, m; t = 1, 2, \dots, n)

be a number of (SVNSNs), then aggregated value of them using the SVNSWA operator is also a SVNSNs, and

S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}})

\begin{matrix} = 〈1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

(4)

Theorem 1 can be proved by the method of mathematical induction as follows:

Proof.

For

m = 1

, we get

θ_{1} = 1

. Then by Definition 5 of operational law,

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) & = & ⨁_{t = 1}^{n} ϕ_{t} ({\tilde{C}}_{e_{1 t}}) \\ = & 〈1 - \prod_{t = 1}^{n} {(1 - T_{1 t})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(I_{1 t})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(F_{1 t})}^{ϕ_{t}}〉 \\ = & 〈1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{1} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{1} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{1} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Again, for

n = 1

and

ϕ_{1} = 1

and hence,

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) & = & (⨁_{s = 1}^{m} θ_{s 1} {\tilde{C}}_{e_{1 t}}) \\ = & 〈1 - \prod_{t = 1}^{m} {(1 - T_{s 1})}^{θ_{s}}, \prod_{s = 1}^{m} {(I_{s 1})}^{θ_{s}}, \prod_{s = 1}^{m} {(F_{s 1})}^{θ_{s}}〉 \\ = & 〈1 - \prod_{t = 1}^{1} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{1} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{1} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Thus, (5) is true for

m = 1

and

n = 1

. Assume that

(5)

is true for

n = p_{1} + 1

m = p_{2}

and

n = p_{1}

m = p_{2} + 1

, then it follows that

\begin{matrix} ⨁_{t = 1}^{p_{1} + 1} ϕ_{t} (⨁_{s = 1}^{p_{2}} θ_{s} {\tilde{C}}_{e_{s t}}) = 〈1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Also,

\begin{matrix} ⨁_{t = 1}^{p_{1}} ϕ_{t} (⨁_{s = 1}^{p_{2} + 1} θ_{s} {\tilde{C}}_{e_{s t}}) = 〈1 - \prod_{t = 1}^{p_{1}} {(\prod_{s = 1}^{p_{2} + 1} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1}} {(\prod_{s = 1}^{p_{2} + 1} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1}} {(\prod_{s = 1}^{p_{2} + 1} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Now for

n = p_{1} + 1

and

m = p_{2} + 1

, we obtained

\begin{matrix} ⨁_{t = 1}^{p_{1} + 1} ϕ_{t} (⨁_{s = 1}^{p_{2} + 1} θ_{s} {\tilde{C}}_{e_{s t}}) = ⨁_{t = 1}^{p_{1} + 1} ϕ_{t} (⨁_{s = 1}^{p_{2}} θ_{s} {\tilde{C}}_{e_{s t}} \oplus θ_{p_{2} + 1} {\tilde{C}}_{e_{(p_{2} + 1) t}}) \\ = ⨁_{t = 1}^{p_{1} + 1} ⨁_{s = 1}^{p_{2}} ϕ_{t} θ_{s} {\tilde{C}}_{e_{s t}} ⨁_{t = 1}^{p_{1} + 1} ϕ_{t} θ_{p_{2} + 1} {\tilde{C}}_{e_{(p_{2} + 1) t}}) \\ = 〈 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}} \oplus 1 - \prod_{t = 1}^{p_{1} + 1} {({(1 - T_{(p_{2} + 1) t})}^{θ_{p_{2} + 1}})}^{ϕ_{t}}, \\ \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}} \oplus \prod_{t = 1}^{p_{1} + 1} {({(I_{(p_{2} + 1) t})}^{θ_{p_{2} + 1}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}} \oplus \prod_{t = 1}^{p_{1} + 1} {({(F_{(p_{2} + 1) t})}^{θ_{p_{2} + 1}})}^{ϕ_{t}} 〉 \\ = 〈1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2} + 1} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2} + 1} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2} + 1} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Thus,

(5)

is true for

n = p_{1} + 1

m = p_{2} + 1

, therefore by induction the results is hold for all

m, n \geq 1

Since,

0 \leq T_{s t} \leq 1 \Leftrightarrow 0 \leq \prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}} \leq 1

and hence,

0 \leq 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1

. Also,

0 \leq I_{s t} \leq 1 \Leftrightarrow 0 \leq \prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}} \leq 1 \Leftrightarrow 0 \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1

, and

0 \leq F_{s t} \leq 1 \Leftrightarrow 0 \leq \prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}} \leq 1 \Leftrightarrow 0 \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1

. Thus,

0 \leq 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}} + \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}} + \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 3

. Hence, aggregated value obtained by SVNSWA is again a SVNSN. ☐

Corollary 1

([60]). For only one parameter

e_{1}

, i.e.,

n = 1

, then SVNSWA operator reduces to SVNWA.

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{21}}, \dots, {\tilde{C}}_{e_{m 1}}) = 〈1 - \prod_{s = 1}^{m} {(1 - T_{s})}^{θ_{s}}, \prod_{s = 1}^{m} {(I_{s})}^{θ_{s}}, \prod_{s = 1}^{m} {(F_{s})}^{θ_{s}}〉 . \end{matrix}

(5)

Therefore, it is justified that aggregation operator defined under SVNS environment is taken as a special case of the proposed operator.

Example 5.

Let

Y = {y_{1}, y_{2}, y_{3}, y_{4}}

be the set of experts which are going to narrate the “attractiveness of two-wheeler bikes" under the set of parameters

E = {e_{1} = s t y l i s h, e_{2} = w e i g h t, e_{3} = m i l a g e, e_{4} = p r i c e}

. The rating value of the experts is assumed to be given in the form of SVNSNs

(C, E) = {(T_{s t}, I_{s t}, F_{s t})}_{4 \times 3}

for each parameters which are given in the following table (Table 1).

Let

ϕ = {(0.3, 0.2, 0.5)}^{T}

and

θ = {(0.2, 0.1, 0.3, 0.4)}^{T}

be the weight vectors for the parameters and experts respectively. Then, we get by using Theorem 1 as:

\begin{matrix} S V N S W A & ({\tilde{B}}_{e_{11}}, {\tilde{B}}_{e_{12}}, \dots, {\tilde{B}}_{e_{43}}) \\ = 〈1 - \prod_{t = 1}^{3} {(\prod_{s = 1}^{4} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{3} {(\prod_{s = 1}^{4} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{3} {(\prod_{s = 1}^{4} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 \end{matrix}

〈1 - ({\{{(1 - 0.6)}^{0.2} {(1 - 0.5)}^{0.1} {(1 - 0.7)}^{0.3} {(1 - 0.4)}^{0.4}\}}^{0.3} {\{{(1 - 0.5)}^{0.2} {(1 - 0.3)}^{0.1} {(1 - 0.4)}^{0.3} {(1 - 0.7)}^{0.4}\}}^{0.2} {\{{(1 - 0.6)}^{0.2} {(1 - 0.5)}^{0.1} {(1 - 0.3)}^{0.3} {(1 - 0.2)}^{0.4}\}}^{0.5}), {\{{(0.2)}^{0.2} {(0.4)}^{0.1} {(0.1)}^{0.3} {(0.5)}^{0.4}\}}^{0.3} {\{{(0.5)}^{0.2} {(0.2)}^{0.1} {(0.3)}^{0.3} {(0.2)}^{0.4}\}}^{0.2} {\{{(0.3)}^{0.2} {(0.4)}^{0.1} {(0.1)}^{0.3} {(0.6)}^{0.4}\}}^{0.5}, {\{{(0.3)}^{0.2} {(0.4)}^{0.1} {(0.4)}^{0.3} {(0.2)}^{0.4}\}}^{0.3} {\{{(0.2)}^{0.2} {(0.1)}^{0.1} {(0.6)}^{0.3} {(0.1)}^{0.4}\}}^{0.2} {\{{(0.5)}^{0.2} {(0.5)}^{0.1} {(0.6)}^{0.3} {(0.3)}^{0.4}\}}^{0.5}〉

= 〈(0.5317, 0.2755, 0.3256)〉 .

We prove easily the following properties by using the operator SVNSWA.

Theorem 2 (Idempotency Property).

Let

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

(s = 1, 2, \dots, m; t = 1, 2, \dots, n)

be a number of SVNSNs are all equal, i.e.,

{\tilde{C}}_{e_{s}} t = {\tilde{C}}_{e}

for all

s, t

, then

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = {\tilde{C}}_{e} . \end{matrix}

(6)

Proof.

Since

{\tilde{C}}_{e_{s t}} = {\tilde{C}}_{e} = 〈 T, I, F 〉

for all

s, t

. Then,

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) & = & 〈1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T)}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I)}^{θ_{s}})}^{ϕ_{t}} \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F)}^{θ_{s}})}^{ϕ_{t}}〉 \\ = & 〈1 - {({(1 - T)}^{\sum_{s = 1}^{m} θ_{s}})}^{\sum_{t = 1}^{n} ϕ_{t}}, {({(I)}^{\sum_{s = 1}^{m} θ_{s}})}^{\sum_{t = 1}^{n} ϕ_{t}} {({(F)}^{\sum_{s = 1}^{m} θ_{s}})}^{\sum_{t = 1}^{n} ϕ_{t}}〉 \\ = & 〈1 - (1 - T), I, F〉 \\ = & 〈T, I, F〉 . \end{matrix}

The proof is completed. ☐

Theorem 3 (Boundedness Property).

Let

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

(s = 1, 2, \dots, m; t = 1, 2, \dots, n)

be a collection of SVNSNs. Let

{\tilde{C}}_{e_{s t}}^{-} = 〈 min_{t} min_{s} {T_{s t}}, max_{t} max_{s} {I_{s t}}, max_{t} max_{s} {F_{s t}} 〉

and

{\tilde{C}}_{e_{s t}}^{+} = 〈 max_{t} max_{s} {T_{s t}}, min_{t} min_{s} {I_{s t}}, min_{t} min_{s} {F_{s t}} 〉

. Then,

{\tilde{C}}_{e_{s t}}^{-} \leq S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) \leq {\tilde{C}}_{e_{s t}}^{+} .

Proof.

Since,

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

be a SVNSNs then

min_{t} min_{s} {T_{s t}} \leq T_{s t} \leq max_{t} max_{s} {T_{s t}}

which implies that

1 - max_{t} max_{s} {T_{s t}} \leq 1 - T_{s t} \leq 1 - min_{t} min_{s} {T_{s t}} \Leftrightarrow {(1 - max_{t} max_{s} {T_{s t}})}^{θ_{s}} \leq (1 - T_{s t} \leq (1 - min_{t} min_{s} {{T_{s t})}^{θ_{s}} \Leftrightarrow 1 - max_{t} max_{s} {T_{s t}} \leq \prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}} \leq 1 - min_{t} min_{s} {T_{s t}} \Leftrightarrow {(1 - max_{t} max_{s} {T_{s t}})}^{\sum_{t = 1}^{n} ϕ_{t}} \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{\sum_{t = 1}^{n} ϕ_{t}} \leq {(1 - min_{t} min_{s} {T_{s t}})}^{\sum_{t = 1}^{n} ϕ_{t}} \Leftrightarrow 1 - max_{t} max_{s} {T_{s t}} \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{\sum_{t = 1}^{n} ϕ_{t}} \leq 1 - min_{t} min_{s} {T_{s t}}

. Therefore,

\begin{matrix} max_{t} max_{s} {T_{s t}} \leq 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{\sum_{t = 1}^{n} ϕ_{t}} \leq min_{t} min_{s} {T_{s t}} . \end{matrix}

(7)

Again,

min_{t} min_{s} {I_{s t}} \leq I_{s t} \leq max_{t} max_{s} {I_{s t}}

which finds

{(min_{t} min_{s} {I_{s t}})}^{\sum_{s = 1}^{m} θ_{s}} \leq \prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}} \leq {(max_{t} max_{s} {I_{s t}})}^{\sum_{s = 1}^{m} θ_{s}} \Leftrightarrow min_{t} min_{s} {I_{s t}} \leq \prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}} \leq max_{t} max_{s} {I_{s t}} \Leftrightarrow {(min_{t} min_{s} {I_{s t}})}^{ϕ_{t}} \leq {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq {(max_{t} max_{s} {I_{s t}})}^{ϕ_{t}} \Leftrightarrow {(min_{t} min_{s} {I_{s t}})}^{\sum_{t = 1}^{n} ϕ_{t}} \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq {(max_{t} max_{s} {I_{s t}})}^{\sum_{t = 1}^{n} ϕ_{t}}

, hence we get,

\begin{matrix} min_{t} min_{s} {I_{s t}} \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq max_{t} max_{s} {I_{s t}} . \end{matrix}

(8)

and,

min_{t} min_{s} {F_{s t}} \leq F_{s t} \leq max_{t} max_{s} {F_{s t}}

which follows

{(min_{t} min_{s} {F_{s t}})}^{\sum_{s = 1}^{m} θ_{s}} \leq \prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}} \leq {(max_{t} max_{s} {F_{s t}})}^{\sum_{s = 1}^{m} θ_{s}} \Leftrightarrow min_{t} min_{s} {F_{s t}} \leq \prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}} \leq max_{t} max_{s} {F_{s t}} \Leftrightarrow {(min_{t} min_{s} {F_{s t}})}^{ϕ_{t}} \leq {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq {(max_{t} max_{s} {F_{s t}})}^{ϕ_{t}} \Leftrightarrow {(min_{t} min_{s} {F_{s t}})}^{\sum_{t = 1}^{n} ϕ_{t}} \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq {(max_{t} max_{s} {F_{s t}})}^{\sum_{t = 1}^{n} ϕ_{t}}

, hence we get,

\begin{matrix} min_{t} min_{s} {F_{s t}} \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq max_{t} max_{s} {F_{s t}} . \end{matrix}

(9)

Let

β \equiv S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = 〈 T_{β}, I_{β}, F_{β} 〉

, then from Equations (7)–(9),

min_{t} min_{s} {T_{s t}} \leq T_{β} \leq max_{t} max_{s} {T_{s t}}

and

min_{t} min_{s} {I_{s t}} \leq I_{β} \leq max_{t} max_{s} {I_{s t}}

, and

min_{t} min_{s} {F_{s t}} \leq F_{β} \leq max_{t} max_{s} {F_{s t}} .

Then by definition of score function

Ψ (β) = T_{β} - F_{β} \leq max_{t} max_{s} {T_{s t}} - min_{t} min_{s} {F_{s t}} = Ψ ({\tilde{C}}_{e_{s t}}^{+})

Ψ (β) = T_{β} - F_{β} \geq min_{t} min_{s} {T_{s t}} - max_{t} max_{s} {F_{s t}} = Ψ ({\tilde{C}}_{e_{s t}}^{-}) .

Now, there are three cases arises:

Case 1. If

Ψ ({\tilde{C}}_{e_{s t}}) < Ψ ({\tilde{C}}_{e_{s t}}^{+})

and

Ψ ({\tilde{C}}_{e_{s t}}) > Ψ ({\tilde{C}}_{e_{s t}}^{-})

, then by comparison of two SVNSNs, we have

{\tilde{C}}_{e_{s t}}^{-} \leq S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) \leq {\tilde{C}}_{e_{s t}}^{+} .

Case 2. If

Ψ ({\tilde{C}}_{e_{s t}}) = Ψ ({\tilde{C}}_{e_{s t}}^{+})

, i.e.,

T_{β} + F_{β} + F_{s t} = max_{t} max_{s} {T_{s t}} + min_{t} min_{s} {I_{s t}} + min_{t} min_{s} {F_{s t}}

, then by above inequalities

T_{β} = max_{t} max_{s} {T_{s t}}

and

I_{β} = min_{t} min_{s} {I_{s t}}

, and

F_{β} = min_{t} min_{s} {F_{s t}}

Therefore,

H = T_{β} + I_{β} + F_{β} = max_{t} max_{s} {T_{s t}} + min_{t} min_{s} {I_{s t}} + min_{t} min_{s} {F_{s t}} = H ({\tilde{C}}_{e_{s t}}^{+}),

then by comparison of two SVNSNs, we have

S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = C_{e_{s t}}^{+} .

Case 3. If

Ψ ({\tilde{C}}_{e_{s t}}) = Ψ ({\tilde{C}}_{e_{s t}}^{-})

, i.e.,

T_{β} + I_{β} + F_{β} = min_{t} min_{s} {T_{s t}} + max_{t} max_{s} {I_{s t}} + max_{t} max_{s} {F_{s t}}

, then by above inequalities

T_{β} = min_{t} min_{s} {T_{s t}}

I_{β} = max_{t} max_{s} {I_{s t}}

, and

F_{β} = max_{t} max_{s} {F_{s t}}

Hence,

H = T_{β} + I_{β} + F_{s t} = min_{t} min_{s} {T_{s t}} + max_{t} max_{s} {I_{s t}} + max_{t} max_{s} {F_{s t}} = H ({\tilde{C}}_{e_{s t}}^{-}),

then by comparison of two SVNSNs, we have

S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = C_{e_{s t}}^{-} .

Thus, proof is completed. ☐

Theorem 4 (Shift-invariance property).

{\tilde{C}}_{e} = 〈 T, I, F 〉

be another SVNSN, then

S V N S W A ({\tilde{C}}_{e_{11}} \oplus {\tilde{C}}_{e}, {\tilde{C}}_{e_{12}} \oplus {\tilde{C}}_{e}, \dots, {\tilde{C}}_{e_{m n}} \oplus {\tilde{C}}_{e}) = S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) \oplus {\tilde{C}}_{e}

Proof.

Since

{\tilde{C}}_{e}

and

{\tilde{C}}_{e_{s t}}

are SVNSNs. Then, we have

{\tilde{C}}_{e} \oplus {\tilde{C}}_{e_{s t}} = 〈1 - (1 - T) (1 - T_{s t}), I I_{s t}, F F_{s t}〉

. Hence,

S V N S W A ({\tilde{C}}_{e_{11}} \oplus {\tilde{C}}_{e}, {\tilde{C}}_{e_{12}} \oplus {\tilde{C}}_{e}, \dots, {\tilde{C}}_{e_{m n}} \oplus {\tilde{C}}_{e})

\begin{matrix} = & ⨁_{t = 1}^{n} ϕ_{t} (⨁_{s = 1}^{m} θ_{t} ({\tilde{C}}_{e_{s t}} \oplus {\tilde{C}}_{e})) \\ = & 〈1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}} {(1 - T)}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}} {(I)}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}} {(F)}^{θ_{s}})}^{ϕ_{t}}〉 \\ = & 〈1 - (1 - I) \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, I \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, F \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 \\ = & 〈1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 \oplus 〈T, I, F〉 \\ = & S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) \oplus {\tilde{C}}_{e} . \end{matrix}

Hence the result. ☐

Theorem 5 (Homogeneity property).

For any real number

λ > 0

, we have

S V N S W A (λ {\tilde{C}}_{e_{11}}, λ {\tilde{C}}_{e_{12}}, \dots, λ {\tilde{C}}_{e_{m n}}) = λ S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) .

Proof.

Let

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

(s = 1, 2, \dots, m; t = 1, 2, \dots, n)

be a number of SVNSNs and

λ > 0

be any real number. Then,

λ {\tilde{C}}_{e_{s t}} = 〈 1 - {(1 - T_{s t})}^{λ}, {(I_{s t})}^{λ}, {(F_{s t})}^{λ} 〉

. Thus,

\begin{matrix} S V N S W A (λ {\tilde{C}}_{e_{11}}, λ {\tilde{C}}_{e_{12}}, \dots, λ {\tilde{C}}_{e_{m n}}) & = & 〈1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{λ θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{λ θ_{s}})}^{ϕ_{t}}, \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{λ θ_{s}})}^{ϕ_{t}}〉 \\ = & 〈 1 - {(\prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - T_{s t})}^{θ_{s}})}^{ϕ_{t}})}^{λ}, {(\prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(I_{s t})}^{θ_{s}})}^{ϕ_{t}})}^{λ}, \\ {(\prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(F_{s t})}^{θ_{s}})}^{ϕ_{t}})}^{λ} 〉 \\ = & λ S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) . \end{matrix}

Hence the proof is completed. ☐

4.2. Single-Valued Neutrosophic Soft Weighted Geometric Averaging (SVNSWGA) Operator

In this Section, we defined single-valued neutrosophic soft weighted geometric averaging (SVNSWGA) operator and studied

Definition 9.

Let

{\tilde{C}}_{e_{s t}} = (T_{s t}, I_{s t}, F_{s t})

(

s = 1, 2, \dots, m; t = 1, 2, \dots, n)

be a number of SVNSNs and

ϕ_{t}

θ_{s}

are the are weight vectors for the parameter

e_{t}

’s and expert

y_{s}

’s respectively, satisfying

ϕ_{t} \geq 0

θ_{s} \geq 0

such that

\sum_{t = 1}^{m} ϕ_{t} = 1

and

\sum_{s = 1}^{n} θ_{s} = 1

. Then single-valued neutrosophic soft weighted geometric (SVNSWGA) operator is a function

S V N S W G A : {\tilde{C}}^{n} \to \tilde{C}

such that

\begin{matrix} S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = ⨂_{t = 1}^{n} {(⨂_{s = 1}^{m} {\tilde{C}}_{e_{s t}}^{θ_{s}})}^{ϕ_{t}} . \end{matrix}

Theorem 6.

Then single-valued neutrosophic soft weighted geometric (SVNSWGA) operator is a function

S V N S W G A : {\tilde{C}}^{n} \to \tilde{C}

such that

\begin{matrix} S V N S W A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{1 n}}) = 〈\prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

(10)

Proof.

For

m = 1

and

θ_{1} = 1

then by Definition 5, we have

\begin{matrix} S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{1 n}}) & = & ⨂_{t = 1}^{n} {\tilde{C}}_{e_{s t}}^{ϕ_{t}} \\ = & 〈\prod_{t = 1}^{n} {(T_{1 t})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{n} {(1 - I_{1 t})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{n} {(1 - F_{1 t})}^{ϕ_{t}}〉 \\ = & 〈\prod_{t = 1}^{n} {(\prod_{s = 1}^{1} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{1} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{1} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

For

n = 1

and

ϕ_{1} = 1

, then by Definition 9, we get

\begin{matrix} S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{21}}, \dots, {\tilde{C}}_{e_{m 1}}) & = & ⨂_{t = 1}^{n} {\tilde{C}}_{e_{s t}}^{θ_{s}} \\ = & 〈\prod_{s = 1}^{m} {(T_{s 1})}^{θ_{s}}, 1 - \prod_{s = 1}^{m} {(1 - I_{s 1})}^{θ_{s}}, 1 - \prod_{s = 1}^{m} {(1 - F_{s 1})}^{θ_{s}}〉 \\ = & 〈\prod_{t = 1}^{1} {(\prod_{s = 1}^{m} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{1} {(\prod_{s = 1}^{m} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{1} {(\prod_{s = 1}^{m} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Assume that

(10)

is true for

n = p_{1} + 1

m = p_{2}

and

n = p_{1}

m = p_{2} + 1

, then it follows that

\begin{matrix} ⨂_{t = 1}^{p_{1} + 1} {(⨂_{s = 1}^{p_{2}} {\tilde{C}}_{e_{s t}}^{θ_{s}})}^{ϕ_{t}} = 〈\prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Also,

\begin{matrix} ⨂_{t = 1}^{p_{1}} {(⨂_{s = 1}^{p_{2} + 1} {\tilde{C}}_{e_{s t}}^{θ_{s}})}^{ϕ_{t}} = 〈\prod_{t = 1}^{p_{1}} {(\prod_{s = 1}^{p_{2} + 1} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{p_{1}} {(\prod_{s = 1}^{p_{2} + 1} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{p_{1}} {(\prod_{s = 1}^{p_{2} + 1} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 . \end{matrix}

Now for

n = p_{1} + 1

and

m = p_{2} + 1

, we obtained

\begin{matrix} ⨂_{t = 1}^{p_{1} + 1} {(⨂_{s = 1}^{p_{2} + 1} {\tilde{C}}_{e_{s t}}^{θ_{s}})}^{ϕ_{t}} & = & ⨂_{t = 1}^{p_{1} + 1} {(⨂_{s = 1}^{p_{2}} {\tilde{C}}_{e_{s t}}^{θ_{s}} \otimes {\tilde{C}}_{e_{(p_{2} + 1) t}}^{θ_{p_{2} + 1}})}^{ϕ_{t}} \\ = & ⨂_{t = 1}^{p_{1} + 1} {(⨂_{s = 1}^{p_{2}} {\tilde{C}}_{e_{s t}}^{θ_{s}})}^{ϕ_{t}} ⨂_{t = 1}^{p_{1} + 1} {({\tilde{C}}_{e_{(p_{2} + 1) t}}^{θ_{p_{2} + 1}})}^{ϕ_{t}}) \\ = & 〈 \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}} \otimes \prod_{t = 1}^{p_{1} + 1} {({(T_{(p_{2} + 1) t})}^{θ_{p_{2} + 1}})}^{ϕ_{t}}, \\ 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}} \otimes 1 - \prod_{t = 1}^{p_{1} + 1} {({(1 - I_{(p_{2} + 1) t})}^{θ_{p_{2} + 1}})}^{ϕ_{t}}, \\ 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2}} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}} \otimes 1 - \prod_{t = 1}^{p_{1} + 1} {({(1 - F_{(p_{2} + 1) t})}^{θ_{p_{2} + 1}})}^{ϕ_{t}} 〉 \\ = & 〈 \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2} + 1} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2} + 1} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, \\ 1 - \prod_{t = 1}^{p_{1} + 1} {(\prod_{s = 1}^{p_{2} + 1} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}} 〉 . \end{matrix}

Thus,

(10)

is true for

n = p_{1} + 1

m = p_{2} + 1

, therefore by induction the results is hold for all

m, n \geq 1

Since,

0 \leq I_{s t} \leq 1 \Leftrightarrow 0 \leq \prod_{s = 1}^{m} {(1 - I_{s t})}^{θ_{s}} \leq 1 \Leftrightarrow 0 \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1 \Leftrightarrow 0 \leq 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1

, and

0 \leq F_{s t} \leq 1 \Leftrightarrow 0 \leq \prod_{s = 1}^{m} {(1 - F_{s t})}^{θ_{s}} \leq 1 \Leftrightarrow 0 \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1 \Leftrightarrow 0 \leq 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1

On the other hand,

0 \leq T_{s t} \leq 1 \Leftrightarrow 0 \leq \prod_{s = 1}^{m} {(T_{s t})}^{θ_{s}} \leq 1 \Leftrightarrow 0 \leq \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 1 .

Therefore,

0 \leq 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}} + 1 - \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}} + \prod_{t = 1}^{n} {(\prod_{s = 1}^{m} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}} \leq 3

Thus, aggregated value obtained by SVNSWG operator is again a SVNSN. ☐

Example 6.

Let

Y = {y_{1}, y_{2}, y_{3}, y_{4}}

be the set of experts which are going to narrate the “attractiveness of two-wheeler bikes" under the set of parameters

E = {e_{1} = s t y l i s h, e_{2} = w e i g h t, e_{3} = m i l a g e, e_{4} = p r i c e}

. The rating value of the experts is assumed to be given in the form of SVNSNs

(B, E) = {(T_{s t}, I_{s t}, F_{s t})}_{4 \times 3}

for each parameters which are given in the following table (Table 2).

Let

ϕ = {(0.3, 0.2, 0.5)}^{T}

and

θ = {(0.2, 0.1, 0.3, 0.4)}^{T}

be the weight vectors for the parameters and experts respectively. Then, we get by using Theorem 6 as:

S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{43}})

\begin{matrix} = 〈\prod_{t = 1}^{3} {(\prod_{s = 1}^{4} {(T_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{3} {(\prod_{s = 1}^{4} {(1 - I_{s t})}^{θ_{s}})}^{ϕ_{t}}, 1 - \prod_{t = 1}^{3} {(\prod_{s = 1}^{4} {(1 - F_{s t})}^{θ_{s}})}^{ϕ_{t}}〉 \end{matrix}

〈({\{{(0.6)}^{0.2} {(0.5)}^{0.1} {(0.4)}^{0.3} {(0.6)}^{0.4}\}}^{0.3} {\{{(0.7)}^{0.2} {(0.5)}^{0.1} {(0.7)}^{0.3} {(0.6)}^{0.4}\}}^{0.2} {\{{(0.4)}^{0.2} {(0.8)}^{0.1} {(0.5)}^{0.3} {(0.6)}^{0.4}\}}^{0.5}), 1 - {\{{(1 - 0.3)}^{0.2} {(1 - 0.4)}^{0.1} {(1 - 0.1)}^{0.3} {(1 - 0.2)}^{0.4}\}}^{0.3} {\{{(1 - 0.2)}^{0.2} {(1 - 0.3)}^{0.1} {(1 - 0.1)}^{0.3} {(1 - 0.3)}^{0.4}\}}^{0.2} {\{{(1 - 0.2)}^{0.2} {(1 - 0.1)}^{0.1} {(1 - 0.2)}^{0.3} {(1 - 0.3)}^{0.4})}^{0.5}, 1 - {\{{(1 - 0.3)}^{0.2} {(1 - 0.2)}^{0.1} {(1 - 0.2)}^{0.3} {(1 - 0.4)}^{0.4}\}}^{0.3} {\{{(1 - 0.5)}^{0.2} {(1 - 0.2)}^{0.1} {(1 - 0.5)}^{0.3} {(1 - 0.4)}^{0.4}\}}^{0.2} {\{{(1 - 0.2)}^{0.2} {(1 - 0.1)}^{0.1} {(1 - 0.3)}^{0.3} {(1 - 0.3)}^{0.4})}^{0.5}〉

= 〈(0.5518, 0.2261, 0.3138)〉 .

SVNSWGA operator satisfies the following properties as similar as SVNSWA operator

(Idempotency Property) If ${\tilde{C}}_{e_{s t}} = {\tilde{C}}_{e} = 〈 T, I, F 〉$ for all s, t, then

$S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) = {\tilde{C}}_{e} .$
(Boundedness Property) If ${\tilde{C}}_{e_{s t}}^{-} = 〈 min_{t} min_{s} {T_{s t}}, max_{t} max_{s} {I_{s t}}, max_{t} max_{s} {F_{s t}} 〉$ and if

${\tilde{C}}_{e_{s t}}^{+} = 〈 max_{t} max_{s} {T_{s t}}, min_{t} min_{s} {I_{s t}}, min_{t} min_{s} {F_{s t}} 〉,$

then

${\tilde{C}}_{e_{s t}}^{-} \leq S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) \leq {\tilde{C}}_{e_{s t}}^{+} .$
(Shift-invariance Property) Let ${\tilde{C}}_{e} = 〈 T, I, F 〉$ be another SVNSN then

$S V N S W G A ({\tilde{C}}_{e_{11}} \otimes {\tilde{C}}_{e}, {\tilde{C}}_{e_{12}} \otimes {\tilde{C}}_{e}, \dots, {\tilde{C}}_{e_{m n}} \otimes {\tilde{C}}_{e}) = S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}) \otimes {\tilde{C}}_{e} .$
(Homogeneity Property) For any real number $λ > 0$ , we have

$S V N S W G A ({\tilde{C}}_{e_{11}}^{λ}, {\tilde{C}}_{e_{12}}^{λ}, \dots, {\tilde{C}}_{e_{m n}}^{λ}) = {(S V N S W G A ({\tilde{C}}_{e_{11}}, {\tilde{C}}_{e_{12}}, \dots, {\tilde{C}}_{e_{m n}}))}^{λ} .$

5. Model for MCDM Method Using Single-Valued Soft Information

In this Section, we shall present multi-criteria decision making (MCDM) method using single-valued neutrosophic soft weighted averaging operator (SVNSWA) and single-valued neutrosophic soft weighted geometric (SVNSWGA) operator in the environment of single-valued neutrosophic soft numbers.

An Approach Based on Proposed Operators

Let

\tilde{Y} = {{\tilde{Y}}_{1}, {\tilde{Y}}_{2}, \dots, {\tilde{Y}}_{l}}

be the discrete set of alternatives is evaluated by the set of m experts

{y_{1}, y_{2}, \dots, y_{m}}

under the constraints of n parameters

E = {e_{1}, e_{2}, \dots, e_{n}}

. Let

θ = {(θ_{1}, θ_{2}, \dots, θ_{m})}^{T}

and

ϕ = {(ϕ_{1}, ϕ_{2}, \dots, ϕ_{n})}^{T}

are respectively denote the weight vectors of the m experts

x_{s}^{'} s

and n parameters

e_{t}^{'} s

that

θ_{s} > 0

θ \in [0, 1]

such that

\sum_{s = 1}^{m} θ_{s} = 1

and

ϕ_{t} > 0

ϕ \in [0, 1]

such that

\sum_{t = 1}^{n} ϕ_{s} = 1

. In order to choice the best l alternates by the preference of n experts in the form of SVNSNs

{\tilde{C}}_{e_{s t}} = 〈 T_{s t}, I_{s t}, F_{s t} 〉

where

0 \leq T_{s t} + I_{s t} + F_{s t} \leq 3

and collective over all decision matrix is expressed as

\tilde{M} = {({\tilde{C}}_{e_{s t}})}_{m \times n}

. By these preference values of the experts, the aggregated SVNSN

{\tilde{C}}_{e_{k}}

for the alternatives

{\tilde{p}}_{k}

(k = 1, 2, \dots, l)

{\tilde{C}}_{e_{k}} = 〈 T_{k}, I_{k}, F_{k} 〉

by applying weighted averaging or geometric averaging operators which is given in Equations (5) and (8). Ranking order of the alternatives is determine based on the score function of the aggregated values of SVNSNs

{\tilde{C}}_{e_{k}}

(k = 1, 2, \dots, l)

In the following algorithm we propose to solve MCDM problem with single-valued neutrosophic soft information using SVNSWA and SVNSWGA operators.

Step 1.: Collect all the information in the form of single-valued neutrosophic soft matrix $C = 〈 T_{s t}, I_{s t}, F_{s t} 〉$ $(s = 1, 2, \dots, m; t = 1, 2, \dots, n)$ related to each alternatives under different parameters $e_{k}$ $(k = 1, 2, \dots, l)$ as

${\tilde{C}}_{m \times n} = M = [\begin{matrix} (T_{11}, I_{11}, F_{s t}) & (T_{12}, I_{12}, F_{12}) & \dots & (T_{1 n}, I_{1 n}, F_{1 n}) \\ (T_{21}, I_{21}, F_{21}) & (T_{22}, I_{22}, F_{22}) & \dots & (T_{2 n}, I_{2 n}, F_{2 n}) \\ ⋮ & ⋮ & ⋱ & ⋮ \\ (T_{m 1}, I_{m 1}, F_{m 1}) & (T_{m 2}, I_{m 2}, F_{m 2}) & \dots & (T_{m n}, I_{m n}, F_{m n}) \end{matrix}]$
Step 2.: To normalize the aggregated decision matrix by transforming values of benefit type (B) into cost (C) type by using the formula depicted in [61].

$g_{i j} = \{\begin{matrix} {\tilde{C}}_{e_{s t}}^{c}, & if e_{t} \in \tilde{B} \\ {\tilde{C}}_{e_{s t}}, & if e_{t} \in \tilde{C} \end{matrix}$

where ${\tilde{C}}_{e_{s t}}^{c} = 〈 1 - F_{s t}, I_{s t}, T_{s t} 〉$ is the complement of ${\tilde{C}}_{e_{s t}} = 〈 T_{s t}, I_{s t}, F_{s t} 〉$ .
Step 3.: Aggregate the SVNSNs ${\tilde{C}}_{e_{s t}}$ $(s = 1, 2, \dots, m; t = 1, 2, \dots, n)$ for each alternatives $Y_{k}$ $(k = 1, 2, \dots, l)$ into collective decision matrix $Ψ_{k}$ using SVNSWA or (SVNSWGA) operators.
Step 4.: Using Equation (1) we get the score value of $Ψ_{k}$ $(k = 1, 2, \dots, l)$ for each alternatives $A_{k}$ $(k = 1, 2, \dots, l)$ .
Step 5.: Rank all the alternative $A_{k}$ $(k = 1, 2, \dots, l)$ in order to choice the best one(s) in accordance with $Ψ_{k}$ $(k = 1, 2, \dots, l)$ .
Step 6.: End.

6. Numerical Example

In the above described decision-making method has been demonstrated with a practical example about the Medical diagnosis. The experts of five doctors

m_{1}, m_{2}, m_{3}, m_{4}, m_{5}

whose weight vector is

θ = {(0.2, 0.15, 0.2, 0.3, 0.15)}^{T}

, will give their judgement based on the diagnosis of four patients

Y_{1}, Y_{2}, Y_{3}, Y_{4}

under the parameters

E = {T e m p a r a t u r e (e_{1}), H e a d a c h e (e_{2}), S t o m a c h p a i n (e_{3}), C o u g h (e_{4}), C h e s t p a i n (e_{5})}

with weight vector

ϕ = {(0.2, 0.1, 0.3, 0.15, 0.25)}^{T}

. Then, we utilize the developed method to get most desirable candidate(s).

6.1. By SVNSWA Operator

The steps of the proposed approach performed and their corresponding details are reviewed as follows:

Step 1.: The given patients are being evaluated by five experts doctors to give their grades in terms of SVNSNs and are found in Table 3, Table 4, Table 5 and Table 6 respectively for each candidate.
Step 2.: All the parameters are of same type, so, there is no required for normalization.
Step 3.: The opinion of doctors for each patient $Y_{k}$ $(k = 1, 2, 3, 4)$ are aggregated by using Equation (5) given as follows: $Ω_{1} = 〈 0.4918, 0.2326, 0.3404 〉$ , $Ω_{2} = 〈 0.5154, 0.1700, 0.2522 〉$ , $Ω_{3} = 〈 0.4800, 0.1656, 0.2753 〉$ and $Ω_{4} = 〈 0.4319, 0.1942, 0.2444 〉$ .
Step 4.: The values of score functions are: $Ψ (Ω_{1}) = 0.1514$ , $Ψ (Ω_{2}) = 0.2632$ , $Ψ (Ω_{3}) = 0.2047$ and $Ψ (Ω_{4}) = 0.1875$ .
Step 5.: Ranking all the patients $Y_{k}$ $(k = 1, 2, 3, 4)$ in accordance with the value of the score $Ψ (Ω_{k})$ $(k = 1, 2, 3, 4)$ of the overall single-valued neutrosophic soft numbers as $Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$ .
Step 6.: Therefore, $Y_{2}$ is the more illness patient than other patients.

6.2. By Using SVNSWGA Operator

If we apply SVNSWGA operator on the proposed problem for the selection of appropriate candidate(s) that follows the following steps:

Step 3.: The aggregated values for each patients $Y_{k}$ $(k = 1, 2, 3, 4)$ using SVNSWGA operator are as follows from Equation (10): $Ω_{1} = 〈 0.4432, 0.3084, 0.3913 〉$ , $Ω_{2} = 〈 0.4515, 0.1999, 0.3044 〉$ , $Ω_{3} = 〈 0.4224, 0.1825, 0.3079 〉$ and $Ω_{4} = 〈 0.3960, 0.2204, 0.3030 〉$ .
Step 4.: The values of score functions are: $Ψ (Ω_{1}) = 0.0519$ , $Ψ (Ω_{2}) = 0.1471$ , $Ψ (Ω_{3}) = 0.1145$ and $Ψ (Ω_{4}) = 0.0930$ .
Step 5.: Ranking all the candidates $Y_{k}$ $(k = 1, 2, 3, 4)$ in accordance with the value of the score $Ψ (Ω_{k})$ $(k = 1, 2, 3, 4)$ of the overall single-valued neutrosophic soft numbers as $Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$ .
Step 6.: Hence, $Y_{2}$ is the most illness patient diagnosed by the expert doctors.

From the above analysis, it is clear that although overall rating values of the alternatives are different by using two operators, but ranking order of the alternatives are similar, the most illness patient is

Y_{2}

among four patients.

7. Comparative Analysis

To compare the proposed work with the existing approach, an analysis has been made based on aggregation operator (see [25,60,62]). In that reason, the different parameters of single-valued neutrosophic soft numbers are aggregated by using weighted averaging operator corresponding to the weighted vector

{(0.2, 0.1, 0.3, 0.15, 0.25)}^{T}

and then obtained aggregated single-valued neutrosophic soft matrix for the different candidates

Y_{k}

(k = 1, 2, 3, 4)

given in Table 7. From this evaluated matrix, a comparative study has been established with the existing work based on weighted aggregation operator on simplified neutrosophic numbers, single-valued neutrosophic Domi weighted aggregation operators and single-valued neutrosophic weighted averaging operators developed by researchers [25,60,62] for each candidate are shown in Table 8. It also shows that proposed method is stable with compare the existing methods. From the Table 7, we can see that the candidate

Y_{2}

is most illness person diagnosed by the experts doctors. The characteristic comparison between propose study with existing methods are given in Table 9. The propose method utilize advance technique to compare the existing works [56,57] where a decision making method has been develop based on some soft algebraic operations in neutrosophic soft environment but present paper leads a decision making method based on aggregating single-valued neutrosophic soft arguments in the environment of SVN soft numbers.The advantages of this paper is that they are capable to facilitate the descriptions of the real-world problems situation with the help of their parameterizations property. Therefore, proposed method can be utilize to solve decision-making problems instead of other existing operator in the environment of SVN soft numbers.

8. Conclusions

In this article, we have studied multi-criteria group decision-making problem using in the environment of single-valued neutrosophic soft information. We have introduced two new operators namely (SVNSWA) operator, (SVNSWGA) operators in SVN soft environment. The different features of those recommended operators is deliberated. For this purpose, firstly some algebraic structures of two SVNSNs are given and their operational rules are defined. The two aggregation operators have been proposed in the environment of SVNS numbers. Some properties of these two kinds of operators have been established. We justify the propose method with the existing methods and a characteristic comparison also shown to demonstrate advantage and applicability of the proposed method. A Medical decision-making problems has been studied based on SVNSWA and SVNSWGA operators under the environment of SVN soft information. The main advantages of these operators is that they are able to make smooth description of the real-world problems by the use of parameterizations factor. Ultimately, a realistic example for the selection of most illness patient is provided to develop a strategy and in accordance with expounding the utility and effectiveness of the proposed method. In the future work, the propose model further develop new soft aggregation operators for simplified neutrosophic sets and apply them to solve practical applications like engineering [63], group decision-making [64], expert system, information fusion system, fault diagnosis, robotics design [65] and other domains under different fuzzy soft environments.

Author Contributions

Conceptualization, C.J.; formal analysis, M.P.; writing—original draft preparation, C.J.; writing—review and editing, C.J. and M.P.; supervision, M.P.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

Kurvers, R.H.J.M.; Krause, J.; Argenziano, G.; Zalaudek, I.; Wolf, M. Detection accuracy of collective intelligence assessments for skin cancer diagnosis. JAMA Dermatol. 2015, 151, 1346–1353. [Google Scholar] [CrossRef] [PubMed]
Wolf, M.; Krause, J.; Carney, P.A.; Bogart, A.; Kurvers, R.H.J.M. Collective intelligence meets medical decision-making: The collective outperforms the best radiologist. PLoS ONE 2015, 10, e0134269. [Google Scholar] [CrossRef] [PubMed]
Marshall, J.A.R.; Brown, G.; Radford, A.N. Individual confidence-weighting and group decision-making. Trends Ecol. Evol. 2017, 32, 636–645. [Google Scholar] [CrossRef] [PubMed]
Olfati-Saber, R.; Franco, E.; Frazzoli, E.; Shamma, J.S. Belief consensus and distributed hypothesis testing in sensor networks. In Networked Embedded Sensing and Control; Springer: Berlin/Heidelberg, Germany, 2006; pp. 169–182. [Google Scholar]
Mukhametzyanov, I.; Pamuear, D. A sensistivity analysis in MCDM problems: A statistical approach. Decis. Mak. Appl. Manag. Eng. 2018, 1, 51–80. [Google Scholar] [CrossRef]
Teixeira, C.; Lopes, I.; Figueiredo, M. Classification methodology for spare parts management combining maintenance and logistics perspectives. J. Manag. Anal. 2018, 5, 116–135. [Google Scholar] [CrossRef]
Ronaynea, D.; Brown Gordon, D.A. Multi-attribute decision by sampling: An account of the attraction, compromise and similarity effects. J. Math. Psychol. 2017, 81, 11–27. [Google Scholar] [CrossRef]
Abbasian, N.S.; Salajegheh Gaspar, A.H.; Brett, P.O. Improving early OSV design robustness by applying Multivariate big data analytics on a ship’s life cycle. J. Ind. Inf. Integr. 2018, 10, 29–38. [Google Scholar] [CrossRef]
Liu, F.; Aiwu, G.; Lukovac, V.; Vukic, M. A multicriteria model for the selection of the transport service provider: A single valued neutrosophic DEMATEL multicriteria model. Decis. Mak. Appl. Manag. Eng. 2018, 1, 121–130. [Google Scholar] [CrossRef]
Atanassov, K.T. Intuitionistic Fuzzy Sets: Theory and Applications, Studies in Fuzziness and Soft Computing; Physica-Verlag: Heidelberg, Germany; New York, NY, USA, 1999; Volume 35. [Google Scholar]
Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
Beliakov, G.; Pradera, A.; Calvo, T. Aggregation Functions: A Guide for Practitioners; Springer: Heidelberg/Berlin, Germany; New York, NY, USA, 2007. [Google Scholar]
Beliakov, G.; Bustince, H.; Goswami, D.P.; Mukherjee, U.K.; Pal, N.R. On averaging operators for Atanassov’s intuitionistic fuzzy sets. Inf. Sci. 2011, 181, 1116–1124. [Google Scholar] [CrossRef]
Chen, S.M.; Chiou, C.H. Multiattribute decision making based on interval-valued intuitionistic fuzzy sets, PSO techniques, and evidential reasoning methodology. IEEE Trans. Fuzzy Syst. 2015, 23, 1905–1916. [Google Scholar] [CrossRef]
Jana, C.; Pal, M.; Karaaslan, F.; Wang, J.Q. Trapezoidal neutrosophic aggregation operators and its application in multiple attribute decision-making process. Sci. Iran. E 2018. in accepted. [Google Scholar]
Jana, C.; Senapati, T.; Pal, M.; Yager, R.R. Picture fuzzy Dombi aggregation operators: Application to MADM process. Appl. Soft Comput. 2018, 74, 99–109. [Google Scholar] [CrossRef]
Peng, J.J.; Wang, J.Q.; Wu, X.H.; Zhang, H.Y.; Chen, X.H. The fuzzy cross-entropy for intuitionistic hesitant fuzzy sets and its application in multi-criteria decision-making. Int. J. Syst. Sci. 2015, 46, 2335–2350. [Google Scholar] [CrossRef]
Wang, P.; Xu, X.H.; Wang, J.Q.; Cai, C.G. Some new operation rules and a new ranking method for interval-valued intuitionistic linguistic numbers. J. Int. Fuzzy syst. 2017, 32, 1069–1078. [Google Scholar] [CrossRef]
Xu, Z.S.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
Xu, Z.S. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
Ye, J. Multicriteria fuzzy decision-making method based ona novel accuracy function under interval-valued intuitionistic fuzzy environment. Expert Syst. Appl. 2009, 36, 899–6902. [Google Scholar] [CrossRef]
Smarandache, F. A Unifying Field in Logics. Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999. [Google Scholar]
Smarandache, F. Neutrosophic set-a generalization of the intuitionistic fuzzy set. Int. J. Pure Appl. Math. 2005, 24/3, 287–297. [Google Scholar]
Ye, J. A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Int. Fuzzy Syst. 2014, 27, 2459–2466. [Google Scholar]
Garg, H.; Nancy. Linguistic single-valued neutrosophic prioritized aggregation operators and their applications to multiple-attribute group decision-making. J. Ambient Intell. Hum. Comput. 2018, 9, 1975–1997. [Google Scholar] [CrossRef]
Wang, L.; Zhang, H.Y.; Wang, J.Q. Frank Choquet Bonferroni mean operators of bipolar neutrosophic sets and their application to multi-criteria decision-making problems. Int. J. Fuzzy Syst. 2018, 20, 13–28. [Google Scholar] [CrossRef]
Shi, L.; Ye, J. Dombi aggregation operators of neutrosophic cubic sets for multiple attribute decision-making. Algorithms 2018, 11, 29. [Google Scholar] [CrossRef]
Wei, G.W.; Zhang, Z. Some single-valued neutrosophic Bonferroni power aggregation operators in multiple attribute decision making. J. Ambient Intell. Hum. Comput. 2018. [Google Scholar] [CrossRef]
Ulucay, V.; Deli, I.; Sahin, M. Similarity measures of bipolar neutrosophic sets and their application to multiple criteria decision-making. Neural Comput. Appl. 2018, 29, 739–748. [Google Scholar] [CrossRef]
Abdel-Basset, M.; Mohamed, M.; Zhou, Y.; Hezam, I. Multi-criteria group decision making based on neutrosophic analytic hierarchy process. J. Int. Fuzzy Syst. 2017, 33, 4055–4066. [Google Scholar] [CrossRef]
Abdel-Basset, M.; Mohamed, M.; Smarandache, F. An extension of neutrosophic AHP-SWOT analysis for strategic planning and decision-making. Symmetry 2018, 10, 116. [Google Scholar] [CrossRef]
Dalapati, S.; Pramanik, S.; Alam, S.; Smarandache, F.; Roy, T.K. IN-cross entropy based magdm strategy under interval neutrosophic set environment. Neutrosophic Sets Syst. 2017, 18, 43–57. [Google Scholar]
Bausys, R.; Zavadskas, E.K. Multicriteria decision making approach by VIKOR under interval neutrosophic set environment. Econ. Comput. Econ. Cybern. Stud. Res. 2015, 4, 33–48. [Google Scholar]
Biswas, P.; Pramanik, S.; Giri, B.C. TOPSIS method for multi-attribute group decision-making under single valued neutrosophic environment. Neural Comput. Appl. 2016, 27, 727–737. [Google Scholar] [CrossRef]
Broumi, S.; Bakali, A.; Talea, M.; Smarandache, F.; Krishnan Kishore, K.P.; Sahin, R. Shortest path problem under interval valued neutrosophic setting. J. Fundam. Appl. Sci. 2018, 10, 168–174. [Google Scholar]
Sahin, R.; Liu, P. Correlation coefficient of single-valued neutrosophic hesitant fuzzy sets and its applications in decision making. Neural Comput. Appl. 2017, 28, 1387–1395. [Google Scholar] [CrossRef]
Jana, C.; Pal, M.; Wang, J.Q. Bipolar fuzzy Dombi aggregation operators and its application in multiple attribute decision making process. J. Ambient Intell. Hum. Comput. 2018. [Google Scholar] [CrossRef]
Pamuear, D.; Bozaniae, D.; Lukovac, V.; Komazec, N. Normalized weighted geometric bonferroni mean operator of interval rough numbers- application in interval rough DEMATEL-COPRAS. Facta Univ. Ser. Mech. Eng. 2018, 1–22. [Google Scholar] [CrossRef]
Maji, P.K.; Biswas, R.; Roy, A.R. Fuzzy soft sets. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
Maji, P.K.; Biswas, R.; Roy, A.R. Intuitionistic fuzzy soft sets. J. Fuzzy Math. 2001, 9, 677–692. [Google Scholar]
Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 27, 19–31. [Google Scholar] [CrossRef]
Cagman, N.; Citak, F.; Enginoglu, S. Fuzzy parameterized fuzzy soft set theory and its applications. Turk. J. Fuzzy Syst. 2001, 1, 21–35. [Google Scholar]
Cagman, N.; Deli, I. Intuitionistic fuzzy parameterized soft set theory and its decision making. Appl. Soft. Comput. 2015, 28, 109–113. [Google Scholar] [Green Version]
Alkhazaleh, S.; Salleh, A.R. Fuzzy soft expert set and its application. Appl. Math. 2014, 5, 1349–1368. [Google Scholar] [CrossRef]
Garg, H.; Arora, R. Generalized and group-based generalized intuitionistic fuzzy soft sets with applications in decision-making. Appl. Intell. 2018, 48, 343–356. [Google Scholar] [CrossRef]
Jiang, Y.; Tang, Y.; Chen, Q.; Liu, H.; Tang, J. Interval-valued intuitionistic fuzzy soft sets and their properties. Comput. Math. Appl. 2010, 60, 906–918. [Google Scholar] [CrossRef] [Green Version]
Yang, X.; Lin, T.Y.; Yang, J.; Li, Y.; Yu, D. Combination of interval-valued fuzzy set and soft set. Comput. Math. Appl. 2009, 58, 521–527. [Google Scholar] [CrossRef] [Green Version]
Jana, C.; Pal, M. Application of bipolar intuitionistic fuzzy soft sets in decision making problem. Int. J. Fuzzy Syst. Appl. 2018, 7, 32–55. [Google Scholar] [CrossRef]
Babitha, K.V.; John, S.J. Hesistant fuzzy soft sets. J. New Results Sci. 2013, 3, 98–107. [Google Scholar]
Jana, C.; Pal, M. Applications of new soft intersection set on groups. Ann. Fuzzy Math. Inf. 2013, 6, 17–31. [Google Scholar]
Jana, C.; Pal, M. Application of (α,β)-soft intersectional sets on BCK/BCI-algebras. Int. J. Intell. Syst. Technol. Appl. 2017, 16, 269–288. [Google Scholar] [CrossRef]
Selvachandran, G.; Peng, X. A modified TOPSIS method based on vague parameterized vague soft sets and its application to supplier selection problems. Neural Comput. Appl. 2018. [Google Scholar] [CrossRef]
Arora, R.; Garg, H. Prioritized averaging/geometric aggregation operators under the intuitionistic fuzzy soft set environment. Sci. Iran. E 2018, 25, 466–482. [Google Scholar] [CrossRef]
Karaaslan, F. Possibility neutrosophic soft sets and PNS-decision making method. Appl. Soft Comput. 2017, 54, 403–414. [Google Scholar] [CrossRef]
Broumi, S.; Samarandache, F. Single-valued neutrosophic soft expert sets and their application in decision-making. J. New Theory 2015, 3, 67–88. [Google Scholar]
Ali, M.; Son, L.; Deli, I.; Tien, N.D. Bipolar Neutrosophic Soft Sets and Applications in Decision Making. J. Int. Fuzzy Syst. 2017, 33, 4077–4087. [Google Scholar] [CrossRef]
Deli, I.; Eraslan, S.; Cagman, N. ivnpiv-Neutrosophic soft sets and their decision making based on similarity measure. Neural Comput. Appl. 2018, 29, 187–203. [Google Scholar] [CrossRef]
Khalid, A.; Abbas, M. Distance measures and operations in intuitionistic and interval- valued intuitionistic fuzzy soft set theory. Int. J. Fuzzy Syst. 2015, 17, 490–497. [Google Scholar] [CrossRef]
Sahin, R. Multi-criteria neutrosophic decision making method based on score and accuracy functions under neutrosophic environment. arXiv, 2014; arXiv:412.5202. [Google Scholar]
Xu, Z.S.; Hu, H. Projection models for intuitionistic fuzzy multiple attribute decision- making. Int. J. Inf. Technol. Dec. Mak. 2010, 9, 267–280. [Google Scholar] [CrossRef]
Chen, J.; Ye, J. Some Single-Valued Neutrosophic Dombi Weighted Aggregation Operators for Multiple Attribute Decision-Making. Symmetry 2017, 9, 82. [Google Scholar] [CrossRef]
Pamuear, D.; Badi, I.; Sanja, S.; Obradovic, R. A novel approach for the selection of power-generation technology using a linguistic neutrosophic CODAS method: A case study in Libya. Energies 2018, 11, 2489. [Google Scholar] [CrossRef]
Maio, C.D.; Fenza, G.; Loia, V.; Orciuoli, F.; Herrera-Viedma, E. A framework for context-aware heterogeneous group decision making in business processes. Knowl.-Based Syst. 2016, 102, 39–50. [Google Scholar] [CrossRef]
Smarandache, F.; Vladareanu, L. Applications of Neutrosophic Logic to Robotics. Available online: https://www.researchgate.net/publication/268443363_Applications_of_Neutrosophic_Logic_to_Robotics_An_Introduction (accessed on 21 March 2015).

Table 1. Neutrosophic soft numbers.

$Experts$	$e_{1}$	$e_{2}$	$e_{3}$
$y_{1}$	$〈 0.6, 0.2, 0.3 〉$	$〈 0.5, 0.5, 0.2 〉$	$〈 0.6, 0.3, 0.5 〉$
$y_{2}$	$〈 0.5, 0.4, 0.4 〉$	$〈 0.3, 0.2, 0.1 〉$	$〈 0.5, 0.4, 0.5 〉$
$y_{3}$	$〈 0.7, 0.1, 0.4 〉$	$〈 0.4, 0.3, 0.6 〉$	$〈 0.3, 0.1, 0.6 〉$
$y_{4}$	$〈 0.4, 0.5, 0.2 〉$	$〈 0.7, 0.2, 0.1 〉$	$〈 0.2, 0.6, 0.3 〉$

Table 2. Neutrosophic soft numbers.

$Experts$	$e_{1}$	$e_{2}$	$e_{3}$
$y_{1}$	$〈 0.6, 0.3, 0.3 〉$	$〈 0.7, 0.2, 0.5 〉$	$〈 0.4, 0.2, 0.2 〉$
$y_{2}$	$〈 0.5, 0.4, 0.2 〉$	$〈 0.5, 0.3, 0.2 〉$	$〈 0.8, 0.1, 0.1 〉$
$y_{3}$	$〈 0.4, 0.1, 0.2 〉$	$〈 0.7, 0.1, 0.5 〉$	$〈 0.5, 0.2, 0.3 〉$
$y_{4}$	$〈 0.6, 0.2, 0.4 〉$	$〈 0.6, 0.3, 0.4 〉$	$〈 0.6, 0.3, 0.3 〉$

Table 3. Single-valued neutrosophic soft matrix for the patient

Y_{1}

Table 3. Single-valued neutrosophic soft matrix for the patient

Y_{1}

$Experts$	$e_{1}$	$e_{2}$	$e_{3}$	$e_{4}$	$e_{5}$
$m_{1}$	$〈 0.6, 0.2, 0.3 〉$	$〈 0.5, 0.5, 0.5 〉$	$〈 0.6, 0.3, 0.2 〉$	$〈 0.3, 0.5, 0.7 〉$	$〈 0.3, 0.4, 0.4 〉$
$m_{2}$	$〈 0.6, 0.4, 0.5 〉$	$〈 0.3, 0.2, 0.4 〉$	$〈 0.5, 0.4, 0.5 〉$	$〈 0.4, 0.6, 0.4 〉$	$〈 0.4, 0.1, 0.2 〉$
$m_{3}$	$〈 0.7, 0.1, 0.4 〉$	$〈 0.4, 0.3, 0.4 〉$	$〈 0.3, 0.1, 0.4 〉$	$〈 0.7, 0.3, 0.2 〉$	$〈 0.6, 0.2, 0.6 〉$
$m_{4}$	$〈 0.4, 0.5, 0.3 〉$	$〈 0.7, 0.2, 0.1 〉$	$〈 0.2, 0.6, 0.4 〉$	$〈 0.6, 0.1, 0.5 〉$	$〈 0.5, 0.1, 0.5 〉$
$m_{5}$	$〈 0.5, 0.2, 0.2 〉$	$〈 0.6, 0.1, 0.6 〉$	$〈 0.6, 0.2, 0.2 〉$	$〈 0.4, 0.1, 0.1 〉$	$〈 0.4, 0.2, 0.3 〉$

Table 4. Single-valued neutrosophic soft matrix for the patient

Y_{2}

Table 4. Single-valued neutrosophic soft matrix for the patient

Y_{2}

$Experts$	$e_{1}$	$e_{2}$	$e_{3}$	$e_{4}$	$e_{5}$
$m_{1}$	$〈 0.3, 0.4, 0.4 〉$	$〈 0.8, 0.1, 0.1 〉$	$〈 0.7, 0.1, 0.1 〉$	$〈 0.4, 0.1, 0.3 〉$	$〈 0.2, 0.3, 0.4 〉$
$m_{2}$	$〈 0.5, 0.1, 0.3 〉$	$〈 0.5, 0.2, 0.2 〉$	$〈 0.4, 0.2, 0.3 〉$	$〈 0.6, 0.1, 0.2 〉$	$〈 0.2, 0.1, 0.3 〉$
$m_{3}$	$〈 0.2, 0.1, 0.2 〉$	$〈 0.4, 0.1, 0.4 〉$	$〈 0.5, 0.4, 0.5 〉$	$〈 0.4, 0.2, 0.6 〉$	$〈 0.5, 0.2, 0.2 〉$
$m_{4}$	$〈 0.7, 0.2, 0.3 〉$	$〈 0.5, 0.1, 0.4 〉$	$〈 0.6, 0.2, 0.4 〉$	$〈 0.4, 0.2, 0.1 〉$	$〈 0.7, 0.1, 0.1 〉$
$m_{5}$	$〈 0.5, 0.2, 0.2 〉$	$〈 0.5, 0.3, 0.2 〉$	$〈 0.4, 0.1, 0.5 〉$	$〈 0.3, 0.2, 0.2 〉$	$〈 0.6, 0.4, 0.2 〉$

Table 5. Single-valued neutrosophic soft matrix for the patient

Y_{3}

Table 5. Single-valued neutrosophic soft matrix for the patient

Y_{3}

$Experts$	$e_{1}$	$e_{2}$	$e_{3}$	$e_{4}$	$e_{5}$
$m_{1}$	$〈 0.4, 0.3, 0.2 〉$	$〈 0.8, 0.1, 0.4 〉$	$〈 0.5, 0.2, 0.3 〉$	$〈 0.6, 0.1, 0.2 〉$	$〈 0.2, 0.3, 0.3 〉$
$m_{2}$	$〈 0.5, 0.1, 0.2 〉$	$〈 0.4, 0.2, 0.3 〉$	$〈 0.3, 0.2, 0.4 〉$	$〈 0.4, 0.2, 0.3 〉$	$〈 0.5, 0.2, 0.2 〉$
$m_{3}$	$〈 0.2, 0.1, 0.1 〉$	$〈 0.4, 0.2, 0.3 〉$	$〈 0.4, 0.2, 0.3 〉$	$〈 0.5, 0.1, 0.4 〉$	$〈 0.5, 0.1, 0.1 〉$
$m_{4}$	$〈 0.7, 0.2, 0.4 〉$	$〈 0.5, 0.2, 0.2 〉$	$〈 0.2, 0.1, 0.5 〉$	$〈 0.6, 0.2, 0.5 〉$	$〈 0.6, 0.2, 0.2 〉$
$m_{5}$	$〈 0.5, 0.3, 0.3 〉$	$〈 0.5, 0.4, 0.4 〉$	$〈 0.4, 0.1, 0.2 〉$	$〈 0.4, 0.1, 0.5 〉$	$〈 0.7, 0.2, 0.3 〉$

Table 6. Single-valued neutrosophic soft matrix for the patient

Y_{4}

Table 6. Single-valued neutrosophic soft matrix for the patient

Y_{4}

$Experts$	$e_{1}$	$e_{2}$	$e_{3}$	$e_{4}$	$e_{5}$
$m_{1}$	$〈 0.4, 0.1, 0.2 〉$	$〈 0.5, 0.4, 0.4 〉$	$〈 0.5, 0.2, 0.1 〉$	$〈 0.5, 0.1, 0.3 〉$	$〈 0.2, 0.3, 0.7 〉$
$m_{2}$	$〈 0.5, 0.1, 0.3 〉$	$〈 0.3, 0.2, 0.2 〉$	$〈 0.3, 0.2, 0.3 〉$	$〈 0.4, 0.2, 0.2 〉$	$〈 0.3, 0.2, 0.2 〉$
$m_{3}$	$〈 0.5, 0.3, 0.4 〉$	$〈 0.5, 0.1, 0.5 〉$	$〈 0.4, 0.2, 0.2 〉$	$〈 0.2, 0.2, 0.4 〉$	$〈 0.5, 0.2, 0.4 〉$
$m_{4}$	$〈 0.6, 0.2, 0.3 〉$	$〈 0.4, 0.5, 0.2 〉$	$〈 0.3, 0.2, 0.4 〉$	$〈 0.7, 0.2, 0.1 〉$	$〈 0.3, 0.1, 0.1 〉$
$m_{5}$	$〈 0.5, 0.3, 0.1 〉$	$〈 0.4, 0.6, 0.1 〉$	$〈 0.4, 0.2, 0.3 〉$	$〈 0.3, 0.1, 0.4 〉$	$〈 0.6, 0.3, 0.3 〉$

Table 7. Aggregated value of single-valued neutrosophic soft matrix for the patients.

$Experts$	$C_{1}$	$C_{2}$	$C_{3}$	$C_{4}$
$m_{1}$	$〈 0.4884, 0.3378, 0.3411 〉$	$〈 0.5161, 0.1737, 0.2200 〉$	$〈 0.4854, 0.2018, 0.2679 〉$	$〈 0.4168, 0.1861, 0.2531 〉$
$m_{2}$	$〈 0.4680, 0.2805, 0.3761 〉$	$〈 0.4256, 0.1320, 0.2711 〉$	$〈 0.4211, 0.1741, 0.2725 〉$	$〈 0.3605, 0.1741, 0.2449 〉$
$m_{3}$	$〈 0.5545, 0.1565, 0.3990 〉$	$〈 0.4251, 0.2000, 0.3327 〉$	$〈 0.4092, 0.1320, 0.1911 〉$	$〈 0.4333, 0.2024, 0.3322 〉$
$m_{4}$	$〈 0.4513, 0.2531, 0.3594 〉$	$〈 0.6182, 0.1569, 0.2169 〉$	$〈 0.5246, 0.1625, 0.3470 〉$	$〈 0.4573, 0.1843, 0.2024 〉$
$m_{5}$	$〈 0.5081, 0.1682, 0.2226 〉$	$〈 0.4747, 0.2012, 0.2633 〉$	$〈 0.5223, 0.1702, 0.2952 〉$	$〈 0.4650, 0.2415, 0.2253 〉$

Table 8. Comparison analysis with the existing method.

Methods	$Ψ (Ω_{1})$	$Ψ (Ω_{2})$	$Ψ (Ω_{3})$	$Ψ (Ω_{4})$	Ranking Order
$P r o p o s e d S V N S W A o p e r a t o r$	0.1514	0.2632	0.2047	0.1875	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
$P r o p o s e d S V N S W G A o p e r a t o r$	0.0519	0.1417	0.1145	0.0930	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
Ye [25] by SNWAA operator	0.1440	0.2583	0.1969	0.1822	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
Ye [25] by SNWGA operator	0.1487	0.2506	0.1999	0.1852	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
Chen and Ye [62] SVNDWA operator	0.1594	0.2732	0.2131	0.1915	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
Chen and Ye [62] SVNDWG operator	0.1378	0.2383	0.1875	0.1760	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
Sahin [60] SVNWAA operator	0.1515	0.2632	0.2047	0.1869	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$
Sahin [60] SVNWGA operator	0.1412	0.2445	0.1921	0.1791	$Y_{2} ≻ Y_{3} ≻ Y_{4} ≻ Y_{1}$

Table 9. Characteristic comparisons of different methods.

Methods	Fuzzy Information Easier	Weather Aggregate Parameter Information
Ye [25]	Yes	No
Chen and Ye [62]	Yes	No
Sahin [60]	Yes	No
Proposed operators	Yes	Yes

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Share and Cite

MDPI and ACS Style

Jana, C.; Pal, M. A Robust Single-Valued Neutrosophic Soft Aggregation Operators in Multi-Criteria Decision Making. Symmetry 2019, 11, 110. https://doi.org/10.3390/sym11010110

AMA Style

Jana C, Pal M. A Robust Single-Valued Neutrosophic Soft Aggregation Operators in Multi-Criteria Decision Making. Symmetry. 2019; 11(1):110. https://doi.org/10.3390/sym11010110

Chicago/Turabian Style

Jana, Chiranjibe, and Madhumangal Pal. 2019. "A Robust Single-Valued Neutrosophic Soft Aggregation Operators in Multi-Criteria Decision Making" Symmetry 11, no. 1: 110. https://doi.org/10.3390/sym11010110

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Menu

A Robust Single-Valued Neutrosophic Soft Aggregation Operators in Multi-Criteria Decision Making

Abstract

1. Introduction

2. Literature Review

3. Basic Concepts of FSS and SVNSS

4. Single-Valued Neutrosophic Soft Weighted Arithmetic Averaging (SVNSWAA) Operator

4.1. Operational Law for SVNSNs

4.2. Single-Valued Neutrosophic Soft Weighted Geometric Averaging (SVNSWGA) Operator

5. Model for MCDM Method Using Single-Valued Soft Information

An Approach Based on Proposed Operators

6. Numerical Example

6.1. By SVNSWA Operator

6.2. By Using SVNSWGA Operator

7. Comparative Analysis

8. Conclusions

Author Contributions

Funding

Conflicts of Interest

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI