Shadowed Sets-Based Linguistic Term Modeling and Its Application in Multi-Attribute Decision-Making

Abstract

For many multi-attribute decision-making (MADM) problems, linguistic variables are more convenient for people to express the attribute values. In this paper, a novel shadowed set-based method is proposed to deal with linguistic terms, where the linguistic term sets are symmetrical both in meaning and form. Firstly, to effectively express the linguistic variables, we develop a data-driven method to construct the shadowed set model for the linguistic terms. Secondly, the Pythagorean shadowed set is defined, and some theorems are subsequently explored. Thirdly, we propose the score function of the Pythagorean shadowed number and develop a new MADM method on the basis of the Pythagorean shadowed set. Finally, a case study of the supplier selection problem is provided to illustrate the effectiveness of the proposed method, and the superiority of our method is demonstrated by comparison analysis.

1. Introduction

Multi-attribute decision-making (MADM) aims to select the best alternative solution(s) from multiple alternatives and has been widely used in various fields [1,2,3]. In MADM problems, linguistic terms are a convenient and natural way to describe evaluation information. For example, the decision-makers (DMs) can use linguistic terms such as ‘Extremely low’, ‘Very low’, ‘Low’, ‘Fair’, ‘High’, ‘Very high’, and ‘Extremely high’ to estimate service quality, product performance, and so forth. Therefore, MADM problems based on linguistic terms have received increasing attention. In [4], Aggarwal proposed a new aggregation operator for linguistic terms, and the effectiveness of the operator was illustrated by a case study on the supplier selection problem. Jin [5] developed two group decision-making methods to handle MADM problems under linguistic set environment, and comparative analysis with other methods was performed to demonstrate the validity and merits of the two methods. Yu [6] proposed an extended TODIM method with unbalanced hesitant fuzzy linguistic term sets for MADM problems. For linguistic decision-making problems, Pei [7] developed a new decision-making method by integrating the fuzzy linguistic multiset and TOPSIS methods, and two practical examples were utilized to verify the feasibility of the proposed approach. For the venture capital problem under a linguistic environment, Cheng [8] proposed an interaction approach. However, the methods mentioned above directly replace the linguistic variables with linguistic subscript in the decision-making process, which may cause distortion of information. To better express linguistic variables, the linguistic 2-tuple [9,10] and linguistic scale function [11,12] were introduced to deal with linguistic sets. Nevertheless, the linguistic 2-tuple and linguistic scale function methods still use linguistic subscript to express language variables in nature. Besides, it is difficult to explain the rationality in theory by simply replacing linguistic word with its linguistic subscript. Furthermore, people may have diverse opinions on identical words, but linguistic subscript can only depict a single meaning for one person, which may lead to information distortion.

As distinct from the linguistic 2-tuple and scale function, shadowed sets [13,14] can effectively construct linguistic terms using a data-driven method, and have recently been attracting more and more attention [15,16]. The membership value of the shadowed set is not a precise number, and its distribution is composed of three different zones: the core zone, shadowed zone, and exclusion zone. The core zone and the exclusion zone take the values of 1 and 0, which means all the elements of both zones are fully compatible with or completely excluded from the linguistic word described by a shadowed set. The shadowed zone is an entire unit interval perceived as a zone of uncertainty, which means we are not sure whether the shadowed zone elements represent the linguistic word described by a shadowed set.

In addition, in many situations, experts may hesitate as to what attribute values should be given by them, due to the increasing complexity. Consequently, Atanassov [17] proposed the intuitionistic fuzzy set (IFS) to express uncertainty, which involves not only membership degree but also non-membership degree. However, the limitation of IFS is that the sum of membership degree and non-membership degree must be no more than 1, which makes it difficult to sufficiently express the ideas of the DMs. Therefore, Yager [18] defined the Pythagorean fuzzy set (PFS), which can effectively express the certainty and uncertainty of experts. Recently, PFS has been introduced to deal with MADM problems [19,20,21,22]. Zhang and Xu [19] proposed the operation rules of PFS, and extended the TOPSIS method to PFS. By combining PFS with the hesitant fuzzy set (HFS), a new fuzzy set was defined by Liang and Xu [20], named the hesitant Pythagorean fuzzy set (HPFS), an extended TOPSIS method with HPFS was subsequently proposed. Zhang [21] extended PFS to the interval-valued case, and explored the basic operation rules of the Pythagorean fuzzy set (IVPFS). In addition, a Pythagorean fuzzy QUALIFLEX method was developed by integrating closeness index, and its effectiveness was demonstrated through a hierarchical MADM problem. Combining PFSs with linguistic variables, the definition of Pythagorean fuzzy linguistic set (PFLS) was proposed by Peng and Yang [22] and the operation rules of PFLS was defined, subsequently.

Inspired by the idea of the shadowed set and PFS, we propose a new approach to solve MADM problems under linguistic set environment. Firstly, we define Pythagorean shadowed set and explore some theorems of the shadowed set. Secondly, a score function of the Pythagorean shadowed number is defined and the detailed decision-making procedures-based upon the score function is proposed. Finally, a case study of supplier selection is adopted to verify the feasibility of the proposed approach.

The organization of this paper is as follows. Section 2 presents the preliminaries of the Pythagorean fuzzy set and shadowed set. In Section 3, the shadowed set model of seven-level language term is obtained by a data-driven method. A new score function of Pythagorean shadowed number is introduced in Section 4. Section 5 mainly addresses a new MADM method based on Pythagorean shadowed set. The effectiveness of the proposed approach is demonstrated through a supplier selection problem in Section 6, and comparative analysis is made with the other existing methods. Finally, some conclusions are drawn in Section 7.

2. Preliminaries

2.1. Pythagorean Fuzzy Set (PFS)

Definition 1

([18,23]). Suppose X is a fixed set. A PFS takes the form of:

$$P=\left\{\langle x,P\left(u_P\left(x\right),v_P\left(x\right)\right)\rangle |x\in X\right\}$$

where $v_p\left(x\right)$: $X\to \left[0,1\right]$ and $u_p\left(x\right)$: $X\to \left[0,1\right]$ represent the non-membership function and membership function of $x\in X$, respectively, $u_p^2\left(x\right)+v_p^2\left(x\right)\le 1$. In addition, ${\pi }_{p\left(x\right)}=\sqrt{1-u_p^2\left(x\right)-{\nu }_p^2\left(x\right)}$ denotes the hesitation degree of $x\in X$.

For the sake of simplicity, Zhang and Xu [19] named $P\left(u_P\left(x\right),v_P\left(x\right)\right)$ the Pythagorean fuzzy number (PFN), expressed by $\beta =P\left(u_{\beta },v_{\beta }\right)$, where $u_p\left(x\right),v_p\left(x\right)\in \left[0,1\right]$, ${\pi }_{p\left(x\right)}=\sqrt{1-u_p^2\left(x\right)-{\nu }_p^2\left(x\right)}$ and $u_p^2\left(x\right)+v_p^2\left(x\right)\le 1$.

Definition 2

([9]). Assume $S=\left\{s_i|i=0,\cdots ,t,t\in R\right\}$ is a linguistic term set, $s_i$ is the linguistic evaluation value, $t$ is the granularity of $S$. Take the seven-level linguistic term as an example: S = {s₀ = Extremely low, s₁ = Very low, s₂ = Low, s₃ = Fair, s₄ = High, s₅ = Very high, s₆ = Extremely high}.

$S$ must satisfy the following two properties:

(1)

There is a negation operator: $neg\left(s_i\right)=s_{t-i}$;

(2)

If $i<j$ then $S_i<S_j$;

Definition 3

([22]). Based on the definition of linguistic term set and PFS, the Pythagorean fuzzy linguistic set (PFLS) takes the form of $D=\left\{\langle s_{\tau \left(x\right)},u_p\left(x\right),v_p\left(x\right)\rangle |x\in X\right\}$, and the Pythagorean fuzzy linguistic number (PFLN) is denoted as $\langle s_{\tau \left(x\right)},u_p\left(x\right),v_p\left(x\right)\rangle$, where $s_{\tau \left(x\right)}$ is the linguistic evaluation value.

When the attribute values are represented in the form of linguistic terms in MADM problems, the linguistic variable cannot be directly calculated. Therefore, Xu used the subscript of the linguistic term [24] for computation, Wang put forward a linguistic scale function [11] to convert linguistic terms into crisp numbers, and Herrera converted linguistic terms into fuzzy numbers [25]. However, all those methods still use linguistic subscript to express language variables in nature. To express the fuzziness and uncertainty of linguistic terms, we introduce shadowed set method to cope with linguistic term, and further put forward a new Pythagorean shadowed set.

2.2. Shadowed Set

Definition 4

([13,14]). A shadowed set $S$ is a set-valued mapping as follows:

$$S:U\to \left\{0,\left[0,1\right],1\right\}$$

where $U$ is a given universe of discourse.

The core of the shadowed set $S$ is the area where the mapping values of the elements are equal to 1.

$$core\left(S\right)=\left\{x\in U|S\left(x\right)=1\right\}$$

The elements of $U$ whose mapping values are unit intervals in $S$ compose the shadowed zone of the shadowed set and are expressed as follows,

$$CU\left(S\right)=\left\{x\in U|S\left(x\right)=\left[0,1\right]\right\}$$

The elements of $U$ whose mapping values are equal to 0 will be excluded from the shadowed set $S$.

Definition 5.

$A=\left[a,b,c,d\right]$is called a shadowed number (SN), where $a,b$ are the lower and upper bound of the left-shoulder shadowed part, and $c,d$ are the lower and upper bound of the right-shoulder shadowed part. Figure 1 shows an illustration of shadowed number.

2.3. Pythagorean Shadowed Set (PSS)

In this section, we will define the Pythagorean shadowed set and give some properties for it.

Definition 6.

Suppose$X$is a fixed set, a Pythagorean shadowed set$T$over$X$takes the form of

$$T=\left\{\langle A,P\left(u_P\left(x\right),v_P\left(x\right)\right)\rangle |x\in X\right\}$$

where$A=\left[a,b,c,d\right]$,$a,b$are the lower and upper bound of the left-shoulder shadowed part, respectively, and$c,d$are the lower and upper bound of the right-shoulder shadowed part, respectively. Function$u_p\left(x\right)$:$X\to \left[0,1\right]$and$v_p\left(x\right)$:$X\to \left[0,1\right]$denote the membership function and non-membership function, respectively. $u^2{}_p\left(x\right)+v^2{}_p\left(x\right)\le 1$, and${\pi }_{p\left(x\right)}=\sqrt{1-u_p^2\left(x\right)-{\nu }_p^2\left(x\right)}$denotes the hesitate degree of$x\in X$.

Definition 7.

A Pythagorean shadowed number (PSN) takes the form of:

$$V=\langle A,P\left(u_P\left(x\right),v_P\left(x\right)\right)\rangle$$

where $a,b$ are the lower and upper bound of the left-shoulder shadowed part, $c,d$ are the lower and upper bound of the right-shoulder shadowed part, and $u_p\left(x\right)$: $X\to \left[0,1\right]$ and $v_p\left(x\right)$: $X\to \left[0,1\right]$ represent membership function and non-membership function, respectively.

Let $V_1=\langle A_1,P\left(u_P\left(x_1\right),v_P\left(x_1\right)\right)\rangle$ and $V_2=\langle A_2,P\left(u_P\left(x_2\right),v_P\left(x_2\right)\right)\rangle$ be two PSNs, where $A_1=\left[a_1,b_1,c_1,d_1\right]$ and $A_2=\left[a_2,b_2,c_2,d_2\right]$, then the operation rules are as follows:

(1)

$V_1+V_2=\langle \left[a_1+a_2,b_1+b_2,c_1+c_2,d_1+d_2\right],P\left(\sqrt{{\left(u_p\left(x_1\right)\right)}^2+{\left(u_p\left(x_2\right)\right)}^2-{\left(u_p\left(x_1\right)\right)}^2{\left(u_p\left(x_2\right)\right)}^2},v_p\left(x_1\right)v_p\left(x_2\right)\right)\rangle$

(2)

$V_1\times V_2=\langle \left[a_1\times a_2,b_1\times b_2,c_1\times c_2,d_1\times d_2\right],P\left(u_p\left(x_1\right)u_p\left(x_2\right),\sqrt{{\left({\nu }_p\left(x_1\right)\right)}^2+{\left({\nu }_p\left(x_2\right)\right)}^2-{\left({\nu }_p\left(x_1\right)\right)}^2{\left({\nu }_p\left(x_2\right)\right)}^2}\right)\rangle$

(3)

$\lambda V_1=\langle \left[\lambda a_1,\lambda b_1,\lambda c_1,\lambda d_1\right],P\left(\sqrt{1-{\left(1-{\left(u_p\left(x_1\right)\right)}^2\right)}^{\lambda }},{\left({\nu }_p\left(x_1\right)\right)}^{\lambda }\right)\rangle ,\lambda \ge 0$

(4)

$V_1{}^{\lambda }=\langle \left[a_1^{\lambda },b_1^{\lambda },c_1^{\lambda },d_1^{\lambda }\right],P\left({\left(u_p\left(x_1\right)\right)}^{\lambda },\sqrt{1-{\left(1-{\left({\nu }_p^{}\left(x_1\right)\right)}^2\right)}^{\lambda }}\right)\rangle ,\lambda \ge 0$

Theorem 1.

For any two PSNs$V_1=\langle A_1,P\left(u_P\left(x_1\right),v_P\left(x_1\right)\right)\rangle$and$V_2=\langle A_2,P\left(u_P\left(x_2\right),v_P\left(x_2\right)\right)\rangle$,where$A_1=\left[a_1,b_1,c_1,d_1\right]$and$A_2=\left[a_2,b_2,c_2,d_2\right]$, the calculation rules satisfy the following properties:

(1) 

$V_1+V_2=V_2+V_1$

(2) 

$V_1\times V_2=V_2\times V_1$

(3) 

$\lambda \left(V_1+V_2\right)=\lambda V_1+\lambda V_2,\lambda \ge 0$

(4) 

$V_1^{{\lambda }_1+{\lambda }_2}=V_1^{{\lambda }_1}+V_2^{{\lambda }_2},{\lambda }_1,{\lambda }_2\ge 0$

(5) 

${\lambda }_1{V}_1+{\lambda }_2{V}_1=\left({\lambda }_1+{\lambda }_2\right)V_1,{\lambda }_1,{\lambda }_2\ge 0$

(6) 

$V_1^{\lambda }\times V_2^{\lambda }={\left(V_1\times V_2\right)}^{\lambda },\lambda \ge 0$

3. Shadowed Set Model of Linguistic Terms

We collect the interval data for each language word in the form of the seven-level linguistic term listed in Definition 2 and use the collected interval data to construct the shadowed set models for the seven-level linguistic term. The interval data are obtained by means of questionnaire survey. The main framework of our questionnaire is designed to get a proper interval value for each word of the seven-level linguistic term from those respondents according to their experience, habits and common sense. It is necessary for the filled numbers to be accurate to the first decimal place.

We handed out our questionnaires via leaflets, emails and online survey websites to people in different fields, especially to those with a bachelor degree or above. In the end, we got 1205 valid questionnaires, and the questionnaire data were processed by the following interval data preprocessing method to obtain the shadowed number of the seven-level linguistic term.

3.1. Interval Data Preprocessing

Wu and Liu [26,27] proposed an efficient method to preprocess interval data, and we preprocessed the $n$ interval endpoint data $\left[a_k,b_k\right]\left(k=1,2,\dots ,n\right)$ based on this method, as follows:

Step 1: Bad data processing. This aims to remove unreasonable results from the surveyed people, whose answers were beyond the range of the universe of discourse $U$. If the interval endpoints satisfy the following conditions, the interval data are acceptable. Otherwise, they will be rejected.

$$\{\begin{array}{l}0\le a_k\le 10\\ 0\le b_k\le 10\\ b_k\ge a_k\end{array},k=1,2,\dots ,n$$

By this step, some data will be abandoned, and $n^{*}<n$ interval data will be preserved.

Step 2: Outlier Processing. By using the Box and Whisker test [28], the data that are extremely large or small, i.e., outliers, can be eliminated. Outlier tests can be applied to process the endpoints of interval data and the lengths of interval data $L_k=b_k-a_k$, respectively. Consequently, only the interval endpoints and lengths satisfying the following conditions are kept:

$$\{\begin{array}{l}{a}_k\in \left[Q_a\left(0.25\right)-1.5IQ{R}_a,Q_a\left(0.75\right)+1.5IQ{R}_a\right]\\ b_k\in \left[Q_b\left(0.25\right)-1.5IQ{R}_b,Q_b\left(0.75\right)+1.5IQ{R}_b\right]\\ L_k\in \left[Q_L\left(0.25\right)-1.5IQ{R}_L,Q_L\left(0.75\right)+1.5IQ{R}_L\right]\end{array},k=1,2,\dots ,n^{*}$$

where $Q_a$ and $IQ{R}_a$ are respectively the quartile and interquartile ranges of the left endpoints, $Q_b$ and $IQ{R}_b$ are respectively the quartile and interquartile ranges of the right endpoints, $Q_L$ and $IQ{R}_L$ are respectively the quartile and interquartile ranges of the interval data’s length. $Q\left(0.25\right)$ and $Q\left(0.75\right)$ are the first and third quartiles, which include 25% and 75% of the data, respectively. In addition, the interquartile range $IQR$ is the difference between $Q\left(0.25\right)$ and $Q\left(0.75\right)$; that is to say, $IQR$ contains 50% of the data between $Q\left(0.25\right)$ and $Q\left(0.75\right)$. The points that are more than $1.5IQR$ below the first quartile or more than $1.5IQR$ above the third quartile are regarded as outliers.

After this step, $m^{*}<n^{*}$ interval data will remain.

Then, the following statistics of the $m^{*}$ interval data are calculated: $m_l$ and ${\sigma }_l$ are mean values and standard deviations of the $m^{*}$ left endpoints, respectively. Similarly, $m_r$ and ${\sigma }_r$ represent the mean values and standard deviations of the $m^{*}$ right endpoints. $m_L$ and ${\sigma }_L$ denote the mean values and standard deviations of the lengths of the $m^{*}$ interval data.

Step 3: Tolerance limit processing. If the remaining intervals satisfy the following conditions, then they will be accepted; otherwise, they will be rejected.

$$\{\begin{array}{l}{a}_k\in \left[m_l-\eta {\sigma }_l,m_l+\eta {\sigma }_l\right]\\ b_k\in \left[m_r-\eta {\sigma }_r,m_r+\eta {\sigma }_r\right]\\ L_k\in \left[m_L-\eta {\sigma }_L,m_L+\eta {\sigma }_L\right]\end{array},k=1,2,\dots ,m^{*}$$

where $\eta$ is the tolerance factor, which represents that we can assure the given limits at least include the proportion $1-\alpha$ of the measurements with $100\cdot \left(1-\gamma \right)\%$ confidence level. The value of tolerance factor can be obtained from

Table 1. Tolerance factor $\eta$ for several collected data.

${\mathit{m}}^{*}$	$1-\mathit{\gamma }=0.95$		$1-\mathit{\gamma }=0.99$
	$1-\mathit{\alpha }$		$1-\mathit{\alpha }$
	0.90	0.95	0.90	0.95
10	2.839	3.379	3.582	4.265
15	2.480	2.954	2.945	3.507
20	2.310	2.752	2.659	3.168
30	2.140	2.549	2.358	2.841
50	1.996	2.379	2.162	2.576
100	1.874	2.233	1.977	2.355
1000	1.709	2.036	1.736	2.718
$\infty$	1.645	1.960	1.645	1.960

[29].

After the processing of Step 3, $m^{**}<m^{*}\left(1\le m^{**}\le n\right)$ interval data will be left, and the following statistical characteristics of the $m^{**}$ data will be computed: $m_l$, ${\sigma }_l$, $m_r$, ${\sigma }_r$, $m_L$ and ${\sigma }_L$ of the left (right) endpoints the $m^{**}$ interval data.

Step 4: Reasonable-interval processing. If the intervals satisfy the following conditions, they will be kept; otherwise, they will be rejected.

$$2m_l-{\varphi }^{*}\le a_k<{\varphi }^{*}<b_k\le 2m_r-{\varphi }^{*}$$

where

$${\varphi }^{*}=\frac{\left(m_r{\sigma }_l^2-m_l{\sigma }_r^2\right)\pm {\sigma }_l{\sigma }_r{\left[{\left(m_l-m_r\right)}^2+2\left({\sigma }_l^2-{\sigma }_r^2\right)\ln \left({\sigma }_l/{\sigma }_r\right)\right]}^{1/2}}{{\sigma }_l^2-{\sigma }_r^2}$$

After this step, there will be $m$ interval data.

In a word, there will be $m$ interval data after the four processing steps above, which is not greater than the $n$ interval data at the beginning, as shown in Figure 2.

3.2. Shadowed Set Model of Seven-Level Language Terms

After data preprocessing, the distribution of the remaining interval data is obtained as shown in Figure 3. The intervals of the left-end points and right-end points can reflect the linguistic word’s uncertainties from different surveyed persons. Therefore, it is necessary to determine the representative intervals for the left-end points and right-end points to express the uncertainties. As shown in Figure 3, the core area can be determined even if the surveyed people cannot give accurate representative intervals. As a result, the core of the shadowed set is the core area and the uncertain bound of the shadowed set is the representative intervals.

Next, we will estimate the representative intervals by the tolerance limit method via the following steps.

Step 1: Calculate the mean $m_l$ and standard deviation ${\sigma }_l$ of the remaining left-end points

$$m_l=\frac{{\displaystyle \sum _{k=1}^m\widehat{l_k}}}{m}$$

(1)

$${\sigma }_l=\sqrt{\frac{{\displaystyle \sum _{k=1}^m{\left(\widehat{l_k}-m_l\right)}^2}}{m}}$$

(2)

where $\widehat{l_k}$ denotes the left-end point of each remaining interval, $m$ is the number of remaining intervals.

Step 2: Determine the representative interval. Let $\left[L_l,L_r\right]$ and $\left[R_l,R_r\right]$ be the representative intervals of the left-end points and right-end points, respectively.

$$L_l=m_l-\eta \ast {\sigma }_l$$

(3)

$$L_r=m_l+\eta \ast {\sigma }_l$$

(4)

where $\eta$ is the tolerance factor in Table 1.

Then, the representative interval for the right-end points is calculated in the same way.

The parameters $\gamma$ and $\alpha$ are set to 0.05 and 0.1 in this paper, respectively, and we can obtain a tolerance factor $\eta$ of 1.709 from Table 1. Take the seven-level language terms as an example: based on the results above, the shadowed set models for seven-level language terms can be constructed as shown in Figure 4.

4. The Score Function of Pythagorean Shadowed Number

Based on the concepts of shadowed number and Pythagorean shadowed number in Section 2, we will further present the score functions of shadowed number and Pythagorean shadowed number, respectively. Numerical examples will also be given to illustrate the specific calculation process of the two score functions.

According to the central limit theorem, the attribute value $r_{ij}$ given by the decision-maker is stable and tends to be the most likely attribute value at a certain point, so it is believed that $r_{ij}$ obeys the normal distribution within the fuzzy interval. From the tolerance limit method in Section 3.2, we can obtain the distribution of attribute value in the shadowed set $S=\left\{A_i|U\right\}$, $A_i=\left[a_i,b_i,c_i,d_i\right]$, as shown in Figure 5.

Definition 8.

The score function of shadowed number$A$is defined as follows:

$$\mathrm{score}(A)=a+{\displaystyle {\int }_a^{b}f\left(x\right)}dx+c-b+{\displaystyle {\int }_c^{d}f\left(x\right)}dx+d$$

(5)

where$f\left(x\right)=\frac{1}{\sqrt{2\pi }\sigma }\cdot e^{-{\left(x-u\right)}^2/\left(2\cdot {\sigma }^2\right)}$.

According to the $3\sigma$ principle of normal distribution:

$$p\left(r\in \left[u-3\sigma ,u+3\sigma \right]\right)=0.9974,p\left(r\in \left[a,d\right]\right)=0.9974$$

Then $u=\frac{a+d}{2}$, $\sigma =\frac{d-a}{6}$.

Example 1.

The score function value of shadowed set$A_0$for ‘High’ in Figure 3 can be calculated as follows:

$$u=a+d=5.77+7.96=13.73,\sigma =\frac{d-a}{6}=\frac{7.96-5.77}{6}=0.37$$

$f\left(x\right)=1.08e^{-{\left(x-6.87\right)}^2/0.27}$

Then, we can gain the figure of shadowed number ‘High’ as shown in Figure 6.

$$\mathrm{score}(A_0)=5.77+{\displaystyle {\int }_{5.77}^{6.48}f\left(x\right)}dx+7.21-6.48+{\displaystyle {\int }_{7.21}^{7.96}f\left(x\right)}dx+7.96=17.9$$

In the same way, we can get the score function of shadowed sets for the other six language terms in Figure 3.

Definition 9.

The score function of a Pythagorean shadowed number$V$is denoted as:

$$\mathrm{score}(V)=\left(a+{\displaystyle {\int }_a^{b}f\left(x\right)}dx+c-b+{\displaystyle {\int }_c^{d}f\left(x\right)}dx+d\right)\cdot \left(u/v\right)$$

(6)

Example 2.

For a Pythagorean shadowed number$V_1=\left\{\left[5.77,6.48,7.21,7.96\right],P\left(0.7,0.4\right)\right\}$, the score function value is:

$$score\left(V_1\right)=\left(5.77+{\displaystyle {\int }_{5.77}^{6.48}f\left(x\right)dx+7.21-6.48+{\displaystyle {\int }_{7.21}^{7.96}f\left(x\right)dx}}+7.96\right)\cdot \left(0.7/0.4\right)=31.33$$

where$f\left(x\right)=1.08e^{-{\left(x-6.87\right)}^2/0.27}$.

5. MADM Method Based on the Pythagorean Shadowed Set

With the concept of PSS in mind, we can put forward a novel MADM approach under Pythagorean fuzzy linguistic term circumstances. The diagram of the proposed method is shown in Figure 7. Firstly, present a description of the MADM problem under the Pythagorean linguistic fuzzy circumstances. Secondly, transform the PFLS into PSS through a data-driven method. Thirdly, determine the ranking order of all alternatives so as to obtain the best choice(s) by means of the score function of PSNs and OWA operator. The whole decision-making process is carried out in the following steps.

Step 1: Standardized decision matrix. For PFLVs $P_{ij}=\langle s_{{\tau }_{ij}},P\left(u_p\left(x_{ij}\right),v_p\left(x_{ij}\right)\right)\rangle$

For beneficial attributes, $\overline{P_{ij}}=P_{ij}=\langle s_{{\tau }_{ij}},P\left(u_p\left(x_{ij}\right),v_p\left(x_{ij}\right)\right)\rangle$

For cost attributes, $\overline{P_{ij}}={\left(P_{ij}\right)}^{-1}=\langle s_{{\left({\tau }_{ij}\right)}^{-1}},P\left(v_p\left(x_{ij}\right),u_p\left(x_{ij}\right)\right)\rangle$ where ${\left({\tau }_{ij}\right)}^{-1}=l+1-{\tau }_{ij}$ and $l$ is the number of language term.

Step 2: Collect the data by questionnaire and get the shadowed set of language terms by processing the data. Transform Pythagorean fuzzy linguistic numbers into PSNs using Figure 4.

Step 3: Transform the PFSN decision matrix into score function matrix based on Equation (6).

Step 4: By OWA operator, the attribute values $r_{ij}$ of each alternative $a_i$ are aggregated to obtain the comprehensive attribute values $z_i$.

$$z_i=OW{A}_w\left(r_{i1},r_{i2},\dots ,r_{im}\right)={\displaystyle \sum _{j=1}^m{w}_i{r}_{ij}},i=1,2,\dots ,n$$

where $w=\left(w_1,w_2,\dots ,w_m\right)$ is the criterion weight vector, $n$ is the number of alternatives, $m$ is the number of attribute.

Step 5: Determine the order of all the alternatives in the light of the comprehensive attribute values $z_i$.

6. Numerical Study

The proposed algorithm will be demonstrated by solving the problem of how to select the most suitable supplier for a company under various evaluation factors. At the same time, comparisons with the linguistic term subscript method and the linguistic scale function method are performed to show the advantages of our approach.

6.1. Supplier Selection Problem

A car company needs to choose appropriate supplier of spare parts. A total of five alternative suppliers are denoted as $a_1$, $a_2$, $a_3$, $a_4$, $a_5$. After synthetical consideration, four main factors are taken into account: $c_1$ Supply capacity, $c_2$ Delivery timeliness, $c_3$ Service quality, $c_4$ Scientific research ability. The criterion weight vector is $w=\left(0.3,0.2,0.4,0.1\right)$. Language evaluation of the four attributes adopts the form of seven-level linguistic term, $S=\left\{s_0,s_1,s_2,s_3,s_4,s_5,s_6\right\}$ = {Extremely low, Very low, Low, Fair, High, Very high, and Extremely high}. The decision matrix given by experts is shown in

Table 2. Decision matrix.

Alternatives	Attributes
	${\mathit{c}}_1$	${\mathit{c}}_2$	${\mathit{c}}_3$	${\mathit{c}}_4$
$a_1$	$\langle s_4,P\left(0.7,0.4\right)\rangle$	$\langle s_5,P\left(0.5,0.6\right)\rangle$	$\langle s_2,P\left(0.7,0.3\right)\rangle$	$\langle s_3,P\left(0.8,0.4\right)\rangle$
$a_2$	$\langle s_5,P\left(0.6,0.4\right)\rangle$	$\langle s_3,P\left(0.7,0.4\right)\rangle$	$\langle s_3,P\left(0.6,0.4\right)\rangle$	$\langle s_4,P\left(0.7,0.5\right)\rangle$
$a_3$	$\langle s_6,P\left(0.6,0.5\right)\rangle$	$\langle s_3,P\left(0.8,0.3\right)\rangle$	$\langle s_5,P\left(0.6,0.5\right)\rangle$	$\langle s_2,P\left(0.6,0.4\right)\rangle$
$a_4$	$\langle s_3,P\left(0.7,0.3\right)\rangle$	$\langle s_4,P\left(0.6,0.5\right)\rangle$	$\langle s_3,P\left(0.7,0.4\right)\rangle$	$\langle s_6,P\left(0.7,0.6\right)\rangle$
$a_5$	$\langle s_4,P\left(0.7,0.4\right)\rangle$	$\langle s_5,P\left(0.6,0.5\right)\rangle$	$\langle s_4,P\left(0.7,0.4\right)\rangle$	$\langle s_3,P\left(0.8,0.4\right)\rangle$

:

Step 1:$c_1$, $c_2$, $c_3$, $c_4$ are beneficial attributes. Therefore, the standardized decision matrix is the same with Table 2.

Step 2: Transform PFLNs into Pythagorean shadowed numbers using Figure 4, and the result is shown in

Table 3. Decision matrix with PFSN.

Alternatives	Attributes
	${\mathit{c}}_1$	${\mathit{c}}_2$
$a_1$	$\langle \left[5.77,6.48,7.21,7.96\right],P\left(0.7,0.4\right)\rangle$	$\langle \left[7.51,7.61,8.60,8.97\right],P\left(0.5,0.6\right)\rangle$
$a_2$	$\langle \left[7.51,7.61,8.60,8.97\right],P\left(0.6,0.4\right)\rangle$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.7,0.4\right)\rangle$
$a_3$	$\langle \left[8.61,9.22,9.62,9.89\right],P\left(0.6,0.5\right)\rangle$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.8,0.3\right)\rangle$
$a_4$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.7,0.3\right)\rangle$	$\langle \left[5.77,6.48,7.21,7.96\right],P\left(0.6,0.5\right)\rangle$
$a_5$	$\langle \left[5.77,6.48,7.21,7.96\right],P\left(0.7,0.4\right)\rangle$	$\langle \left[7.51,7.61,8.60,8.97\right],P\left(0.6,0.5\right)\rangle$
Alternatives	Attributes
	${\mathit{c}}_{\mathbf{3}}$	${\mathit{c}}_{\mathbf{4}}$
$a_1$	$\langle \left[2.38,3.28,3.83,4.90\right],P\left(0.7,0.3\right)\rangle$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.8,0.4\right)\rangle$
$a_2$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.6,0.4\right)\rangle$	$\langle \left[5.77,6.48,7.21,7.96\right],P\left(0.7,0.5\right)\rangle$
$a_3$	$\langle \left[7.51,7.61,8.60,8.97\right],P\left(0.6,0.5\right)\rangle$	$\langle \left[2.38,3.28,3.83,4.90\right],P\left(0.6,0.4\right)\rangle$
$a_4$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.7,0.4\right)\rangle$	$\langle \left[8.61,9.22,9.62,9.89\right],P\left(0.7,0.6\right)\rangle$
$a_5$	$\langle \left[5.77,6.48,7.21,7.96\right],P\left(0.7,0.4\right)\rangle$	$\langle \left[3.83,4.84,5.52,6.46\right],P\left(0.8,0.4\right)\rangle$

.

Step 3: Transform the PFSNs decision matrix into score function matrix (shown in

Table 4. Score function matrix.

Alternatives	Attributes
	${\mathit{c}}_1$	${\mathit{c}}_2$	${\mathit{c}}_3$	${\mathit{c}}_4$
$a_1$	31.33	18.39	25.29	26.76
$a_2$	33.11	23.42	20.07	25.06
$a_3$	40.97	35.68	26.49	16.26
$a_4$	31.22	21.48	23.42	39.83
$a_5$	31.33	26.49	31.33	26.76

) based on Equation (6).

Step 4: By OWA operator, the attribute values $r_{ij}$ of each alternative $a_i$ are aggregated to obtain the comprehensive attribute values $z_i$.

$z_1=25.87$, $z_2=25.15$, $z_3=31.65$, $z_4=27.01$, $z_5=29.91$Step 5: Rank the alternatives and obtain the best alternative(s) according to the comprehensive attribute values $z_i$ in the Step 4.

$z_3>z_5>z_4>z_1>z_2$, that means, $a_3\succ a_5\succ a_4\succ a_1\succ a_2$.

And the alternative $a_3$ is the best choice of the supplier option problem.

6.2. Comparison Analysis

To verify the superiority of our method, comparations will be made between our approach and the other two approaches, i.e., the linguistic term subscript method [22] and the linguistic scale function method [11,19].

In [22], the score function of $p=\langle s_{\tau \left(x\right)},u_A\left(x\right),v_A\left(x\right)\rangle$ is:

$$score\left(p\right)=\frac{\tau \left(x\right)}{t+1}*\left({\mu }_{\beta }^2-{\nu }_{\beta }^2\right)$$

(7)

where $\tau \left(x\right)$ is the subscript of the linguistic term, and $t$ is the number of linguistic terms.

We can obtain the comprehensive attribute values $z_i$ based on Equation (7) and the OWA operator.

$z_1=0.094$, $z_2=0.104$, $z_3=0.098$, $z_4=0.115$, $z_5=0.147$, and $z_5>z_4>z_2>z_3>z_1$.

Therefore, the alternative $a_5$ is the best choice.

In [19], the score function of PFN $\beta =P\left(u_{\beta },v_{\beta }\right)$ is:

$$score\left(\beta \right)={\mu }_{\beta }^2-{\nu }_{\beta }^2$$

(8)

In [11], the improved linguistic scale function is calculated as follows:

$$f\left(s_i\right)={\theta }_i=\{\begin{array}{l}\frac{m^{\alpha }-{\left(m-i\right)}^{\alpha }}{2m^{\alpha }}\left(i=0,1,2,\dots ,m\right)\\ \frac{m^{\beta }+{\left(i-m\right)}^{\beta }}{2m^{\beta }}\left(i=m+1,m+2m\dots ,t\right)\end{array}$$

(9)

where $\alpha ,\beta \in \left(0,1\right]$, $m=\frac{t}{2}$, and $t$ is the number of linguistic terms.

According to the improved linguistic scale Function (8) and score Function (9), we can obtain the score function of $p=\langle s_{\tau \left(x\right)},u_A\left(x\right),v_A\left(x\right)\rangle$ as:

$$score\left(p\right)=f\left(s_i\right)*\left({\mu }_{\beta }^2-{\nu }_{\beta }^2\right)$$

(10)

Let $\alpha =\beta =0.5$. We can obtain the comprehensive attribute values $z_i$ based on Equation (10) and the OWA operator.

$z_1=0.07$, $z_2=0.15$, $z_3=0.2$, $z_4=0.14$, $z_5=0.16$, and $z_3>z_5>z_2>z_4>z_1$.

Therefore, the alternative $a_3$ is the best choice.

From

Table 5. Comparison analysis results.

Method	Order of Alternatives
Our method	$a_3\succ a_5\succ a_4\succ a_1\succ a_2$
Linguistic term subscript method [22]	$a_5\succ a_4\succ a_2\succ a_3\succ a_1$
Language scale function method [11,19]	$a_3\succ a_5\succ a_2\succ a_4\succ a_1$

, it can be observed that the ranking result obtained via our algorithm is different from the other two methods. By using the linguistic term subscript method, the ranking order is $a_5\succ a_4\succ a_2\succ a_3\succ a_1$, which is totally different form the results of our method and the language scale function method. The reason is that replacing linguistic words simply with linguistic subscript leads to distortion of information. In fact, the linguistic subscript cannot effectively reflect original decision information. Compared with the linguistic term subscript approach, the linguistic scale function method seems more reasonable for describing the linguistic term information with a so-called language scale function. However, the language scale function still replaces linguistic words with numbers in nature, and information loss or information distortion is still inevitable. On the other hand, different people may have different viewpoints on the same word, but the linguistic subscript and linguistic scale function can only express a single meaning for a word. Compared with the other two methods, we utilize a data-driven method to construct the shadowed set models for the linguistic terms, which cannot only maintain the original decision information as far as possible, but also take different views into account for a single word.

7. Conclusions

A novel method for MADM problems under a linguistic term environment was proposed, combining shadowed sets and Pythagorean fuzzy sets. We defined Pythagorean shadowed numbers and subsequently described their operation rules and basic properties. Based on the operation rules, the score function of Pythagorean shadowed numbers was deduced, and a numerical example was provided to illustrate the computing process. Bearing the above results in mind, we proposed a new MADM approach to deal with linguistic terms. A supplier selection example was used to demonstrate the feasibility of our method. Compared with the linguistic term subscript method and the linguistic scale function method, a data-driven method was adopted to construct the shadowed set models for linguistic terms, which can avoid information loss or information distortion to a great extent. The comparative analysis shows that our method can provide more reasonable and accurate decision-making results by depicting linguistic terms in a more precise manner.

In future research, the proposed method can be extended to other types of shadowed sets, for example, left-shoulder, right-shoulder, non-cored, etc. Additionally, applications in other fields are also worth exploring with our approach.