Taxonomy Method for Multiple Attribute Group Decision Making Under the Spherical Fuzzy Environment

Abstract

In recent years, the multi-attribute group decision making (MAGDM) problem has received extensive attention and research, and it plays an increasingly important role in our daily life. Fuzzy environment provides a more accurate decision-making environment for decision makers, so the research on MAGDM problem under fuzzy environment sets (SFSs) has become popular. Taxonomy method has become an effective method to solve the problem of MAGDM. It also plays an important role in solving the problem of MAGDM combined with other environments. In this paper, a new method for MAGDM is proposed by combining Taxonomy method with SFSs (SF-Taxonomy). In addition, we use entropy weight method to calculate the objective weight of attributes, so that more objective results can be produced when solving MAGDM problems.

1 Introduction

In order to improve the accuracy of decision-making, Zadeh (1965) put forward the concept of a fuzzy set, in which the relationship between hesitation degree, membership degree and non-membership degree is expounded. Many scholars have done related research on the fuzzy set and extended it further (Li and Wan, 2014a, 2014b; Lei et al., 2021a, 2021b, Wei et al., 2021). On the basis of predecessors, Atanassov (1986) proposed intuitionistic fuzzy sets (IFSs), so many scholars have studied the problem of MADM based on IFSs (Xian et al., 2017a, 2017b; Ye, 2017; Garg, 2018a, 2018b). For example, Liu et al. (2021) used IFSs to deal with uncertainty in data. Kaur and Garg (2018) presented an intuitionistic method for cubic intuitionistic fuzzy environment and carried out a comparative analysis. Liu et al. (2021) proposed an improved precision function to accurately compare some interval IFSs. Xu et al. (2012) used IFSs to deal with the problem of information uncertainty in air target threat assessment. Xue et al. (2021) studied the problem of data retrieval based on IFSs. Lei et al. (2020) defined the intuitionistic fuzzy Taxonomy method. Zhao et al. (2021a) improved TODIM method for IF-MAGDM based on cumulative prospect theory (CPT). Zhao et al. (2021b) extended CPT-TODIM method for interval-valued IF-MAGDM. In addition, scholars (Garg and Arora, 2021; Tao et al., 2021; Zhang et al., 2021; Mishra et al., 2020) et al. also conducted related studies on IFSs. Kutlu Gündoğdu and Kahraman (2019a) extended the IFSs to form spherical fuzzy sets (SFSs), in which the quantitative relations among membership, non-membership and hesitation are defined, and they satisfy $0⩽{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{(}\mathit{a}\mathrm{)}+{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{(}\mathit{a}\mathrm{)}+{\overline{\mathit{\pi }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{(}\mathit{a}\mathrm{)}⩽1$ . SFSs have a wide range of applications, such as military, game theory, etc., and also arouse a wide range of interest among scholars. In order to make SFSs work better, Kutlu Gündoğdu and Kahraman (2019a) defined distance and geometric operation. Mathew et al. (2020) proposed a new framework combining AHP and TOPSIS with SFSs. A new spherical fuzzy geometric average formula is proposed to calculate the weight of the spherical fuzzy criterion. Aydogdu and Gul (2020) proposed a new spherical fuzzy set entropy measure, and combined SFSs with WASPAS to evaluate the product, proving the feasibility of the method. Fernandez-Martinez and Sanchez-Lozano (2021) extended SFSs to a wider range of contexts constituting a new field in the context of AI problem studies, thereby expanding the scope for membership levels defined in imprecise cases. In addition, a lot of scholars (Ullah et al., 2018; Kutlu Gündoğdu and Kahraman, 2019b; Zeng et al., 2019; Ashraf et al., 2019) have also carried out related research on it.

Taxonomy was proposed in 1763 and subsequently extended by a Polish mathematical group, and introduced as a means of classifying and determining levels of development (Jurkowska, 2014; Bienkowska, 2013). This method is very useful for classifying, categorizing, and comparing various methods to evaluate the advantages of the attributes of the study (Hellwing, 1968a,b). In recent years, some scholars have applied this method to decision analysis under some circumstances. For example, Xiao et al. (2020) combined the Taxonomy method with IFSs to solve the selection problem of green supply chain, and proposed an objective weighting method to improve the effectiveness of the algorithm. Wei et al. (2020) applied Taxonomy to select and rank low-carbon tourism destinations based on the Pythagorean fuzzy environment. He et al. (2019) combined Taxonomy with Pythagorean 2-Tuple linguistic classification method to select the provision of medical devices, and also adopted comparative analysis to prove the practicality of this method. These examples also prove that this method can be combined with other environments and provides a better decision method for solving MAGDM problems in other environments.

According to the existing literature on the study of SFSs, we have not found a method to use Taxonomy to solve the problem of MAGDM in the background of SFSs. Therefore, it is necessary to combine SFSs and Taxonomy to solve the MAGDM problem in this paper, which will provide a new method to solve the MAGDM problem in SFSs. This paper uses case analysis to carry on the concrete calculation, and also makes the relative comparison with the other methods which have been proved in this environment to confirm the practicability of this method. To this end, this paper has the following research ideas: (1) Use SFSs to express the decision maker’s (DM) overall evaluation of the method. (2) Combine Taxonomy method with SFSs, and present the specific calculation process. (3) Take car rental as an example to present the actual operation method of the algorithm. (4) Compare and verify the method in this paper with the existing method in this environment.

This paper is structured as follows: Firstly, SFSs and Taxonomy methods are briefly introduced and their applications are introduced. Secondly, in order to make readers better understand the method, we listed the formulas and calculation steps related to SFS and Taxonomy in this part. Later, we used the example to carry out specific operations. In order to verify the correctness of this method, we used the existing SF-VIKOR and SF-TOPSIS methods for verification. Finally, we compare and summarize the methods.

2 Preliminaries

2.1 Spherical Fuzzy Sets

Definition 2.1.1 (Kutlu Gündoğdu and Kahraman, 2019b).

The definition of an SFSs, each a to ${\mathit{Z}}_{\mathit{s}}$ below represents our membership degree ( ${\overline{\mathit{\mu }}}_{{\mathit{Z}}_{\mathit{s}}}\mathrm{(}\mathit{a}\mathrm{)}$ ), non-membership degree ( ${\overline{\mathit{\nu }}}_{{\mathit{Z}}_{\mathit{s}}}\mathrm{(}\mathit{a}\mathrm{)}$ ) and hesitation number ( ${\overline{\mathit{\pi }}}_{{\mathit{Z}}_{\mathit{s}}}\mathrm{(}\mathit{a}\mathrm{)}$ ), The relationship between them satisfies the following formula $$\begin{array}{c}{\mathit{Z}}_{\mathit{s}}=\left\{\mathit{a}\mathrm{\right(}{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{\mathit{s}}}\mathrm{(}\mathit{a}\mathrm{)}\mathrm{,}{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{\mathit{s}}}\mathrm{(}\mathit{a}\mathrm{)}\mathrm{,}{\overline{\mathit{\pi }}}_{{\mathit{Z}}_{\mathit{s}}}\mathrm{(}\mathit{a}\mathrm{)}\mathrm{\left)}\right|\mathit{a}\in \mathit{A}\}\mathrm{,}\end{array}$$(1) where ${\overline{\mathit{\mu }}}_{{\mathit{Z}}_{\mathit{s}}}:\mathit{A}\to [0\mathrm{,}1]\mathrm{,}{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{\mathit{s}}}:\mathit{A}\to [0\mathrm{,}1]\mathrm{,}{\mathit{\pi }}_{{\mathit{Z}}_{\mathrm{s}}}:\mathit{A}\to [0\mathrm{,}1]$ . In addition, they will also need to satisfy $0⩽{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{(}\mathit{a}\mathrm{)}+{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{(}\mathit{a}\mathrm{)}+{\overline{\mathit{\pi }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{(}\mathit{a}\mathrm{)}⩽1$ , $\forall \mathit{a}\in \mathit{A}$ .

Definition 2.1.2 (Kutlu Gündoğdu and Kahraman, 2019b).

Some basic operations about SFSs.

(i)

Add operation $$\begin{array}{rl}{\mathit{X}}_{\mathit{s}}\oplus {\mathit{Y}}_{\mathit{s}}& =\{{\mathrm{(}{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}^2+{\overline{\mathit{\mu }}}_{{\mathit{Y}}_{\mathit{s}}}^2-{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}^2{\overline{\mathit{\mu }}}_{{\mathit{Y}}_{\mathit{s}}}^2\mathrm{)}}^{\frac{1}{2}}\mathrm{,}{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}{\overline{\mathit{\nu }}}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{,}\mathrm{(}\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{Y}}_{\mathit{s}}}^2\mathrm{)}{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}^2\\ & +\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}{\overline{\mathit{\pi }}}_{{\mathit{Y}}_{\mathit{s}}}^2-{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}^2{\overline{\mathit{\pi }}}_{{\mathit{Y}}_{\mathit{s}}}^2\mathrm{\left)}{}^{\frac{1}{2}}\right\}.\end{array}$$(2)

(ii)

The multiplication $$\begin{array}{rl}{\mathit{X}}_{\mathit{s}}\otimes {\mathit{Y}}_{\mathit{s}}& =\{{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}{\overline{\mathit{\mu }}}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{,}{\mathrm{(}{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}^2+{\overline{\mathit{\nu }}}_{{\mathit{Y}}_{\mathit{s}}}^2+{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}^2{\overline{\mathit{\nu }}}_{{\mathit{Y}}_{\mathit{s}}}^2\mathrm{)}}^{\frac{1}{2}}\mathrm{,}\mathrm{(}\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}^2\\ & +\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}{\overline{\mathit{\pi }}}_{{\mathit{Y}}_{\mathit{s}}}^2-{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}^2{\overline{\mathit{\pi }}}_{{\mathit{Y}}_{\mathit{s}}}^2\mathrm{\left)}{}^{\frac{1}{2}}\right\}.\end{array}$$(3)

(iii)

Multiplication by a scalar $$\begin{array}{rl}\mathit{\tau }{\mathit{Z}}_{\mathit{s}}& =\{{\mathrm{(}1-{\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{\mathit{s}}}^2\mathrm{)}}^{\mathit{\tau }}\mathrm{)}}^{\frac{1}{2}}\mathrm{,}{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}^{\mathit{\tau }}\mathrm{,}\\ & {\mathrm{(}{\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}}^{\mathit{\tau }}-{\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}^2-{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}}^{\mathit{\tau }}\mathrm{)}}^{\frac{1}{2}}\}\mathrm{,}\mathit{\tau }\mathrm{>}0.\end{array}$$(4)

(iv)

$$\begin{array}{rl}{\mathit{X}}_{\mathit{s}}^{\mathit{\tau }}& =\{{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{,}{\mathrm{(}1-{\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}}^{\mathit{\tau }}\mathrm{)}}^{\frac{1}{2}}\mathrm{,}\\ & {\mathrm{(}{\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}}^{\mathit{\tau }}-{\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}-{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}^2\mathrm{)}}^{\mathit{\tau }}\mathrm{)}}^{\frac{1}{2}}\}\mathrm{,}\mathit{\tau }\mathrm{>}0.\end{array}$$(5)

Definition 2.1.3.

For any set of fuzzy numbers ${\mathit{X}}_{\mathit{s}}=\mathrm{(}{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{,}{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{,}{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{)}$ and ${\mathit{Y}}_{\mathit{s}}=\mathrm{(}{\overline{\mathit{\mu }}}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{,}{\overline{\mathit{\nu }}}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{,}{\overline{\mathit{\pi }}}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{)}$ , this is true for $\mathit{\tau }\mathrm{,}{\mathit{\tau }}_1\mathrm{,}{\mathit{\tau }}_2⩾0$ . $$\begin{array}{rl}\mathrm{(}\mathrm{i}\mathrm{)}& {\mathit{X}}_{\mathit{s}}\oplus {\mathit{Y}}_{\mathit{s}}={\mathit{X}}_{\mathit{s}}\oplus {\mathit{Y}}_{\mathit{s}}\mathrm{,}\end{array}$$(6) $$\begin{array}{rl}\mathrm{(}\mathrm{ii}\mathrm{)}& {\mathit{X}}_{\mathit{s}}\otimes {\mathit{Y}}_{\mathit{s}}={\mathit{X}}_{\mathit{s}}\otimes {\mathit{Y}}_{\mathit{s}}\end{array}$$(7) $$\begin{array}{rl}\mathrm{(}\mathrm{iii}\mathrm{)}& {\mathit{\tau }}_1{\mathit{X}}_{\mathit{s}}\otimes {\mathit{\tau }}_2{\mathit{X}}_{\mathit{s}}=\mathrm{(}{\mathit{\tau }}_1+{\mathit{\tau }}_2\mathrm{)}{\mathit{X}}_{\mathit{s}}\mathrm{,}\end{array}$$(8) $$\begin{array}{rl}\mathrm{(}\mathrm{iv}\mathrm{)}& \mathit{\tau }\mathrm{(}{\mathit{X}}_{\mathit{s}}\oplus {\mathit{Y}}_{\mathit{s}}\mathrm{)}=\mathit{\tau }{\mathit{X}}_{\mathit{s}}\oplus \mathit{\tau }{\mathit{Y}}_{\mathit{s}}\mathrm{,}\end{array}$$(9) $$\begin{array}{rl}\mathrm{(}\mathrm{v}\mathrm{)}& {\mathrm{(}{\mathit{X}}_{\mathit{s}}\otimes {\mathit{Y}}_{\mathit{s}}\mathrm{)}}^{\mathit{\tau }}={\mathit{X}}_{\mathit{s}}^{\mathit{\tau }}\otimes {\mathit{Y}}_{\mathit{s}}^{\mathit{\tau }}\mathrm{,}\end{array}$$(10) $$\begin{array}{rl}\mathrm{(}\mathrm{vi}\mathrm{)}& {\mathit{X}}_{\mathit{s}}^{{\mathit{\tau }}_1}\otimes {\mathit{X}}_{\mathit{s}}^{{\mathit{\tau }}_2}={\mathit{X}}_{\mathit{s}}^{{\mathit{\tau }}_1+{\mathit{\tau }}_2}.\end{array}$$(11)

Definition 2.1.4 (Kutlu Gündoğdu and Kahraman, 2020, 2019c).

Spherical Weighted Arithmetic Mean (SWAM) and Spherical Weighted Geometric Mean (SWGM). $$\begin{array}{rl}& {\mathit{\text{SWAM}}}_{\mathit{\delta }}\mathrm{(}{\mathit{Z}}_{{\mathit{s}}_1}\mathrm{,}{\mathit{Z}}_{{\mathit{s}}_2}\mathrm{,}\dots \cdots \mathrm{,}{\mathit{Z}}_{{\mathit{s}}_{\mathit{n}}}\mathrm{)}\\ & ={\mathit{\delta }}_1{\mathit{Z}}_{{\mathit{s}}_1}+{\mathit{\delta }}_2{\mathit{Z}}_{{\mathit{s}}_2}+\cdots +{\mathit{\delta }}_{\mathit{n}}{\mathit{Z}}_{{\mathit{s}}_{\mathit{n}}}=\{{[1-{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2\mathrm{)}}^{{\mathit{\delta }}_{\mathit{i}}}]}^{\frac{1}{2}}\mathrm{,}{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^{{\mathit{\delta }}_{\mathit{i}}}\mathrm{,}\\ & {[{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2\mathrm{)}}^{{\mathit{\delta }}_{\mathit{i}}}-{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\mathrm{(}1-{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2-{\overline{\mathit{\pi }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2\mathrm{)}}^{{\mathit{\delta }}_{\mathit{i}}}]}^{\frac{1}{2}}\}\mathrm{,}\end{array}$$(12) where ${\mathit{\delta }}_{\mathit{i}}\in [0\mathrm{,}1]$ ; ${\sum }_{\mathit{i}=1}^{\mathit{n}}{\mathit{\delta }}_{\mathit{i}}=1$ . $$\begin{array}{rl}& {\mathit{\text{SWAM}}}_{\mathit{\delta }}\mathrm{(}{\mathit{Z}}_{{\mathit{s}}_1}\mathrm{,}{\mathit{Z}}_{{\mathit{s}}_2}\mathrm{,}\dots \mathrm{,}{\mathit{Z}}_{{\mathit{s}}_{\mathit{n}}}\mathrm{)}\\ & ={\mathit{Z}}_{{\mathit{s}}_1}^{{\mathit{\delta }}_1}+{\mathit{Z}}_{{\mathit{s}}_2}^{{\mathit{\delta }}_2}+\cdots +{\mathit{Z}}_{{\mathit{s}}_{\mathit{n}}}^{{\mathit{\delta }}_{\mathit{n}}}=\{{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\overline{\mathit{\mu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^{{\mathit{\delta }}_{\mathit{i}}}{[1-{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2\mathrm{)}}^{{\mathit{\delta }}_{\mathit{i}}}]}^{\frac{1}{2}}\mathrm{,}\\ & {[{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2\mathrm{)}}^{{\mathit{\delta }}_{\mathit{i}}}-{\displaystyle \prod }_{\mathit{i}=1}^{\mathit{n}}{\mathrm{(}1-{\overline{\mathit{\nu }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2-{\overline{\mathit{\pi }}}_{{\mathit{Z}}_{{\mathit{s}}_{\mathit{i}}}}^2\mathrm{)}}^{{\mathit{\delta }}_{\mathit{i}}}]}^{\frac{1}{2}}\}.\end{array}$$(13)

Definition 2.1.5 (Kutlu Gündoğdu and Kahraman, 2019a , 2019d).

The calculation formula of the score function and the accuracy function is given below $$\begin{array}{c}\mathit{\text{Score}}\mathrm{(}{\mathit{X}}_{\mathit{s}}\mathrm{)}={\mathrm{(}{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}-{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{)}}^2-{\mathrm{(}{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}-{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{)}}^2.\end{array}$$(14)

The score function is used to compare the size of two fuzzy numbers. If the scoring functions are equal, then compare the calculations and compare the accuracy functions. $$\begin{array}{r}\mathit{\text{Accuracy}}\mathrm{(}{\mathit{X}}_{\mathit{s}}\mathrm{)}={\mathrm{(}{\overline{\mathit{\mu }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{)}}^2+{\mathrm{(}{\overline{\mathit{\nu }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{)}}^2+{\mathrm{(}{\overline{\mathit{\pi }}}_{{\mathit{X}}_{\mathit{s}}}\mathrm{)}}^2.\end{array}$$(15)

Note that ${\mathit{X}}_{\mathit{s}}\mathrm{<}{\mathit{Y}}_{\mathit{s}}$ if and only if

• (i)

$\mathit{\text{Score}}\mathrm{(}{\mathit{X}}_{\mathit{s}}\mathrm{)}\mathrm{<}\mathit{\text{Score}}\mathrm{(}{\mathit{Y}}_{\mathit{s}}\mathrm{)}$ or

(ii)

$\mathit{\text{Score}}\mathrm{(}{\mathit{X}}_{\mathit{s}}\mathrm{)}=\mathit{\text{Score}}\mathrm{(}{\mathit{Y}}_{\mathit{s}}\mathrm{)}$ and $\mathit{\text{Accuracy}}\mathrm{(}{\mathit{X}}_{\mathit{s}}\mathrm{)}\mathrm{<}\mathit{\text{Accuracy}}\mathrm{(}{\mathit{Y}}_{\mathit{s}}\mathrm{)}$ .

Definition 2.1.6 (Szmidt and Kacprzyk, 2000).

Euclidean distance formula: $$\begin{array}{c}\mathit{d}\mathrm{(}{\mathit{X}}_{\mathit{s}}\mathrm{,}{\mathit{Y}}_{\mathit{s}}\mathrm{)}=\sqrt{{\displaystyle \frac{1}{2\mathit{n}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{n}}\mathrm{(}{\mathrm{(}{\mathit{\mu }}_{{\mathit{X}}_{\mathit{s}}}-{\mathit{\mu }}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{)}}^2+{\mathrm{(}{\mathit{\nu }}_{{\mathit{X}}_{\mathit{s}}}-{\mathit{\nu }}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{)}}^2+{\mathrm{(}{\mathit{\pi }}_{{\mathit{X}}_{\mathit{s}}}-{\mathit{\pi }}_{{\mathit{Y}}_{\mathit{s}}}\mathrm{)}}^2\mathrm{)}}.\end{array}$$(16)

2.2 The Taxonomy Method

Taxonomy was proposed in 1763, subsequently extended by a Polish mathematical group, and introduced as a means of classifying and determining levels of development (Jurkowska, 2014; Bienkowska, 2013). The classical Taxonomy method is given as follows.

Step 1. Calculate the mean and standard deviation of attributes: $$\begin{array}{rl}& {\overline{\mathit{a}}}_{\mathit{j}}={\displaystyle \frac{1}{\mathit{m}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{m}}{\mathit{a}}_{\mathit{i}\mathit{j}};\mathit{j}=1\mathrm{,}2\mathrm{,}\dots \mathrm{,}\mathit{n}\mathrm{,}\end{array}$$(17) $$\begin{array}{rl}& {\mathit{S}}_{\stackrel{\mathrm{⌢}}{\mathit{j}}}=\sqrt{{\displaystyle \frac{1}{\mathit{m}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{m}}{\mathrm{(}{\mathit{a}}_{\mathit{i}\mathit{j}}-{\overline{\mathit{a}}}_{\mathit{j}}\mathrm{)}}^2};\mathit{j}=1\mathrm{,}2\mathrm{,}\dots \mathrm{,}\mathit{n}.\end{array}$$(18) Step 2. Because in matrix decision making alternative solutions have different measurement scales in attributes, this stage is for balancing its different units, so the following formula is used to achieve this goal (Hellwing, 1968a, 1968b, 1968c). $$\begin{array}{c}{\mathit{L}}_{\mathit{i}\mathit{j}}={\displaystyle \frac{{\mathit{a}}_{\mathit{i}\mathit{j}}-{\overline{\mathit{a}}}_{\mathit{j}}}{{\mathit{S}}_{\hat{\mathit{j}}}}};\mathit{i}=1\mathrm{,}\dots \mathrm{,}\mathit{m}\mathrm{,}\mathit{j}=1\mathrm{,}\dots \mathrm{,}\mathit{n}.\end{array}$$(19) Step 3. Calculate the distance of each alternative relative to the other alternatives using the formula below (Hellwing, 1968a, 1968b, 1968c). $$\begin{array}{c}{\mathit{P}}_{\mathit{a}\mathit{b}}=\sqrt{{\displaystyle \sum }_{\mathit{j}=1}^{\mathit{n}}{\mathrm{(}{\mathit{l}}_{\mathit{a}\mathit{j}}-{\mathit{l}}_{\mathit{b}\mathit{j}}\mathrm{)}}^2}\mathrm{,}\end{array}$$(20) where a and b represent the alternatives being evaluated in order to facilitate the comparison of the two alternatives, and the following composite distance matrix can be obtained: $$\begin{array}{c}\mathit{P}={\left[\begin{array}{ccccc}{\mathit{p}}_{11}& \cdots & {\mathit{p}}_{1\mathit{j}}& \cdots & {\mathit{p}}_{1\mathit{n}}\\ ⋮& \ddots & ⋮& \ddots & ⋮\\ {\mathit{p}}_{\mathit{i}1}& \cdots & {\mathit{p}}_{\mathit{i}\mathit{j}}& \cdots & {\mathit{p}}_{\mathit{i}\mathit{n}}\\ ⋮& \ddots & ⋮& \ddots & ⋮\\ {\mathit{p}}_{\mathit{m}1}& \cdots & {\mathit{p}}_{\mathit{m}\mathit{j}}& \cdots & {\mathit{p}}_{\mathit{m}\mathit{n}}\end{array}\right]}_{\mathit{m}\times \mathit{n}};\mathit{i}=1\mathrm{,}\dots \mathrm{,}\mathit{m}\mathrm{,}\mathit{j}=1\mathrm{,}\dots \mathrm{,}\mathit{n}.\end{array}$$(21) Step 4. Calculate the mean and standard deviation of the minimum distance in each row according to the calculation formula $$\begin{array}{rl}& {\mathit{o}}^{\prime }={\displaystyle \frac{1}{\mathit{m}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{m}}{\mathit{o}}_{\hat{\mathit{i}}}\mathrm{,}\end{array}$$(22) $$\begin{array}{rl}& {\mathit{S}}_{\stackrel{\mathrm{⌢}}{\mathit{o}}}=\sqrt{{\displaystyle \frac{1}{\mathit{m}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{m}}{\mathrm{(}{\mathit{o}}_{\hat{\mathit{i}}}-{\mathit{o}}^{\prime }\mathrm{)}}^2}.\end{array}$$(23)

In this calculation, ${\mathit{o}}_{\hat{\mathit{i}}}$ indicates the optimal distance of each row. Then the formula (23) is used to determine the range that the composite distance matrix should meet. $$\begin{array}{c}\mathit{o}={\mathit{o}}^{\prime }\pm 2{\mathit{S}}_{\stackrel{\mathrm{⌢}}{0}}.\end{array}$$(24)

If every row has a value that doesn’t fall within this range, it will not work, and the mean and standard deviation of each row will need to be calculated again.

Step 5. By the standardized matrix calculation development pattern $$\begin{array}{c}{\mathit{L}}_{\mathit{i}\mathit{o}}=\sqrt{{\displaystyle \sum }_{\mathit{j}=1}^{\mathit{n}}{\mathrm{(}{\mathit{L}}_{\mathit{i}\mathit{j}}-{\mathit{L}}_{0\mathit{j}}\mathrm{)}}^2};\mathit{i}=1\mathrm{,}\dots \mathrm{,}\mathit{m}\mathrm{,}\end{array}$$(25) where ${\mathit{L}}_{0\mathit{j}}$ represents the ideal value of the jth attribute, depending on whether the attribute is benefit type or negative type. ${\mathit{L}}_{\mathit{i}\mathit{j}}$ represents the standard value of the jth attribute in the ith choice.

Step 6. Calculated the height of development $$\begin{array}{c}{\mathit{L}}_{\mathit{O}}={\overline{\mathit{L}}}_{\mathit{i}\mathit{o}}+2{\mathit{S}}_{{\mathit{L}}_{\mathit{i}\mathit{o}}}.\end{array}$$(26)

Then, calculate the final progression order using the following formula: $$\begin{array}{c}{\mathit{F}}_{\mathit{i}}={\displaystyle \frac{{\mathit{L}}_{\mathit{i}\mathit{o}}}{{\mathit{L}}_{\mathit{o}}}};\mathit{i}=1\mathrm{,}\dots \mathrm{,}\mathit{m}.\end{array}$$(27)

2.3 The Taxonomy Method with SFSs

In this section, we combine Taxonomy method with SFS (SF-Taxonomy) method to solve the problem of MAGDM. Let $\mathit{L}=\{{\mathit{L}}_1\mathrm{,}{\mathit{L}}_2\mathrm{,}\dots \mathrm{,}{\mathit{L}}_{\mathit{m}}\}$ be a set of alternatives, $\mathit{P}=\{{\mathit{P}}_1\mathrm{,}{\mathit{P}}_2\mathrm{,}\dots \mathrm{,}{\mathit{P}}_{\mathit{n}}\}$ becomes a set of properties. $\mathit{w}=\{{\mathit{w}}_1\mathrm{,}{\mathit{w}}_2\mathrm{,}\dots \mathrm{,}{\mathit{w}}_{\mathit{i}}\}$ is the set of weights for each attribute, where ${\sum }_{\mathit{i}=1}^{\mathit{n}}{\mathit{w}}_{\mathit{i}}=1$ . For a MAGDM problem, there are k experts for evaluation, and an expert set ${\mathit{L}}^{\mathrm{(}\mathit{k}\mathrm{)}}$ is formed, ${\mathit{\delta }}_{\mathit{i}}$ is the weight of the expert, where satisfies ${\sum }_{\mathit{i}=1}^{\mathit{n}}{\mathit{\delta }}_{\mathit{i}}=1$ . The steps are given below.

Step 1. Building a decision matrix $$\begin{array}{c}{\mathit{L}}^{\mathrm{(}\mathit{k}\mathrm{)}}={\left[{\mathit{L}}_{\mathit{i}\mathit{j}}^{\mathit{k}}\right]}_{\mathit{m}\times \mathit{n}}={\left[\begin{array}{cccc}{\mathit{l}}_{11}^{\mathit{k}}& {\mathit{l}}_{12}^{\mathit{k}}& \cdots & {\mathit{l}}_{1\mathit{n}}^{\mathit{k}}\\ {\mathit{l}}_{21}^{\mathit{k}}& {\mathit{l}}_{22}^{\mathit{k}}& \cdots & {\mathit{l}}_{2\mathit{n}}^{\mathit{k}}\\ ⋮& ⋮& \ddots & ⋮\\ {\mathit{l}}_{\mathit{m}1}^{\mathit{k}}& {\mathit{l}}_{\mathit{m}2}^{\mathit{k}}& \cdots & {\mathit{l}}_{\mathit{m}\mathit{n}}^{\mathit{k}}\end{array}\right]}_{\mathit{m}\times \mathit{n}}\mathrm{,}\mathit{i}=1\mathrm{,}2\mathrm{,}\dots \mathrm{,}\mathit{m}\mathrm{,}\mathit{j}=1\mathrm{,}2\mathrm{,}\dots \mathrm{,}\mathit{n}.\end{array}$$ Step 2. Convert the cost attribute to the benefit attribute, for example, given a cost type fuzzy number $$\begin{array}{rl}& {\mathit{L}}_{\mathit{i}\mathit{j}}=\mathrm{(}{\mathit{\mu }}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{v}}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{\pi }}_{\mathit{i}\mathit{j}}\mathrm{)}\mathrm{,}\text{we can get the fuzzy number of its benefit}\\ & {\mathit{L}}_{\mathit{i}\mathit{j}}=\mathrm{(}{\mathit{v}}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{\mu }}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{\pi }}_{\mathit{i}\mathit{j}}\mathrm{)}.\end{array}$$ Step 3. The decision matrices are aggregated using the SWAM operator in conjunction with the expert weights.

Step 4. The entropy weight method is used to calculate the weight of attributes.

(1)

The scoring function of the standard matrix is calculated, and the matrix obtained is normalized by the following formula: $$\begin{array}{c}{\overline{\mathit{L}}}_{\mathit{i}\mathit{j}}={\displaystyle \frac{\mathit{\text{score}}\mathrm{(}{\mathit{l}}_{\mathit{i}\mathit{j}}\mathrm{)}}{{\sum }_{\mathit{i}=1}^{\mathit{n}}\mathit{\text{score}}\mathrm{(}{\mathit{l}}_{\mathit{i}\mathit{j}}\mathrm{)}}};\mathit{j}=1\mathrm{,}\dots \mathrm{,}\mathit{n}.\end{array}$$(28)

(2)

Calculate the degree of entropy $$\begin{array}{c}{\hat{\mathit{E}}}_{\mathit{j}}=-{\displaystyle \frac{1}{ln\mathit{n}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{n}}{\overline{\mathit{l}}}_{\mathit{i}\mathit{j}};\mathit{j}=1\mathrm{,}\dots \mathrm{,}\mathit{n}\mathrm{,}0⩽{\hat{\mathit{E}}}_{\mathit{j}}⩽1.\end{array}$$(29)

(3)

Calculate the rate of degree of entropy ( ${\mathit{D}}_{\mathit{i}}$ ), and then get the weights of attribute $$\begin{array}{rl}& {\mathit{D}}_{\mathit{j}}=1-{\stackrel{\mathrm{⌢}}{\mathit{E}}}_{\mathit{j}};\mathit{j}=1\mathrm{,}\dots \mathrm{,}\mathit{n}\mathrm{,}\end{array}$$(30) $$\begin{array}{rl}& {\mathit{w}}_{\mathit{j}}={\displaystyle \frac{{\mathit{D}}_{\mathit{j}}}{{\sum }_{\mathit{j}=1}^{\mathit{n}}{\mathit{D}}_{\mathit{j}}}}.\end{array}$$(31)

Step 5. The spherical fuzzy composite distance matrix is calculated (SFCDM). $$\begin{array}{c}\mathit{\text{SFCDM}}={\displaystyle \sum }_{\mathit{j}=1}^{\mathit{n}}{\mathit{w}}_{\mathit{j}}\left(\mathit{d}\left(\mathrm{(}{\mathit{\mu }}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{v}}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{\pi }}_{\mathit{i}\mathit{j}}\mathrm{)}\mathrm{,}\mathrm{(}{\mathit{\mu }}_{\mathit{k}\mathit{j}}\mathrm{,}{\mathit{v}}_{\mathit{k}\mathit{j}}\mathrm{,}{\mathit{\pi }}_{\mathit{k}\mathit{j}}\mathrm{)}\right)\right).\end{array}$$(32) Step 6. Select the minimum value of each row of SFCDM matrix, and calculate their mean ( $\mathit{S}\mathit{F}\overline{\mathit{O}}$ ) and variance ( ${\mathit{S}}_{\mathit{S}\mathit{F}\mathit{O}}$ ). From this we can get their online and offline. $$\begin{array}{rl}& \mathit{\text{SF}}\overline{\mathit{O}}={\displaystyle \frac{1}{\mathit{m}}}{\displaystyle \sum }_{\mathit{i}=1}^{\mathit{m}}{\mathit{\text{SFO}}}_{\mathit{i}}\mathrm{,}\end{array}$$(33) $$\begin{array}{rl}& {\mathit{S}}_{\mathit{\text{SFO}}}=\sqrt{{\displaystyle \frac{1}{\mathit{m}}}{\mathrm{(}{\mathit{\text{SFO}}}_{\mathit{i}}-\mathit{\text{SF}}\overline{\mathit{O}}\mathrm{)}}^2}.\end{array}$$(34) Step 7. Obtain the spherical fuzzy positive ideal solution (SFPIS) of each alternative $$\begin{array}{c}\mathit{\text{SFPIS}}=\mathrm{(}\underset{\mathit{i}}{max}{\mathit{\mu }}_{\mathit{i}\mathit{j}}\mathrm{,}\underset{\mathit{i}}{min}{\mathit{v}}_{\mathit{i}\mathit{j}}\mathrm{,}\underset{\mathit{i}}{min}{\mathit{\pi }}_{\mathit{i}\mathit{j}}\mathrm{)}.\end{array}$$(35) Step 8. Calculate the development pattern (SFDP), from which you can derive the relevant matrix $$\begin{array}{c}\mathit{\text{SFDP}}={\displaystyle \sum }_{\mathit{j}=1}^{\mathit{n}}{\mathit{w}}_{\mathit{j}}\mathrm{(}\mathit{d}\mathrm{(}\mathit{\text{SFPIS}}\mathrm{,}{\mathit{\text{SFL}}}_{\mathit{i}}\mathrm{)}\mathrm{)}\mathrm{,}\mathit{i}=1\mathrm{,}\dots \mathrm{,}\mathit{m}.\end{array}$$(36) Step 9. Calculate the average value and upper limit (SFHLD), from which you can get the final scheme value (SFDA). The minimum value is the optimal calculation scheme: $$\begin{array}{rl}& \mathit{\text{SFHLD}}=\mathit{\text{SFD}}\overline{\mathit{P}}+2{\mathit{S}}_{\mathit{\text{SFDP}}}\mathrm{,}\end{array}$$(37) $$\begin{array}{rl}& \mathit{\text{SFDA}}={\displaystyle \frac{\mathit{\text{SFDP}}}{\mathit{\text{SFHLD}}}}.\end{array}$$(38)

3 Case Analysis

A company needs to rent a car for a major event, and there are four types of car rental companies that can offer this service. $\mathit{L}=\{{\mathit{L}}_1\mathrm{,}{\mathit{L}}_2\mathrm{,}{\mathit{L}}_3\mathrm{,}{\mathit{L}}_4\}$ forms a collection of alternative firms. We measured the vehicles provided by these companies using four attributes: cost ( ${\mathit{U}}_1$ ), endurance time ( ${\mathit{U}}_2$ ), company distance ( ${\mathit{U}}_3$ ), and service ( ${\mathit{U}}_4$ ), among which ${\mathit{U}}_1$ and ${\mathit{U}}_3$ are cost-type attributes, while the rest are benefit attributes, the attribute weight is unknown. There are three experts who form Expert Set $\mathit{E}=\{{\mathit{E}}_1\mathrm{,}{\mathit{E}}_2\mathrm{,}{\mathit{E}}_3\}$ to score them, among which the expert weights are 0.41, 0.32, 0.27, respectively. Based on their assessment, three decisions were made in ${\mathit{L}}^{\mathrm{(}\mathit{k}\mathrm{)}}$ , proof of the decision was made by the k decision maker.

Step 1. A fuzzy evaluation matrix is given $$\begin{array}{c}{\mathit{L}}_{\mathit{p}}={\left[{\mathit{L}}_{\mathit{i}\mathit{j}}^{\mathit{p}}\right]}_{\mathit{m}\times \mathit{n}}=\mathrm{(}{\mathit{l}}_{{\mathit{\mu }}_{\mathit{i}\mathit{j}}^{\mathit{p}}}\mathrm{,}{\mathit{l}}_{{\mathit{\nu }}_{\mathit{i}\mathit{j}}^{\mathit{p}}}\mathrm{,}{\mathit{l}}_{{\mathit{\pi }}_{\mathit{i}\mathit{j}}^{\mathit{p}}}\mathrm{)}\mathrm{,}\mathit{i}=1\mathrm{,}2\mathrm{,}\dots \mathrm{,}\mathit{m}\mathrm{,}\mathit{j}=1\mathrm{,}2\mathrm{,}\dots \mathrm{,}\mathit{n}\end{array}$$ represents the evaluation of the pth decision maker for the ${\mathit{M}}_{\mathit{j}}$ criterion of plan ${\mathit{W}}_{\mathit{i}}$ in SFSs, as below Tables 1–3.

Table 1

Decision matrix by DM₁.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.25\mathrm{,}0.31\mathrm{,}0.12\mathrm{)}$	$\mathrm{(}0.27\mathrm{,}0.39\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.34\mathrm{,}0.23\mathrm{,}0.52\mathrm{)}$	$\mathrm{(}0.31\mathrm{,}0.24\mathrm{,}0.12\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.11\mathrm{,}0.25\mathrm{,}0.31\mathrm{)}$	$\mathrm{(}0.11\mathrm{,}\mathrm{0.35.0.31}\mathrm{)}$	$\mathrm{(}0.32\mathrm{,}0.35\mathrm{,}0.53\mathrm{)}$	$\mathrm{(}0.41\mathrm{,}0.33\mathrm{,}0.65\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.53\mathrm{,}0.32\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.53\mathrm{,}0.47\mathrm{)}$	$\mathrm{(}\mathrm{0.220.38}\mathrm{,}0.35\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.12\mathrm{,}0.42\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.01\mathrm{,}0.23\mathrm{,}0.23\mathrm{)}$	$\mathrm{(}0.36\mathrm{,}0.47\mathrm{,}0.22\mathrm{)}$	$\mathrm{(}0.32\mathrm{,}0.53\mathrm{,}0.32\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.41\mathrm{,}0.23\mathrm{)}$

Table 2

Decision matrix by DM₂.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.43\mathrm{,}0.22\mathrm{,}0.22\mathrm{)}$	$\mathrm{(}0.27\mathrm{,}0.33\mathrm{,}0.31\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.33\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.38\mathrm{,}0.37\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.53\mathrm{,}0.32\mathrm{,}0.39\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}\mathrm{0.23.0.13}\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.38\mathrm{,}0.36\mathrm{)}$	$\mathrm{(}0.59\mathrm{,}0.15\mathrm{,}0.32\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.43\mathrm{,}0.52\mathrm{,}0.41\mathrm{)}$	$\mathrm{(}0.58\mathrm{,}0.27\mathrm{,}0.42\mathrm{)}$	$\mathrm{(}0.55\mathrm{,}0.39\mathrm{,}0.43\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}0.48\mathrm{,}0.53\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.28\mathrm{,}0.05\mathrm{,}0.43\mathrm{)}$	$\mathrm{(}0.43\mathrm{,}0.32\mathrm{,}0.42\mathrm{)}$	$\mathrm{(}0.02\mathrm{,}0.42\mathrm{,}0.54\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.45\mathrm{,}0.23\mathrm{)}$

Step 2. To transform the cost-type index into the benefit-type index, as shown in Tables 4–6.

Table 3

Decision matrix by DM₃.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.39\mathrm{,}0.43\mathrm{,}0.33\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.34\mathrm{,}0.22\mathrm{)}$	$\mathrm{(}0.46\mathrm{,}0.31\mathrm{,}0.51\mathrm{)}$	$\mathrm{(}0.46\mathrm{,}0.32\mathrm{,}0.19\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.35\mathrm{,}0.16\mathrm{,}0.27\mathrm{)}$	$\mathrm{(}0.68\mathrm{,}\mathrm{0.42.0.31}\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.58\mathrm{,}0.31\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.35\mathrm{,}0.22\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.13\mathrm{,}0.27\mathrm{,}0.35\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.33\mathrm{,}0.45\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.45\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.34\mathrm{,}0.42\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.35\mathrm{,}0.54\mathrm{,}0.28\mathrm{)}$	$\mathrm{(}0.48\mathrm{,}0.44\mathrm{,}0.52\mathrm{)}$	$\mathrm{(}0.32\mathrm{,}0.31\mathrm{,}0.32\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}0.33\mathrm{,}0.41\mathrm{)}$

Table 4

Decision matrix by DM₁.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.31\mathrm{,}0.25\mathrm{,}0.12\mathrm{)}$	$\mathrm{(}0.27\mathrm{,}0.39\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.23\mathrm{,}0.34\mathrm{,}0.52\mathrm{)}$	$\mathrm{(}0.31\mathrm{,}0.24\mathrm{,}0.12\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.25\mathrm{,}0.11\mathrm{,}0.31\mathrm{)}$	$\mathrm{(}0.11\mathrm{,}\mathrm{0.35.0.31}\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.32\mathrm{,}0.53\mathrm{)}$	$\mathrm{(}0.41\mathrm{,}0.33\mathrm{,}0.65\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.32\mathrm{,}0.53\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.53\mathrm{,}0.47\mathrm{)}$	$\mathrm{(}0.38\mathrm{,}0.22\mathrm{,}0.35\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.12\mathrm{,}0.42\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.23\mathrm{,}0.01\mathrm{,}0.23\mathrm{)}$	$\mathrm{(}0.36\mathrm{,}0.47\mathrm{,}0.22\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.32\mathrm{,}0.32\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.41\mathrm{,}0.23\mathrm{)}$

Table 5

Decision matrix by DM₂.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.22\mathrm{,}0.43\mathrm{,}0.22\mathrm{)}$	$\mathrm{(}0.27\mathrm{,}0.33\mathrm{,}0.31\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.42\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.38\mathrm{,}0.37\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.32\mathrm{,}0.53\mathrm{,}0.39\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}\mathrm{0.23.0.13}\mathrm{)}$	$\mathrm{(}0.38\mathrm{,}0.42\mathrm{,}0.36\mathrm{)}$	$\mathrm{(}0.59\mathrm{,}0.15\mathrm{,}0.32\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.52\mathrm{,}0.43\mathrm{,}0.41\mathrm{)}$	$\mathrm{(}0.58\mathrm{,}0.27\mathrm{,}0.42\mathrm{)}$	$\mathrm{(}0.39\mathrm{,}0.55\mathrm{,}0.43\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}0.48\mathrm{,}0.53\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.05\mathrm{,}0.28\mathrm{,}0.43\mathrm{)}$	$\mathrm{(}0.43\mathrm{,}0.32\mathrm{,}0.42\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.02\mathrm{,}0.54\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.45\mathrm{,}0.23\mathrm{)}$

Step 3. The above decision matrix is aggregated using the SWAM operator to obtain Table 7.

Table 6

Decision matrix by DM₃.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.43\mathrm{,}0.39\mathrm{,}0.33\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.34\mathrm{,}0.22\mathrm{)}$	$\mathrm{(}0.31\mathrm{,}0.46\mathrm{,}0.51\mathrm{)}$	$\mathrm{(}0.46\mathrm{,}0.32\mathrm{,}0.19\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.16\mathrm{,}0.35\mathrm{,}0.27\mathrm{)}$	$\mathrm{(}0.68\mathrm{,}\mathrm{0.42.0.31}\mathrm{)}$	$\mathrm{(}0.58\mathrm{,}0.33\mathrm{,}0.31\mathrm{)}$	$\mathrm{(}0.35\mathrm{,}0.35\mathrm{,}0.22\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.27\mathrm{,}0.13\mathrm{,}0.35\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.33\mathrm{,}0.45\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.53\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.34\mathrm{,}0.42\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.54\mathrm{,}0.35\mathrm{,}0.28\mathrm{)}$	$\mathrm{(}0.48\mathrm{,}0.44\mathrm{,}0.52\mathrm{)}$	$\mathrm{(}0.31\mathrm{,}0.32\mathrm{,}0.32\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}0.33\mathrm{,}0.41\mathrm{)}$

Step 4. Equations (28)–(31) were used to calculate the objective weight $$\begin{array}{c}{\mathit{\varpi }}_1=0.3798\mathrm{,}{\mathit{\varpi }}_2=0.5413\mathrm{,}{\mathit{\varpi }}_3=0.0243\mathrm{,}{\mathit{\varpi }}_4=\mathrm{0.0546.}\end{array}$$ Step 5. SFCDM was calculated by equations (32), as shown in Table 8.

Table 7

The overall decision matrix.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.33\mathrm{,}0.34\mathrm{,}0.23\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.36\mathrm{,}0.26\mathrm{)}$	$\mathrm{(}029\mathrm{,}0.39\mathrm{,}0.45\mathrm{)}$	$\mathrm{(}0.40\mathrm{,}0.39\mathrm{,}0.25\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.26\mathrm{,}0.25\mathrm{,}0.33\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}\mathrm{0.32.0.28}\mathrm{)}$	$\mathrm{(}0.44\mathrm{,}0.35\mathrm{,}0.42\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}0.44\mathrm{,}0.49\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.39\mathrm{,}0.34\mathrm{,}0.35\mathrm{)}$	$\mathrm{(}0.49\mathrm{,}0.38\mathrm{,}0.45\mathrm{)}$	$\mathrm{(}0.40\mathrm{,}0.37\mathrm{,}0.36\mathrm{)}$	$\mathrm{(}0.41\mathrm{,}0.39\mathrm{,}0.46\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.33\mathrm{,}0.08\mathrm{,}0.32\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.41\mathrm{,}0.40\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.13\mathrm{,}0.41\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}0.45\mathrm{,}0.29\mathrm{)}$

Step 6. Find the minimum value of each row of SFCDM matrix ( ${\mathit{\text{SFO}}}_{\mathit{i}}$ ), calculate its mean value ( $\mathit{\text{SF}}\overline{\mathit{O}}$ ) and its variance ( ${\mathit{S}}_{\mathit{\text{SFO}}}$ ). $$\begin{array}{rl}& {\mathit{\text{SFO}}}_1=0.1058\mathrm{,}{\mathit{\text{SFO}}}_2=0.1058\mathrm{,}{\mathit{\text{SFO}}}_3=0.1181\mathrm{,}{\mathit{\text{SFO}}}_4=0.1190\mathrm{,}\\ & \mathit{\text{SF}}\overline{\mathit{O}}=0.1122\mathrm{,}{\mathit{S}}_{\mathit{\text{SFO}}}=\mathrm{0.0064.}\end{array}$$ Step 7. From ${\mathit{\text{SFDP}}}_{\mathit{i}}$ and ${\mathit{S}}_{\mathit{\text{SFO}}}$ , it can be concluded that its upper and lower lines are $$\begin{array}{r}\mathit{\text{SFO}}=\mathit{\text{SF}}\overline{\mathit{O}}\pm {\mathit{S}}_{\mathit{\text{SFO}}}=0.1122\pm \mathrm{0.0064.}\end{array}$$ Step 8. Obtain the optimal distance under fuzzy environment, as shown in Table 9.

Table 8

The SFCDM.

	${\mathit{L}}_1$	${\mathit{L}}_2$	${\mathit{L}}_3$	${\mathit{L}}_4$
${\mathit{L}}_1$	–	0.1058	0.1396	0.1487
${\mathit{L}}_2$	0.10583	–	0.1181	0.1234
${\mathit{L}}_3$	0.1396	0.1181	–	0.1190
${\mathit{L}}_4$	0.1487	0.1234	0.1190	–

Step 9. Compute the development pattern ( ${\mathit{\text{SFDP}}}_{\mathit{i}}$ ). $$\begin{array}{r}{\mathit{\text{SFDP}}}_1=0.1418\mathrm{,}{\mathit{\text{SFDP}}}_2=0.088\mathrm{,}{\mathit{\text{SFDP}}}_3=0.1639\mathrm{,}{\mathit{\text{SFDP}}}_4=\mathrm{0.1004.}\end{array}$$ Step 10. The mean value and variance of SFDP can be calculated. $$\begin{array}{r}\mathit{\text{SFDP}}\overline{\mathit{O}}=0.1234\mathrm{,}{\mathit{S}}_{\mathit{\text{SFDP}}}=\mathrm{0.0307.}\end{array}$$

Table 9

The SFPIS of each alternative.

${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
$\mathrm{(}0.39\mathrm{,}0.08\mathrm{,}0.23\mathrm{)}$	$\mathrm{(}0.49\mathrm{,}0.32\mathrm{,}0.26\mathrm{)}$	$\mathrm{(}0.45\mathrm{,}0.13\mathrm{,}0.36\mathrm{)}$	$\mathrm{(}0.47\mathrm{,}\mathrm{0.39.0.25}\mathrm{)}$

Similarly, the upper limit of SFDP can also be obtained by calculation. $$\begin{array}{r}\mathit{\text{SFHLD}}=\mathrm{0.1849.}\end{array}$$ Step 11. The SFDA was calculated in Table 10.

Table 10

The SFDA.

${\mathit{L}}_1$	${\mathit{L}}_2$	${\mathit{L}}_3$	${\mathit{L}}_4$
0.7669	0.4757	0.8867	0.5433

From the final value of SFDA obtained above, we can get the final scheme ordering as ${\mathit{L}}_2\mathrm{>}{\mathit{L}}_4\mathrm{>}{\mathit{L}}_1\mathrm{>}{\mathit{L}}_3$ . From sorting, we can get ${\mathit{L}}_2$ as the optimal scheme we got, so we finally choose ${\mathit{L}}_2$ as the optimal provider in this activity.

4 Comparative Analysis

In order to verify the correctness of the SF-Taxonomy method, we adopted the examples and original data previously given in the paper, and adopted the SF-TOPSIS (Kutlu Gündoğdu and Kahraman, 2021) and SF-VIKOR (Sharaf, 2021) methods that have been confirmed by scholars for verification. The results obtained by them are compared with those obtained by the method presented in this paper.

4.1 Compared with SF-TOPSIS Method

Step 1. The overall weight matrix is calculated and the SWAM operator is used for aggregation (see Table 11).

Shep 2. Calculate the score function of the overall weight matrix (see Table 12).

Table 11

The overall weight matrix.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	$\mathrm{(}0.21\mathrm{,}0.66\mathrm{,}0.13\mathrm{)}$	$\mathrm{(}0.19\mathrm{,}0.70\mathrm{,}0.16\mathrm{)}$	$\mathrm{(}0.24\mathrm{,}0.64\mathrm{,}0.30\mathrm{)}$	$\mathrm{(}0.24\mathrm{,}0.13\mathrm{,}0.15\mathrm{)}$
${\mathit{L}}_2$	$\mathrm{(}0.21\mathrm{,}0.52\mathrm{,}0.21\mathrm{)}$	$\mathrm{(}0.26\mathrm{,}\mathrm{0.68.0.18}\mathrm{)}$	$\mathrm{(}0.21\mathrm{,}0.73\mathrm{,}0.29\mathrm{)}$	$\mathrm{(}0.41\mathrm{,}0.33\mathrm{,}0.65\mathrm{)}$
${\mathit{L}}_3$	$\mathrm{(}0.27\mathrm{,}0.63\mathrm{,}0.21\mathrm{)}$	$\mathrm{(}0.29\mathrm{,}0.72\mathrm{,}0.30\mathrm{)}$	$\mathrm{(}0.26\mathrm{,}0.73\mathrm{,}0.24\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.12\mathrm{,}0.42\mathrm{)}$
${\mathit{L}}_4$	$\mathrm{(}0.13\mathrm{,}0.52\mathrm{,}0.19\mathrm{)}$	$\mathrm{(}0.25\mathrm{,}0.74\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.16\mathrm{,}0.76\mathrm{,}0.25\mathrm{)}$	$\mathrm{(}0.53\mathrm{,}0.41\mathrm{,}0.23\mathrm{)}$

Step 3. The optimal distance (SFPIS) and the worst distance (SFNIS) are calculated according to the score function (see Table 13).

Table 12

The score function of the overall weight matrix.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\mathit{L}}_1$	−0.233	−0.299	−0.136	0.132
${\mathit{L}}_2$	−0.071	−0.159	−0.264	0.147
${\mathit{L}}_3$	−0.083	−0.145	−0.213	0.101
${\mathit{L}}_4$	−0.149	−0.240	−0.360	0.204

Step 4. Calculate the distance between the overall weight matrix and the SFPIS and the SFNIS (see Table 14).

Table 13

The SFPIS and SFNIS.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
SFNIS	$\mathrm{(}0.37\mathrm{,}0.65\mathrm{,}0.23\mathrm{)}$	$\mathrm{(}0.33\mathrm{,}0.81\mathrm{,}0.28\mathrm{)}$	$\mathrm{(}0.46\mathrm{,}0.71\mathrm{,}0.20\mathrm{)}$	$\mathrm{(}0.42\mathrm{,}0.36\mathrm{,}0.27\mathrm{)}$
SFPIS	$\mathrm{(}0.54\mathrm{,}0.56\mathrm{,}0.15\mathrm{)}$	$\mathrm{(}0.55\mathrm{,}0.63\mathrm{,}0.30\mathrm{)}$	$\mathrm{(}0.57\mathrm{,}0.56\mathrm{,}0.23\mathrm{)}$	$\mathrm{(}0.55\mathrm{,}0.48\mathrm{,}0.26\mathrm{)}$

Step 5. Calculate the closeness ratio of each alternative (SFCR) (see Table 15).

Table 14

The distance between the overall weight matrix and the SFPIS and SFNIS.

	${\mathit{D}}_{\mathit{E}}\mathrm{(}{\mathit{L}}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{X}}_{\mathit{j}}^{-}\mathrm{)}$	${\mathit{D}}_{\mathit{E}}\mathrm{(}{\mathit{L}}_{\mathit{i}\mathit{j}}\mathrm{,}{\mathit{X}}_{\mathit{j}}^{\ast }\mathrm{)}$
${\mathit{L}}_1$	0.033	0.078
${\mathit{L}}_2$	0.078	0.081
${\mathit{L}}_3$	0.068	0.074
${\mathit{L}}_4$	0.074	0.080

Table 15

The closeness ratio of each alternative (SFCR).

	Closeness ratio
${\mathit{L}}_1$	0.2947
${\mathit{L}}_2$	0.4893
${\mathit{L}}_3$	0.4789
${\mathit{L}}_4$	0.4807

According to the above calculation results of SF-TOPSIS method with the same data, we can get the final decision ranking of the scheme is ${\mathit{L}}_2\mathrm{>}{\mathit{L}}_4\mathrm{>}{\mathit{L}}_3\mathrm{>}{\mathit{L}}_1$ . From the ranking of the results, it is not difficult to see that ${\mathit{L}}_2$ is the optimal decision of the scheme, so we will choose ${\mathit{L}}_2$ as the best choice for the company’s activities in the end.

4.2 Comparison with SF-VIKOR Method

As above, we will also directly show the calculation results of SF-VIKOR method here.

Step 1.The decision matrix is aggregated using the SWAM operator.

Step 2. The SFPIS and SFNIS are obtained from the aggregation matrix (see Table 16).

Step 3. The weight distance ${\overline{\mathit{R}}}_{\mathit{i}\mathit{j}}$ is calculated by combining the attribute weight (see Table 17).

Table 16

The SFPIS and SFNIS.

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
SFNIS	(0.24,0.36,0.34)	(0.33,0.41,0.45)	(0.27,0.43,0.45)	(0.40,0.45,0.49)
SFPIS	(0.43,0.18,0.23)	(0.39,0.32,0.26)	(0.45,0.28,0.36)	(0.47,0.39,0.25)

Step 4. The separation measures $\overline{\mathit{R}}$ and ${\overline{\mathit{Q}}}_{\mathit{i}}$ can be obtained (see Table 18).

Table 17

The weight distance ${\overline{\mathit{R}}}_{\mathit{i}\mathit{j}}$ .

	${\mathit{U}}_1$	${\mathit{U}}_2$	${\mathit{U}}_3$	${\mathit{U}}_4$
${\tilde{\mathit{R}}}_{1\mathit{j}}$	0.1977	0.3382	0.0100	0.0141
${\tilde{\mathit{R}}}_{2\mathit{j}}$	0.1877	0.0558	0.0168	0.0523
${\tilde{\mathit{R}}}_{3\mathit{j}}$	0.2805	0.4049	0.0117	0.0483
${\tilde{\mathit{R}}}_{4\mathit{j}}$	0.2836	0.3740	0.0229	0.0160

Step 5. Sort $\overline{\mathit{R}}$ and $\overline{\mathit{S}}$ , then determine ${\overline{\mathit{S}}}^{+}$ , ${\overline{\mathit{S}}}^{-}$ and ${\overline{\mathit{R}}}^{+}$ , ${\overline{\mathit{R}}}^{-}$ (see Table 19).

Table 18

The separation measures $\overline{\mathit{R}}$ and ${\overline{\mathit{Q}}}_{\mathit{i}}$ .

	${\mathit{P}}_1$	${\mathit{P}}_2$	${\mathit{P}}_3$	${\mathit{P}}_4$
$\overline{\mathit{R}}$	0.3382	0.1877	0.4049	0.3740
$\overline{\mathit{S}}$	0.5599	0.3127	0.7455	0.6966

Step 6. Finally, ${\overline{\mathit{Q}}}_{\mathit{i}}$ can be calculated to obtain scheme ordering. Take $\mathit{\nu }=0$ (Opricovic, 1998) in the following calculation (see Table 20).

Table 19

The ${\overline{\mathit{S}}}^{+}$ , ${\overline{\mathit{S}}}^{-}$ and ${\overline{\mathit{R}}}^{+}$ , ${\overline{\mathit{R}}}^{-}$ .

${\overline{\mathit{R}}}^{+}$	0.1877	${\overline{\mathit{R}}}^{-}$	0.4049
${\overline{\mathit{S}}}^{+}$	0.3127	${\overline{\mathit{S}}}^{-}$	0.7455

Table 20

The ${\overline{\mathit{Q}}}_{\mathit{i}}$ .

${\overline{\mathit{Q}}}_1$	${\overline{\mathit{Q}}}_2$	${\overline{\mathit{Q}}}_3$	${\overline{\mathit{Q}}}_4$
0.6320	0.0000	1.0000	0.8723

According to ${\overline{\mathit{Q}}}_{\mathit{i}}$ , it can be concluded that its ranking is ${\overline{\mathit{Q}}}_2\mathrm{<}{\overline{\mathit{Q}}}_3\mathrm{<}{\overline{\mathit{Q}}}_1\mathrm{<}{\overline{\mathit{Q}}}_4$ , so the ranking of the scheme is ${\mathit{L}}_2\mathrm{>}{\mathit{L}}_3\mathrm{>}{\mathit{L}}_1\mathrm{>}{\mathit{L}}_4$ . Therefore, it can be seen that ${\mathit{Z}}_2$ is the optimal scheme.

4.3 Comparative Analysis

In order to more clearly and intuitively see the results of these two methods and the SF-Taxonomy method, the results are shown in Table 21.

Table 21

The comparative analysis result.

Methods	Consequences
SF-TAXONOMY	${\mathit{L}}_2\mathrm{>}{\mathit{L}}_4\mathrm{>}{\mathit{L}}_1\mathrm{>}{\mathit{L}}_3$
SF-TOPSIS	${\mathit{L}}_2\mathrm{>}{\mathit{L}}_4\mathrm{>}{\mathit{L}}_3\mathrm{>}{\mathit{L}}_1$
SF-VIKOR	${\mathit{L}}_2\mathrm{>}{\mathit{L}}_3\mathrm{>}{\mathit{L}}_1\mathrm{>}{\mathit{L}}_4$

In order to improve the accuracy of comparison, we used the same case above to conduct a comparative study on the SF-TOPSIS method and the SF-VIKOR method, and found that the SF-Taxonomy method formed by applying the Taxonomy method in the SFS environment in this paper was objective and effective. The optimal solution is consistent when the optimal decision is made. There was little difference in the rankings for the rest. In the research of SF-Taxonomy method, entropy weight method is introduced to calculate the objective weight because the attribute weight is unknown, so as to make the result more accurate and objective.

5 Conclusion

Through the study of SFSs by scholars and the application of Taxonomy method in other backgrounds, this paper combines Taxonomy method with SFSs to form a new method to solve the multi-attribute decision problem in SFSs environment. In this paper, the concrete steps of SF-Taxonomy method are given. In order to make readers understand the method more clearly, the paper also gives the relevant calculation example analysis. In order to verify the correctness of such methods, the SF-TOPSIS method and the SF-VIKOR method, which have been confirmed by scholars, were compared in the following part of the paper, and relevant comparative analysis was made. The optimal scheme obtained by them in comparison is consistent, which confirms the correctness of this method. In the future, this approach could also have important applications in other contexts.