Models for Multiple Attribute Decision-Making with Dual Generalized Single-Valued Neutrosophic Bonferroni Mean Operators

Abstract

In this article, we expand the dual generalized weighted BM (DGWBM) and dual generalized weighted geometric Bonferroni mean (DGWGBM) operator with single valued neutrosophic numbers (SVNNs) to propose the dual generalized single-valued neutrosophic number WBM (DGSVNNWBM) operator and dual generalized single-valued neutrosophic numbers WGBM (DGSVNNWGBM) operator. Then, the multiple attribute decision making (MADM) methods are proposed with these operators. In the end, we utilize an applicable example for strategic suppliers selection to prove the proposed methods.

1. Introduction

Smarandache [1,2] introduced a neutrosophic set (NS) from a philosophical point of view to express indeterminate and inconsistent information. In an NS A, its truth–membership function $T_A\left(x\right)$, indeterminacy–membership $I_A\left(x\right)$ and falsity–membership function $F_A\left(x\right)$ are represented independently, which lie in real standard or nonstandard subsets of $\left]{}^{-}0,1^{+}\right[$, that is, $T_A\left(x\right):X\to \left]{}^{-}0,1^{+}\right[,I_A\left(x\right):X\to \left]{}^{-}0,1^{+}\right[$ and $F_A\left(x\right):X\to \left]{}^{-}0,1^{+}\right[$. The main advantage of NSs is to depict inconsistent and indeterminate information. An NS has more potential power than other fuzzy mathematical modeling tools, such as fuzzy set [3], intuitionistic fuzzy set (IFS) [4] and interval valued neutrosophic fuzzy set (IVIFS) [5]. However, it is not easy to use NSs in solving practical problems. Therefore, Smarandache [2] and Wang et al. [6,7] defined the single-valued neutrosophic set (SVNS) and an interval neutrosophic set (INS). Hence, SVNSs and INSs can express much more information than fuzzy sets, IFSs and IVIFSs. Ye [8] presented the correlation and correlation coefficient of single-valued neutrosophic sets (SVNSs) based on the extension of the correlation of intuitionistic fuzzy sets and demonstrates that the cosine similarity measure is a special case of the correlation coefficient in SVNS. Broumi and Smarandache [9] investigated the correlation coefficient with interval neutrosophic numbers(INNs). Biswas et al. [10] proposed a new approach for multi-attribute group decision-making problems by extending the technique for order preference by similarity to ideal solution to single-valued neutrosophic environment. Liu et al. [11] proposed the generalized neutrosophic number Hamacher weighted averaging (GNNHWA) operator, generalized neutrosophic number Hamacher ordered weighted averaging (GNNHOWA) operator, and generalized neutrosophic number Hamacher hybrid averaging (GNNHHA) operator, and explored some properties of these operators and analyzed some special cases of them. Sahin and Liu [12] proposed the maximizing deviation models for solving the multiple attribute decision-making problems with the single-valued neutrosophic information or interval neutrosophic information. Ye [13] developed the Hamming and Euclidean distances between interval neutrosophic sets (INSs) and proposed the similarity measures between INSs based on the relationship between similarity measures and distances. Zhang et al. [14] developed the interval neutrosophic number weighted averaging (INNWA) operator and interval neutrosophic number weighted geometric (INNWG) operator. Ye [15] proposed a simplified neutrosophic set (SNS) as a more general concept including SVNS and INS. Many researchers have given them attention to SNSs. For example, Peng et al. [16] defined some basic operational laws for SNNs and developed simplified neutrosophic information aggregation operators. Additionally, Peng et al. [17] developed a new outranking approach for multi-criteria decision-making (MCDM) problems in the context of a simplified neutrosophic environment, where the truth-membership degree, indeterminacy-membership degree and falsity-membership degree for each element are singleton subsets in [0, 1], and then Zhang et al. [18] gave an extended version of Peng’s approach to interval neutrosophic environment. Liu and Liu [19] developed generalized weighted power operators with SVNNs. Deli and Subas [20] discussed a method to rank SVNNs. Peng et al. [21] introduced the multi-valued neutrosophic sets (MVNSs), which allowed the truth-membership, indeterminacy–membership and falsity-membership degree have a set of crisp values between zero and one, respectively, and then defined the operations of multi-valued neutrosophic numbers (MVNNs) based on Einstein operations, the multi-valued neutrosophic power weighted average (MVNPWA) operator and the multi-valued neutrosophic power weighted geometric (MVNPWG) operator. Zhang et al. [22] presented a new correlation coefficient measure that satisfies the requirement of this measure equaling one if and only if two interval neutrosophic sets (INSs) are the same and presented an objective weight of INSs. Chen and Ye [23] proposed the Dombi operations of single-valued neutrosophic numbers (SVNNs) based on the operations of the Dombi T-norm and T-conorm and then proposed the single-valued neutrosophic Dombi weighted arithmetic average (SVNDWAA) operator and the single-valued neutrosophic Dombi weighted geometric average (SVNDWGA) operator to deal with the aggregation of SVNNs and investigates their properties. Liu and Wang [24] proposed a single-valued neutrosophic normalized weighted Bonferroni mean (SVNNWBM) operator on the basis of Bonferroni mean, the weighted Bonferroni mean (WBM), and the normalized WBM and developed the models solve the multiple attribute decision-making problems with SVNNs based on the SVNNWBM operator. Wu et al. [25] defined the prioritized weighted average operator and prioritized weighted geometric operator for simplified neutrosophic numbers (SNNs) and then proposed two novel effective cross-entropy measures for SNSs and proposed the ranking methods for SNSs to solve MADM problems based on the proposed prioritized aggregation operators and cross-entropy measures. Li et al. [26] proposed the improved generalized weighted Heronian mean (IGWHM) operator and improved generalized weighted geometric Heronian mean (IGWGHM) operator based on crisp numbers, and prove that they can satisfy some desirable properties, such as reducibility, idempotency, monotonicity and boundedness and proposed the single valued neutrosophic number improved generalized weighted Heronian mean (NNIGWHM) operator and single valued the neutrosophic number improved generalized weighted geometric Heronian mean (NNIGWGHM) operator for multiple attribute group decision-making (MAGDM) problems in which attribute values take the form of SVNNs.

Obviously, these established SVNN aggregation operators cannot be used to fuse the arguments that are correlated. Meanwhile, the Bonferroni mean (BM) [27,28,29,30,31,32,33,34] is a very practical tool to tackle the arguments that are correlated. How to effectively extend the mature BM mean to the SVNN environment is a significant research task.

The structure of this manuscript is given. Section 2 reviews SVNSs and basic definitions. Section 3 introduces the extended DGWBM and DGWGBM, which can be used to fuse the SVNNs, and describes some properties of these operators. Section 4 illustrates the functions of the proposed operators with an example for strategic supplier selection in supply chain management area. Section 5 presents the conclusions.

2. Basic Concepts

Smarandache [1,2] proposed Neutrosophic sets (NSs). Wang et al. [6,7] further proposed the SVNSs.

Definition 1 [6,7].

Let $X$ be a space of points (objects) with a generic element in fix set $X$, named by $x$. An SVNS $A$ in $X$ is depicted as the following:

$$A=\left\{\left(x,T_A\left(x\right),I_A\left(x\right),F_A\left(x\right)\right)|x\in X\right\}\oplus ,$$

(1)

where $T_A\left(x\right)\left(0\le T_A\left(x\right)\le 1\right)$ is truth–membership function, $I_A\left(x\right)\left(0\le I_A\left(x\right)\le 1\right)$ is indeterminacy–membership and $F_A\left(x\right)\left(0\le F_A\left(x\right)\le 1\right)$ is falsity–membership function, and $0\le T_A\left(x\right)+I_A\left(x\right)+F_A\left(x\right)\le 3$ .

Zhang et al. [14] gave the order between two SVNNs.

Definition 2 [14].

Let $A_1=\left(T_{A_1},I_{A_1},F_{A_1}\right)$ and $A_2=\left(T_{A_2},I_{A_2},F_{A_2}\right)$ be two SVNNs, $s\left(A_1\right)=\frac{\left(2+T_{A_1}-I_{A_1}-F_{A_1}\right)}{3}$ and $s\left(A_2\right)=\frac{\left(2+T_{A_2}-I_{A_2}-F_{A_2}\right)}{3}$ be the scores of $A_1$ and $A_2$, respectively, and let $H\left(A_1\right)=T_{A_1}-F_{A_1}$ and $H\left(A_2\right)=T_{A_2}-F_{A_2}$ be the accuracy degrees of $A_1$ and $A_2$, respectively, then if $S\left(A_1\right)<S\left(A_2\right)$, $A_1<A_2$; if $S\left(A_1\right)=S\left(A_2\right)$, then (1) if $H\left(A_1\right)=H\left(A_2\right)$, $A_1=A_2$; (2) if $H\left(A_1\right)<H\left(A_2\right)$, $A_1<A_2$.

Definition 3 [6].

Let $A=(T_{A_1},I_{A_1},F_{A_1})$ and $A_2=(T_{A_2},I_{A_2},F_{A_2})$ be two SVNNs and $\lambda$ be a positive real number, some operations of SVNNs are defined:

1.

$A_1\oplus A_2=(T_{A_1}+T_{A_2}-T_{A_1}{T}_{A_2},I_{A_1}{I}_{A_2},F_{A_1}{F}_{A_2});$

2.

$A_1\otimes A_2=(T_{A_1}{T}_{A_2},I_{A_1}+I_{A_2}-I_{A_1}{I}_{A_2},F_{A_1}+F_{A_2}-F_{A_1}{F}_{A_2});$

3.

$\lambda A_1=(1-{(1-T_{A_1})}^{\lambda },{(I_{A_1})}^{\lambda },{(F_{A_1})}^{\lambda }),\lambda >0;$

4.

${(A_1)}^{\lambda }=({(T_{A_1})}^{\lambda },1-{(1-I_{A_1})}^{\lambda },1-{(1-F_{A_1})}^{\lambda }),\lambda >0.$

Zhang et al. [34] develop the dual generalized WBM (DGWBM) operator and dual generalized WGBM (DGWGBM) operator.

Definition 4 [34].

Let $b_i(i=1,2,\dots ,n)$ be a set of nonnegative crisp numbers with the weight $w={(w_1,w_2,\dots ,w_n)}^T$, $w_i\in \left[0,1\right]$ $(i=1,2,\dots ,n)$ and ${\displaystyle {\sum }_{i=1}^n{w}_i}=1$, if

$${\mathrm{DGWBM}}_w^R(b_1,b_2,\dots ,b_n)={\left({\displaystyle \sum _{i_1,i_2,\dots ,i_n=1}^n\left({\displaystyle \prod _{j=1}^n{w}_{i_j}}{b}_{{}_{i_j}}^{r_j}\right)}\right)}^{1/{\displaystyle {\sum }_{j=1}^n{r}_j}},$$

(2)

where $R={(r_1,r_2,\dots ,r_n)}^T$ is the parameter vector with $r_i\ge 0(i=1,2,\dots ,n)$.

Several special cases can be obtained given the change of the parameter vector.

If $R=(\lambda ,0,0,\dots ,0)$, then we obtain

$${\mathrm{DGWBM}}^{(\lambda ,0,0,\dots ,0)}(b_1,b_2,\dots ,b_n)={({\displaystyle \sum _{i=1}^n{w}_i{b}_i^{\lambda }})}^{1/\lambda },$$

(3)

which is the generalized weighted averaging operator.

If $R=(s,t,0,0,\dots ,0)$, then we obtain

$${\mathrm{DGWBM}}^{(s,t,0,0,\dots ,0)}(b_1,b_2,\dots ,b_n)={({\displaystyle \sum _{i,j=1}^n{w}_i{w}_j{b}_i^s}{b}_j^t)}^{1/(s+t)},$$

(4)

which is the weighted BM.

If $R=(s,t,r,0,0,\dots ,0)$, then we obtain

$${\mathrm{DGWBM}}^{(s,t,r,0,0,\dots ,0)}(b_1,b_2,\dots ,b_n)={({\displaystyle \sum _{i,j,k=1}^n{w}_i{w}_j{w}_k{b}_i^s}{b}_j^t{b}_k^r)}^{1/(s+t+k)}.$$

(5)

Definition 5 [34].

Let $b_i(i=1,2,\dots ,n)$ be a set of nonnegative crisp numbers with weight being $w={(w_1,w_2,\dots ,w_n)}^T$, $w_i\in \left[0,1\right]$ $(i=1,2,\dots ,n)$ and ${\displaystyle {\sum }_{i=1}^n{w}_i}=1$, if

$${\mathrm{DGWBGM}}^R(b_1,b_2,\dots ,b_n)=\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}{\left({\displaystyle \prod _{{}_1,i_2,\dots ,i_n=1}^n\left({\displaystyle \sum _{j=1}^n\left(r_j{b}_{i_j}\right)}\right)}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}},$$

(6)

where $R={(r_1,r_2,\dots ,r_n)}^T$ is the parameter vector with $r_i\ge 0(i=1,2,\dots ,n)$.

Similar to the DGWBM, we can consider some special cases given the change of the parameter vector.

(1) If $R=(\lambda ,0,0,\dots ,0)$, then we obtain

$${\mathrm{DGWBGM}}^{(\lambda ,0,0,\dots ,0)}(b_1,b_2,\dots ,b_n)=\frac{1}{\lambda }\left({\displaystyle \prod _{i=1}^n{\left(\lambda b_i\right)}^{w_i}}\right).$$

(7)

(2) If $R=(s,t,0,0,\dots ,0)$, then we obtain

$${\mathrm{DGWBGM}}^{(s,t,0,0,\dots ,0)}(b_1,b_2,\dots ,b_n)=\frac{1}{s+t}{\displaystyle \prod _{i,j=1}^n(s{b}_i}+t{b}_j{)}^{w_i{w}_j}.$$

(8)

(3) If $R=(s,t,r,0,0,\dots ,0)$, then we obtain

$${\mathrm{DGWBGM}}^{(s,t,r,0,0,\dots ,0)}(b_1,b_2,\dots ,b_n)=\frac{1}{s+t+r}{\displaystyle \prod _{i.j.k=1}^n{(s{b}_i+t{b}_j+r{b}_k)}^{w_i{w}_j{w}_k}}.$$

(9)

3. DGSVNNWBM Operator and DGSVNNWGBM Operator

This section extends DGWBM and DGWGBM to fuse the SVNNs, and proposes the dual generalized SVNN weighted BM (DGSVNNWBM) operator and dual generalized SVNN weighted GBM (DGSVNNWGBM) operator.

Definition 6.

Let $a_i=(T_i,I_i,F_i)(i=1,2,\dots ,n)$ be a set of SVNNs with weight $w_i={(w_1,w_2,\dots ,w_n)}^T$, $w_i\in \left[0,1\right]$ and ${\displaystyle {\sum }_{i=1}^n{w}_i}=1$.

Thereafter, the dual generalized SVNN weighted BM (DGSVNNWBM) operator is defined as

$${\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)={\left(\underset{i_1,i_2,\dots ,i_n=1}{\overset{n}{{\displaystyle \oplus }}}\left(\underset{j=1}{\overset{n}{{\displaystyle \otimes }}}{w}_{i_j}{a}_{{}_{i_j}}^{r_j}\right)\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},$$

(10)

where $R={(r_1,r_2,\dots ,r_n)}^T$ is the parameter vector with $r_i\ge 0(i=1,2,\dots ,n)$. We can get Theorem 1.

Theorem 1.

Let $a_i=(T_i,I_i,F_i)(i=1,2,\dots ,n)$ be a set of SVNNs. Hence, the aggregated result of DGSVNNWBM is a SVNN and

$$\begin{array}{l}{\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)\\ =\left(\begin{array}{l}{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\end{array}\right)\end{array}$$

(11)

Proof. 

$$a_{i_j}^{r_j}=\left(T_{i_j}^{r_j},1-{\left(1-I_{i_j}\right)}^{r_j},1-{\left(1-F_{i_j}\right)}^{r_j}\right).$$

(12)

Thus,

$$w_{i_j}{a}_{i_j}^{r_j}=\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}},{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}},{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right).$$

(13)

Thereafter,

$$\underset{j=1}{\overset{n}{\otimes }}{w}_{i_j}{a}_{i_j}^{r_j}=\left(\begin{array}{l}{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right),}\\ 1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)},\\ 1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\end{array}\right).$$

(14)

Furthermore,

$$\begin{array}{l}\underset{i_1,i_2,\dots ,i_n=1}{\overset{n}{\oplus }}\left(\underset{j=1}{\overset{n}{\otimes }}{w}_{i_j}{a}_{i_j}^{r_j}\right)\\ =\left(\begin{array}{l}1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)},\\ {\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)},\\ {\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}.\end{array}\right)\end{array}.$$

(15)

Therefore,

$$\begin{array}{l}{\left(\underset{i_1,i_2,\dots ,i_n=1}{\overset{n}{{\displaystyle \oplus }}}\left(\underset{j=1}{\overset{n}{{\displaystyle \otimes }}}{w}_{i_j}{a}_{{}_{i_j}}^{r_j}\right)\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\\ =\left(\begin{array}{l}{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}.\end{array}\right)\end{array}.$$

(16)

Hence, Label (11) is maintained.

Thereafter,

$$\begin{array}{l}0\le {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\le 1,\\ 0\le 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\le 1,\\ 0\le 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\le 1.\end{array}$$

(17)

In addition,

$$\begin{array}{l}0\le {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\\ +1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\\ +1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\le 3,\end{array}$$

(18)

thereby completing the proof. ☐

Moreover, DGSVNNWBM has the following properties.

Property 1. (Monotonicity).

Let $a_i=(T_{a_i},I_{a_i},F_{a_i})(i=1,2,\dots ,n)$ and $b_i=(T_{b_i},I_{b_i},F_{b_i})$ $(i=1,2,\dots ,n)$ be two sets of SVNNs. If $T_{a_i}\le T_{b_i}and{I}_{a_i}\ge I_{b_i}and{F}_{a_i}\ge F_{b_i}$ holds for all $i$, then

$${\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)\le {\mathrm{DGSVNNWBM}}_w^R(b_1,b_2,\cdots ,b_n).$$

(19)

Proof. 

Let ${\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)=(T_a,I_a,F_a)$, ${\mathrm{DGSVNNWBM}}_w^R(b_1,b_2,\cdots ,b_n)=(T_b,I_b,F_b).$

Given that $T_{a_i}\le T_{b_i},$ we can obtain

$${(1-T_{a_{i_j}}^{r_j})}^{w_{i_j}}\ge {(1-T_{a_{i_j}}^{r_j})}^{w_{i_j}}.$$

(20)

Therefore,

$$1-{(1-T_{a_{i_j}}^{r_j})}^{w_{i_j}}\le 1-{(1-T_{b_{i_j}}^{r_j})}^{w_{i_j}}.$$

(21)

Thus,

$$1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{a_{i_j}}^{r_j}\right)}^{w_{i_j}}\right)}\ge 1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{b_{i_j}}^{r_j}\right)}^{w_{i_j}}\right)}.$$

(22)

Thereafter,

$$1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{a_{i_j}}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\le 1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{b_{i_j}}^{r_j}\right)}^{w_{i_j}}\right)}\right)}.$$

(23)

Then,

$$\begin{array}{l}{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{a_{i_j}}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\\ \le {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{b_{i_j}}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}\end{array},$$

(24)

which means $T_a\le T_b$. Similarly, we can obtain $I_a\ge I_{b}and{F}_a\ge F_b$.

If $T_a<T_{b}and{I}_a\ge I_{b}and{F}_a\ge F_b$, then

${\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)<{\mathrm{DGSVNNWBM}}_w^R(b_1,b_2,\cdots ,b_n)$;

If $T_a=T_{b}and{I}_a>I_{b}and{F}_a>F_b$, then

${\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)<{\mathrm{DGSVNNWBM}}_w^R(b_1,b_2,\cdots ,b_n)$;

If $T_a=T_{b}and{I}_a=I_{b}and{F}_a=F_b$, then

${\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)={\mathrm{DGSVNNWBM}}_w^R(b_1,b_2,\cdots ,b_n)$.

Therefore, the proof of property 1 is completed. ☐

Property 2. (Boundedness).

Let $a_i=(T_{a_i},I_{a_i},F_{a_i})(i=1,2,\dots ,n)$ be a set of SVNNS. If $a^{+}=({\max }_i(T_i),{\min }_i(I_i),{\min }_i(F_i))$ and $a^{-}=({\min }_i(T_i),{\max }_i(I_i),{\max }_i(F_i))$, then

$$\begin{array}{l}{\mathrm{DGSVNNWBM}}_w^R(a_1^{-},a_2^{-},\cdots ,a_n^{-})\\ \le {\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\cdots ,a_n)\\ \le {\mathrm{DGSVNNWBM}}_w^R(a_1^{+},a_2^{+},\cdots ,a_n^{+})\end{array}.$$

(25)

Proof. 

From Theorem 1, we can obtain

$$\begin{array}{l}{\mathrm{DGSVNNWBM}}_w^R(a^{-},a^{-},\dots ,a^{-})\\ =\left(\begin{array}{l}{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-\min T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-\min I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-\min F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}.\end{array}\right)\end{array}$$

(26)

$$\begin{array}{l}{\mathrm{DGSVNNWBM}}_w^R(a,a,\dots ,a)\\ =\left(\begin{array}{l}{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}.\end{array}\right)\end{array}$$

(27)

$$\begin{array}{l}{\mathrm{DGSVNNWBM}}_w^R(a^{+},a^{+},\dots ,a^{+})\\ =\left(\begin{array}{l}{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-\max T_{i_j}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-\max I_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}},\\ 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n=1}^n\left(1-{\displaystyle \prod _{j=1}^n\left(1-{\left(1-{\left(1-\max F_{i_j}\right)}^{r_j}\right)}^{w_{i_j}}\right)}\right)}\right)}^{1/{\displaystyle {\sum }_{i=1}^n{r}_j}}.\end{array}\right)\end{array}$$

(28)

From Property 1, we can obtain

$$\begin{array}{l}{\mathrm{DGSVNNWBM}}_w^R(a^{-},a^{-},\dots ,a^{-})\\ \le {\mathrm{DGSVNNWBM}}_w^R(a_1,a_2,\dots ,a_n)\\ \le {\mathrm{DGSVNNWBM}}_w^R(a^{+},a^{+},\dots ,a^{+}).\end{array}$$

(29)

Evidently, the DGSVNNWBM operator lacks the property of idempotency.

Furthermore, we extend DGWBGM to SVNNS and propose the dual generalized SVNN weighted GBM (DGSVNNWGBM) operator. ☐

Definition 7.

Let $a_i=(T_i,I_i,F_i)(i=1,2,\dots ,n)$ be a set of SVNNs with their weight vector being $w_i={(w_1,w_2,\dots ,w_n)}^T$, thereby satisfying $w_i\in \left[0,1\right]$ and ${\displaystyle {\sum }_{i=1}^n{w}_i}=1.$ If

$${\mathrm{DGSVNNWGBM}}_w^R(a_1,a_2,\cdots a_n)=\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}\left(\underset{i_1,i_2,\dots ,i_n=1}{\overset{n}{{\displaystyle \otimes }}}{\left(\underset{j=1}{\overset{n}{{\displaystyle \oplus }}}\left(r_j{a}_{i_j}\right)\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}\right),$$

(30)

where $R={(r_1,r_2,\dots ,r_n)}^T$ is the parameter vector with $r_i\ge 0(i=1,2,\dots ,n)$. Then, ${\mathrm{DGSVNNWGBM}}_w^R$ is called DGSVNNWGBM.

We can derive Theorem 2.

Theorem 2.

Let $a_i=(T_i,I_i,F_i)(i=1,2,\dots ,n)$ be a set of SVNNs. The aggregated value by DGSVNNWGBM is also a SVNN and

$$\begin{array}{l}{\mathrm{DGSVNNWGBM}}_w^R(a_1,a_2,\cdots a_n)\\ =\left(\begin{array}{l}1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n{\left(1-{\displaystyle \prod _{j=1}^n{\left(1-T_{i_j}\right)}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}},\\ {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n{\left(1-{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}},\\ {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n{\left(1-{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}.\end{array}\right)\end{array}$$

(31)

Proof. 

$$r_j{a}_{i_j}=\left(1-{\left(1-T_{i_j}\right)}^{r_j},I_{i_j}^{r_j},F_{i_j}^{r_j}\right),$$

(32)

$$\underset{j=1}{\overset{n}{{\displaystyle \oplus }}}(r_j{a}_{i_j})=\left(1-{\displaystyle \prod _{j=1}^n{\left(1-T_{i_j}\right)}^{r_j},}{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j},}{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right).$$

(33)

Thereafter,

$${\left(\underset{j=1}{\overset{n}{{\displaystyle \oplus }}}\left(r_j{a}_{i_j}\right)\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}=\left(\begin{array}{l}{\left(1-{\displaystyle \prod _{j=1}^n{(1-T_{i_j})}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}},\\ 1-{\left(1-{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}},\\ 1-{\left(1-{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}.\end{array}\right)$$

(34)

Therefore,

$$\underset{i_1,i_2,\dots ,i_n=1}{\overset{n}{{\displaystyle \otimes }}}{\left(\underset{j=1}{\overset{n}{{\displaystyle \oplus }}}\left(r_j{a}_{i_j}\right)\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}=\left(\begin{array}{l}{\displaystyle \prod _{i_1,i_2,\dots ,i_n}^n{\left(1-{\displaystyle \prod _{j=1}^n{\left(1-T_{i_j}\right)}^{r_j}}\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}},\\ 1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j}}\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}\right)},\\ 1-{\displaystyle \prod _{i_1,i_2,\dots ,i_n}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}\right)}.\end{array}\right)$$

(35)

Thus,

$$\begin{array}{l}\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}\left(\underset{i_1,i_2,\dots ,i_n=1}{\overset{n}{{\displaystyle \otimes }}}{\left(\underset{j=1}{\overset{n}{{\displaystyle \oplus }}}\left(r_j{a}_{i_j}\right)\right)}^{{\displaystyle \prod {}_{j=1}^n{w}_{i_j}}}\right)\\ =\left(\begin{array}{l}1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n{\left(1-{\displaystyle \prod _{j=1}^n{\left(1-T_{i_j}\right)}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}},\\ {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}\right)}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}},\\ {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}\right)}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}.\end{array}\right)\end{array}$$

(36)

Hence, Label (31) is maintained.

Thereafter,

$$\begin{array}{l}0\le 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n{\left(1-{\displaystyle \prod _{j=1}^n{\left(1-T_{i_j}\right)}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}\le 1,\\ 0\le {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}\right)}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}\le 1,\\ 0\le {\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}\right)}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}\le 1.\end{array}$$

(37)

Therefore,

$$\begin{array}{l}0\le 1-{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n{\left(1-{\displaystyle \prod _{j=1}^n{\left(1-T_{i_j}\right)}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}\\ +{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{I}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}\right)}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}\\ +{\left(1-{\displaystyle \prod _{i_1,i_2,\dots i_n=1}^n\left({\left(1-{\displaystyle \prod _{j=1}^n{F}_{i_j}^{r_j}}\right)}^{{\displaystyle {\prod }_{j=1}^n{w}_{i_j}}}\right)}\right)}^{\frac{1}{{\displaystyle {\sum }_{j=1}^n{r}_j}}}\le 3,\end{array}$$

(38)

thereby completing the proof. ☐

Similar to DGSVNNWBM, DGSVNNWGBM has the same properties. The proofs are omitted to save space.

Property 3.

Let $a_i=(T_i,I_i,F_i)(i=1,2,\dots ,n)$ be a set of SVNNs.

(1) 

(Monotonicity). Let $a_i=(T_{a_i},I_{a_i},F_{a_i})(i=1,2,\dots ,n)$ and $b_i=(T_{b_i},I_{b_i},F_{b_i})$ $(i=1,2,\dots ,n)$ be two sets of SVNNs. If $T_{a_i}\le T_{b_i}and{I}_{a_i}\ge I_{b_i}and{F}_{a_i}\ge F_{b_i}$ holds for all $i$, then

$${\mathrm{DGSVNNWGBM}}_w^R(a_1,a_2,\cdots ,a_n)\le {\mathrm{DGSVNNWGBM}}_w^R(b_1,b_2,\cdots ,b_n).$$

(39)

(2) 

(Boundedness). Let $a_i=(T_i,I_i,F_i)(i=1,2,\dots ,n)$ be a set of SVNNS. If

$$a^{+}=({\max }_i(T_i),{\min }_i(I_i),{\min }_i(F_i)),$$

$$a^{-}=({\min }_i(T_i),{\max }_i(I_i),{\max }_i(F_i)).$$

Then,

$$a^{-}\le {\mathrm{DGSVNNWGBM}}_w^R(a_1,a_2,\cdots ,a_n)\le a^{+}.$$

(40)

4. Numerical Example and Comparative Analysis

4.1. Applicable Example

In this section, we shall present a numerical example to select strategic suppliers under supply chain risk with SVNNs in order to illustrate the method proposed in this paper. There is a panel with five possible strategic suppliers $O_i\left(i=1,2,3,4,5\right)$ to select. The experts select four attributes to evaluate the five possible strategic suppliers: ① C₁ is the technology level; ② C₂ is the service level; ③ C₃ is the risk managing ability; and ④ C₄ is the enterprise environment risk. The five possible strategic suppliers $O_i\left(i=1,2,3,4,5\right)$ are to be evaluated using the SVNNs by the decision-maker under the four above attributes (whose weighting vector $\omega ={\left(0.10,0.40,0.35,0.15\right)}^T$), as listed in the following matrix:

$$\tilde{R}=\left[\begin{array}{cccc}\left(0.6,0.9,0.2\right)& \left(0.7,0.4,0.4\right)& \left(0.4,0.7,0.2\right)& \left(0.6,0.8,0.3\right)\\ \left(0.8,0.5,0.2\right)& \left(0.8,0.6,0.3\right)& (0.8,0.5,0.5)& \left(0.9,0.6,0.2\right)\\ \left(0.7,0.8,0.3\right)& \left(0.6,0.8,0.4\right)& \left(0.6,0.4,0.2\right)& \left(0.7,0.4,0.3\right)\\ \left(0.9,0.2,0.4\right)& \left(0.7,0.4,0.5\right)& \left(0.5,0.5,0.3\right)& \left(0.6,0.7,0.3\right)\\ \left(0.7,0.6,0.5\right)& \left(0.5,0.9,0.2\right)& \left(0.8,0.7,0.3\right)& \left(0.6,0.9,0.4\right)\end{array}\right].$$

Then, we utilize the proposed operators to select the best strategic suppliers under supply chain risk.

Step 1. According to $w$ and SVNNs $O_{ij}\left(i=1,2,3,4,5,j=1,2,3,4\right)$, we can aggregate all SVNNs $O_{ij}$ by using the DGSVNNWBM (DGSVNNWGBM) operator to derive the SVNNs $O_i\left(i=1,2,3,4,5\right)$ of the alternative $O_i$. The aggregating results are in

Table 1. The aggregating results of strategic suppliers by the DGSVNNWBM and DGSVNNWGBM ($R=(1,1,1,1).$).

	DGSVNNWBM	DGSVNNWGBM
O1	(0.5720, 0.6135, 0.2929)	(0.5692, 0.6209, 0.2951)
O2	(0.8157, 0.5549, 0.3423)	(0.8150, 0.5552, 0.3454)
O3	(0.6253, 0.5980, 0.3033)	(0.6249, 0.6066, 0.3051)
O4	(0.6377, 0.4583, 0.3888)	(0.6345, 0.4610, 0.3903)
O5	(0.6431, 0.7999, 0.2927)	(0.6395, 0.8064, 0.2951)

.

Step 2. According to Table 1, the scores of the strategic suppliers are shown in

Table 2. The scores of the strategic suppliers.

	DGSVNNWBM	DGSVNNWGBM
O1	0.5552	0.5511
O2	0.6395	0.6381
O3	0.5747	0.5711
O4	0.5969	0.5944
O5	0.5168	0.5127

.

Step 3. According to the Table 2 and the scores, the order of the strategic suppliers is listed in

Table 3. Order of the strategic suppliers.

	Order
DGSVNNWBM	O2 > O4 > O3 > O1 > O5
DGSVNNWGBM	O2 > O4 > O1 > O3 > O5

, and the best strategic suppliers is O₂.

4.2. Influence Analysis

To show the effects on the ranking results by altering the parameters of DGSVNNWBM (DGSVNNWGBM) operators, the corresponding results are shown in

Table 4. Order for different parameters of DGSVNNWBM.

$\mathit{R}$	$\mathit{S}\left({\mathit{O}}_1\right)$	$\mathit{S}\left({\mathit{O}}_2\right)$	$\mathit{S}\left({\mathit{O}}_3\right)$	$\mathit{S}\left({\mathit{O}}_4\right)$	$\mathit{S}\left({\mathit{O}}_5\right)$	Order
(1,1,1,1)	0.5552	0.6395	0.5747	0.5969	0.5168	O2 > O4 > O3 > O1 > O5
(2,2,2,2)	0.7701	0.8604	0.7861	0.8158	0.7326	O2 > O4 > O3 > O1 > O5
(3,3,3,3)	0.8281	0.9127	0.8395	0.8660	0.8096	A2 > A4 > A3 > A1 > A5
(4,4,4,4)	0.8508	0.9290	0.8583	0.8831	0.8455	O2 > O4 > O3 > O1 > O5
(5,5,5,5)	0.8621	0.9351	0.8669	0.8915	0.8656	O2 > O4 > O3 > O5 > O1
(6,6,6,6)	0.8689	0.9378	0.8715	0.8971	0.8785	O2 > O4 > O5 > O3 > O1
(7,7,7,7)	0.8734	0.9392	0.8743	0.9015	0.8873	O2 > O4 > O5 > O3 > O1
(8,8,8,8,)	0.8767	0.9400	0.8763	0.9055	0.8938	O2 > O4 > O5 > O1 > O3
(9,9,9,9)	0.8792	0.9406	0.8778	0.9091	0.8987	O2 > O4 > O5 > O1 > O3
(10,10,10,10)	0.8811	0.9411	0.8789	0.9124	0.9026	O2 > O4 > O5 > O1 > O3

and

Table 5. Order for different parameters of DGSVNNWGBM.

$\mathit{R}$	$\mathit{S}\left({\mathit{O}}_1\right)$	$\mathit{S}\left({\mathit{O}}_2\right)$	$\mathit{S}\left({\mathit{O}}_3\right)$	$\mathit{S}\left({\mathit{O}}_4\right)$	$\mathit{S}\left({\mathit{O}}_5\right)$	Order
(1,1,1,1)	0.5511	0.6381	0.5711	0.5944	0.5127	O2 > O4 > O3 > O1 > O5
(2,2,2,2)	0.4108	0.4996	0.4227	0.4517	0.3726	O2 > O4 > O3 > O1 > O5
(3,3,3,3)	0.3619	0.4291	0.3670	0.3985	0.3208	O2 > O4 > O3 > O1 > O5
(4,4,4,4)	0.3385	0.3920	0.3405	0.3728	0.2962	O2 > O4 > O3 > O1 > O5
(5,5,5,5)	0.3245	0.3702	0.3252	0.3572	0.2817	O2 > O4 > O3 > O1 > O5
(6,6,6,6)	0.3149	0.3562	0.3153	0.3462	0.2716	O2 > O4 > O3 > O1 > O5
(7,7,7,7)	0.3076	0.3467	0.3084	0.3377	0.2641	O2 > O4 > O3 > O1 > O5
(8,8,8,8,)	0.3018	0.3398	0.3032	0.3308	0.2582	O2 > O4 > O3 > O1 > O5
(9,9,9,9)	0.2978	0.3347	0.3002	0.3251	0.2531	O2 > O4 > O3 > O1 > O5
(10,10,10,10)	0.4150	0.3307	0.4182	0.3203	0.2505	O3 > O1 > O2 > O4 > O5

.

4.3. Comparative Analysis

Then, we compare our proposed operators with single valued neutrosophic weighted averaging (SVNWA) operator and single valued neutrosophic weighted geometric (SVNWG) operator [35]. The comparative results are depicted in

Table 6. Order of the strategic suppliers.

	Order
SVNWA	O2 > O4 > O3 > O1 > O5
SVNWG	O2 > O4 > O3 > O1 > O5

.

From above, we can we get the same results to show the effectiveness and practicality of the proposed operators. However, the existing aggregation operators, such as SVNWA operator and SVNWG operators, don’t take into account the relationship between aggregated arguments, and thus cannot eliminate the influence of unfair arguments on decision results. Our proposed DGSVNNWBM and DGSVNNWGBM operators consider the information about the relationship among multiple arguments being aggregated.

5. Conclusions

In this paper, we focused on SVNN information aggregation operators, as well as their application in MADM. To aggregate the SVNNs, the DGSVNNWBM and DGSVNNWGBM operators have been developed. We have conducted further research into these two operator’s several desirable properties. In addition, we demonstrated the effectiveness of the DGSVNNWBM and DGSVNNWGBM operators in practical MADM problems. At the end of this study, we use an applicable example for supplier selection in the supply chain management process to show applicability of these two operators; meanwhile, the analysis of the comparison as the parameters take different values have also been studied. In our future studies, we shall expand the proposed models to other uncertain environments [36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57] and fuzzy MADM problems [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80].