Abstract
One of the most significant and complete approaches to accommodate greater uncertainty than current fuzzy structures is the T-Spherical Fuzzy Set (TSPFS). The primary benefit of TSPFS is that current fuzzy structures are special cases of it. Firstly, some novel TSPF power Heronian mean (TSPFPHM) operators are initiated based on Aczel–Alsina operational laws. These aggregation operators (AOs) have the capacity to eliminate the impact of uncomfortable data and can simultaneously consider the relationships between any two input arguments. Secondly, some elementary properties and core cases with respect to parameters are investigated and found that some of the existing AOs are special cases of the newly initiated aggregation operators. Thirdly, based on these AOs and Aczel–Alsina operational laws a newly advanced technique for order of preference by similarity to ideal solution (TOPSIS)-based method for dealing with multi-attribute group decision-making (MAGDM) problems in a T-Spherical fuzzy framework is established, where the weights of both the decision makers (DMs) and the criteria are completely unknowable. Finally, an illustrative example is provided to evaluate and choose the pharmaceutical firms with the capacity for high-quality, sustainable development in the TSPF environment to demonstrate the usefulness and efficacy. After that, the comparison analysis with other techniques is utilized to demonstrate the coherence and superiority of the recommended approach.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction
Multi-attribute group decision-making (MAGDM)/multiple attribute decision making (MADM) has been increasingly important in recent research environments for decision support systems [1,2,3,4,5,6,7]. The international economy has grown quickly with the emergence and strengthening of global economic integration. However, fast economic expansion has also brought forth several issues with social stability, ecological governance, and environmental conservation. The preservation of a beautiful environment and ecological balance is a crucial assurance for the growth of the green economy at the same time as rapid economic development. To enhance the quality of economic growth, it is crucial to examine businesses from the standpoint of sustainable and high-quality development ability [8]. The assessment of firms with sustainable and high-quality development ability may be viewed as a multi-criteria group decision-making (MCGDM) problem since the process of assessment incorporates criteria for assessment of several aspects and experts and academics in various domains. Although researchers have proposed numerous models to address these issues, the results above seldom take into account elements like expert judgement and the unpredictability and incompleteness of the decision environment. Therefore, to offer assessment specialists with rational, empirical decision assistance, it is important to develop a model for assessment in a fuzzy uncertainty environment (Fig. 1).
It might be challenging for specialists to convey their preferences through precise values in the analysis of practical choice difficulties when dealing with complicated and unclear decision-making challenges. A novel mathematical technique known as the fuzzy set (FS) [9] is proposed to use membership degree (MD) to represent uncertain information, but it is constrained by the objective complexity of decision-making issues and the constraints of decision makers' subjective comprehension. The intuitionistic fuzzy set (IFS) [10] theory is created to more properly express unreliable data by adding non-membership degree (N-MD) and hesitation degree (HD) on the framework of FS, which addresses the impediment that FS only employs MD for expressing fuzzy information. Currently, intuitionistic fuzziness research has produced useful discoveries and has been utilized extensively in several disciplines [11,12,13,14,15,16]. Despite extensive research and solutions to several uncertain decision and assessment problems, IFSs are unable to represent ambiguous and contradictory information. Then, Yager [17] introduced the Pythagorean fuzzy (PyF) set, which is distinguished by the positive and negative membership grades, and which meets the requirement that the square sum of the specified functions is less than or equal to one. PyFS fuzzy fails in some instances, when the total of squares of both positive and negative membership grades is larger than 1. To overawe, this imperfection of PyFS, Yager [18] proposed a new concept called q-rung orthopair fuzzy set (Q-ROFS), which is characterized by positive and negative MDs, that satisfy the requirement that the qth (q > 0) power sum of the specified functions be less than or equal to one. Researchers from several fields were drawn to the use of Q-ROFS in different fields [19,20,21,22,23].
Yet, there are still instances when human opinions have several consequences, such as in electoral systems where there are four options: vote for, abstain, and refuse. Cuong and Kreinovich [24] presented picture fuzzy sets (PFSs) as a solution to this sort of issue, where the total of the MD, abstinence degree (AD), and N-MD is less than or equal to 1. The PFSs were further developed by Ashraf et al. [25], Gündoğdu et al. [26], and Mahmood et al. [27] to include spherical fuzzy sets (SPFSs) and T-spherical fuzzy sets (TSPFSs). The square sum of MD, AD, and N-MD does not exceed one in SPFSs, while the qth power sum of MD, AD, and N-MD does not exceed one in TSPFSs. TSPFSs, that have a wider viable domain than conventional FSs, can be utilized to describe unreliable and ambiguous information more correctly and effectively. Since its introduction, TSPFS have already seen significant expansion. Garg et al. [28] proposed some power aggregation operators and apply them to solve MADM problems. Wu et al. [29] introduced some cosine similarity measures and applied them to pattern recognition. Mahnaz et al. [30] proposed some entropy measures and Frank aggregation operators and applied them to solve MADM problems. Garg et al. [31] proposed some interactive aggregation operators and apply them to solve MADM problems. Ullah et al. [32] introduced some Hamacher aggregation operators and are utilized to evaluate the effectiveness of search and rescue robots utilizing a MAD technique because of how well they perform under pressure. Khan et al. [33] proposed some Schweizer–Sklar power Heronian mean operators for TSPFS and applied them to solve MAGDM problems. Numerous scholars have recently progressed in distance and similarity measures [6, 34,35,36,37] and developed various techniques [38,39,40,41,42] for different fuzzy structures and applied them to solve MADM/MAGDM in various fields. Recently, Hussain et al. [43] initiated some Aczel–Alsina operational laws for TSPFS, based on these operational laws various Aczel–Alsina aggregation operators are developed and applied them to solve MADM problems.
The development of decision analysis using various decision techniques is the most significant MCGDM process. Numerous approaches for making decisions have been developed in the literature throughout the years, with Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) being one of the most well-known and widely employed. TOPSIS was introduced by Hwang and Yoon [44] to deal with MADM problems. The optimal alternative in MADM problems is the one where the distance between it and the positive ideal solution (POIS) is the shortest and the distance between it and the negative ideal solution (NOIS) is the greatest. The TOPSIS employing the FS environment to solve the MADM problems was presented by Chen in [45]. Numerous academics have recently developed an interest in TOPSIS and used it to actual MADM/MAGDM problems under various extended FS structures [5, 46,47,48,49] in the decision sciences. It should also be noted that the current TOPSIS algorithms have the limitation that to solve MADM problems, either DMs weights [50] or criteria weights [51, 52] are known, or both [53, 54]. Some researchers assigned unknown weight information to DMs [55, 56] with known criterion weights. Instead, other researchers solved MCGDM difficulties using DMs with known weights to manage uncertain criterion weights.
As a result of the above-mentioned discussion, to provide a new enlarged TOPSIS technique in a TSPF environment, allowing us to take advantages of the TOPSIS method, TSPFS and TSPF power Heronian mean operators. As the TSPFS is the generalized version of the current different structures of FS, including IF sets, PyF sets, and PF sets, TSP-SF sets may handle more uncertainty than FS, IF sets, PyF sets, and PF sets. To deal with such conditions of unknown weight information for both DMs and criterion weights and to solve the MAGDM problems after computing all the weights, a unique enhanced TOPSIS-based algorithm is created in this study. Selecting the optimum viewpoint that is better related to each DMs matrix is crucial for solving the MADM/MAGDM problems. In the approach shown, the ideal opinion is selected using the TSPF Aczel–Alsina power Heronian mean operators/geometric Heronian mean operators. The distance measures and entropy measure are also utilized in the proposed T-spherical fuzzy TOPSIS (TSPF TOPSIS) for addressing MAGDM problems to determine the criterion weights under the TSPF information.
The rest of the article is arranged as follows. In “Preliminaries”, some basic definitions and results related to our work are given. In “T-spherical fuzzy Aczel–Alsina power Heronian mean operators”, TSPFAAPHM operator and TSPFAAPGHM operator, core properties and some special cases with respect to the parameters are initiated. In “The TSFAAWPHM operator and TSFAAWPGHM operators”, the weighted forms of the said aggregation operators are given. In “T-Spherical Fuzzy MAGDM Model Based on Improved T-Spherical Fuzzy TOPSIS”, MAGDM model and TSPF TOPSIS approach is initiated based on these aggregation operators. In “Illustrative example”, an illustrative example is given to show the effectiveness and practicality of the proposed approach. In “TSPF TOPSIS approached based on TSPFAAPWGHM operators”, the same example is solved with the same technique, instead of using the TSPFAAWPHM operator, the TSPFAAWPGHM operator is used. In Effect of the parameters N,\(Q,{\mathbb{R}}\) and q on final ranking results, comparisons with some existing approaches are investigated. Finally, conclusion and future work and references are given.
Preliminaries
In this portion, some core definitions, and results about TSPFSs, Aczel–Alsina TN and TC-N have been discussed.
TSPFS and their operational laws
Definition 1
[27] Suppose that the universe of discourse is symbolized by \(\mathfrak{B}\) and \(\mathfrak{E} \in {\mathbb{A}}\) be any element. Then, a TSPFS \(\widetilde{TS}\) in the universe of discourse is symbolized by.
where \(A_{{\widetilde{TS}}} ,I_{{\widetilde{TS}}}\) and \(F_{{\widetilde{TS}}}\) respectively, articulated the membership grade, indeterminacy grade and the non-membership grade of \(\mathfrak{E}\) in the TSPFS \(\widetilde{TS}\) such that \(0 \le A_{{\widetilde{TS}}} (\mathfrak{E}),I_{{\widetilde{TS}}} (\mathfrak{E}),F_{{\widetilde{TS}}} (\mathfrak{E}) \le 1\) with the condition \(0 \le \left( {A_{{\widetilde{TS}}} (\mathfrak{E})} \right)^{q} + \left( {I_{{\widetilde{TS}}} (\mathfrak{E})} \right)^{q} + \left( {F_{{\widetilde{TS}}} (\mathfrak{E})} \right)^{q} \le 1\left( {q > 0} \right)\). The hesitancy grade \(\widetilde{E}_{{\widetilde{TS}}} (\oe )\) of the member \(\oe\) in the TSPFS \(\widetilde{TS}\) is demarcated by \(\widetilde{E}_{{\widetilde{TS}}} (\mathfrak{E}) = \left( {1 - \left( {A_{{\widetilde{TS}}} (\mathfrak{E})} \right)^{q} - \left( {I_{{\widetilde{TS}}} (\mathfrak{E})} \right)^{q} - \left( {F_{{\widetilde{TS}}} (\mathfrak{E})} \right)^{q} } \right)\), satisfying \(0 \le \widetilde{E}_{{\widetilde{TS}}} (\mathfrak{E}) \le 1\) and \(\mathfrak{E} \in {\mathbb{A}}\).
The pair \(\left\langle {A_{{\widetilde{TS}}} (\mathfrak{E}),I_{{\widetilde{TS}}} (\mathfrak{E}),F_{{\widetilde{TS}}} (\mathfrak{E})} \right\rangle\) was named TSPFN by Mahmood et al. [27] and is denoted \(S = \left\langle {A,I,F} \right\rangle\) satisfying the condition \(0 \le A,I,F \le 1\) with the axiom \(0 \le \left( A \right)^{q} + \left( I \right)^{q} + \left( F \right)^{q} \le 1\left( {q > 0} \right).\)
To compare two TSPFNs, the score function and accuracy function are determined as:
Definition 2
[27] The score function \(\overline{\overline{SC}} \left( S \right)\) and accuracy function \(\overline{\overline{AY}} \left( S \right)\) of a TSPFN \(S = \left\langle {A,I,F} \right\rangle\) can be emitted as.
For rating the TSPFNs, Liu and Wang [27] devised a comparative approach based on the score and exactness function, which is expressed as:
Definition 3
[27] Suppose that the two TSPFNS are \(S_{1} = \left\langle {A_{1} ,I_{1} ,F_{1} } \right\rangle\) and \(S_{2} = \left\langle {A_{2} ,I_{2} ,F_{2} } \right\rangle\). Let \(\overline{\overline{SC}} \left( {S_{1} } \right)\),\(\overline{\overline{SC}} \left( {S_{2} } \right)\) be the score functions and \(\overline{\overline{AY}} \left( {S_{1} } \right),\overline{\overline{AY}} \left( {S_{2} } \right)\) be the accuracy functions of \(S_{i} \,\,\left( {i = 1,2} \right)\) respectively. Then.
(1) \(\overline{\overline{SC}} \left( {S_{1} } \right)\) < \(\overline{\overline{SC}} \left( {{S}_{2} } \right)\), then \(S_{1} < S_{2}\);
(2) \(\overline{\overline{SC}} \left( {S_{1} } \right)\) > \(\overline{\overline{SC}} \left( {S_{2} } \right)\), then \(S_{1} > S_{2}\);
(3) \(\overline{\overline{SC}} \left( {S_{1} } \right)\) = \(\overline{\overline{SC}} \left( {S_{2} } \right)\), then;
(i) \(\overline{\overline{AY}} \left( {S_{1} } \right)\) < \(\overline{\overline{AY}} \left( {S_{2} } \right)\), then \(S_{1} < S_{2}\);
(ii) \(\overline{\overline{AY}} \left( {S_{1} } \right)\) > \(\overline{\overline{AY}} \left( {S_{2} } \right)\), then \(S_{1} > S_{2}\);
(iii) \(\overline{\overline{AY}} \left( {S_{1} } \right)\) = \(\overline{\overline{AY}} \left( {S_{2} } \right)\), then \(S_{1} = S_{2}\).
Definition 4
[27] Let \(S = \left\langle {A,I,F} \right\rangle ,S_{1} = \left\langle {A_{1} ,I_{1} ,F_{1} } \right\rangle\) and \(S_{2} = \left\langle {A_{2} ,I_{2} ,F_{2} } \right\rangle\).be any three TSPFNs. The following describes the basic interactions between them.
Considering the Aczel–Alsina (AA) t-norm and t-conorm, we conferred how Aczel–Alsina operations relate to TSPFNs (Table 1).
Defiition 5
[34] Let \(S = \left\langle {A,I,F} \right\rangle ,S_{1} = \left\langle {A_{1} ,I_{1} ,F_{1} } \right\rangle\) and \(S_{2} = \left\langle {A_{2} ,I_{2} ,F_{2} } \right\rangle\) be any three TSPFNs. The following describes the AA interactions between them.
Theorem 1
[34] Let \(S = \left\langle {A,I,F} \right\rangle ,S_{1} = \left\langle {A_{1} ,I_{1} ,F_{1} } \right\rangle\) and \(S_{2} = \left\langle {A_{2} ,I_{2} ,F_{2} } \right\rangle\) be any three TSPFNs. Then, we have.
-
1.
\(S_{1} \oplus S_{2} = S_{2} \oplus S_{1} ;\)
-
2.
\(S_{1} \otimes S_{2} = S_{2} \otimes S_{1} ;\)
-
3.
\({\mathbb{B}}\left( {S_{1} \oplus S_{2} } \right) = {\mathbb{B}}S_{1} \oplus {\mathbb{B}}S_{2} ,\,\,\,\,\,\,\,\,\,\,{\mathbb{B}} > 0;\)
-
4.
\(\left( {{\mathbb{B}}_{1} + {\mathbb{B}}_{2} } \right)S = {\mathbb{B}}_{1} S \oplus {\mathbb{B}}_{2} S,\,\,\,\,\,\,\,\,\,\,{\mathbb{B}}_{1} ,{\mathbb{B}}_{2} > 0;\)
-
5.
\(\left( {S_{1} \otimes S_{2} } \right)^{\mathbb{B}} = S_{1}^{\mathbb{B}} \otimes S_{2}^{\mathbb{B}} ,\,\,\,\,\,\,\,\,\,\,{\mathbb{B}} > 0;\)
-
6.
\(S^{{\left( {{\mathbb{B}}_{1} + {\mathbb{B}}_{2} } \right)}} = S^{{{\mathbb{B}}_{1} }} \otimes S^{{{\mathbb{B}}_{2} }} ,\,\,\,\,\,\,\,\,\,\,{\mathbb{B}}_{1} ,{\mathbb{B}}_{2} > 0.\)
Definition 6
[30] Let \(S\) be a TSPFS. Then, the entropy measure of \(S\) is defined as:
Definition 7
[28] Let \(S_{1} = \left\langle {A_{1} ,I_{1} ,F_{1} } \right\rangle\) and \(S_{2} = \left\langle {A_{2} ,I_{2} ,F_{2} } \right\rangle\) be any two TSPFNs. Then, the distance measure among \(S_{1}\) and \(S_{2}\) is defined as:
PA operator
For aggregation, the PA [48] operator is another important AO that may be used to reduce the negative effects of uncomfortable data on the outcomes of the final ranking process. It is defined as:
Definition 8
[48] Let \(\overline{\overline{\wp }}_{l} \left( {l = 1,2,...,g} \right)\) be a group of positive crisp numbers. Then, the PA operator is quantified as.
where \(T\left( {\overline{\overline{\wp }}_{l} } \right) = \mathop \oplus \nolimits_{m = 1,l \ne m}^{g} {\text{Spt}}\left( {\overline{\overline{\wp }}_{l} ,\overline{\overline{\wp }}_{m} } \right)\),\({\text{Sprt}}\left( {\overline{\overline{\wp }}_{l} ,\overline{\overline{\wp }}_{m} } \right)\) indicates the support for \(\overline{\overline{\wp }}_{l}\) from \(\overline{\overline{\wp }}_{m}\) executing the axioms:
-
1.
\(0 \le {\text{Sprt}}\left( {\overline{\overline{\wp }}_{l} ,\overline{\overline{\wp }}_{m} } \right) \le 1\),
-
2.
\({\text{Sprt}}\left( {\overline{\overline{\wp }}_{l} ,\overline{\overline{\wp }}_{m} } \right) = {\text{Sprt}}\left( {\overline{\overline{\wp }}_{m} ,\overline{\overline{\wp }}_{l} } \right)\) and
-
3.
\({\text{Sprt}}\left( {\overline{\overline{\wp }}_{j} ,\overline{\overline{\wp }}_{h} } \right) \le {\text{Sprt}}\left( {\overline{\overline{\wp }}_{l} ,\overline{\overline{\wp }}_{m} } \right),\) if \(\left| {\overline{\overline{\wp }}_{l} ,\overline{\overline{\wp }}_{m} } \right| \ge \left| {\overline{\overline{\wp }}_{j} ,\overline{\overline{\wp }}_{h} } \right|.\)
The HM operators
For aggregation, The HM [49] operator, which may represent the relationships between the input attributes, is another important AO, and is perceived as:
Definition 9
[49] Let \(\overline{\overline{\mathbb{G}}} = \left[ {0,1} \right],Q,{\mathbb{R}} \ge 0,HM^{p,r} :\overline{\overline{\mathbb{G}}}^{Z} \to \overline{\overline{\mathbb{G}}} ,\) if \(HM^{{Q,{\mathbb{R}}}}\) satisfies.
Then, the function \(HM^{{Q,{\mathbb{R}}}}\) is assumed to be HM operator with parameters \(Q,{\mathbb{R}}\). The HM operator must confirm the characteristics of idempotency, boundedness and monotonicity.
T-spherical fuzzy Aczel–Alsina power Heronian mean operators
In this part, based on the Aczel–Alsina operational laws, several aggregation operators, such as T-Spherical fuzzy Aczel–Alsina power Heronian mean, T-Spherical fuzzy Aczel–Alsina power geometric Heronian mean operators are introduced and several core properties and special cases with respect to the parameters are investigated.
The T-spherical fuzzy Aczel–Alsina power Heronian mean operators
In this subpart, T-Spherical fuzzy Aczel–Alsina power Heronian mean (TSPFAAPHM) operators are introduced, some properties and special cases about generalized parameters are investigated.
Definition 10
Let \(S_{i} = \left\langle {A_{i} ,I_{i} ,F_{i} } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a class of TSPFNs, and \(Q, {\mathbb{R}} \ge 0\). Then, the TSPFAAPHM operator is defined as:
where \(T\left( {S_{i} } \right) = \sum\nolimits_{i = 1,j \ne i}^{\mathbb{V}} {\text{sprt}}\left( {S_{j} ,S_{i} } \right),\,\,{\text{sprt}}\left( {S_{j} ,S_{i} } \right) = 1 - \overline{\overline{{{\text{DIS}}}}} \left( {S_{j} ,S_{i} } \right)\) is the support degree for \(S_{j}\) from \(S_{i}\) sustaining the following requirements:
-
(1)
\({\text{sprt}}\left( {S_{i} ,S_{j} } \right) \in \left[ {0,1} \right]\);
-
(2)
\({\text{sprt}}\left( {S_{j} ,S_{i} } \right) = {\text{sprt}}\left( {S_{i} ,S_{j} } \right)\);
-
(3)
\({\text{sprt}}\left( {S_{i } ,S_{j} } \right) \ge {\text{sprt}}\left( {S_{k} ,S_{l} } \right)\), if \(\overline{\overline{{{\text{DIS}}}}} \left( {S_{i } ,S_{j} } \right) < \overline{\overline{{{\text{DIS}}}}} \left( {S_{k} ,S_{l} } \right)\) in which \(\overline{\overline{{{\text{DIS}}}}} \left( {S_{i } ,S_{j} } \right)\) is the distance measure between two TSPFNs.
To write Eq. (18), in a simplified form, we can denote,
By utilizing Eq. (19), Eq. (18) becomes
Theorem 2
Let \(S_{i} = \left\langle {A_{i} ,I_{i} ,F_{i} } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a group of an TSPFNs. Then, the result obtained by using Eq. (20) is still TSFNs, and.
Proof
Based on Aczel–Alsina operational laws for TSPFNs, we have.
and
Similarly,
So,
Let \({\ddot{Y}} = 1 - e^{{ - \left( {Q\left( { - \ln \left( {1 - e^{{ - \left( {{\mathbb{V}}\Im_{i } \left( { - \ln \left( {1 - A_{i }^{q} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} } \right)} \right)^{N} + {\mathbb{R}}\left( { - \ln \left( {1 - e^{{ - \left( {{\mathbb{V}}\Im_{j} \left( { - \ln \left( {1 - A_{j}^{q} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} ,\) then \(\ln \left( {1 - {\ddot{Y}} } \right) = - \left( {Q\left( { - \ln \left( {1 - e^{{ - \left( {{\mathbb{V}}\Im_{i} \left( { - \ln \left( {1 - A_{i}^{q} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} } \right)} \right)^{N} + {\mathbb{R}}\left( { - \ln \left( {1 - e^{{ - \left( {{\mathbb{V}}\Im_{j} \left( { - \ln \left( {1 - A_{j}^{q} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} } \right)} \right)^{N} } \right)^{\frac{1}{N}}\).
Utilizing this, we have
Therefore,
Hence,
Theorem 3
(Idempotency) Let \(Q \ge 0,{\mathbb{R}} \ge 0\), and \(Q,{\mathbb{R}}\) can only accept one 0 value at a time, \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \left( {i = 1,2,....,{\mathbb{V}}} \right)\) be a group of TSPFNs and \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle = S = \left\langle {A,I,F} \right\rangle \left( {i = 1,2,...,{\mathbb{V}}} \right)\). Then
Proof
Since \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle = S = \left\langle {A,I,F} \right\rangle \left( {i = 1,2,...,{\mathbb{V}}} \right)\), we have.
\({\text{Sprt}}\left( {S_{i } ,S_{j} } \right) = 1\left( {\forall i,j = 1,2,...,{\mathbb{V}}} \right)\), so \(\Im_{i } = 1\left( {\forall i = 1,2,...,{\mathbb{V}}} \right)\) and \({\mathbb{V}}\Im_{i } = {\mathbb{V}}\frac{1}{\mathbb{V}} = 1\left( {\forall i = 1,2,...,{\mathbb{V}}} \right)\). Then
.
Theorem 4
(Commutativity) Let \(\left( {S^{\prime}_{1} ,S_{2}^{\prime } ,...,S_{\mathbb{V}}^{\prime } } \right)\) be any permutation of \(\left( {S_{1} ,S_{2} ,...,S_{\mathbb{V}} } \right)\). Then
Proof
Since \(\left( {S^{\prime}_{1} ,S_{2}^{\prime } ,...,S_{\mathbb{V}}^{\prime } } \right)\) is any permutation of \(\left( {S_{1} ,S_{2} ,...,S_{\mathbb{V}} } \right)\). So,
Theorem 5
(Boundedness) Let \(S_{i} = \left\langle {A_{i} ,I_{i} ,F_{i} } \right\rangle \left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a group of TSPFNs, \(S^{ - } = \left\langle {\min A_{i} ,\max I_{i} ,\max F_{i} } \right\rangle\) and \(S^{ + } = \left\langle {\max A_{i} ,\min I_{i} ,\min F_{i} } \right\rangle\). Then
Proof
By the comparison rules defined in Definition 3, then utilizing on Theorems 3 and 4, we have
Similarly, we can have
Therefore, we can have.
Hence, we can get.
By allocating distinct values to the parameters \(q,Q,{\mathbb{R}}\) various aggregation operators are obtained as a special case of the initiated aggregation operators.
1. If \(q = 1,\) then the TSPFAAPHM operators degenerates to the picture FAAPHM operators which can be expressed as follows:
2. If \(q = 2\), then the TSPFAAPHM operators degenerates to the SFAAPHM operators which can be expressed as follows:
3. If \({\mathbb{R}} \to 0,\) then the TSPFAAPHM operator degenerates to the TSFAA descending power average operator, which can be expressed as follows:
4. If \(Q \to 0,\) then the TSPFAAPHM operator degenerates to the TSFAA ascending power average operator, which can be expressed as follows:
5. If \({\mathbb{R}} \to 0,\) and \(sprt\left( {S_{i} ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPHM operator degenerates to the TSPFAA linear descending WA operator, which can be defined as follows:
6. If ¥ → 0, and \({\text{Sprt}}\left( {S_{i} ,S_{j} } \right) = c\left( {c \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPHM operator degenerates to the TSFAA linear Ascending WA operator, which can be defined as follows:
7. If \(Q = {\mathbb{R}} = \frac{1}{2},\) and \(Sprt\left( {S_{i} ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPHM operator degenerates to the TSFAA basic HM operator, which can be defined as follows:
8. If \(Q = {\mathbb{R}} = 1,\) and \(Sprt\left( {S_{i} ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPHM operator degenerates to the TSPFAA linear HM operator, which can be defined as follows:
The T-spherical fuzzy Aczel–Alsina power geometric Heronian mean operators
In this subpart, T-Spherical fuzzy Aczel–Alsina power Heronian mean (TSPFAAPGHM) operators are introduced, some properties and special cases about generalized parameters are investigated.
Definition 11.
Let \(S_{i} = \left\langle {A_{i} ,I_{i} ,F_{i} } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a group of an TSFNs, and \(Q, {\mathbb{R}} \ge 0\). Then, the TSFAAPGHM is defined as:
where \(T( {S_{i} }) = \sum\nolimits_{i = 1,j \ne i}^{\mathbb{V}} {\text{Sprt}}\left( {S_{j} ,S_{i} } \right),\,\,{\text{Sprt}}\left( {S_{j} ,S_{i} } \right) = 1 - \overline{\overline{{{\text{DIS}}}}} (S_{j}, S_{i})\) is the support degree for \(S_{j}\) from \(S_{i }\) sustaining the following requirements:
-
(1)
\({\text{Sprt}}\left( {S_{i} ,S_{j} } \right) \in \left[ {0,1} \right]\);
-
(2)
\({\text{Sprt}}\left( {S_{j} ,S_{i} } \right) = {\text{Sprt}}\left( {S_{i} ,S_{j} } \right)\);
-
(3)
\({\text{Sprt}}\left( {S_{i} ,S_{j} } \right) \ge {\text{Sprt}}\left( {S_{k} ,S_{l} } \right)\), if \(\overline{\overline{{{\text{DIS}}}}} \left( {S_{i} ,S_{j} } \right) < \overline{\overline{{{\text{DIS}}}}} \left( {S_{k} ,S_{l} } \right)\) in which \(\overline{\overline{{{\text{DIS}}}}} \left( {S_{i} ,S_{j} } \right)\) is the distance measure between two TSFNs.
To write Eq. (33), in a simplified form, we can denote,
By Utilizing Eq. (34), Eq. (33) becomes
Theorem 6
Let \(S_{i} = \left\langle {A_{i} ,I_{i} ,F_{i} } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a group of an TSPFNs. Then, the result obtained by using Eq. (35) is still TSFNs, and.
Proof
Based on Aczel–Alsina operational laws for TSPFNs, we have
and
Similarly,
So,
Let \({\ddot{Y}} = 1 - e^{{ - \left( {Q\left( { - \ln \left( {1 - e^{{ - \left( {{\mathbb{V}}\Im_{i } \left( { - \ln \left( {1 - A_{i }^{q} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} } \right)} \right)^{N} + {\mathbb{R}}\left( { - \ln \left( {1 - e^{{ - \left( {{\mathbb{V}}\Im_{j} \left( { - \ln \left( {1 - A_{j}^{q} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} } \right)} \right)^{N} } \right)^{\frac{1}{N}} }} ,\) then \( \ln \left( {1 - \ddot{Y}} \right) = - \left( {Q\left( { - \ln \left( {1 - e^{{ - \left( {\mathbb{V}\Im _{i} \left( { - \ln \left( {1 - A_{i} ^{q} } \right)} \right)^{N} } \right)^{{\frac{1}{N}}} }} } \right)} \right)^{N} + \mathbb{R}\left( { - \ln \left( {1 - e^{{ - \left( {\mathbb{V}\Im _{j} \left( { - \ln \left( {1 - A_{j} ^{q} } \right)} \right)^{N} } \right)^{{\frac{1}{N}}} }} } \right)} \right)^{N} } \right)^{{\frac{1}{N}}} \). Utilizing this, we have
Therefore,
Hence,
.
Theorem 7
(Idempotency) Let \(Q \ge 0,{\mathbb{R}} \ge 0\), and \(Q,{\mathbb{R}}\) can only accept one 0 value at a time, \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \left( {i = 1,2,....,{\mathbb{V}}} \right)\) be a group of TSPFNs and \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle = S = \left\langle {A,I,F} \right\rangle \left( {i = 1,2,...,{\mathbb{V}}} \right)\). Then
Theorem 8
(Commutativity) Let \(\left( {S^{\prime}_{1} ,S_{2}^{\prime } ,...,S_{\mathbb{V}}^{\prime } } \right)\) be any permutation of \(\left( {S_{1} ,S_{2} ,...,S_{\mathbb{V}} } \right)\). Then
Theorem 9
(Boundedness) Let \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \left( {i = 1,2,....,{\mathbb{V}}} \right)\) be a collection of TSPFNs, \(S^{ - } = \left\langle {\min A_{i} ,\max I_{i} ,\max F_{i} } \right\rangle\) and \(S^{ + } = \left\langle {\max A_{i} ,\min I_{i} ,\max F_{i} } \right\rangle\). Then
By allocating distinct values to the parameters \(q,Q\,\,and\,\,{\mathbb{R}}\) various aggregation operators are obtained as a special case of the initiated aggregation operators.
1. If \(q = 1,\) then the TSPFAAPGHM operators degenerates to the picture FAAPGHM operators which can be expressed as follows:
2. If \(q = 2\), then the TSPFAAPGHM operators degenerates to the SFAAPGHM operators which can be expressed as follows:
3. If \({\mathbb{R}} \to 0,\) then the TSPFAAPGHM operator degenerates to the TSFAA descending power geometric average operator, which can be expressed as follows:
4. If \(Q \to 0,\) then the TSPFAAPHM operator degenerates to the TSPFAA ascending power average operator, which can be expressed as follows:
5. If \({\mathbb{R}} \to 0,\) and \(Sprt\left( {S_{i } ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPGHM operator degenerates to the TSPFAA linear descending WGA operator, which can be defined as follows:
6. If \(Q \to 0,\) and \(Sprt\left( {S_{i } ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPGHM operator degenerates to the TSPFAA linear Ascending WGA operator, which can be defined as follows:
7. If \(Q = {\mathbb{R}} = \frac{1}{2},\) and \(Sprt\left( {S_{i } ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPGHM operator degenerates to the TSPFAA basic GHM operator, which can be defined as follows:
8. If \(Q = {\mathbb{R}} = 1,\) and \(Sprt\left( {S_{i } ,S_{j} } \right) = u\left( {u \in \left[ {0,1} \right]} \right)\left( {\forall i \ne j} \right),\) then the TSPFAAPGHM operator degenerates to the TSPFAA linear GHM operator, which can be defined as follows:
The TSFAAWPHM operator and TSFAAWPGHM operators
In this portion, the weighted forms of the initiated aggregation operators are introduced by considering the weights of the attributes.
Definition 12
Let \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a class of an TSPFNs,\(Q,{\mathbb{R}} \ge 0\) and \({\mathbb{N}} = \left( {{\mathbb{N}}_{1} ,{\mathbb{N}}_{2} ,...,{\mathbb{N}}_{\mathbb{V}} } \right)^{T}\) be the importance degree of \(S_{i } \left( {i = 1,2,...,{\mathbb{V}}} \right),\) where \({\mathbb{N}}_{i} \ge 0\,\,\,and\,\,\,\sum\nolimits_{i = 1}^{\mathbb{V}} {{\mathbb{N}}_{i} = 1}\). Then, the TSPFAAWPHM is defined as:
where \(T\left( {S_{i } } \right) = \sum\nolimits_{i = 1,j \ne i}^{\mathbb{V}} {Sprt\left( {S_{j} ,S_{i} } \right),\,\,Sprt\left( {S_{j} ,S_{i} } \right) = 1 - \overline{\overline{DIS}} \left( {S_{j} ,S_{i} } \right)}\) is the support degree for \(S_{j}\) from \(S_{i }\) sustaining the following requirements:
-
(1)
\(Sprt\left( {S_{i} ,S_{j} } \right) \in \left[ {0,1} \right]\);
-
(2)
\(Sprt\left( {S_{j} ,S_{i} } \right) = Sprt\left( {S_{i} ,S_{j} } \right)\);
-
(3)
\(Sprt\left( {S_{i} ,S_{j} } \right) \ge Sprt\left( {S_{k} ,S_{l} } \right)\), if \(\overline{\overline{DIS}} \left( {S_{i} ,S_{j} } \right) < \overline{\overline{DIS}} \left( {S_{k} ,S_{l} } \right)\) in which \(\overline{\overline{DIS}} \left( {S_{i} ,S_{j} } \right)\) is the distance measure between two TSPFNs.
To write Eq. (48), in a simplified form, we can denote,
By utilizing Eq. (49), Eq. (48) becomes
Theorem 10
Let \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a group of an TSPFNs. Then, the result obtained by using Eq. (50) is still TSFNs, and.
Definition 13
Let \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a class of an TSPFNs,\(Q,{\mathbb{R}} \ge 0\) and \({\mathbb{N}} = \left( {{\mathbb{N}}_{1} ,{\mathbb{N}}_{2} ,...,{\mathbb{N}}_{\mathbb{V}} } \right)^{T}\) be the importance degree of \(S_{i } \left( {i = 1,2,...,{\mathbb{V}}} \right),\) where \({\mathbb{N}}_{i} \ge 0\,\,\,and\,\,\,\sum\nolimits_{i = 1}^{\mathbb{V}} {{\mathbb{N}}_{i} = 1}\). Then, the TSFAAWPGHM is defined as:
where \(T\left( {S_{i } } \right) = \sum\limits_{i = 1,j \ne i}^{\mathbb{V}} {Sprt\left( {S_{j} ,S_{i} } \right),\,\,Sprt\left( {S_{j} ,S_{i} } \right) = 1 - \overline{\overline{DIS}} \left( {S_{j} ,S_{i} } \right)}\) is the support degree for \(S_{j}\) from \(S_{i }\) sustaining the following requirements:
-
(4)
\(Sprt\left( {S_{i} ,S_{j} } \right) \in \left[ {0,1} \right]\);
-
(5)
\(Sprt\left( {S_{j} ,S_{i} } \right) = Sprt\left( {S_{i} ,S_{j} } \right)\);
-
(6)
\(Sprt\left( {S_{i} ,S_{j} } \right) \ge Sprt\left( {S_{k} ,S_{l} } \right)\), if \(\overline{\overline{DIS}} \left( {S_{i} ,S_{j} } \right) < \overline{\overline{DIS}} \left( {S_{k} ,S_{l} } \right)\) in which \(\overline{\overline{DIS}} \left( {S_{i} ,S_{j} } \right)\) is the distance measure between two TSPFNs.
To write Eq. (52), in a simplified form, we can denote,
By utilizing Eq. (53), Eq. (52) becomes
Theorem 11
Let \(S_{i } = \left\langle {A_{i } ,I_{i } ,F_{i } } \right\rangle \,\,\left( {i = 1,2,...,{\mathbb{V}}} \right)\) be a group of an TSPFNs. Then, the result obtained by using Eq. (54) is still TSFNs, and.
T-Spherical Fuzzy MAGDM Model Based on Improved T-Spherical Fuzzy TOPSIS
The applications of these operators in the MAGDM will be covered in this section.
T-Spherical Fuzzy MAGDM problem
In this sub-portion, a model is initiated to handle MAGDM problems under T-SPF information. The MAGDM problems can be resolved using a decision matrix, in which the rows denote choices/alternatives, and the columns denote a group of attributes/criteria. Thus for the decision matrix \({\mathbb{M}}_{n \times m}\) assume a group of \(n\) choices \( \left\{ {'\!\gamma_{1} ,'\!\gamma_{2} ,'\!\gamma_{3} ,...,'\!\gamma_{n} } \right\}\) and \(m\) attributes/criteria \(\left\{ {'\!O_{1} ,'\!O_{2} ,'\!O_{3} ,...,'\!O_{m} } \right\}.\) The importance degrees of decision makers and that of attributes/criteria are unknown and are symbolized by \({\mathbb{W}} = \left\{ {{\mathbb{W}}_{1} ,{\mathbb{W}}_{2} ,...,{\mathbb{W}}_{c} } \right\}\) and \({\mathbb{Z}} = \left\{ {{\mathbb{Z}}_{1} ,{\mathbb{Z}}_{2} ,{\mathbb{Z}}_{3} ,...,{\mathbb{Z}}_{m} } \right\}\) respectively, subject to the constrains \({\mathbb{W}}_{g} ,{\mathbb{Z}}_{z} \in \left[ {0,1} \right],\left( {g = 1,2,...,c,z = 1,2...,m} \right)\) with \(\sum\nolimits_{g = 1}^{c} {{\mathbb{W}}_{g} = 1} ,\sum\nolimits_{z = 1}^{m} {{\mathbb{Z}}_{z} = 1}\). Assumed that the T-SPF decision matrix is symbolized by \({\mathbb{M}}^{\zeta } = \left[ {\varsigma_{i j}^{\zeta } } \right]_{n \times m} = \left\langle {A_{i j}^{\zeta } ,I_{i j}^{\zeta } ,F_{i j}^{\zeta } } \right\rangle\), where \(A_{i j}\) epitomizes the degree of the choice/alternative \('\!\gamma_{i }\) indulges the attribute/criteria \('\!O_{j}\) judged by the decision makers (DMs), \(I_{i j}\) epitomizes the degree of the choice/alternative \('\!\gamma_{i }\) is neutral for the attribute/criteria \('\!O_{j}\) judged by the DMs and \(F_{i j}\) epitomizes the degree of the choice/alternative \('\!\gamma_{i }\) does not indulge the attribute/criteria \('\!O_{j}\) judged by the DMs.
Note that none of the information on the DM weights and attribute values is known in the context of decision-making.
Obtaining the T-SPF information
We initially established the expert assessment committee by inviting specialists and intellectuals from related fields to select the most satisfying proposal from the group of proposals. An expert assessment committee is given a translation relation from linguistic concepts to TSPFN mentioned in Table 2, so they may choose the identified strategy according to multiple considerations. Following that, the cognitive preference capability and knowledge background of the specialists are used to obtain the linguistic assessment information of alternatives.
After obtaining the linguistic evaluation data for alternatives, we change the expert committee's recommended preferences to get the TSPF evaluation matrices \({\mathbb{M}}^{\zeta } = \left[ {\varsigma_{i j}^{\zeta } } \right]_{n \times m} = \left\langle {A_{i j}^{\zeta } ,I_{i j}^{\zeta } ,F_{i j}^{\zeta } } \right\rangle\) (Fig. 2).
The T-SPF-TOPSIS methodology
There are three basic components to the approach. Using the suggested aggregation operators, we determine the decision makers' weights in the first section. In the second section, the suggested aggregation operators and entropy measure are addressed in relation to computing the weights of the criterion. The last section uses a rating system based on how closely each solution matches the ideal one in terms of PIS and NIS.
The following procedures are provided to solve the T-Spherical fuzzy MAGDM issue utilizing a TOPSIS-based methodology.
Step 1. The decision matrices \({\mathbb{M}}_{n \times m}^{\zeta }\) should be normalized. In a MAGDM issue, the benefit type criterion and the cost type criteria are typically the two types of characteristics. The following equation converts the cost type criteria to benefit type criteria to harmonies the criterion:
where \(C_{B}\) represent benefit type criteria and \(C_{Co}\) represent cost type criteria.
Step 2. Generate the supports.
where \( \overline{\overline{DIS}} \left( {'\!\gamma_{i j}^{\zeta } ,'\!\gamma_{i j}^{h} } \right)\) is the distance measure given in Definition (7).
Step 3. Generate \( T\left( {'\!\gamma_{i j}^{\zeta } } \right)\)
Step 4. Generate the weight vector \({\mathbb{W}}_{i j}^{\zeta }\) of power operator associated with the TSPFN \('\!\gamma_{i j}^{\zeta }\),
Step 5 (a). The optimal group decision ideal solution (GDEIS) should be calculated by taking the average of all the opinions of each individual DMs, since it is closer to the GDEIS than any one DM's opinions. Therefore, in this stage, instead of taking average of all opinions, we compute the GDEIS by using the T-SPFWPHM values of alternatives that meet the criteria provided by decision makers and considering the same weighting of the DM's values as follows.
where \({\mathbb{W}}_{i } = \frac{1}{t}\) and
Step 5 (b). Do the following computations to determine the group right optimal decision (GROD) and group left optimal decision (GLOD):
Step 5 (c). This stage involves determining the decision matrices distances from GDEIS, GROD, and GLOD using Definition 10. The distances are represented symbolically by the inscriptions DGDEIS, DGROD, and DGLOD. Where
where \(i = 1,2,...,m,\,\,\zeta = 1,2,3,...,t\) and \({'\!\!A}\) is generalized parameter.
Step 5 (d). In this stage, we compute the closeness indicators (CIs) using the Yue model [46] in the manner described below.
for \(\zeta = 1,2,3,...,t\).
Step 5 (e). In this stage, the weights of DMs are computed as follows:
Step 6 (a). Generate the weight vector \('\Omega_{i j}^{\zeta }\) of power operator associated with the TSPFN \('\!\gamma_{i j}^{\zeta }\),
Step 6 (b). In this stage, with the TSPF entropy measure, compute the updated group decision (UGDOS) as follows to get the weights of the attributes. (\( {\mathbb{W}}_{i }^{\zeta } ='\Omega{i j}^{\zeta }\))
Step 6(c). Utilizing Definition 6, to compute the T-SPF entropy measure of each attribute as follows:
Step 6 (d). Attributes weights are computed as follows:
Step 7 (a). Utilizing the weights of the attributes, compute the weighted normalized decision matrices by the following formula:
Step 7 (b). Utilizing NWD matrices \(\overline{\overline{NWDM}} \left( {\Xi_{i j}^{\zeta } } \right)\), calculate the positive optimal matrix (POM) and negative optimal matrix (NOS) for decision matrices by the following formula:
Step 8. Utilizing Definition 7 to calculate the distances of NWD matrices to POS and NOS by the following formula:
Step 9. In this stage, we compute the revised closeness indicators (CIs) the following formula:
Step 10. In this stage, the final FCIs are computed by the following formula follows:
Sort the computed FRCI values in descending order; the option with the highest value is the best option.
Illustrative example
To confirm the viability and applicability of the suggested group decision framework, this section makes use of the newly introduced TSPF TOPSIS group decision method based on TSPFAAPWHM operators for evaluating and selecting a suitable pharmaceutical enterprise, who have a sustainable and high-quality development capability. To demonstrate the reliability and dominance on their own, sensitivity analysis and contrast research are also used.
Numerous difficulties have been brought about by the rapid spread of COVID-19 for public health defense, fiscal growth, and human production life. Currently, scientists both locally and internationally are working hard to create new medicines to treat crown pneumonia, and they have made some substantial progress. Selecting pharmaceutical companies with sustainable and high-quality development capacity for drug manufacturing and environmental protection is crucial for further mitigating the pandemic. Considering sustainable and high-quality growth, a city's pharmaceutical management agency will select pharmaceutical companies to make medicines. Six regional businesses identified as \( \left\{ {'\!\gamma_{1} ,'\!\gamma_{2} ,...,'\!\gamma_{6} } \right\}\) are chosen as candidate businesses for the assessment committee to choose the best pharmaceutical companies based on several evaluation criteria after undergoing preliminary qualification test and screening. To start, the Pharmaceutical Administration Department formed an assessment committee by inviting four specialists \(\left\{ {EX_{1} ,EX_{2} ,EX_{2} ,EX_{2} } \right\}\) from the disciplines of medication research and development, production management, and sustainable economic growth. Second, seven assessment criteria \( \left\{ {'\!O_{1} ,'\!O_{2} ,'\!O_{3} ,...,'\!O_{7} } \right\}\) are chosen as the comprehensive evaluation criteria following a debate among the rating committee members and a review of the body of literature [2, 7]. The descriptions of the criteria are, \('\!O_{1}\) represents effective supply ability, \('\!O_{2}\) represents scientific and technological innovation ability, \('\!O_{3}\) transnational cooperation ability,\('\!O_{4}\) efficient operation ability, \('\!O_{5}\) represents market improvement ability, \('\!O_{6}\) represents green improvement ability, and \('\!O_{7}\) social contribute ability. The expert weight and criterion weight in the assessment process are entirely unknown due to the ambiguity and complexity of the assessment environment, thus experts must offer comparison preferences between the criteria in order to ascertain the subjective weight of the criteria. This part uses the suggested group decision-making technique to rate the six pharmaceutical firms in the area and choose the top six based on the assessment data given by experts. To solve such a decision-making problem, the following steps are to be followed using the proposed approach.
Four experts provide their opinions and assessments of the pharmaceutical companies using the linguistic terms mentioned in Table 2 and the criteria listed above. The linguist term assessment of the experts \(EX_{h} = (h = 1,...,4)\) is given in Tables 3, 4, 5 and 6 below.
Utilizing Table 2, the linguistic term evaluation Tables 3, 4, 5 and 6 are converted to TSPF environment which are listed in Tables 7, 8, 9 and 10 given below.
Step 1. Utilize formula (57), to normalize the cost type attribute. Since all the attributes are of benefit type, there is no need to normalize it.
Step 2. Utilize formula (58), to generate the supports \({\text{Sprt}}\left( {'\!\gamma_{i j}^{gh} ,'\!\gamma_{i j}^{gl} } \right) \quad \left( {g,h,l = 1,...,4,i = 1,2,.,,,7,j = 1,2,...,6} \right)\). Instead of writing \( Sprt\left( {'\!\gamma_{i j}^{gh} ,'\!\gamma_{i j}^{gl} } \right)\), we denote it by \(S_{i j}^{gl}\) which are listed below.
Step 3. Utilize formula (59), to generate \( T\left( {'\!\gamma_{i j}^{g} } \right)\,\,(g = 1,...,4,i = 1,...,6,j = 1,...,7)\). Instead of writing \( T\left( {'\!\gamma_{i j}^{g} } \right)\), we will simply denote it by \(T_{i j}^{g}\) which are listed below.
Step 4. Utilize formula (60), to generate the weight vector \('\!E_{i j}^{g}\) of power operator associated with the TSPFN \('\!\gamma_{i j}^{g}\),
Step 5 (a). Utilize formulas (61) and (62), to compute the GDEIS by using the T-SPFWPHM values of alternatives that meet the criteria provided by decision makers and considering the same weighting of the DM's values which is listed in Table 11 below (Table 12).
\( \begin{gathered}'\!E_{46}^{1} = 0.2640,'\!E_{46}^{2} = 0.2089,'\!E_{46}^{3} = 0.2640,'\!E_{46}^{4} = 0.2631,'\!E_{47}^{1} = 0.2428,'\!E_{47}^{2} = 0.2530,'\!E_{47}^{3} = 0.2530,'\!E_{47}^{4} = 0.2513, \hfill \\'\!E_{51}^{1} = 0.2577,'\!E_{51}^{2} = 0.2274,'\!E_{51}^{3} = 0.2577,'\!E_{51}^{4} = 0.2572,'\!E_{52}^{1} = 0.2590,'\!E_{52}^{2} = 0.2596,'\!E_{52}^{3} = 0.2427,'\!E_{52}^{4} = 0.2387, \hfill \\'\!E_{53}^{1} = 0.2580,'\!E_{53}^{2} = 0.2273,'\!E_{53}^{3} = 0.2580,'\!E_{53}^{4} = 0.2567,'\!E_{54}^{1} = 0.2367,'\!E_{54}^{2} = 0.2591,'\!E_{54}^{3} = 0.2451,'\!E_{54}^{4} = 0.2592, \hfill \\'\!E_{55}^{1} = 0.2542,'\!E_{55}^{2} = 0.2542,'\!E_{55}^{3} = 0.2541,'\!E_{55}^{4} = 0.2376,'\!E_{56}^{1} = 0.2441,'\!E_{56}^{2} = 0.2667,'\!E_{56}^{3} = 0.2667,'\!E_{56}^{4} = 0.2225, \hfill \\'\!E_{57}^{1} = 0.2577,'\!E_{57}^{2} = 0.2577,'\!E_{57}^{3} = 0.2572,'\!E_{57}^{4} = 0.2274,'\!E_{61}^{1} = 0.2531,'\!E_{61}^{2} = 0.2406,'\!E_{61}^{3} = 0.2531,'\!E_{61}^{4} = 0.2531, \hfill \\'\!E_{62}^{1} = 0.2544,'\!E_{62}^{2} = 0.2373,'\!E_{62}^{3} = 0.2539,'\!E_{62}^{4} = 0.2544,'\!E_{63}^{1} = 0.2572,'\!E_{63}^{2} = 0.2577,'\!E_{63}^{3} = 0.2274,'\!E_{63}^{4} = 0.2577, \hfill \\'\!E_{64}^{1} = 0.2543,'\!E_{64}^{2} = 0.2543,'\!E_{64}^{3} = 0.2371,'\!E_{64}^{4} = 0.2543,'\!E_{65}^{1} = 0.2667,'\!E_{65}^{2} = 0.2441,'\!E_{65}^{3} = 0.2225,'\!E_{65}^{4} = 0.2667, \hfill \\'\!E_{66}^{1} = 0.2540,'\!E_{66}^{2} = 0.2540,'\!E_{66}^{3} = 0.2381,'\!E_{66}^{4} = 0.2540,'\!E_{67}^{1} = 0.2565,'\!E_{67}^{2} = 0.2665,'\!E_{67}^{3} = 0.2655,'\!E_{67}^{4} = 0.2115. \hfill \\ \end{gathered}\)
Step 5 (b). Utilize formulas (63) and (64), to determine the GROD and GLOD matrices which are listed in Tables 13 and 14 below.
Step 5 (c). Utilize formulas (65), (66) and (67), to determine distances from GDEIS, GROD, and GLOD which are listed in Tables 15, 16 and 17.
Step 5 (d). Utilize formula (68), to compute the CIs which is listed below.
Step 5 (e). Utilize formula (69), to determine the weights of DMs which are listed below.
Step 6 (a). Utilize formula (70), to generate the weight vector \(\mathcal{J}_{i j}^{g}\) of power operator associated with the TSPFN \('\!\gamma_{i j}^{g}\) which are listed below.
Step 6 (b). Utilize formula (71) to compute the UGDOS which is give in Table 18 below.
Step 6(c). Utilize formula (72), to compute the T-SPF entropy measure of each attribute which is listed below.
Step 6 (d). Utilize formula (73), to compute the attributes weights which is listed below.
Step 7 (a). Utilize formula (74), and the weights of the attributes, to compute the weighted normalized decision matrices which are listed in Tables 19, 20, 21 and 22.
Step 7 (b). Utilize Formula (75), and NWD matrices, to calculate the POIM and NOIM which are listed in Tables 23 and 24.
Step 8. Utilize formula (76), to calculate the distances of NWD matrices to POS and NOS which are listed in Tables 25 and 26.
Step 9. Utilize formula (77), to compute the revised closeness indicators (RCIs) which is listed in Table 27.
Step 10. Use formula (78), to determine the final CIs which is given below.
From the FRCIs values, the best is \('\!\gamma_{6}\), while the worst on is \('\!\gamma_{2}\).
TSPF TOPSIS approached based on TSPFAAPWGHM operators
In this part, we will utilize the same approach to solve the above example. In the above approach, the TSPF-TOPSIS is based on TSPFAAWPHM operators. Here, we will utilize TSPFAAWPGHM operator instead of TSPFAAWPHM operator. The same steps should be followed to solve the above MAGDM problem.
Steps 1 to 4 are the same.
Step 5 (a). The GDEIS should be calculated by taking the average of all the opinions of each individual DMs, since it is closer to the GDEIS than any one DM's opinions. Therefore, in this stage, instead of taking average of all opinions, we compute the GDEIS by using the T-SPFWPGHM values of alternatives that meet the criteria provided by DMs and considering the same weighting of the DM's values as follows which is listed in Table 28.
Step 5 (b). The GROD matrix and the GLOD matrix is given Tables 13 and 14 respectively.
Step 5 (c). Utilize formulas (65), (66) and (67) to compute the decision matrices distances from GDEIS, GROD, and GLOD. The distances are represented symbolically by the inscriptions DGDEIS, DGROD, and DGLOD and are listed in Tables 29, 30, and 31, respectively.
Step 5 (d). Utilize formula (68), to compute the CIs which is listed below.
Step 5 (e). Utilize formula (69), to determine the weights of DMs which are listed below.
Step 6 (a). Utilize formula (70), to generate the weight vector \(\mathcal{J}_{i j}^{g}\) of power operator associated with the TSPFN \('\!\gamma_{i j}^{g}\). Which are listed below:
Step 6 (b). Utilize TSPAAWPGHM operators, with the TSPF entropy measure, to compute the UGDOS which is listed in Table 32.
Step 6(c). Utilize formula (72), to compute the T-SPF entropy measure of each attribute which is listed below.
Step 6 (d). Utilize formula (73), to compute the attributes weights which is listed below.
Step 7 (a). Utilize formula (74), and the weights of the attributes, to compute the weighted normalized decision matrices which are listed in Tables 33,34, 35 and 36.
Step 7 (b). Utilize Formula (75), and NWD matrices, to calculate the POIM and NOIM which are listed in Tables 37 and 38.
Step 8. Utilize formula (76), to calculate the distances of NWD matrices to POS and NOS which are listed in Tables 39 and 40.
Step 9. Utilize formula (77), to compute the revised closeness indicators (RCIs) which is listed in Table 41.
Step 10. Use formula (78), to determine the final CIs which is given below.
From the FRCIs values, the best is \('\!\gamma_{6}\), while the worst on is \('\!\gamma_{2}\).
Effect of the parameters \(N\),\(Q,{\mathbb{R}}\) and \(q\) on final ranking results
In this part, effect of different values of the parameters \(N\),\(Q,{\mathbb{R}}\) and \(q\) are investigated utilizing TSPFAAWPHM/TSPFAAWPGHM operators.
Effect of the parameter \(N\) on final ranking results
In this subpart, effect of the parameter \(N\) is investigated utilizing TSPFAAWPHM/TSPFPAAWPGHM operators, while the values of the parameter \({\mathbb{Q}},{\mathbb{R}}\) and \(q\) are fixed. That is \(\left( {q = 3,\,\,{\mathbb{Q}} = 2,\,\,\,{\mathbb{R}} = 3} \right)\) and the alternatives/choices are, respectively, represented by \('\!\gamma_{1} =_{1}\),\('\!\gamma_{2} =_{2}\),\('\!\gamma_{3} =_{3}\),\('\!\gamma_{4} =_{4}\),\('\!\gamma_{5} =_{5}\) and \('\!\gamma_{6} =_{6}\) in the below figures.
From Fig. 3, one can see that the score values obtained for different values of the parameter \(N\) while utilizing TSPFAAWPHM operators are different, but the ranking order remain the same. That is the best alternative is Ђ6 while the worst on is Ђ2. Similarly, from Fig. 4, one can observe that the score values obtained for different values of the parameter \(N\) while utilizing TSPFAAWPGHM operators are different, but the ranking order remain the same. That is the best alternative is Ђ6 while the worst on is Ђ3. One can also noticed that when the values of the parameter \(N\) increases the score values decreases while utilizing TSPFAAWPHM/TSPFPAAWPGHM operators.
Effect of the parameter \(q\) on final ranking results
In this subpart, effect of the parameter \(q\) is investigated utilizing TSPFAAWPHM/TSPFPAAWPGHM operators, while the values of the parameter \({\mathbb{Q}}\ominus \,,{\mathbb{R}}\) and \(N\) are fixed. That is \(\left( {N = 3,\,\,{\mathbb{Q}} = 2,\,\,\,{\mathbb{R}} = 3} \right)\).
From Fig. 5, one can see that the score values obtained for different values of the parameter \(q\) while utilizing TSPFAAWPHM operators are different, but the ranking order remain the same. That is the best alternative is Ђ6 while the worst on is Ђ2. Similarly, from Fig. 6, one can observe that the score values obtained for different values of the parameter \(q\) while utilizing TSPFAAWPGHM operators are different, and the ranking orders are also different. That is the best alternative is Ђ6 while the worst on is Ђ3 when the value of the parameter \(q = 4\). When the values of the parameter \(q = 7\) and greater than 7 the worst alternative becomes Ђ2, while the best on remain the same. One can also notice that when the values of the parameter \(N\) increases, the score values decreases while utilizing TSPFAAWPHM/TSPFPAAWPGHM operators.
Effect of the parameter \(Q,{\mathbb{R}}\) on final ranking results
In this subpart, the effect of the parameters \(Q,{\mathbb{R}}\) are investigated utilizing TSPFAAWPHM/TSPFPAAWPGHM operators, while the values of the parameter \(q\) and \(N\) are fixed. That is \(\left( {N = 3,\,\,q = 3} \right)\).
From Fig. 7, one can see that the score values obtained for different values of the parameters \({\mathbb{Q}}\,,{\mathbb{R}}\) while utilizing TSPFAAWPHM operators are different, but the ranking order remain the same. That is the best alternative is Ђ6 while the worst on is Ђ2. Similarly, from Fig. 8, one can observe that the score values obtained for different values of the parameter \(Q,{\mathbb{R}}\) while utilizing TSPFAAWPGHM operators are different, but the ranking order remain the same. That is the best alternative is Ђ6 while the worst on is Ђ3. One can also noticed that when the values of the parameters \(Q,{\mathbb{R}}\) increases the score values increases while utilizing TSPFAAWPHM/TSPFPAAWPGHM operators.
This makes the developed TOPSIS method more flexible. Since the existing TOPSIS methods for different fuzzy structure is mainly based on weighted/geometric averaging operators. But the developed TOPSIS method is based on TSPFAAWPHM/TSPFAAWGHM operator, which have the capability of taking interrelationship among input arguments and also vanish the influence unreliable data from the final ranking results. Hence, the proposed TOPSIS method is more reasonable to be utilized to solve more complex MAGDM problems.
Comparison of the proposed TOPSIS method with existing approaches
In this subpart, the proposed approach is compared with different approaches.
As from Fig. 9, one can see that utilizing the TSPFAAWA/TSPFAAWG [34] operators the best alternative is Ђ6 while the worst on is Ђ2 and Ђ3. Similarly, Figure 9 shows that when the TSPFEWA/TSPFEWG [31] operators are utilized the best alternative is Ђ6 while the worst on is Ђ2 and Ђ6, and when SPF TOPSIS [23] method is utilized the best alternative is Ђ5 while the worst on is Ђ3. The ranking order obtained from the TSPFAAWA/TSPFAAWG [34] and TSPFEWA/TSPFEWG [31] are the same as obtained from developed approach but the ranking order obtained from SPF TOPSIS method [23] is different from the proposed approach, although the worst alternative is the same. The main reason behind this different ranking order is that the developed TOPSIS approach is based on TSPAAWPHM/TSPAAWPGHM operators while the SPF TOPSIS approach is simply based on SPWA operators. The developed TSPF TOPSIS method has some advantages over the existing approaches. The developed TSPF TOPSIS approach is based TSPFAAWPHM/TSPFAAWPGHM operators, which consist of four parameters, remove the effect of unreliable data and can consider the interrelationship among input arguments. Due to these characteristics, the developed approach is more flexible and can be utilized to solve more complex MADM/MAGDM problems.
Advantages and disadvantages of the developed approach
In this subpart, advantages and disadvantages of the developed approaches are investigated.
The initiated MAGDM approach-based TSPF TOPSIS methods have some advantages over the existing approaches. Firstly, the initiated TSPF TOPSIS method is based TSPFAAWPHM/TSPFAAWPGHM operators. The, TSPFAAWPHM/TSPFAAWPGHM is hybrid structure, that is TSPFAAWPHM/TSPFAAWPGHM operators are combination of PA/PG operator and HM/GHM operator. The TSPFAAWPHM/TSPFAAWPGHM operators have both the characteristics PA/PG and HM/GHM operators. Secondly, these aggregation operators are initiated utilizing Aczel–Alsina operational laws, which consist of generalized parameter. Thirdly, some of the existing aggregation operators are obtained by giving specific values to the parameters. The disadvantage of the initiated aggregation operators is that it can consider the interrelationship among any two input arguments and unable to consider the interrelationship among any number of input arguments. Due to above-defined characteristics, the developed approach is more flexible and can be utilized to solve more complex MADM/MAGDM problems.
Conclusion
One of the key indicators for pharmaceutical companies to prove their fundamental competence against the backdrop of green economic growth is their capacity for sustainable and high-quality development. When creating growth strategies and correcting pharmaceutical companies, pharmaceutical management departments may benefit greatly from using the evaluation of pharmaceutical companies from a standpoint of sustainable and high-quality development. In this article, some novel TSPF power Heronian mean operators are initiated based on Aczel–Alsina operational laws such as TSPFAAPHM and TSPFAAGHM operators. Some core properties and special cases with respect to generalized parameters are also investigated and found that some of the existing aggregation operators are special cases of it. The weighted forms of the said aggregation operators are also developed. As these aggregation operators have the capability of removing the effect of awkward data and can consider the interrelationship among any two input arguments at the same time. Further, based on these aggregation operators and Aczel–Alsina operational laws a newly advanced TOPSIS-based method for dealing with MAGDM problems in a T-Spherical fuzzy framework is established, where the weights of both the DMs and the criteria are completely unknowable. Finally, an illustrative example is provided to evaluate and choose the pharmaceutical firms with the capacity for high-quality, sustainable development in the TSPF environment to show the effectiveness and practicality. Following that, the comparison analysis with existing methods is used to support the suggested method's coherence and supremacy.
In future, we will try to extend the proposed aggregation operators to some advanced fuzzy structure such as, Py m-polar FS [2], complex IFS [11], linguistic IFS [38], q-rung orthopair fuzzy soft sets [40] and apply them to solve MADM/MAGDM problems in different fields.
Data availability
The data is available in the manuscript and can be used by anyone by just citing this article.
References
Liu P, Khan Q, Mahmood T, Khan RA, Khan HU (2021) Some improved pythagorean fuzzy Dombi power aggregation operators with application in multiple-attribute decision making. J Intell Fuzzy Syst 40(5):9237–9257
Rong Y, Niu W, Garg H, Liu Y, Yu L (2022) A hybrid group decision approach based on MARCOS and regret theory for pharmaceutical enterprises assessment under a single-valued neutrosophic scenario. Systems 10(4):106
Khan Q, Mahmood T, Ullah K (2021) Applications of improved spherical fuzzy Dombi aggregation operators in decision support system. Soft Comput 25(14):9097–9119
Riaz M, Naeem K, Chinram R, Iampan A (2021) Pythagorean m-polar fuzzy weighted aggregation operators and algorithm for the investment strategic decision making. J Math 2021:1–19
Riaz M, Garg H, Hamid MT, Afzal D (2022) Modelling uncertainties with TOPSIS and GRA based on q-rung orthopair m-polar fuzzy soft information in COVID-19. Expert Syst 39(5):e12940
Jafar MN, Saeed M, Saqlain M, Yang MS (2021) Trigonometric similarity measures for neutrosophic hypersoft sets with application to renewable energy source selection. IEEE Access 9:129178–129187
Dong J, Ju Y, Dong P, Giannakis M, Wang A, Liang Y, Wang H (2021) Evaluate and select state-owned enterprises with sustainable high-quality development capacity by integrating FAHP-LDA and bidirectional projection methods. J Clean Prod 329:129771
Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–353
Atanassov KT (1986) Intuitionistic fuzzy sets. Fuzzy Sets Syst 20:87–96
Jia X, Wang Y (2022) Choquet integral-based intuitionistic fuzzy arithmetic aggregation operators in multi-criteria decision-making. Expert Syst Appl 191:116242
Garg H, Rani D (2019) Some generalized complex intuitionistic fuzzy aggregation operators and their application to multicriteria decision-making process. Arab J Sci Eng 44:2679–2698
Khan Q, Khattak H, AlZubi AA, Alanazi JM (2022) Multiple attribute group decision-making based on intuitionistic fuzzy schweizer-sklar generalized power aggregation operators. Math Problems Eng 2022:1–34
Garg H, Rani D (2020) New generalised Bonferroni mean aggregation operators of complex intuitionistic fuzzy information based on Archimedean t-norm and t-conorm. J Exp Theor Artif Intell 32(1):81–109
Deveci K, Cin R, Kağızman A (2020) A modified interval valued intuitionistic fuzzy CODAS method and its application to multi-criteria selection among renewable energy alternatives in Turkey. Appl Soft Comput 96:106660
Nguyen H (2019) A generalized p-norm knowledge-based score function for an interval-valued intuitionistic fuzzy set in decision making. IEEE Trans Fuzzy Syst 28(3):409–423
Yager RR (2013) Pythagorean fuzzy subsets. In: 2013 joint IFSA world congress and NAFIPS annual meeting (IFSA/NAFIPS). IEEE, pp. 57–61
Yager RR (2016) Generalized orthopair fuzzy sets. IEEE Trans Fuzzy Syst 25(5):1222–1230
Deveci M, Gokasar I, Brito-Parada PR (2022) A comprehensive model for socially responsible rehabilitation of mining sites using Q-rung orthopair fuzzy sets and combinative distance-based assessment. Expert Syst Appl 200:117155
Garg H, Gandomi AH, Ali Z, Mahmood T (2022) Neutrality aggregation operators based on complex q-rung orthopair fuzzy sets and their applications in multi-attribute decision-making problems. Int J Intell Syst 37(1):1010–1051
Güneri B, Deveci M (2023) Evaluation of supplier selection in the defense industry using q-rung orthopair fuzzy set based EDAS approach. Expert Syst Appl 222:119846
Peng X, Garg H, Luo Z (2023) When content-centric networking meets multi-criteria group decision-making: Optimal cache placement policy achieved by MARCOS with q-rung orthopair fuzzy set pair analysis. Eng Appl Artif Intell 123:106231
Yin S, Wang Y, Shafiee S (2023) Ranking products through online reviews considering the mass assignment of features based on BERT and q-rung orthopair fuzzy set theory. Expert Syst Appl 213:119142
Barukab O, Abdullah S, Ashraf S, Arif M, Khan SA (2019) A new approach to fuzzy TOPSIS method based on entropy measure under spherical fuzzy information. Entropy 21(12):1231
Cuong BC, Kreinovich V (2014) Picture fuzzy sets. J Comput Sci Cybern 30(4):409–420
Ashraf S, Abdullah S, Mahmood T, Ghani F, Mahmood T (2019) Spherical fuzzy sets and their applications in multi-attribute decision making problems. J Intell Fuzzy Syst 36(3):2829–2844
Kutlu Gündoğdu F, Kahraman C (2019) Spherical fuzzy sets and spherical fuzzy TOPSIS method. J Intell Fuzzy Syst 36(1):337–352
Mahmood T, Ullah K, Khan Q, Jan N (2019) An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput Appl 31:7041–7053
Garg H, Ullah K, Mahmood T, Hassan N, Jan N (2021) T-spherical fuzzy power aggregation operators and their applications in multi-attribute decision making. J Ambient Intell Humaniz Comput 12:1–14
Wu MQ, Chen TY, Fan JP (2020) Similarity measures of T-spherical fuzzy sets based on the cosine function and their applications in pattern recognition. IEEE Access 8:98181–98192
Mahnaz S, Ali J, Malik MA, Bashir Z (2021) T-spherical fuzzy Frank aggregation operators and their application to decision making with unknown weight information. IEEE Access 10:7408–7438
Munir M, Kalsoom H, Ullah K, Mahmood T, Chu YM (2020) T-spherical fuzzy Einstein hybrid aggregation operators and their applications in multi-attribute decision making problems. Symmetry 12(3):365
Ullah K, Mahmood T, Garg H (2020) Evaluation of the performance of search and rescue robots using T-spherical fuzzy Hamacher aggregation operators. Int J Fuzzy Syst 22(2):570–582
Khan Q, Gwak J, Shahzad M, Alam MK (2021) A novel approached based on T-spherical fuzzy Schweizer-Sklar power Heronian mean operator for evaluating water reuse applications under uncertainty. Sustainability 13(13):7108
Jafar MN, Saeed M, Khan KM, Alamri FS, Khalifa HAEW (2022) Distance and similarity measures using max-min operators of neutrosophic hypersoft sets with application in site selection for solid waste management systems. IEEE Access 10:11220–11235
Jafar MN, Saeed M (2021) Matrix theory for neutrosophic hypersoft set and applications in multiattributive multicriteria decision-making problems. J Math 2022:6666408
Naveed M, Riaz M, Sultan H, Ahmed N (2020) Interval valued fuzzy soft sets and algorithm of IVFSS applied to the risk analysis of prostate cancer. Int J Comput Appl 975:8887
Jafar MN, Farooq A, Javed K, Nawaz N (2020) Similarity measures of tangent, cotangent and cosines in neutrosophic environment and their application in selection of academic programs. Infinite Study
Kumar PS (2016) PSK method for solving type-1 and type-3 fuzzy transportation problems. Int J Fuzzy Syst Appl (IJFSA) 5(4):121–146
Kumar PS (2016) A simple method for solving type-2 and type-4 fuzzy transportation problems. Int J Fuzzy Logic Intelli Syste 16(4):225–237
Kumar PS (2019) Intuitionistic fuzzy solid assignment problems: a software-based approach. Int J Syst Assurance Eng Manag 10(4):661–675
Kumar PS (2022) Computationally simple and efficient method for solving real-life mixed intuitionistic fuzzy 3D assignment problems. In J Softw Sci Comput Intell (IJSSCI) 14(1):1–42
Kumar PS (2020) Developing a new approach to solve solid assignment problems under intuitionistic fuzzy environment. Int J Fuzzy Syst Appl (IJFSA) 9(1):1–34
Hussain A, Ullah K, Yang MS, Pamucar D (2022) Aczel-Alsina aggregation operators on T-spherical fuzzy (TSF) information with application to TSF multi-attribute decision making. IEEE Access 10:26011–26023
Hwang CL, Yoon K, Hwang CL, Yoon K (1981) Methods for multiple attribute decision making. Multiple attribute decision making: methods and applications a state-of-the-art survey. Springer, Berlin, pp 58–191
Chen CT (2000) Extensions of the TOPSIS for group decision-making under fuzzy environment. Fuzzy Sets Syst 114(1):1–9
Beg I, Rashid T (2013) TOPSIS for hesitant fuzzy linguistic term sets. Int J Intell Syst 28(12):1162–1171
Biswas A, Kumar S (2018) An integrated TOPSIS approach to MADM with interval-valued intuitionistic fuzzy settings. In: Advanced computational and communication paradigms: proceedings of international conference on ICACCP 2017, vol 2. Springer, Singapore, pp. 533–543
Kumar K, Chen SM (2022) Group decision making based on weighted distance measure of linguistic intuitionistic fuzzy sets and the TOPSIS method. Inf Sci 611:660–676
Alkan N, Kahraman C (2022) Circular intuitionistic fuzzy TOPSIS method: pandemic hospital location selection. J Intell Fuzzy Syst 42(1):295–316
Xu Z, Zhang X (2013) Hesitant fuzzy multi-attribute decision making based on TOPSIS with incomplete weight information. Knowl-Based Syst 52:53–64
Li DF (2010) TOPSIS-based nonlinear-programming methodology for multi-attribute decision making with interval-valued intuitionistic fuzzy sets. IEEE Trans Fuzzy Syst 18(2):299–311
Zhang X, Xu Z (2014) Extension of TOPSIS to multiple criteria decision making with Pythagorean fuzzy sets. Int J Intell Syst 29(12):1061–1078
Boran FE, Genç S, Kurt M, Akay D (2009) A multi-criteria intuitionistic fuzzy group decision making for supplier selection with TOPSIS method. Expert Syst Appl 36(8):11363–11368
Torlak G, Sevkli M, Sanal M, Zaim S (2011) Analyzing business competition by using fuzzy TOPSIS method: An example of Turkish domestic airline industry. Expert Syst Appl 38(4):3396–3406
Yue Z (2011) An extended TOPSIS for determining weights of decision makers with interval numbers. Knowl-Based Syst 24(1):146–153
Yue Z (2013) An avoiding information loss approach to group decision making. Appl Math Model 37(1–2):112–126
Yager RR (2001) The power average operator. IEEE Trans Syst Man Cybern Part A Syst Humans 31(6):724–731
Sýkora S (2009) Mathematical means and averages: generalized Heronian means. Stan’s Libr. Castano Primo Italy, 3
Author information
Authors and Affiliations
Contributions
All authors contributed equally.
Corresponding authors
Ethics declarations
Conflict of interest
The authors declare no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Liu, P., Khan, Q., Jamil, A. et al. A novel fuzzy TOPSIS method based on T-spherical fuzzy Aczel–Alsina power Heronian mean operators with applications in pharmaceutical enterprises’ selection. Complex Intell. Syst. 10, 2327–2386 (2024). https://doi.org/10.1007/s40747-023-01249-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40747-023-01249-3