Next Article in Journal
Job Stress and Burnout among Social Workers in the VUCA World of COVID-19 Pandemic
Next Article in Special Issue
Double Coating as a Novel Technology for Controlling Urea Dissolution in Soil: A Step toward Improving the Sustainability of Nitrogen Fertilization Approaches
Previous Article in Journal
Impact of the COVID-19 Pandemic on Family Carers of Older People Living with Dementia in Italy and Hungary
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Approached Based on T-Spherical Fuzzy Schweizer-Sklar Power Heronian Mean Operator for Evaluating Water Reuse Applications under Uncertainty

1
Department of Pure and Applied Mathematics, University of Haripur, Haripur 22620, KPK, Pakistan
2
Department of Software, Korea National University of Transportation, Chungju 27469, Korea
3
Department of Biomedical Engineering, Korea National University of Transportation, Chungju 27469, Korea
4
Department of AI Robotics Engineering, Korea National University of Transportation, Chungju 27469, Korea
5
Department of IT & Energy Convergence (BK21 FOUR), Korea National University of Transportation, Chungju 27469, Korea
*
Author to whom correspondence should be addressed.
Sustainability 2021, 13(13), 7108; https://0-doi-org.brum.beds.ac.uk/10.3390/su13137108
Submission received: 29 May 2021 / Revised: 14 June 2021 / Accepted: 18 June 2021 / Published: 24 June 2021

Abstract

:
The T-Spherical Fuzzy set (T-SPHFS) is one of the core simplifications of quite a lot of fuzzy concepts such as fuzzy set (FS), intuitionistic fuzzy set (ITFS), picture fuzzy set (PIFS), Q-rung orthopair fuzzy set (Q-RUOFS), etc. T-SPHFS reveals fuzzy judgment by the degree of positive membership, degree of abstinence, degree of negative membership, and degree of refusal with relaxed conditions, and this is a more powerful mathematical tool to pair with inconsistent, indecisive, and indistinguishable information. In this article, several novel operational laws for T-SPFNs based on the Schweizer–Sklar t-norm (SSTN) and the Schweizer–Sklar t-conorm (SSTCN) are initiated, and some desirable characteristics of these operational laws are investigated. Further, maintaining the dominance of the power aggregation (POA) operators that confiscate the ramifications of the inappropriate data and Heronian mean (HEM) operators that consider the interrelationship among the input information being aggregated, we intend to focus on the T-Spherical fuzzy Schweizer–Sklar power Heronian mean (T-SPHFSSPHEM) operator, the T-Spherical fuzzy Schweizer–Sklar power geometric Heronian mean (T-SPHFSSPGHEM) operator, the T-Spherical fuzzy Schweizer–Sklar power weighted Heronian mean (T-SPHFSSPWHEM) operator, the T-Spherical fuzzy Schweizer–Sklar power weighted geometric Heronian mean (T-SPHFSSPWGHEM) operator, and their core properties and exceptional cases in connection with the parameters. Additionally, deployed on these newly initiated aggregation operators (AOs), a novel multiple attribute decision making (MADM) model is proposed. Then, the initiated model is applied to the City of Penticton (British Columbia, Canada) to select the best choice among the accessible seven water reuse choices to manifest the practicality and potency of the preferred model and a comparison with the proffered models is also particularized.

1. Introduction

The purification and restoration of non-traditional or polluted water for constructive use are known as water reuse [1]. Water recycling is associated through the use of recovered water, which might help to alleviate water shortage, particularly in anticipation of the recent influence of climate change and increased human activity. Water recycling has become commonplace across the world to address the degradation of water supplies, which has resulted in a reduction in water availability. Water reuse application evaluation is a weight-replacement method that leads to the most optimal water reuse application selection. As a result, the evaluation entails examining a variety of social, technological, economic, cultural, ecological, and technical criteria in order to guarantee that decisions are made in a sustainable manner [2]. The difficulty in evaluating water reuse applications is that they are diverse in character and may have competing requirements. In the evaluation of water reuse applications, ambiguity occurs where decision makers are unsure about which option they prefer based on specific criteria or even how much they like a certain option. Additionally, there might be some inadequate or inaccurate data about the alternatives’ performance in terms of criterion. For tackling such contradictory and ambiguous situations, fuzzy set theory is a particularly valuable strategy.
Fuzzy set (FS) was instigated by Zadeh [3] as a contraption for depicting and transferring precariousness and ambiguity. Since its commencement, FS has managed remarkable consideration from intellectuals around the globe, who calculated its real and theoretical features. The T-Spherical Fuzzy set [4] (T-SPHFS) is the latest generalization of FS and a dominant tool for handling ambiguous, conflicting, and unclear data.
In this article, the T-Spherical fuzzy set-based framework is initiated for water reuse application evaluation. The main aim of the research consists of advancement of the operational laws of T-Spherical fuzzy numbers, improvement in aggregation operators, and proposes an advanced multiple attribute decision-making model based on these improved operational laws and advanced aggregation operators. The research objectives could be explained briefly as follows. When combining water reuse with multiple attribute decision making, uncertainty is an inescapable and predictable part of the evaluation process. To handle uncertain, inconsistent, and unpredictable information, the T-Spherical fuzzy set is one of the most prominent tools. So, the first task of this research is to initiate novel operational laws for the T-Spherical fuzzy set on Schweizer–Sklar t-norm and t-conorm and discussed its core properties.
Aggregation operators (AOs) play a decisive part in the decision-making (DM) process. Scholars have been considerably more conscious of information AOs in recent years, and they have begun to extend many AOs, for instance, the ordinary AOs conferred by Xu [5] and Xu and Yager [6] may aggregate a series of real numbers into a single real number. Several researchers have expanded these traditional AOs in recent years; for instance, Liu et al. [7] initiated the T-SPHFP Muirhead mean operator and applied them to solve MA group DM (MAGDM) problems. The features of various AOs vary. Some AOs, like the Bonferroni mean (BOM) [8], Heronian mean (HEM) [9], Muirhead mean (MUM) operators [10], and Maclaurin symmetric mean (MCSM) operator [11], took into account the correlation between input arguments.
The second task of this research is to merge the power average operator with the Heronian mean operator to initiate T-Spherical fuzzy power Heronian mean operators that have the advantages of removing the bad effect of awkward data and consider the correlation among input data at the same time. Furthermore, based on these aggregation operators, a multiple attribute decision-making model is initiated and applied to solve the water reuse application evaluation [12] problem to show the practicality and effectiveness of the initiated multiple attribute decision-making model.

2. Materials

2.1. Literature Review

High population growth and industrialization in the colonial era have resulted in a slew of environmental issues, prominent among them the deterioration of water resources and the resulting water supply constraints. Developed nations, on average, have greater freshwater resources than emerging and poor ones. However, in industrialized nations, pollution, over-exploitation, degradation, and intense rivalry between agriculture and industry have resulted in larger urban water supply difficulties. The process of weighing options and selecting the best appropriate water reuse application is known as water reuse application evaluation. Water reuse applications are challenging to assess since they are varied in nature and may have competing requirements. To achieve sustainable judgments, the review will now include a study of many factors involving social, scientific, financial, political, geological, and engineering factors. When evaluating water reuse applications, ambiguity arises when decision-makers are undecided about which choice they prefer based on a given criterion or even how much they favor a certain alternative. To deal with such a situation, the fuzzy set theory is the most appropriate set.
Zadeh [3] was the founder of the Fuzzy set (FS) as a mechanism for illustrating and reassigning unevenness and vagueness. Since its origination, FS has managed notable contemplation from scholars throughout the world, who premeditated its actual and theoretical features. Some of the latest research efforts on the theory and applications of FSs have been launched in economics and business [12,13,14], genetic algorithms [15,16], and supply chain management [17,18], etc. Following the introduction of the concept of FS, a number of extensions of FSs were expected, such as interval-valued FS [19], which elucidated the membership degree is a subset of [ 0 ,   1 ] , and Atanassov’s ITFS [20], which elucidated the membership degree (MED) and non-membership degree (NOMD) by a single number in the [ 0 ,   1 ] , with the total of these two degrees having to be less than or equal to one. As a result, ITFS explains uncertainty and unreliability in greater depth than FS. The appealing scenario arises when such an entity’s MED and NOMD are in the [ 0 ,   1 ] , but somehow the total of two such functions exceeds one. The standard ITFS fails to manage such types of data under such scenarios. To address the scenario described earlier, Yager [21,22,23] suggested Pythagorean fuzzy sets (PytFSs), which might be considered an augmentation of ITFSs. The main distinction amid both PytFS and ITFS would be that in PytFS, the addition of squares of the MED and NOMD will be less than or equal to one, whereas in IFS, the sum of MED and NOMD would be less than or equal to one. After the commencement of PytFS, a variety of studies have been carried out by numerous investigators, such as distance measure [24,25,26,27] and correlation coefficient [28,29]. Zhang and Xu [30] conveyed the ample mathematical representation for PytFS and anticipated the initiative of PytF number (PytFN), then they also anticipated a MADM algorithm deployed on PytF TOPSIS to pair with PytFNs. Some other studies about PytFS have been conducted by different investigators and give their applications in different areas [31,32,33]. Q-RUOFS [34] is another conception of ITFS and PytFS. Q-RUOFS is a more dominant and reliable set to pact with unclear and conflicting information.
In various areas, ITFS, PytFS and Q-RUOFS have been addressed. Unfortunately, there have been some circumstances for which IFS, PyFS, and Q-ROFS are not compatible. For example, the members of three departments, namely the department of mathematics, department of physics, and department of information technology, vote for the selection of the dean post among one of these departments. From these faculties, 100 teachers (Assistant professors and associate professors) are chosen for voting, and 1 professor from each department is chosen for the selection of the dean post. Thirty teachers support professors from the department of mathematics, forty teachers oppose professors from the department of mathematics, twenty teachers abstain from voting, and ten teachers decline to vote. ITFS, PytFS, and Q-RUOFS fail to cope with these sort of data. Cuong and Kreinovich [35] initiated and termed picture fuzzy set (PIFS), another conception of ITFS and FS to cope with such information. Furthermore, there will be instances whenever an entity’s MED, neutral MED, and NMED are permissible from a unit interval, yet the sum of these three degrees is greater than one. Under such cases, the traditional PFS is unable to manage the data. As a result, dealing with such data necessitates the use of a more sophisticated mathematical tool. For this intention, Mahmood et al. created the spherical fuzzy set (SPHFS) and T-SPHFS, which is a further expansion of PytFS, Q-RUOFS, and PIFS. T-SPHFS has the same structure as PIFS, with the exception that the total of qth power of these three degrees must be less than or equal to one. As a result, T-SPHFS is a more dominant tool for handling ambiguous, conflicting, and unclear data.
Aggregation operators (AOs) are one of the core concepts in multiple attribute decision-making process. The AOs may aggregate a set of real numbers into a single real number. The characteristics of various AOs vary. Some AOs, such as the PA operator provided by Yager [36], have the capacity of removing the bad effect of awkward data from the final ranking results and has been expanded on by many investigators from everywhere in the globe to cope with diverse settings, such as Xu [37] who provided the ITF power aggregation operator and applied these to MAGDM, which can mitigate the effects of bad data. Garg et al. [38] extend the crisp PA operator to T-SPHF environment and apply them to solve MADM problems. Some AOs, like the BOM, HEM, and MUM operators and the MCSM operator, took into account the correlation between input arguments. BOM and HEM can consider the correlation among two input arguments while MCSM and MUM can consider correlation among any number of input arguments. These AOs were then expanded to handle a variety of fuzzy situations [39,40,41,42,43].
Most AOs are proposed for aggregating T-SPHFNs utilizing algebraic T-norm (TNO) and T-conorm (TCNO). Currently, Ashraf et al. [44] provided various spherical fuzzy dombi (SPHFD) AOs deployed on Dombi [45] TNO and TCNO and applied them to handle MADM problems under SPHF environment. Archimedean TNO (ATNO) and Archimedean TCNO (ATCNO) are simplifications of Dombi TNO, Dombi TCNO, and other TNO and TCNO, like algebraic, Einstein, Hamacher, and Frank, etc. Dombi TNO and TCNO outperform generic TNO and TCNO on a generic parameter, allowing for more flexibility in the input dataset. Similar to the above TNO and TCNO, Schweizer–Sklar (SS) TNO (SSTNO) and Schweizer–Sklar TCN (SSTCNO) [46] are meticulous cases from the ATNO and ATCNO. SSTNO and SSTCNO are also more flexible and superior to the previous procedures because they have a parameter that may be changeable. Nonetheless, the most common SS research focused on determining the basic theory and forms of SSTNO and SSTCNO [47,48]. SS operations were recently fused with interval-valued ITFS (IVITFS) and ITFS and predicted power weighted averaging (WA)/weighted geometric (WG) AGOs by Liu et al. [49] and Zhang [50]. Wang and Liu [51] predicted a MSM operator for ITFS recognized on SS operational laws (ALs). Liu et al. [52] further offered SS ALs for single-valued neutrosophic numbers and initiated various SS prioritized AGOs for handling MADM problems under an SVN environment. Presently, Zhang et al. [53] predicted some MUM operators for SVNS recognized on SS ALs and applied them to handle MADM problems. Nagarajan et al. [54] proposed few SS ALs for interval neutrosophic set (INS) by captivating the variable parameter from [ 0 , + ] . They also projected a few WA/WG AOs deployed on these SS ALs for IN numbers. Rong, Y. et al. [55] anticipated a novel MAGDM method based on SS ALs and improved the COPRAS method.

2.2. Theoretical Fundamentals

Since 2018, it has been noted that research on different structures of fuzzy MADM AOs based on SS ALs have been released at a quick pace.
It is clear from Table 1 that no authors have sought to define SS ALs for T-SPHFS and combine them with power HEM operator to cope with T-SPHF data. As a result, we put forward:
(1)
In dealing with MADM challenges, T-SPHFNs outperform ITFS, PytFS, Q-RUOFS and, PIFS in displaying speculative data by detecting the positive MED, abstinence MD, and negative MED.
(2)
The SS operations are far more versatile and, by a variable parameter, superior to the previous procedures.
(3)
Fortunately, there are a variety of MADM issues in which the attributes are interrelated, and a number of current AGOs can only mitigate such situations when attributes have been in the form of actual numbers or in the form of other fuzzy structures.
(4)
There are currently no AGOs in place to handle the MADM issues under T-SPHF information provided on SSTNO and SSTCNO. We integrated the combination of PA and HM operators with SS operations to tackle MADM issues using T-SPF information in response to this constraint.
As a result of major influences of the previous studies, the following are the priorities and offerings of this work:
(1)
Initiating novel SS ALs for T-SPHFNs, discussing its basic properties, and deploying it on the SS ALs anticipating T-SPHFSS power Heronian mean operators, T-SPHFSS power geometric Heronian mean operators, and its weighted form.
(2)
Inspecting its basic properties and special cases of these initiating AOs.
(3)
Anticipating a MADM model deployed on these initiating AOs.
(4)
Applying a MADM model to assess water reuse applications.
(5)
Verifying the initiated approach’ effectiveness and practicality.
To accomplish these intentions, this paper is planned as follows. In part 3, we instigate a number of vital ideas of T-SPHFS and score and accuracy functions, POA, and HEM operators. In part 4, we scrutinize a number of SS ALs for TSPHFNs where the general parameter acquires values from [ ,   0 ] . In part 5, we put forward T-SPHFSSPOHEM and T-SPHFSSPOGHEM operators, their weighted forms, and scrutinize a few properties and meticulous cases of the projected AOs. In part 6, we initiate a MADM model recognized on these AOs and applied it to select a water reuse option in the available options to validate the unassailability and compensations of the initiated approach by weighing against other accessible approaches. Lastly, a petite conclusion is prepared in part 7.

3. Methodology

In this part, some core concepts such as T-SPHFS, the HEM operator, POA operator, and their core properties are discussed.

3.1. The T-Spherical Fuzzy Set and Its Operational Laws

Definition 1. 
([4]) Let U E ¯ ¯ be a universal set. A T-SPHFS is identified and mathematically signified as:
T S P H F S = { ξ , p m ¯ ¯ ( ξ ) , a s ¯ ¯ ( ξ ) , n m ¯ ¯ ( ξ )   for   all   ξ U E ¯ ¯ }
where p m ¯ ¯ ( ξ ) , a s ¯ ¯ ( ξ ) , n m ¯ ¯ ( ξ ) [ 0 , 1 ] are, respectively, symbolizing the positive MED (PMED), the abstinence degree (ABD), and negative-membership degree (NMED) with the condition 0 ( p m ¯ ¯ ( ξ ) ) q + ( a s ¯ ¯ ( ξ ) ) q + ( n m ¯ ¯ ( ξ ) ) q 1 , and the degree of refusal (RED) is symbolized by H E = 1 ( p m ¯ ¯ ( ξ ) ) q + ( a s ¯ ¯ ( ξ ) ) q + ( n m ¯ ¯ ( ξ ) ) q q . For computational ease, we shall designate a T-spherical fuzzy number (T-SPHFN) by the ordered triple t s p ¯ ¯ = ( p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ ) .
The ALs for T-SPHFS were classified by Mahmood et al. [28] and are prearranged below:
Definition 2. 
([4]) Let T S P H F S 1   and   T S P H F S 2 be any two T-SPHFSs. Then
T S P H F S 1 T S P H F S 2 iff p m ¯ ¯ 1 ( ξ ) p m ¯ ¯ 2 ( ξ ) , a s ¯ ¯ 1 ( ξ ) a s ¯ ¯ 2 ( ξ ) , n m ¯ ¯ 1 ( ξ ) n m ¯ ¯ 2 ( ξ ) for   all   ξ U E ¯ ¯ .
T S P H F S 1 = T S P H F S 2 iff   T S P H F S 1 T S P H F S 2 and T S P H F S 2 T S P H F S 1 .
T S P H F S 1 T S P H F S 2 = { ξ , m a x i ( p m ¯ ¯ 1 ( ξ ) , p m ¯ ¯ 2 ( ξ ) ) , mini ( a s ¯ ¯ 1 ( ξ ) , a s ¯ ¯ 2 ( ξ ) ) , mini ( n m ¯ ¯ 1 ( ξ ) , n m ¯ ¯ 2 ( ξ ) )   f o r   a l l   ξ U E ¯ ¯ } .
T S P H F S 1 T S P H F S 2 = { ξ , mini ( p m ¯ ¯ 1 ( ξ ) , p m ¯ ¯ 2 ( ξ ) ) , maxi ( a s ¯ ¯ 1 ( ξ ) , a s ¯ ¯ 2 ( ξ ) ) , maxi ( n m ¯ ¯ 1 ( ξ ) , n m ¯ ¯ 2 ( ξ ) )   f o r   a l l   ξ U E ¯ ¯ } .
For comparison of two T-SPFNs t s f 1   and   t s f 2 , the score, accuracy functions, and judgment rules are illustrated as follows:
S R E ˜ ( t s f 1 ) = p m ¯ ¯ 1 q ( ξ ) a s ¯ ¯ 1 q ( ξ ) n m ¯ ¯ 1 q ( ξ ) 3 ,   S R E ˜ [ 1 , 1 ] .
A C U ˜ ( t s f 1 ) = p m ¯ ¯ 1 q ( ξ ) + a s ¯ ¯ 1 q ( ξ ) + n m ¯ ¯ 1 q ( ξ ) 3 ;   A C U ˜ [ 0 , 1 ] .
For judgment of two T-SPHFNs, the judgment rules are listed below.
  • If S R E ˜ ( t s f 1 ) > S R E ˜ ( t s f 2 ) , then t s f 1 is finer than t s f 2 and is designated by t s f 1 > t s f 2 ;
  • If S R E ˜ ( t s f 1 ) = S R E ˜ ( t s f 2 )   and   A C U ˜ ( t s f 1 ) > A C U ˜ ( t s f 2 ) , then t s f 1 is superior to t s f 2 and is designated by t s f 1 > t s f 2 ;
  • If S R E ˜ ( t s f 1 ) = S R E ˜ ( t s f 2 )   and   A C U ˜ ( t s f 1 ) = A C U ˜ ( t s f 2 ) , then t s f 1 is identical to t s f 2 and is designated by t s f 1 = t s f 2 .
Definition 3. 
([7]) Let the T-SPHFNs be t s f 1 = p m ¯ ¯ 1 , a s ¯ ¯ 1 , n m ¯ ¯ 1 and t s f 2 = p m ¯ ¯ 2 , a s ¯ ¯ 2 , n m ¯ ¯ 2 , and q > 0 . Then the ALs for T-SPFNs are identified as:
t s f 1 t s f 2 = ( p m ¯ ¯ 1 q + p m ¯ ¯ 2 q p m ¯ ¯ 1 q p m ¯ ¯ 2 q ) 1 q , a s ¯ ¯ 1 a s ¯ ¯ 2 , n m ¯ ¯ 1 n m ¯ ¯ 2 ;
t s f 1 t s f 2 = p m ¯ ¯ 1 p m ¯ ¯ 2 , ( a s ¯ ¯ 1 q + a s ¯ ¯ 2 q a s ¯ ¯ 1 q a s ¯ ¯ 2 q ) 1 q , ( n m ¯ ¯ 1 q + n m ¯ ¯ 2 q n m ¯ ¯ 1 q n m ¯ ¯ 2 q ) 1 q ;
t s f 1 = ( 1 ( 1 p m ¯ ¯ 1 q ) ) 1 q , a s ¯ ¯ 1 , n m ¯ ¯ 1 ; > 0
t s f 1 = p m ¯ ¯ 1 , ( 1 ( 1 a s ¯ ¯ 1 q ) ) 1 q , ( 1 ( 1 n m ¯ ¯ 1 q ) ) 1 q ; > 0
t s f 1 c = n m ¯ ¯ 1 , a s ¯ ¯ 1 , p m ¯ ¯ 1
Definition 4. 
([7]) Suppose that the two SPFNs be t s f 1 = p m ¯ ¯ 1 , a s ¯ ¯ 1 , n m ¯ ¯ 1 and t s f 2 = p m ¯ ¯ 2 , a s ¯ ¯ 2 , n m ¯ ¯ 2 . Then, the normalized Hamming distance between t s f 1 and t s f 2 is labelled as:
D I T ¯ ¯ ( t s f 1 , t s f 2 ) = 1 3 ( | p m ¯ ¯ 1 q p m ¯ ¯ 2 q | + | a s ¯ ¯ 1 q a s ¯ ¯ 2 q | + | n m ¯ ¯ 1 q n m ¯ ¯ 2 q | )

3.2. The Power Average (POA) Operator

Yagar [36] initiated the perception of the POA operator that is the key AO. The POA operator reduced various unconstructive effects of pointlessly high or unreasonably low opinions specified by experts. The predictable POA operator may combine a collection of crisp integers where the weighting vector is based only on the input data and is characterized as:
Definition 5. 
([36]) Let the group of positive real number represented by b i ( i = 1 , 2 , , ϑ ) . Then, the POA operator is a function delineated by
P A ( b 1 , b 2 , . , b ϑ ) = i = 1 ϑ ( 1 + T ( b i ) ) b i i = 1 ϑ ( 1 + T ( b i ) ) ,
where
T ( b i ) = j = 1 j i ϑ S u p r ( b i , b j )
and S u p r ( b , ) is the support degree for b   from , which should gratify the following constrain. (1) S u p r ( b , ) [ 0 , 1 ] , (2) S u p r ( b , ) = S u p r ( , b ) , (3) S u p r ( b , ) S u p r ( v , u ) , if | b | < | v u | .

3.3. Heronian Mean (HEM) Operator

For aggregation, the HEM [9] operator is also a significant AO, which can embody the interrelationships of the input attributes, and is delineated as:
Definition 6. 
([9]) Let G = [ 0 , 1 ] , a , b 0 , H E M A , B : G m G , if H E M A , B satisfies:
H E M A , B ( c 1 , c 2 , , c ϑ ) = ( 2 ϑ 2 + ϑ i = 1 ϑ j = i ϑ c i A c j B ) 1 A + B
Then, the function H E M A , B is alleged to be HEM operator with parameters A , B . The HEM operator must ensure the characteristics of idempotency, boundedness, and monotonicity.

4. Results

4.1. Schweizer–Sklar ALs for T-SPHFNs

In this subpart, the SS ALs are initiated for T-SPHFNs deployed on SSTNO and SSTCNO, and various core properties of SS ALs for T-SPHFNs are investigated.
The SSTNO and SSTCNO [48] are identified as:
T N O ˜ S S ( v o ¯ ¯ , u o ¯ ¯ ) = ( v o ¯ ¯ γ + u o ¯ ¯ γ 1 ) 1 γ   and   T C N O ˜ S S * ( v o ¯ ¯ , u o ¯ ¯ ) = 1 ( ( 1 v o ¯ ¯ ) γ + ( 1 u o ¯ ¯ ) γ 1 ) 1 γ
where γ < 0 , v o ¯ ¯ , u o ¯ ¯ [ 0 , 1 ] .
Additionally, when γ = 0 , we have T N O ˜ ζ ( v o ¯ ¯ , u o ¯ ¯ ) = v o ¯ ¯ u o ¯ ¯ and T C N O ˜ ζ * ( v o ¯ ¯ , u o ¯ ¯ ) = v o ¯ ¯ + u o ¯ ¯ v o ¯ ¯ . u o ¯ ¯ . That is, SS TNO and SS TCNO condense to algebraic TNO and TCNO.
Now, deployed on SSTNO T N O ˜ ζ ( v o ¯ ¯ , u o ¯ ¯ ) and SSTCNO T C N O ˜ ζ * ( v o ¯ ¯ , u o ¯ ¯ ) , we can permit the subsequent definition about SS ALs of T-SPHFNs.
Definition 7. 
Let the three SPHFNs be t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ , t s f 1 = p m ¯ ¯ 1 , a s ¯ ¯ 1 , n m ¯ ¯ 1 , and t s f 2 = p m ¯ ¯ 2 , a s ¯ ¯ 2 , n m ¯ ¯ 2 . Then, the SS ALs for T-SPHFNs are defined as:
t s f 1 t s f 2 = ( 1 ( ( 1 p m ¯ ¯ 1 q ) γ + ( 1 p m ¯ ¯ 2 q ) γ 1 ) 1 γ ) 1 q , ( ( a s ¯ ¯ 1 q ) γ + ( a s ¯ ¯ 2 q ) γ 1 ) 1 q γ , ( ( n m ¯ ¯ 1 q ) γ + ( n m ¯ ¯ 2 q ) γ 1 ) 1 q γ ;
t s f 1 t s f 2 = ( ( p m ¯ ¯ 1 q ) γ + ( p m ¯ ¯ 2 q ) γ 1 ) 1 q γ , ( 1 ( ( 1 a s ¯ ¯ 1 q ) γ + ( 1 a s ¯ ¯ 2 q ) γ 1 ) 1 γ ) 1 q , ( 1 ( ( 1 n m ¯ ¯ 1 q ) γ + ( 1 n m ¯ ¯ 2 q ) γ 1 ) 1 γ ) 1 q ;
ξ t s f = ( 1 ( ξ ( 1 p m ¯ ¯ q ) γ ( ξ 1 ) ) 1 γ ) 1 q , ( ξ a s ¯ ¯ q γ ( ξ 1 ) ) 1 q γ , ( ξ n m ¯ ¯ q γ ( ξ 1 ) ) 1 q γ ;
t s f ξ = ( ξ p m ¯ ¯ q γ ( ξ 1 ) ) 1 q γ , ( 1 ( ξ ( 1 a s ¯ ¯ q ) γ ( ξ 1 ) ) 1 γ ) 1 q , ( 1 ( ξ ( 1 n m ¯ ¯ q ) γ ( ξ 1 ) ) 1 γ ) 1 q .
Likewise, a number of attractive properties of the T-SPHFNs ALs can be easily obtained.
Theorem 1. 
Let the three T-SPHFNs be  t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ , t s f 1 = p m ¯ ¯ 1 , a s ¯ ¯ 1 , n m ¯ ¯ 1  and t s f 2 = p m ¯ ¯ 2 , a s ¯ ¯ 2 , n m ¯ ¯ 2 . Then,
(1) 
t s f 1 S S t s f 2 = t s f 2 S S t s f 1 ;
(2) 
t s f 1 S S t s f 2 = t s f 2 S S t s f 1 ;
(3) 
λ ( t s f 1 S S t s f 2 ) = λ t s f 1 S S λ t s f 2 ,   λ 0 ;
(4) 
λ 1 t s f S S λ 2 t s f = ( λ 1 + λ 2 ) t s f ;   λ 1 , λ 2 0 ;
(5) 
t s f λ 1 S S t s f λ 2 = ( t s f ) λ 1 + λ 2 ,   λ 1 , λ 2 0 ;
(6) 
t s f 1 λ S S t s f 2 λ = ( t s f 1 S S t s f 2 ) λ ,   λ 0 .

4.2. The T-Spherical Fuzzy Schweizer-Sklar Power Heronian Mean Operators

The T-SPHFSSPOHEM and T-SPHFSSPOGHEM Operators

In this sub-subpart, we initiate various new AOs under the T-SPHF environment by merging the POA operator with the HEM operator and the GHEM, respectively.
Definition 8. 
Let t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i   ( i = 1 , 2 , . , l ) be a group of T-SPHFNs, and then the T-SPHFSSPOHEM operator is explained as follows:
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) ( i , j = 1 j = i l ( l ( 1 + T ( t s f i ) ) h = 1 l ( 1 + T ( t s f h ) ) t s f i ) A S S ( l ( 1 + T ( t s f j ) ) h = 1 l ( 1 + T ( t s f h ) ) t s f j ) B ) ) 1 A + B
where A , B 0 , T ( t s f i ) = j = 1 j i l sup r ( t s f i , t s f j ) , sup r ( t s f i , t s f j ) = 1 D I T ¯ ¯ ( t s f i , t s f j ) , and D I T ¯ ¯ ( t s f i , t s f j ) can be computed by Equation (13).
Let i = ( 1 + T ( t s f i ) ) h = 1 l ( 1 + T ( t s f h ) ) , then the definition of T-SPHFSSPOHEM operator is equivalent to the subsequent form:
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) ( i , j = 1 j = i l ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B
Theorem 2. 
Let  A 0 ,   B 0  and  A , B  take no more than one value of 0 at a time, t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i be a group of T-SPHFNs. Then, utilizing the T-SPHFSSPOHEM operator, their fused values are also T-SPHFN, and
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i u ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q .
Proof. 
From the Schweizer–Sklar operational laws for T-SPHFS, we have
l i t s f i = ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) 1 q , ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 q γ , ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 q γ ;
and
( l i t s f i ) A = ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 q γ , ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) 1 q , ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) 1 q .
Similarly,
l j t s f j = ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) 1 q , ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 q ζ , ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 q γ ;
and
( l j t s f j ) B = ( B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ ( B 1 ) ) 1 q γ , ( 1 ( B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ ( B 1 ) ) 1 γ ) 1 q , ( 1 ( B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ ( B 1 ) ) 1 γ ) 1 q .
( l i t s f i ) A S S ( l j t s f j ) B = ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 q γ , ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) 1 q , ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) 1 q ,
i , j = 1 j = i l ( l i t s f i ) A S S ( l j t s f j ) B = ( 1 ( i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ( l ( l + 1 ) 2 1 ) ) 1 γ ) 1 q , ( i , j = 1 j = i u ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ( l ( l + 1 ) 2 1 ) ) 1 q γ , ( i , j = 1 j = i l ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ( l ( l + 1 ) 2 1 ) ) 1 q γ .
2 l ( l + 1 ) ( i , j = 1 j = i l ( l i s f t i ) A S S ( l j s f t j ) B ) = ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) 1 q , ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 q γ , ( 2 l ( l + 1 ) i , j = 1 j = i u ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 q γ .
( 2 l ( l + 1 ) ( i , j = 1 j = i l ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q .
Hence,
T S P F H S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q .
 □
Now, we confer various core properties of the anticipated T-SPHFSSPOHEM operator.
Theorem 3. 
(Idempotency)Let  A 0 ,   B 0  and  A , B  take no more than one value of 0 at a time,  t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i ( i = 1 , 2 , , l )  be a group of T-SPHFNs, and  t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i = t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ ( i = 1 , 2 , , l ) . Then
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯
Proof. 
Since, t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i = t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ ( i = 1 , 2 , , l ) , we have
supr ( t s f g , t s f z ) = 1   (   g , z = 1 , 2 , , l )   so   g = 1 u (   g = 1 , 2 , , u )   and   l g = l 1 l = 1 ( g = 1 , 2 , , l )
Then
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = T S P H F S S P O H E M A , B ( t s f , t s f , , t s f ) = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i u ( 1 ( A ( 1 ( ( 1 p m ¯ ¯ q ) γ ) 1 γ ) γ + B ( 1 ( ( 1 p m ¯ ¯ q ) γ ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 a s ¯ ¯ q ) γ + B ( 1 a s ¯ ¯ q ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 n m ¯ ¯ q ) γ + B ( 1 n m ¯ ¯ q ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q ,
= ( 1 A + B ( ( A + B ) p m ¯ ¯ q γ A B + 1 ) 1 A + B + 1 ) 1 q γ , ( 1 ( 1 A + B ( ( A + B ) ( 1 a s ¯ ¯ q ) γ A B + 1 ) 1 A + B + 1 ) 1 γ ) 1 q , ( 1 ( 1 A + B ( ( A + B ) ( 1 n m ¯ ¯ q ) γ A B + 1 ) 1 A + B + 1 ) 1 γ ) 1 q , = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ = t s f
Theorem 4. 
(Commutativity)Let ( t s f , t s f 2 , , t s f l ) be any permutation of ( t s f 1 , t s f 2 , , t s f l ) . Then
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l )
Proof. 
Since ( t s f , t s f 2 , , t s f l ) is any permutation of ( t s f 1 , t s f 2 , , t s f l ) . SO,
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( u + 1 ) ( i , j = 1 j = i l ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B ,   = ( 2 l ( l + 1 ) ( i , j = 1 j = i l ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B ,   = T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) .
Theorem 5. 
(Boundedness)Let t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i ( i = 1 , 2 , , l ) be a group of T-SPHFNs, t s f = mini i p m ¯ ¯ i , maxi i a s ¯ ¯ i , maxi i n m ¯ ¯ i and t s f + = maxi i p m ¯ ¯ i , mini i a s ¯ ¯ i , mini i n m ¯ ¯ i . Then
t s f T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) t s f +
Proof. 
By the comparison method in Definition 2, we have t s f i t s f i , then deployed on Theorems 3 and 4, we have
T S P H F S S P H E M A , B ( t s f 1 , t s f 2 , , t s f l ) T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = t s f
Similarly, we can have
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) T S P H F S S P O H E M A , B ( t s f 1 + , t s f 2 + , , t s f l + ) = t s f + .
So, we have
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) T S P H F S S P O H E M A , B ( t s f 1 + , t s f 2 + , , t s f l + )
Hence,
t s f T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) t s f +
 □
By allocating different values to the parameters γ , q , A   a n d   B , various special cases of the T-SPHFSSPOHEM operator can be obtained, which can be expressed as given below:
Case 1. If γ = 0 , then the T-SPHFSSPOHEM operator degenerates to the T-SPHFPOHEM operator, which can be expressed as follows:
T S P H F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) i , j = 1 j = i l ( ( l i t s f i ) A ( l j t s f j ) B ) ) 1 A + B = ( ( 1 i , j = 1 j = i u ( 1 ( 1 ( 1 p m ¯ ¯ i q ) l i ) A ( 1 ( 1 p m ¯ ¯ j q ) l j ) B ) 2 l ( l + 1 ) ) 1 q ) 1 A + B , ( 1 ( 1 i , j = 1 j = i l ( 1 ( 1 ( a s ¯ ¯ i ) q l i ) A ( 1 ( a s ¯ ¯ j ) q l j ) B ) 2 l ( l + 1 ) ) 1 A + B ) 1 q ,   ( 1 ( 1 i , j = 1 j = i u ( 1 ( 1 ( n m ¯ ¯ i ) q l i ) A ( 1 ( n m ¯ ¯ j ) q l j ) B ) 2 l ( l + 1 ) ) 1 A + B ) 1 q .
Case 2. If q = 1 , then the T-SPHFSSPOHEM operator degenerates to the picture fuzzy Schweizer–Sklar power Heronian mean (PIFSSPOHEM) operator, which can be expressed as follows:
P I F S S P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) i , j = 1 j = i u ( ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j ) γ ( l m j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ , 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i a s ¯ ¯ i γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ , 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i n m ¯ ¯ i γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ .
Case 3. If q = 2 , then the T-SPHFSSPOHEM operator degenerates to the Spherical fuzzy Schweizer–Sklar power Heronian mean (SPFSSPOHEM) operator, which can be expressed as follows:
S P F S S P H M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) i , j = 1 j = i l ( ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i 2 ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 p m ¯ ¯ j 2 ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 2 γ , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i a s ¯ ¯ i 2 γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j a s ¯ ¯ j 2 γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 2 , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i n m ¯ ¯ i 2 γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j n m ¯ ¯ j 2 γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 2 .
Case 4. If B 0 , then the T-SPHFSSPOHEM operator degenerates to the T-SPHF descending POA operator, which can be expressed as follows:
T S P F S S P H M A , B ( t s f 1 , t s f 2 , , t s f n ) = lim B 0 ( 2 l ( l + 1 ) i , j = 1 j = i l ( ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B   = ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( l i t s f i ) A ) ) 1 A = ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 q γ , ( 1 ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 n ( ( l + 1 i ) ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 γ ) 1 q .
Case 5. If A 0 , then the T-SPHFSSPOHEM operator degenerates to the T-SPF ascending POA operator, which can be expressed as follows:
T S P H F S S P O H E M 0 , B ( t s f 1 , t s f 2 , , t s f n ) = lim A 0 ( 2 l ( l + 1 ) i , j = 1 j = i l ( ( l i t s f i ) A S S ( l j t s f j ) B ) ) 1 A + B   = ( 2 l ( l + 1 ) i = 1 l ( i ( l i t s f i ) B ) ) 1 B = ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( i ( 1 ( A ( 1 ( l i ( 1 p m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 q γ , ( 1 ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( i ( 1 ( A ( 1 ( l i a s ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( i ( 1 ( A ( 1 ( l i n m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 γ ) 1 q .
Case 6. If B 0 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOHEM operator degenerates to the T-SPHF linear descending WA operator, which can be expressed as follows:
T S P H F S S P O H E M A , 0 ( t s f 1 , t s f 2 , , t s f n ) = lim B 0 ( 2 l ( l + 1 ) i , j = 1 j = 1 l ( l i t s f i ) A ( l j t s f j ) B ) 1 A + B   = ( 2 l ( l + 1 ) i = 1 l ( l + 1 i ) t s f i A ) 1 A = ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A p m ¯ ¯ i q γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 q γ , ( 1 ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 a s ¯ ¯ i q ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 n m ¯ ¯ i q ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 γ ) 1 q
Certainly, the importance degree of T-SPHFNs t s f i A ( i = 1 , 2 , . , l ) is ( l , l 1 , . , 1 ) .
Case 7. If A 0 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOHEM operator degenerates to the T-SPHF linear ascending WA operator, which can be expressed as follows:
T S P F S S P H M 0 , B ( t s f 1 , t s f 2 , , t s f n ) = lim A 0 ( 2 l ( l + 1 ) i , j = 1 j = 1 l ( l i t s f i ) A ( l j t s f j ) B ) 1 A + B   = ( 2 l ( l + 1 ) i = 1 l ( i t s f i B ) ) 1 B = ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( i ) ( 1 ( B p m ¯ ¯ i q γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 q γ , ( 1 ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( i ) ( 1 ( B ( 1 a s ¯ ¯ i q ) γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( i ) ( 1 ( B ( 1 n m ¯ ¯ i q ) γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 γ ) 1 q .
Case 8. If A = B = 1 2 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOHEM operator degenerates to the T-SPHF basic HEM operator, which can be expressed as follows:
T S P H F S S P O H E M 1 2 , 1 2 ( t s f 1 , t s f 2 , , t s f n ) = 2 l ( l + 1 ) i , j = 1 j = 1 l ( ( t s f i ) 1 2 ( t s f j ) 1 2 ) = ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( 1 2 p m ¯ ¯ i q γ + 1 2 p m ¯ ¯ j q γ ) 1 γ ) γ ) 1 γ ) 1 q , ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( 1 2 ( 1 a s ¯ ¯ i q ) γ + 1 2 ( 1 a s ¯ ¯ j q ) γ ) 1 γ ) γ ) 1 q γ ,   ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( 1 2 ( 1 n m ¯ ¯ i q ) γ + 1 2 ( 1 n m ¯ ¯ j q ) γ ) 1 γ ) γ ) 1 q γ .
Case 9. If A = B = 1 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOHEM operator degenerates to the T-SPHF linear HEM operator, which can be expressed as follows:
T S P H F S S P O H E M 1 , 1 ( t s f 1 , t s f 2 , , t s f n ) = ( 2 l ( l + 1 ) i , j = 1 j = 1 l ( t s f i t s f j ) ) 1 2 = ( 1 2 ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( p m ¯ ¯ i q γ + p m ¯ ¯ j q γ 1 ) 1 γ ) γ ) 1 γ ) γ + 1 2 ) 1 q γ , ( 1 ( ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( ( 1 a s ¯ ¯ i q ) γ + ( 1 a s ¯ ¯ j q ) γ 1 ) 1 γ ) γ ) 1 γ ) γ + 1 2 ) 1 γ ) 1 q , ( 1 ( ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( ( 1 n m ¯ ¯ i q ) γ + ( 1 n m ¯ ¯ j q ) γ 1 ) 1 γ ) γ ) 1 γ ) γ + 1 2 ) 1 γ ) 1 q .
Definition 9. 
Let t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i   ( i = 1 , 2 , . , l ) be a group of T-SPHFNs, and then the T-SPHF Schweizer–Sklar power geometric Heronian mean (T-SPHFSSPOGHEM) operator is explained as follows:
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f n ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l ( 1 + T ( t s f i ) ) z = 1 l ( 1 + T ( t s f z ) ) S S B t s f j l ( 1 + T ( t s f j ) ) z = 1 l ( 1 + T ( t s f z ) ) ) ) 2 l ( l + 1 )
where A , B 0 , T ( t s f i ) = j = 1 j i l supr ( t s f i , t s f j ) , supr ( t s f i , t s f j ) = 1 D I T ¯ ¯ ( t s f i , t s f j ) , and D I T ¯ ¯ ( t s f i , t s f j ) can be computed by Equation (13).
Let i = ( 1 + T ( t s f i ) ) z = 1 l ( 1 + T ( t s f z ) ) , then the definition of T-SPHFSSPOGHEM operator is equivalent to the following form:
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l i S S B t s f j l j ) ) 2 l ( l + 1 )
Theorem 6. 
Let A 0 ,   B 0 and A , B take no more than one value of 0 at a time, t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i be a group of T-SPHFNs. Then, utilizing the T-SPHFSSPOGHEM operator, their fused values are also T-SPHFN, and
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f n ) = ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ .
Proof. 
From the Schweizer–Sklar operational laws for T-SPFS, we have
t s f i l i = ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 q γ , ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) 1 q , ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) 1 q ,
and
A t s f i l i = ( 1 ( A ( 1 ( l i t s f ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) 1 q , ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 q γ , ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 q γ .
Similarly,
t s f j l j = ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 q γ , ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) 1 q , ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) 1 q , B s f j l j = ( 1 ( B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ ( B 1 ) ) 1 γ ) 1 q , ( B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ ( B 1 ) ) 1 q γ , ( B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ ( B 1 ) ) 1 q γ . A t s f i l i S S B t s f j l j = ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) 1 q , ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 q γ ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 q γ .
Therefore,
i , j = 1 j = i l ( A t s f i l i S S B t s f j l j ) = ( i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ( l ( l + 1 ) 2 1 ) ) 1 q γ , ( 1 ( i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ( l ( l + 1 ) 2 1 ) ) 1 γ ) 1 q , ( 1 ( i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ( l ( l + 1 ) 2 1 ) ) 1 γ ) 1 q . ( i , j = 1 j = i l ( A t s f i l i S S B t s f j l j ) ) 2 l ( l + 1 ) = ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 q γ , ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) 1 q , ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) 1 q . 1 A + B ( i , j = 1 j = i l ( A t s f i l i S S B t s f j l j ) ) 2 l ( l + 1 ) = ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ .
Hence,
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j q γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j q ) γ ( n Ω j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j q ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ .
 □
Now we confer several desirable properties of the anticipated T-SPHFSSPOGHEM operator.
Theorem 7. 
(Idempotency)Let A 0 ,   B 0 and A , B take no more than one value of 0 at a time, t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i ( i = 1 , 2 , , l ) be a group of T-SPHFNs, and t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i = t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯ ( i = 1 , 2 , , l ) . Then
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = t s f = p m ¯ ¯ , a s ¯ ¯ , n m ¯ ¯
Theorem 8. 
(Commutativity)Let ( t s f 1 , t s f 2 , , t s f l ) be any permutation of ( t s f 1 , t s f 2 , , t s f l ) . Then
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l )
Theorem 9. 
(Boundedness)Let t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i ( i = 1 , 2 , , l ) be a group of T-SPHFNs, t s f = mini i p m ¯ ¯ i , maxi i a s ¯ ¯ i , maxi i n m ¯ ¯ i and t s f + = maxi i p m ¯ ¯ i , mini i a s ¯ ¯ i , mini i n m ¯ ¯ i . Then
t s f T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) t s f +
The proofs of these Theorems are the same as the proofs of the Theorems for T-SPHFSSPOHEM operators. Hence, these are committed here.
By allocating distinct values of the parameters γ , q , A   a n d   B , various special cases of the T-SPHFSSPOGHEM operator can be obtained, which can be expressed as given below:
Case 1. If γ = 0 , then the T-SPHFSSPOGHEM operator degenerates to the T-SPFPGHM operator, which can be expressed as follows:
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 ) = ( 1 ( 1 i , j = 1 j = i l ( 1 ( 1 ( p m ¯ ¯ i ) q l i ) A ( 1 ( p m ¯ ¯ j ) q l j ) B ) 2 l ( l + 1 ) ) 1 A + B ) 1 q , ( ( 1 i , j = 1 j = i l ( 1 ( 1 ( 1 a s ¯ ¯ i q ) l i ) A ( 1 ( 1 a s ¯ ¯ j q ) l j ) B ) 2 l ( l + 1 ) ) 1 q ) 1 A + B , ( ( 1 i , j = 1 j = i l ( 1 ( 1 ( 1 n m ¯ ¯ i q ) l i ) A ( 1 ( 1 n m ¯ ¯ j q ) l j ) B ) 2 l ( l + 1 ) ) 1 q ) 1 A + B .
Case 2. If q = 1 , then the T-SPHFSSPOGHEM operator degenerates to the picture fuzzy Schweizer–Sklar power Heronian mean (PIFSSPOGHEM) operator, which can be expressed as follows:
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j p m ¯ ¯ j γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ .
Case 3. If q = 2 , then the T-SPHFSSPOGHEM operator degenerates to the Spherical fuzzy Schweizer-Sklar power Heronian mean (SPHFSSPOGHEM) operator, which can be expressed as follows:
T S P H F S S P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i p m ¯ ¯ i 2 γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j Ξ j 2 γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 2 , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i 2 ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 a s ¯ ¯ j 2 ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 2 γ , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i 2 ) γ ( l i 1 ) ) 1 γ ) γ + B ( 1 ( l j ( 1 n m ¯ ¯ j 2 ) γ ( l j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 2 γ .
Case 4. If B 0 , then the T-SPHFSSPOGHEM operator degenerates to the T-SPHF descending PG operator, which can be expressed as follows:
T S P H F S S P O G H E M A , 0 ( t s f 1 , t s f 2 , , t s f n ) = lim B 0 1 A + B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 )   = 1 A ( i = 1 l ( A Θ i l i ) ( l + 1 i ) ) 2 l ( l + 1 ) = ( 1 ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 γ ) 1 q , ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 q γ ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 q γ .
Case 5. If A 0 , then the T-SPHFSSPOGHEM operator degenerates to the T-SPHF ascending power geometric operator, which can be expressed as follows:
T S P F S S P G H M 0 , B ( t s f 1 , t s f 2 , , t s f n ) = lim A 0 1 B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 )   = 1 B ( i = 1 l ( B t s f i l i ) i ) 2 l ( l + 1 ) = ( 1 ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( i ( 1 ( B ( 1 ( l i p m ¯ ¯ i q γ ( l i 1 ) ) 1 γ ) γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 γ ) 1 q , ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( i ( 1 ( B ( 1 ( l i ( 1 a s ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 q γ ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( i ( 1 ( B ( 1 ( l i ( 1 n m ¯ ¯ i q ) γ ( l i 1 ) ) 1 γ ) γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 q γ .
Case 6.  If B 0 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOGHEM operator relapses to the T-SPF linear descending WGA operator, which can be expressed as follows:
T S P H F S S P O G H E M A , 0 ( t s f 1 , t s f 2 , , t s f n ) = lim B 0 1 B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 )   = 1 A ( i = 1 l ( A t s f i ) ( l + 1 i ) ) 2 l ( l + 1 ) = ( 1 ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A ( 1 p m ¯ ¯ i q ) γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 γ ) 1 q , ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A a s ¯ ¯ i q γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 q γ , ( 1 A ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( l + 1 i ) ( 1 ( A n m ¯ ¯ i q γ ( A 1 ) ) 1 γ ) γ ) ( ( 2 l i ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 A 1 ) ) 1 q γ .
Certainly, the importance degree of T-SPHN A t s f i ( i = 1 , 2 , . , l ) is ( l , l 1 , . , 1 ) .
Case 7. If A 0 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOGHEM operator relapses to the T-SPHF linear ascending WG operator, which can be expressed as follows:
T S P H F S S P O G H E M 0 , B ( t s f 1 , t s f 2 , , t s f l ) = lim A 0 1 A + B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 )   = 1 B ( i = 1 l ( B t s f i ) i ) 2 l ( l + 1 ) = ( 1 ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( i ) ( 1 ( B ( 1 p m ¯ ¯ i q ) γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 γ ) 1 q , ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 n ( ( i ) ( 1 ( B a s ¯ ¯ i q γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 q γ , ( 1 B ( 1 ( 2 l ( l + 1 ) i = 1 l ( ( i ) ( 1 ( B n m ¯ ¯ i q γ ( B 1 ) ) 1 γ ) γ ) ( ( l + i 1 ) ( 2 l ( l + 1 ) ) 1 ) ) 1 γ ) γ ( 1 B 1 ) ) 1 q γ .
Case 8. If A = B = 1 2 , and sup r ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOGHEM operator degenerates to the T-SPHF geometric Heronian mean operator, which can be expressed as follows:
T S P F S S P G H M 1 2 , 1 2 ( t s f 1 , t s f 2 , , t s f n ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 )   = ( 1 2 i , j = 1 j = i l ( t s f i t s f j ) ) 2 l ( l + 1 ) = ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( 1 2 ( 1 p m ¯ ¯ i q ) γ + 1 2 ( 1 p m ¯ ¯ j q ) γ ) 1 γ ) γ ) 1 q γ , ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( 1 2 a s ¯ ¯ i q γ + 1 2 a s ¯ ¯ j q γ ) 1 γ ) γ ) 1 γ ) 1 q ,   ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( 1 2 n m ¯ ¯ i q γ + 1 2 n m ¯ ¯ j q γ ) 1 γ ) γ ) 1 γ ) 1 q
Case 9. If A = B = 1 , and supr ( t s f i , t s f j ) = h ( h [ 0 , 1 ] ) ( i j ) , then the T-SPHFSSPOGHEM operator relapses to the T-SPHF basic geometric Heronian mean operator, which can be expressed as follows:
T S P H F S S P O G H E M 1 , 1 ( t s f 1 , t s f 2 , , t s f n ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l i B t s f j l j ) ) 2 l ( l + 1 )   = 1 2 ( i , j = 1 j = i l ( t s f i t s f j ) ) 2 l ( l + 1 ) = ( 1 ( ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( ( 1 p m ¯ ¯ i q ) γ + ( 1 p m ¯ ¯ j q ) γ 1 ) 1 γ ) γ ) 1 γ ) γ + 1 2 ) 1 γ ) 1 q , ( 1 2 ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( a s ¯ ¯ i q γ + a s ¯ ¯ j q γ 1 ) 1 γ ) γ ) 1 γ ) γ + 1 2 ) 1 q γ , ( 1 2 ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i n ( 1 ( n m ¯ ¯ i q γ + n m ¯ ¯ j q γ 1 ) 1 γ ) γ ) 1 γ ) γ + 1 2 ) 1 q γ .

4.3. T-SPHFSSWPOHEM and T-SPHFSSWPOGHEM Operators

In this subpart, we initiate the T-SPHFSSWPOHEM operator and the T-SPHFSWPOGHEM operator by taking the importance of the attributes.
Definition 10. 
Let A , B 0 , t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i ( i = 1 , 2 , , l ) be a group of T-SPHFNs and ς = ( ς 1 , ς 2 , , ς n ) T be the importance degree of t s f i ( i = 1 , 2 , , l ) , where ς i 0 and i = 1 l ς i = 1 . The T-SPHFSSWPOHEM operator is explained as:
T S P H F S S W P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) ( i , j = 1 j = i l ( l ς i ( 1 + T ( t s f i ) ) z = 1 l ς z ( 1 + T ( t s f z ) ) t s f i ) A S S ( l ς j ( 1 + T ( t s f j ) ) z = 1 l ς z ( 1 + T ( t s f z ) ) t s f j ) B ) ) 1 A + B
where A , B 0 , T ( t s f i ) = j = 1 j i l supr ( t s f i , t s f j ) , supr ( t s f i , t s f j ) = 1 D I T ¯ ¯ ( t s f i , t s f j ) , and D I T ¯ ¯ ( t s f i , t s f j ) can be computed by Equation (13).
Let i = ( 1 + T ( t s f i ) ) z = 1 l ( 1 + T ( t s f z ) ) , then the definition of T-SPHFSSWPOHEM operator is equivalent to the following form:
T S P H F S S W P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 2 l ( l + 1 ) ( i , j = 1 j = i l ( l ς i i t s f i ) A S S ( l j ς j t s f j ) B ) ) 1 A + B
Theorem 10. 
Let A 0 ,   B 0 and A , B take no more than one value of 0 at a time, t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i be a group of T-SPFNs. Then, utilizing the T-SPHFSSWPOHEM operator, their fused values are also T-SPHFN, and
T S P H F S S W P O H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l ς i i ( 1 p m ¯ ¯ i q ) γ ( l ς i i 1 ) ) 1 γ ) γ + B ( 1 ( l ς j j ( 1 p m ¯ ¯ j q ) γ ( l ς j j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l ς i i a s ¯ ¯ i q γ ( l ς i i 1 ) ) 1 γ ) γ + B ( 1 ( l ς j j a s ¯ ¯ j q γ ( l ς j j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l ς i i n m ¯ ¯ i q γ ( l ς i i 1 ) ) 1 γ ) γ + B ( 1 ( l ς j j ϒ j q γ ( l ς j j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q .
Definition 11. 
Let A , B 0 , t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i ( i = 1 , 2 , , l ) be a group of T-SPHFNs and ς = ( ς 1 , ς 2 , , ς n ) T be the importance degree of t s f i ( i = 1 , 2 , , l ) , where ς i 0 and i = 1 n ς i = 1 . The T-SPHFSSWPOGHEM operator is explained as:
T S P H F S S W P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l ς i ( 1 + T ( t s f i ) ) z = 1 l ς z ( 1 + T ( t s f z ) ) S S B t s f j l ς j ( 1 + T ( t s f j ) ) z = 1 l ς z ( 1 + T ( t s f z ) ) ) ) 2 l ( l + 1 )
where A , B 0 , T ( t s f i ) = j = 1 j i l supr ( t s f i , t s f j ) , supr ( t s f i , t s f j ) = 1 D S T ¯ ¯ ( t s f i , t s f j ) , and D S T ¯ ¯ ( t s f i , t s f j ) can be computed by Equation (13).
Let i = ( 1 + T ( t s f i ) ) z = 1 l ( 1 + T ( t s f z ) ) , then the definition of T-SPFSSWPGHM operator is equivalent to the following form:
T S P F S S W P O G H E M A , B ( t s f 1 , t s f 2 , , t s f n ) = 1 A + B ( i , j = 1 j = i l ( A t s f i l ς i i S S B t s f j l ς j j ) ) 2 l ( l + 1 )
Theorem 11. 
Let A 0 ,   B 0 and A , B take no more than one value of 0 at a time, t s f i = p m ¯ ¯ i , a s ¯ ¯ i , n m ¯ ¯ i be a group of T-SPHFNs. Then, utilizing the T-SPHFSSWPOGHEM operator, their fused values are also T-SPHFN, and
T S P H F S S W P O G H E M A , B ( t s f 1 , t s f 2 , , t s f l ) = ( 1 ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l ς i i p m ¯ ¯ i q γ ( l ς i i 1 ) ) 1 γ ) γ + B ( 1 ( l ς j j p m ¯ ¯ j q γ ( l ς j j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 γ ) 1 q , ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l ς i i ( 1 a s ¯ ¯ i q ) γ ( l ς i i 1 ) ) 1 γ ) γ + B ( 1 ( l ς j j ( 1 a s ¯ ¯ j q ) γ ( l ς j j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ ( 1 A + B ( 1 ( 2 l ( l + 1 ) i , j = 1 j = i l ( 1 ( A ( 1 ( l ς i i ( 1 n m ¯ ¯ i q ) γ ( l ς i i 1 ) ) 1 γ ) γ + B ( 1 ( l ς j j ( 1 n m ¯ ¯ j q ) γ ( l ς j j 1 ) ) 1 γ ) γ A B + 1 ) 1 γ ) γ ) 1 γ ) γ ( 1 A + B 1 ) ) 1 q γ .
The proofs of Theorems 10 and 11 are the same as Theorems 2 and 6. Therefore, here we omit their proofs.

5. The Approach to Solve MADM Problems

In this part, we initiate an innovative process for MADM problems, which is based on the initiated T-SPHFSSWPOHEM and T-SPHFSSWPOGHEM. The main goal of the MADM problem is to choose the best option between several available options. The procedure of the initiated process can be articulated as follows:
Let V S = { V S 1 , V S 2 , , V S m } and R E = { R E 1 , R E 2 , , R E n } be groups of alternatives/options and attributes/criteria, respectively. Let the weight vector of each attribute R E h is C E h where h = 1 , 2 , , l and h = 1 l C E h = 1 . The assessment information is provided in the form of T-SPHFNs. So, the T-SPHF decision matrix (DM) M T = [ Θ i h ] in which t s f i h = ( t s f i h 1 , t s f i h 2 , , t s f i h l ) T S P H F S ( C E h ) where h = 1 , 2 , , l and i = 1 , 2 , m as follows:
[ A l t e r n a t i v e s \ A t t r i b u t e s R E 1 R E 2 R E l V S 1 Θ 11 Θ 12 Θ 1 l V S 2 Θ 21 Θ 22 Θ 2 l . . . . . . . . V S m Θ m 1 Θ m 2 . Θ m l ]
The initiated process is in accord with the following steps:
Step 1. Normalize the DM. In this step, we put up the T-SPHF DM. For illustration, for all i = 1 , , m and h = 1 , , l , we calculate
[ A l t e r n a t i v e s / a t t r i b u t e s V S 1 V S 2 . . V S m R E 1 R E 1 h 1 R E 2 h 1 . . R E m h 1 R E 2 R E 1 h 2 R E 2 h 2 . . R E m h 2 . . R E l R E l h l R E l h l . . R E m h l ] , [ A l t e r n a t i v e s / a t t r i b u t e s V S 1 V S 2 . . V S m R E 1 t s f 1 h 1 t s f 2 h 1 . . t s f m h 1 R E 2 t s f 1 h 2 t s f 2 h 2 . . t s f m h 2 . . R E l t s f l h l t s f l h l . . t s f m h l ] .
where
t s f i h g = R E i h g g = 1 l R E i h g , ( g = 1 , , l )
Then the T-SPHF DM M T = [ Θ i h ] in which t s f i h = ( t s f i h 1 , t s f i h 2 , , t s f i h n ) T S P H F S ( C E h ) is a T-SPHF DM, where h = 1 , , l and i = 1 , , m . This conveys that V S i is a T-SPHFS on the attributes set R E = { R E 1 , R E 2 , , R E l } .
Step 2. Determine the Support Degree by utilizing the formula:
S u p ( t s f i h , t s f i k ) = 1 D I T ¯ ¯ ( t s f i h , t s f i k ) ;
where D S T ¯ ¯ ( t s f i h , t s f i k ) symbolized as the distance measure among two T-SPFNs t s f i h and t s f i k provided in Equation (13).
Step 3. Determine the weighted Sup T ( t s f i h ) of the T-SPHFN t s f i h by the other T-SPHFNs t s f i k ( h , k = 1 , , l ) by the formula:
T ( t s f i h ) = j = 1 k h q S u p ( t s f i h , t s f i k ) ; ( h , k = 1 , , l ) .
Step 4. Determine the weight h associated with T-SPFN t s f h , by utilizing the formula:
h = l ς h ( 1 + T ( t s f h ) ) h = 1 l ( 1 + T ( t s f i h ) ) , i = 1 , , m ; h = 1 , 2 , , l .
Step 5. Determine the overall assessment value of every alternative t s f i by utilizing the formula:
T S P H F S S W P O H E M A , B ( t s f i 1 , t s f i 2 , , t s f i l )
or
T S P H F S S W P O G H E M A , B ( t s f i 1 , t s f i 2 , , t s f i l )
Step 6. Find out the score values S R E ˜ ( t s f i ) of the collective T-SPFNs t s f i ( i = 1 , 2 , , m ) to rank the alternatives V S i ( i = 1 , 2 , , m ) and then pick the finest one(s). If the score values of T-PFNs are the same, then we determine the accuracy values and rank the alternatives according to their accuracy values and pick the finest one(s).

6. Numerical Example

In this subpart, we utilize the initiated algorithm based on these newly initiated aggregation operators for assessing water reuse applications. These data are taken from reference [4].
The suggested algorithm is applied for the City of Penticton (CoP) in British Columbia (BC), Canada. Residents, businesses, institutions, and industries all use public water. The wastewater is processed and treated using biological nutrient removal equipment at an automated wastewater treatment facility. Half of the filtered water is reused, while the rest is released into a river. There are seven alternatives (Water reuses) such as V S 1 toilet flushing (TF), V S 2 watering vegetables in the garden (VW), V S 3 watering flowers in the garden, V S 4 agricultural irrigation (AI), V S 5 hydration of public parks (PPW), V S 6 watering of golf courses (GCW), and V S 7 drinking water (DW). These seven alternatives are assessed by using five attributes namely, R E 1 public acceptability, R E 2 freshwater saving, R E 3 life cycle cost, R E 4 human health risk, and R E 4 governments’ policies, and the data are given in Table 2 and Table 3. The weight of the attributes are ς j = ( 0.2 , 0.2 , 0.2 , 0.2 , 0.2 ) . The local governments’ policies are assessed by utilizing a linguistic term set. The corresponding T-SPFNs of linguistic terms are given in Table 3.
Now, we will utilize the suggested algorithm to solve the assessment of the water reuse application. The following steps should be followed.
Step 1. Discover the T-SPF decision matrix M T = [ Θ i j ]   i = 1 , 2 , , 7 , j = 1 , 2 , , 5 by exploiting Equation (57), listed in Table 4 and Table 5.
Step 2. Discover the support degrees S u p ( Θ i i j , Θ i i h ) , i = 1 , 2 , , 7 , j , h = 1 , 2 , , 5 , by exploiting Equation (58), and we have
S 12 1 = S 21 1 = 0.7267 , S 13 1 = S 31 1 = 0.6373 , S 14 1 = S 41 1 = 0.7458 , S 15 1 = S 51 1 = 0.7564 , S 23 1 = S 32 1 = 0.9106 , S 24 1 = S 42 1 = 0.9809 , S 25 1 = S 52 1 = 0.9704 , S 34 1 = S 43 1 = 0.8915 , S 35 1 = S 53 1 = 0.8810 , S 45 1 = S 45 1 = 0.9870 , S 12 2 = S 21 2 = 0.8230 , S 13 2 = S 31 2 = 0.8230 , S 14 2 = S 41 2 = 0.8481 , S 15 2 = S 51 2 = 0.7672 , S 23 2 = S 32 2 = 1.000 , S 24 2 = S 42 2 = 0.8584 , S 25 2 = S 52 2 = 0.9443 , S 34 2 = S 43 2 = 0.8584 , S 35 2 = S 53 2 = 0.9443 , S 45 2 = S 45 2 = 0.8562 , S 12 3 = S 21 3 = 0.6997 , S 13 3 = S 31 3 = 0.6997 , S 14 3 = S 41 3 = 0.7221 , S 15 3 = S 51 3 = 0.8960 , S 23 3 = S 32 3 = 1.0000 , S 24 3 = S 42 3 = 0.9776 , S 25 3 = S 52 3 = 0.8037 , S 34 3 = S 43 3 = 0.9776 , S 35 3 = S 53 3 = 0.8037 , S 45 3 = S 45 3 = 0.8261 , S 12 4 = S 21 4 = 0.7597 , S 13 4 = S 31 4 = 0.7597 , S 14 4 = S 41 4 = 0.7677 , S 15 4 = S 51 4 = 0.7893 , S 23 4 = S 32 4 = 1.0000 , S 24 4 = S 42 4 = 0.9920 , S 25 4 = S 52 4 = 0.9704 , S 34 4 = S 43 4 = 0.9920 , S 35 4 = S 53 4 = 0.9704 , S 45 4 = S 45 4 = 0.9708 , S 12 5 = S 21 5 = 0.6932 , S 13 5 = S 31 5 = 0.6932 , S 14 5 = S 41 5 = 0.7138 , S 15 5 = S 51 5 = 0.8895 , S 23 5 = S 32 5 = 1.0000 , S 24 5 = S 42 5 = 0.9794 , S 25 5 = S 52 5 = 0.8040 , S 34 5 = S 43 5 = 0.9794 , S 35 5 = S 53 5 = 0.8037 , S 45 5 = S 45 5 = 0.8243 , S 12 6 = S 21 6 = 0.6746 , S 13 6 = S 31 6 = 0.6746 , S 14 6 = S 41 6 = 0.6940 , S 15 6 = S 51 6 = 0.7042 , S 23 6 = S 32 6 = 1.0000 , S 24 6 = S 42 6 = 0.9805 , S 25 6 = S 52 6 = 0.9704 , S 34 6 = S 43 6 = 0.9805 , S 35 6 = S 53 6 = 0.9704 , S 45 6 = S 45 6 = 0.9870 , S 12 7 = S 21 7 = 0.8902 , S 13 7 = S 31 7 = 0.8902 , S 14 7 = S 41 7 = 0.9677 , S 15 7 = S 51 7 = 0.8848 , S 23 7 = S 32 7 = 1.0000 , S 24 7 = S 42 7 = 0.9022 , S 25 7 = S 52 7 = 0.7750 , S 34 7 = S 43 7 = 0.9022 , S 35 7 = S 53 7 = 0.7750 , S 45 7 = S 45 7 = 0.8728 .
Step 3. Exploiting Equation (59), to discover the weighted support Sup T ( R E i j ) . For simplicity, we indicate T ( R E i j ) by T i j , we have
T 11 = 2.8663 , T 12 = 3.5886 , T 13 = 3.3204 , T 14 = 3.6053 , T 15 = 3.5948 , T 21 = 3.2612 , T 22 = 3.6257 , T 23 = 3.6257 , T 24 = 3.4211 , T 25 = 3.5120 , T 31 = 3.0174 , T 32 = 3.4809 , T 33 = 3.4809 , T 34 = 3.5034 , T 35 = 3.3295 , T 41 = 3.0763 , T 42 = 3.7220 , T 43 = 3.7220 , T 44 = 3.7224 , T 45 = 3.7008 , T 51 = 2.9897 , T 52 = 3.4763 , T 53 = 3.4763 , T 54 = 3.4969 , T 55 = 3.3212 , T 61 = 2.7474 , T 62 = 3.6255 , T 63 = 3.6255 , T 64 = 3.6421 , T 65 = 3.6320 , T 71 = 3.6329 , T 72 = 3.5673 , T 73 = 3.5673 , T 74 = 3.6448 , T 75 = 3.3075 .
Step 4. Exploiting Equation (60), to discover weight Ω j (j = 1,2, … ,5), we have
Ω 11 = 0.8797 , Ω 12 = 1.0440 , Ω 13 = 0.9830 , Ω 14 = 1.0478 , Ω 15 = 1.0454 , Ω 21 = 0.9492 , Ω 22 = 1.0304 , Ω 23 = 1.0304 , Ω 24 = 0.9849 , Ω 25 = 1.0051 , Ω 31 = 0.9209 , Ω 32 = 1.0272 , Ω 33 = 1.0272 , Ω 34 = 1.0323 , Ω 35 = 0.9925 , Ω 41 = 0.8883 , Ω 42 = 1.0291 , Ω 43 = 1.0291 , Ω 44 = 1.0291 , Ω 45 = 1.0244 , Ω 51 = 0.9167 , Ω 52 = 1.0285 , Ω 53 = 1.0285 , Ω 54 = 1.0333 , Ω 55 = 0.9929 , Ω 61 = 0.8413 , Ω 62 = 1.0384 , Ω 63 = 1.0384 , Ω 64 = 1.0421 , Ω 65 = 1.0398 , Ω 71 = 1.0196 , Ω 72 = 1.0051 , Ω 73 = 1.0051 , Ω 74 = 1.0222 , Ω 75 = 0.9480 .
Step 5. Exploiting Equation (61), to discover the overall assessment values of each alternative V S i ,   i = 1 , 2 , , 7 , we have ( A = 2 , B = 3 , γ = 2   a n d   q = 2 ) ,
V S 1 = 0.3807 , 0.0453 , 0.1154 , V S 2 = 0.3411 , 0.0987 , 0.1324 , V S 3 = 0.5126 , 0.0370 , 0.1317 , V S 4 = 0.3771 , 0.0589 , 0.1155 , V S 5 = 0.5197 , 0.0226 , 0.1330 , V S 6 = 0.4862 , 0.0479 , 0.1192 , V S 7 = 0.1979 , 0.1159 , 0.3747 .
or
Exploiting Equation (61), to discover the overall assessment values of each alternative V S i ,   i = 1 , 2 , , 7 , we have ( A = 2 , B = 3 , γ = 2   a n d   q = 2 ) ,
V S 1 = 0.1056 , 0.3031 , 0.3426 , V S 2 = 0.2943 , 0.3416 , 0.3069 , V S 3 = 0.1759 , 0.2445 , 0.2716 , V S 4 = 0.1299 , 0.2822 , 0.3335 , V S 5 = 0.2070 , 0.2412 , 0.2737 , V S 6 = 0.1047 , 0.2824 , 0.3142 , V S 7 = 0.3889 , 0.2171 , 0.5854 .
Step 6. Utilizing Equation (6) given in Definition (2), to discover the score values of overall T-SPFNs V S i ,   i = 1 , 2 , , 7 , to rank the alternatives, we have
S c r ( V S 1 ) = 0.0432 , S c r ( V S 2 ) = 0.0297 , S c r ( V S 3 ) = 0.0813 , S c r ( V S 4 ) = 0.0418 , S c r ( V S 5 ) = 0.0840 , S c r ( V S 6 ) = 0.0733 , S c r ( V S 7 ) = 0.0382 .
or
S c r ( V S 1 ) = 0.0660 , S c r ( V S 2 ) = 0.0414 , S c r ( V S 3 ) = 0.0342 , S c r ( V S 4 ) = 0.0580 , S c r ( V S 5 ) = 0.0301 , S c r ( V S 6 ) = 0.0558 , S c r ( V S 7 ) = 0.0796 .
According to score values, the ranking orders are V S 5 > V S 3 > V S 6 > V S 1 > V S 4 > V S 2 > V S 7 and V S 5 > V S 3 > V S 2 > V S 6 > V S 4 > V S 1 > V S 7 . Hence the best one is V S 5 hydration of public parks, and the worst one is V S 7 drinking water (DW).

6.1. Effect of Parameters

6.1.1. Effect of the Parameters A , B on Ranking Order Utilizing T-SPFSSWHM and T-SPFSSPWGHM Operators

In this subpart, the effect of the parameters A , B utilizing T-SPFSSPWHM and T-SPFSSPWGHM operators are investigated, and the values of the parameters q = 2   a n d   γ = 2 are fixed. The score values and ranking orders for distinct values of the parameters A , B utilizing T-SPFSSPWHM and T-SPFSSPWGHM operators are given in Table 6 and Table 7. From Table 6, one can notice that the ranking order is slightly different for different values of the parameter A , B , although the best and the worst alternative remains the same. From Table 6, we also noticed that when the values of the parameters enlarge, the score values of the alternatives decline. Similarly, From Table 7, one can notice that the ranking order is different for different values of the parameter A , B . When A , B = 1 , the best one is V S 3 , while the worst alternative remains the same. From Table 7 we also noticed that when the values of the parameters increase, the score values of the alternatives increase.

6.1.2. Effect of the Parameter γ on Final Ranking Orders Utilizing T-SPFSSPWHM and T-SPFSSPWGHM Operators

In this subpart, the effect of the parameter γ on final ranking orders utilizing T-SPFSSPWHM and T-SPFSSPWGHM operators are investigated, and the value of other parameters A = 2 ,   B = 3   a n d   q = 2 are fixed. The score values and ranking orders for different values of the parameter γ utilizing T-SPFSSWPHM and T-SPFSSPWGHM operators are given in Table 8 and Table 9. One can notice from Table 8 that for distinct values of the parameter γ the ranking order is different. That is, utilizing the T-SPFSSPWHM operator for distinct values of γ the best alternative is either V S 5 or V S 6 while the worst alternative remain the same which is V S 7 . We can also notice that when the values of the parameter decrease, the score values of the alternative increase. Similarly, from Table 9, we can see that for distinct values of the parameter γ the ranking order is different from the ranking order obtained for γ = 2 . That is, utilizing the T-SPFSSPWGHM operator for distinct values of γ , the best alternative is V S 3 while the worst alternative remains the same, which is V S 7 . We can also notice that when the values of the parameter decline, the score values of the alternative decline.

6.1.3. Effect of the Parameter q on Final Ranking Orders Utilizing T-SPFSSPWHM and T-SPFSSPWGHM Operators

In this subpart, the effect of the parameter q on final ranking orders utilizing T-SPFSSPWHM and T-SPFSSPWGHM operators are investigated, and the value of other parameters A = 2 ,   B = 3   a n d   γ = 2 are fixed. The score values and ranking orders for different values of the parameter q utilizing T-SPFSSWPHM and T-SPFSSPWGHM operators are given in Table 10. One can notice from Table 10, that is, for distinct values of the parameter, q , the ranking order is totally different. That is, utilizing T-SPFSSPWHM and T-SPFPWGHM operators for distinct values of q , the best alternative is either V S 1 , V S 5 or V S 6 while the worst alternative is V S 1 , V S 4   a n d   V S 7 . The reason behind these different ranking orders is that these AOs are more flexible due to consisting of general parameters. Therefore, the MADM model based on these aggregation operators is more flexible. Hence, the decision-maker may choose the values of these parameters according to the actual needs of the situations.

6.1.4. Comparison with Existing Approaches

In this subpart, we compare our produced MADM model, which is based on these developed novel AGOs, to some current techniques, such as the approach initiated by Garg et al. [38] and the MADM model initiated by Tahir et al. [4]. The score values and ranking orders are given in Table 11. From Table 11, one can notice that the ranking order obtained from these approaches and the proposed approaches are the same, except the approach developed on the T-SPFWG operator. This shows that the developed MADM decision making model is valid. The initiated MADM model has some advantages over the existing approaches.
(1)
The anticipated MADM model is based on the newly initiated aggregation operators. That is, these aggregation operators are proposed utilizing SS ALs for T-SPFNs, which consist of general parameters that make the decision-making process more flexible. Meanwhile, the existing MADM models are based on the aggregation operators, which are initiated utilizing algebraic ALs.
(2)
The existing aggregation operators have the characteristic that they can only remove the effect of awkward data by utilizing power weight vector, while the anticipated aggregation operators have the ability to remove the effect of awkward data as well as consider the interrelationship among the input data at the same time.
(3)
The other advantage of the anticipated AOs is that it consists of general parameters, which make the decision-making process more flexible. Therefore, the initiated AOs are more practical and comparative in their utilization while solving MADM models under T-SPF information.

7. Conclusions

One of several implementations of multi-criteria decision-making (MCDM) problems is indeed the assessment of water reuse strategies. Water reuse is a potential method for boosting the urban supply of water, particularly in light of the changing standards such as climate change and increased human activity. A cost-effective, long-term water reuse application should pose an admissible health risk to customers. Data collection is frequently coupled with difficulties of ambiguity, hesitation, and parameterization, making water reuse application evaluation difficult. In this article, a T-Spherical fuzzy set-based decision support is initiated to offer an efficient approach to explain ambiguity, hesitation, and uncertainty. The contribution of this article is fourfold. Firstly, the novel SS ALs for T-SPFN are initiated and some the vital characteristic of these ALs are investigated. Secondly, based on these novel SS ALs, some T-SPFSSPHM operators such as the T-Spherical fuzzy Schweizer–Sklar power Heronian mean operator, the T-Spherical fuzzy Schweizer–Sklar power geometric Heronian mean operator, the T-Spherical fuzzy Schweizer–Sklar power weighted Heronian mean operator, the T-Spherical fuzzy Schweizer–Sklar power weighted geometric Heronian mean operator, and their vital properties and special cases with respect to the parameters are discussed. By giving specific values to the general parameters, we can observe that some of the existing AOs are special cases of these newly initiated AOs. These AOs have advantages over the existing AOs. These AOs have the capacity to remove the influence of awkward data and consider the interrelationship among the input data at the same time, while the existing aggregation operators for T-SPFS can remove the effect of awkward data or create interrelationships among input data. Thirdly, based on these AOs, a MADM model is anticipated. Lastly, the anticipated model is applied to select the best option in water reuse from the available options.
In future, we will apply the anticipated approach to some new applications, such as supply chain management [5,9], public transportation [24], traffic control [54], digital twin model [56], and so on, or extend the anticipated model to some more extended form of T-SPFSs.

Author Contributions

Idea and conceptualization, Q.K. and M.S.; methodology, Q.K. and J.G.; collection of data and result calculation, Q.K. and M.K.A.; validation, J.G.; writing—original draft preparation, Q.K. and J.G.; writing—review and editing, Q.K. and J.G. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (Grant No. NRF-2020R1I1A3074141), the Brain Research Program through the NRF funded by the Ministry of Science, ICT and Future Planning (Grant No. NRF-2019M3C7A1020406), and “Regional Innovation Strategy (RIS)” through the NRF funded by the Ministry of Education.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Miller, G.W. Integrated concepts in water reuse: Managing global water needs. Desalination 2006, 187, 65–75. [Google Scholar] [CrossRef]
  2. Zarghami, M.; Szidarovszky, F. Stochastic-fuzzy multi criteria decision making for robust water resources management. Stoch. Environ. Res. Risk Assess. 2009, 23, 329–339. [Google Scholar] [CrossRef]
  3. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  4. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  5. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  6. Xu, Z.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gener. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  7. Liu, P.; Khan, Q.; Mahmood, T.; Hassan, N. T-spherical fuzzy power Muirhead mean operator based on novel operational laws and their application in multi-attribute group decision making. IEEE Access 2019, 7, 22613–22632. [Google Scholar] [CrossRef]
  8. Bonferroni, C. Sulle medie multiple di potenze. Boll. dell’Unione Mat. Ital. 1950, 5, 267–270. [Google Scholar]
  9. Sykora, S. Mathematical Means and Averages: Generalized Heronian Means. Stan’s Libr. Castano Primo 2009, 3. [Google Scholar] [CrossRef]
  10. Muirhead, R.F. Some methods applicable to identities and inequalities of symmetric algebraic functions of n letters. Proc. Edinb. Math. Soc. 1902, 21, 144–162. [Google Scholar] [CrossRef] [Green Version]
  11. Maclaurin, C. A second letter to Martin Folkes, Esq.; concerning the roots of equations, with the demonstration of other rules of algebra. Philos. Trans. 1729, 36, 59–96. [Google Scholar]
  12. Pan, Q.; Chhipi-Shrestha, G.; Zhou, D.; Zhang, K.; Hewage, K.; Sadiq, R. Evaluating water reuse applications under uncertainty: Generalized intuitionistic fuzzy-based approach. Stoch. Environ. Res. Risk Assess. 2018, 32, 1099–1111. [Google Scholar] [CrossRef]
  13. Phochanikorn, P.; Tan, C. A new extension to a multi-criteria decision-making model for sustainable supplier selection under an intuitionistic fuzzy environment. Sustainability 2019, 11, 5413. [Google Scholar] [CrossRef] [Green Version]
  14. Tseng, M.L.; Tan, P.A.; Jeng, S.Y.; Lin, C.W.R.; Negash, Y.T.; Darsono, S.N.A.C. Sustainable investment: Interrelated among corporate governance, economic performance and market risks using investor preference approach. Sustainability 2019, 11, 2108. [Google Scholar] [CrossRef] [Green Version]
  15. Wang, R.; Nan, G.; Chen, L.; Li, M. Channel integration choices and pricing strategies for competing dual-channel retailers. IEEE Trans. Eng. Manag. 2020, 1–15. [Google Scholar] [CrossRef]
  16. Mousavi-Avval, S.H.; Rafiee, S.; Mohammadi, A. Development and Evaluation of Combined Adaptive Neuro-Fuzzy Inference System and Multi-Objective Genetic Algorithm in Energy, Economic and Environmental Life Cycle Assessments of Oilseed Production. Sustainability 2021, 13, 290. [Google Scholar] [CrossRef]
  17. Stekelorum, R.; Laguir, I.; Gupta, S.; Kumar, S. Green supply chain management practices and third-party logistics providers’ performances: A fuzzy-set approach. Int. J. Prod. Econ. 2021, 235, 108093. [Google Scholar] [CrossRef]
  18. Coppolino, L.; Romano, L.; Scaletti, A.; Sgaglione, L. Fuzzy set theory-based comparative evaluation of cloud service offerings: An agro-food supply chain case study. Technol. Anal. Strateg. Manag. 2020, 1–14. [Google Scholar] [CrossRef]
  19. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [Google Scholar] [CrossRef]
  20. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy sets syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  21. Yager, R.R. Pythagorean fuzzy subsets. In Proceedings of the 2013 Joint IFSA World Congress and NAFIPS Annual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  22. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  23. Yager, R.R. Pythagorean membership grades in multicriteria decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  24. Wei, G.; Wei, Y. Similarity measures of Pythagorean fuzzy sets based on the cosine function and their applications. Int. J. Intell. Syst. 2018, 33, 634–652. [Google Scholar] [CrossRef]
  25. Peng, X.; Dai, J. Approaches to Pythagorean fuzzy stochastic multi-criteria decision making based on prospect theory and regret theory with new distance measure and score function. Int. J. Intell. Syst. 2017, 3, 1187–1214. [Google Scholar] [CrossRef]
  26. Chen, T.Y. Remoteness index-based Pythagorean fuzzy VIKOR methods with a generalized distance measure for multiple criteria decision analysis. Inf. Fusion 2018, 41, 129–150. [Google Scholar] [CrossRef]
  27. Zhang, X. A novel approach based on similarity measure for Pythagorean fuzzy multiple criteria group decision making. Int. J. Intell. Syst. 2016, 31, 593–611. [Google Scholar] [CrossRef]
  28. Zulqarnain, R.M.; Xin, X.L.; Siddique, I.; Khan, W.A.; Yousif, M.A. TOPSIS method based on correlation coefficient under pythagorean fuzzy soft environment and its application towards green supply chain management. Sustainability 2021, 13, 1642. [Google Scholar] [CrossRef]
  29. Garg, H. A novel correlation coefficient between Pythagorean fuzzy sets and its applications to decision-making processes. Int. J. Intell. Syst. 2016, 31, 1234–1252. [Google Scholar] [CrossRef]
  30. Zhang, X.; Xu, Z. Extension of TOPSIS to multiple criteria decision making with Pythagorean fuzzy sets. Int. J. Intell. Syst. 2014, 29, 1061–1078. [Google Scholar] [CrossRef]
  31. Pérez-Dominguez, L.; Durán, S.N.A.; López, R.R.; Pérez-Olguin, I.J.C.; Luviano-Cruz, D.; Gómez, J.A.H. Assessment urban transport service and Pythagorean Fuzzy Sets CODAS method: A case of study of Ciudad Juárez. Sustainability 2021, 13, 1281. [Google Scholar] [CrossRef]
  32. Li, X.H.; Huang, L.; Li, Q.; Liu, H.C. Passenger satisfaction evaluation of public transportation using pythagorean fuzzy MULTIMOORA method under large group environment. Sustainability 2020, 12, 4996. [Google Scholar] [CrossRef]
  33. Rani, P.; Mishra, A.R.; Mardani, A.; Cavallaro, F.; Štreimikienė, D.; Khan, S.A.R. Pythagorean fuzzy SWARA–VIKOR framework for performance evaluation of solar panel selection. Sustainability 2020, 12, 4278. [Google Scholar] [CrossRef]
  34. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  35. Cuong, B.C.; Kreinovich, V. Picture Fuzzy Sets-a new concept for computational intelligence problems. In Proceedings of the 2013 Third World Congress on Information and Communication Technologies, WICT, Hanoi, Vietnam, 15–18 December 2013; pp. 1–6. [Google Scholar]
  36. Yager, R.R. The power average operator. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 2001, 31, 724–731. [Google Scholar] [CrossRef]
  37. Xu, Z. Approaches to multiple attribute group decision making based on intuitionistic fuzzy power aggregation operators. Knowl.-Based Syst. 2011, 24, 749–760. [Google Scholar] [CrossRef]
  38. Garg, H.; Ullah, K.; Mahmood, T.; Hassan, N.; Jan, N. T-spherical fuzzy power aggregation operators and their applications in multi-attribute decision making. J. Ambient Intell. Humaniz. Comput. 2021, 1–14. [Google Scholar] [CrossRef]
  39. Liu, P.; You, X. Interval neutrosophic Muirhead mean operators and their applications in multiple-attribute group decision making. Int. J. Uncertain. Quant. 2017, 7, 303–334. [Google Scholar] [CrossRef]
  40. Liu, P.; Khan, Q.; Mahmood, T. Some single-valued neutrosophic power muirhead mean operators and their application to group decision making. J. Intell. Fuzzy Syst. 2019, 37, 2515–2537. [Google Scholar] [CrossRef]
  41. Li, Y.; Liu, P.; Chen, Y. Some single valued neutrosophic number Heronian mean operators and their application in multiple attribute group decision making. Informatica 2016, 27, 85–110. [Google Scholar] [CrossRef] [Green Version]
  42. Xu, Z.; Yager, R.R. Intuitionistic fuzzy Bonferroni means. IEEE Trans. Syst. Man Cybern. Part B 2011, 41, 568–578. [Google Scholar]
  43. Zhou, W.; He, J.M. Intuitionistic fuzzy geometric Bonferroni means and their application in multi-criteria decision making. Int. J. Intell. Syst. 2012, 27, 995–1019. [Google Scholar] [CrossRef]
  44. Ashraf, S.; Abdullah, S.; Mahmood, T. Spherical fuzzy Dombi aggregation operators and their application in group decision making problems. J. Ambient Intell. Humaniz. Comput. 2019, 1–19. [Google Scholar] [CrossRef]
  45. Dombi, J. A general class of fuzzy operators, the DeMorgan class of fuzzy operators and fuzziness measures induced by fuzzy operators. Fuzzy Sets Syst. 1982, 8, 149–163. [Google Scholar] [CrossRef]
  46. Deschrijver, G.; Kerre, E.E. A generalization of operators on intuitionistic fuzzy sets using triangular norms and conorms. Notes Intuit. Fuzzy Sets 2002, 8, 19–27. [Google Scholar]
  47. Deschrijver, G. Generalized arithmetic operators and their relationship to t-norms in interval-valued fuzzy set theory. Fuzzy Sets Syst. 2009, 160, 3080–3102. [Google Scholar] [CrossRef] [Green Version]
  48. Zhang, X.; He, H.; Xu, Y. A fuzzy logic system based on Schweizer-Sklar t-norm. Sci. China Ser. F Inf. Sci. 2006, 49, 175–188. [Google Scholar] [CrossRef]
  49. Liu, P.; Wang, P. Some interval-valued intuitionistic fuzzy Schweizer–Sklar power aggregation operators and their application to supplier selection. Int. J. Syst. Sci. 2018, 49, 1188–1211. [Google Scholar] [CrossRef]
  50. Zhang, L. Intuitionistic fuzzy averaging Schweizer-Sklar operators based on interval-valued intuitionistic fuzzy numbers and its applications. In Proceedings of the 2018 Chinese Control and Decision Conference (CCDC), Shenyang, China, 9–11 June 2018; pp. 2194–2197. [Google Scholar]
  51. Wang, P.; Liu, P. Some Maclaurin symmetric mean aggregation operators based on Schweizer-Sklar operations for intuitionistic fuzzy numbers and their application to decision making. J. Intell. Fuzzy Syst. 2019, 36, 3801–3824. [Google Scholar] [CrossRef]
  52. Liu, P.; Khan, Q.; Mahmood, T. Multiple-attribute decision making based on single-valued neutrosophic Schweizer-Sklar prioritized aggregation operator. Cogn. Syst. Res. 2019, 57, 175–196. [Google Scholar] [CrossRef] [Green Version]
  53. Zhang, H.; Wang, F.; Geng, Y. Multi-Criteria Decision-Making Method Based on Single-Valued Neutrosophic Schweizer–Sklar Muirhead Mean Aggregation Operators. Symmetry 2019, 11, 152. [Google Scholar] [CrossRef] [Green Version]
  54. Nagarajan, D.; LathaMaheswari, M.; Broumi, S.; Kavikumar, J. A new perspective on traffic control management using triangular interval type-2 fuzzy sets and interval neutrosophic sets. Oper. Res. Perspect. 2019, 6, 100099. [Google Scholar] [CrossRef]
  55. Rong, Y.; Li, Q.; Pei, Z. A Novel Q-rung Orthopair Fuzzy Multi-attribute Group Decision-making Approach Based on Schweizer-sklar Operations and Improved COPRAS Method. In Proceedings of the 4th International Conference on Computer Science and Application Engineering, Sanya, China, 20–22 October 2020; pp. 1–6; Association for Computing Machinery: New York, NY, USA, 2020. [Google Scholar]
  56. Kapustina, I.V.; Sergeev, S.M.; Kalinina, O.V.; Vilken, V.V.; Putikhin, Y.Y.; Volkova, L.V. Developing the physical distribution digital twin model within the trade network. Acad. Strateg. Manag. J. 2021, 20, 1–24. [Google Scholar]
Table 1. Offers the latest literature of different structures of fuzzy MADM AOs based on SS ALs.
Table 1. Offers the latest literature of different structures of fuzzy MADM AOs based on SS ALs.
AuthorsDifferent Structures of Fuzzy MADM AOs Based on SS ALs
“Liu and Wang” [49] (2018)IVIFSSPWA and IVIFSSPWG operators
“Zhang” [50] (2018)IFSSWA operator
“Wang and Liu” [51] (2019)IFSSMSM operator
“Liu et al.” [52] (2019)SVNSSPrWA and SVNSSPrWG operators
“Zhang et al.” [53] (2019)SVNSSMM and SVNSSDMM operators
“Nagarajan et al.” [54] (2019)INSSWA and INSSWG operators
“Rong et al.” [55] (2020)Improved COPRAS method
Table 2. Data of public acceptability and fresh water saving.
Table 2. Data of public acceptability and fresh water saving.
Alternatives\Attributes R E 1   P u b l i c   A c c e p t a b i l i t y R E 2   F r e s h   W a t e r   S a v i n g
AgreeNeutralityDisagreeLowMediumHigh
TF   V S 1 80911428.8536643.2
VW   V S 2 63.51323.52624.832813937.2
FW   V S 3 84.5105.53192.53990.64788.8
AI   V S 4 74.51015.53192.53990.64788.8
PPW   V S 5 85.586.5886.31107.91329.5
GCW   V S 6 88.574.5361.8452.3542.7
DW   V S 7 2414623192.53990.64788.8
Table 3. Data of life cycle cost, human health risk, and government policies.
Table 3. Data of life cycle cost, human health risk, and government policies.
Alternatives\Attributes R E 3   L i f e   C y c l e   C o s t R E 4   H u m a n   H e a l t h   R i s k R E 5   G o v e r n m e n t s   P o l i c e s
AgreeNeutralityDisagreeLowMediumHigh
TF   V S 1 1,555,3581,944,1982,333,0387.1 × 10−127.51 × 10−128.30 × 10−12 M   0.5 , 0.5 , 0.5
VW   V S 2 1,637,21920,46,5242,455,8291.83 × 10−111.89 × 10−112.03 × 10−11 L   0.2 , 0.7 , 0.7
FW   V S 3 834,0191,042,5241,251,0281.78 × 10−111.84 × 10−111.99 × 10−11 H   0.8 , 0.2 , 0.2
AI   V S 4 146,660183,326219,9919.07 × 10−121.0 × 10−111.26 × 10−11 M   0.5 , 0.5 , 0.5
PPW   V S 5 635,529794,411953,2939.34 × 10−129.77 × 10−121.07 × 10−11 H   0.8 , 0.2 , 0.2
GCW   V S 6 78,21997,774117,3288.43 × 10−128.87 × 10−129.83 × 10−12 M   0.5 , 0.5 , 0.5
DW   V S 7 1,197,6741,497,0921,796,5112.76 × 10-84.01 × 10−81.00 × 10−7 V L   0.10 , 0.10 , 0.90
Table 4. T-SPF decision matrix M T .
Table 4. T-SPF decision matrix M T .
Alternatives\Attributes R E 1 R E 2 R E 3
V S 1 0.80 , 0.09 , 0.110 0.2667 , 0.3333 , 0.4000 0.0350 , 0.4386 , 0.5263
V S 2 0.6350 , 0.1300 , 0.2350 0.2667 , 0.3333 , 0.4000 0.2667 , 0.3333 , 0.4000
V S 3 0.8450 , 0.1000 , 0.0550 0.2667 , 0.3333 , 0.4000 0.2667 , 0.3333 , 0.4000
V S 4 0.7450 , 0.1000 , 0.1550 0.2667 , 0.3333 , 0.4000 0.2667 , 0.3333 , 0.4000
V S 5 0.8550 , 0.0800 , 0.0650 0.2667 , 0.3333 , 0.4000 0.2667 , 0.3333 , 0.4000
V S 6 0.8850 , 0.0700 , 0.0450 0.2667 , 0.3333 , 0.4000 0.2667 , 0.3333 , 0.4000
V S 7 0.2400 , 0.1400 , 0.6200 0.2666 , 0.3334 , 0.4000 0.2667 , 0.3333 , 0.4000
Table 5. T-SPF decision matrix M T .
Table 5. T-SPF decision matrix M T .
Alternatives\Attributes R E 4 R E 5
V S 1 0.3099 , 0.3278 , 0.3623 0.3333 , 0.3333 , 0.3333
V S 2 0.4651 , 0.4830 , 0.0519 0.1250 , 0.4375 , 0.4375
V S 3 0.3173 , 0.3280 , 0.3547 0.6667 , 0.1667 , 0.1667
V S 4 0.2864 , 0.3158 , 0.3979 0.3333 , 0.3333 , 0.3333
V S 5 0.3133 , 0.3277 , 0.3589 0.6667 , 0.1667 , 0.1667
V S 6 0.3107 , 0.3269 , 0.3623 0.3333 , 0.3333 , 0.3333
V S 7 0.1646 , 0.2391 , 0.5963 0.0909 , 0.0909 , 0.8182
Table 6. Effect of the parameters A , B on final ranking order utilizing the T-SPFSSPWHM operator.
Table 6. Effect of the parameters A , B on final ranking order utilizing the T-SPFSSPWHM operator.
ParametersScore ValuesRanking Order
A , B = 1 S c r ( V S 1 ) = 0.0296 , S c r ( V S 2 ) = 0.0186 , S c r ( V S 3 ) = 0.0850 , S c r ( V S 4 ) = 0.0126 , S c r ( V S 5 ) = 0.0901 , S c r ( V S 6 ) = 0.0874 , S c r ( V S 7 ) = 0.0872 . V S 5 > V S 6 > V S 3 > V S 1 > V S 2 > V S 4 > V S 7
A = 3 , B = 2 S c r ( V S 1 ) = 0.0721 , S c r ( V S 2 ) = 0.0774 , S c r ( V S 3 ) = 0.0118 , S c r ( V S 4 ) = 0.0682 , S c r ( V S 5 ) = 0.0091 , S c r ( V S 6 ) = 0.0317 , S c r ( V S 7 ) = 0.1550 . V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
A = 5 , B = 4 S c r ( V S 1 ) = 0.0502 , S c r ( V S 2 ) = 0.0521 , S c r ( V S 3 ) = 0.0083 , S c r ( V S 4 ) = 0.0464 , S c r ( V S 5 ) = 0.0106 , S c r ( V S 6 ) = 0.0137 , S c r ( V S 7 ) = 0.1343 . V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
A = 10 , B = 8 S c r ( V S 1 ) = 0.0544 , S c r ( V S 2 ) = 0.0551 , S c r ( V S 3 ) = 0.0030 , S c r ( V S 4 ) = 0.0485 , S c r ( V S 5 ) = 0.0049 , S c r ( V S 6 ) = 0.0206 , S c r ( V S 7 ) = 0.1367 . V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
A = 20 , B = 15 S c r ( V S 1 ) = 0.0669 , S c r ( V S 2 ) = 0.0676 , S c r ( V S 3 ) = 0.0103 , S c r ( V S 4 ) = 0.0588 , S c r ( V S 5 ) = 0.0087 , S c r ( V S 6 ) = 0.0346 , S c r ( V S 7 ) = 0.1468 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 30 , B = 25 S c r ( V S 1 ) = 0.0524 , S c r ( V S 2 ) = 0.0516 , S c r ( V S 3 ) = 0.0040 , S c r ( V S 4 ) = 0.0449 , S c r ( V S 5 ) = 0.0055 , S c r ( V S 6 ) = 0.0208 , S c r ( V S 7 ) = 0.1338 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 50 , B = 48 S c r ( V S 1 ) = 0.0240 , S c r ( V S 2 ) = 0.0186 , S c r ( V S 3 ) = 0.0326 , S c r ( V S 4 ) = 0.0208 , S c r ( V S 5 ) = 0.0342 , S c r ( V S 6 ) = 0.0104 , S c r ( V S 7 ) = 0.1123 . V S 5 > V S 3 > V S 6 > V S 2 > V S 4 > V S 1 > V S 7
A = 70 , B = 50 S c r ( V S 1 ) = 0.0764 , S c r ( V S 2 ) = 0.0768 , S c r ( V S 3 ) = 0.0209 , S c r ( V S 4 ) = 0.0664 , S c r ( V S 5 ) = 0.0196 , S c r ( V S 6 ) = 0.0455 , S c r ( V S 7 ) = 0.1546 . V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
A = 150 , B = 120 S c r ( V S 1 ) = 0.0621 , S c r ( V S 2 ) = 0.0615 , S c r ( V S 3 ) = 0.0067 , S c r ( V S 4 ) = 0.0525 , S c r ( V S 5 ) = 0.0055 , S c r ( V S 6 ) = 0.0319 , S c r ( V S 7 ) = 0.1416 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
Table 7. Effect of the parameters A , B on final ranking order utilizing the T-SPFSSPWHM operator.
Table 7. Effect of the parameters A , B on final ranking order utilizing the T-SPFSSPWHM operator.
ParametersScore ValuesRanking Order
A , B = 1 S c r ( V S 1 ) = 0.0697 , S c r ( V S 2 ) = 0.0531 , S c r ( V S 3 ) = 0.0041 , S c r ( V S 4 ) = 0.0311 , S c r ( V S 5 ) = 0.0042 , S c r ( V S 6 ) = 0.0262 , S c r ( V S 7 ) = 0.1240 . V S 3 > V S 5 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 3 , B = 2 S c r ( V S 1 ) = 0.0099 , S c r ( V S 2 ) = 0.0042 , S c r ( V S 3 ) = 0.0417 , S c r ( V S 4 ) = 0.0043 , S c r ( V S 5 ) = 0.0418 , S c r ( V S 6 ) = 0.0114 , S c r ( V S 7 ) = 0.0836 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 5 , B = 4 S c r ( V S 1 ) = 0.0237 , S c r ( V S 2 ) = 0.0175 , S c r ( V S 3 ) = 0.0299 , S c r ( V S 4 ) = 0.0073 , S c r ( V S 5 ) = 0.0300 , S c r ( V S 6 ) = 0.0001 , S c r ( V S 7 ) = 0.0939 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 10 , B = 8 S c r ( V S 1 ) = 0.0206 , S c r ( V S 2 ) = 0.0152 , S c r ( V S 3 ) = 0.0345 , S c r ( V S 4 ) = 0.0053 , S c r ( V S 5 ) = 0.0347 , S c r ( V S 6 ) = 0.0030 , S c r ( V S 7 ) = 0.0919 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 20 , B = 15 S c r ( V S 1 ) = 0.0116 , S c r ( V S 2 ) = 0.0076 , S c r ( V S 3 ) = 0.0440 , S c r ( V S 4 ) = 0.0014 , S c r ( V S 5 ) = 0.0444 , S c r ( V S 6 ) = 0.0112 , S c r ( V S 7 ) = 0.0859 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 30 , B = 25 S c r ( V S 1 ) = 0.0209 , S c r ( V S 2 ) = 0.0161 , S c r ( V S 3 ) = 0.0363 , S c r ( V S 4 ) = 0.0061 , S c r ( V S 5 ) = 0.0366 , S c r ( V S 6 ) = 0.0035 , S c r ( V S 7 ) = 0.0931 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 50 , B = 48 S c r ( V S 1 ) = 0.0430 , S c r ( V S 2 ) = 0.0318 , S c r ( V S 3 ) = 0.0226 , S c r ( V S 4 ) = 0.0181 , S c r ( V S 5 ) = 0.0228 , S c r ( V S 6 ) = 0.0092 , S c r ( V S 7 ) = 0.1049 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 70 , B = 50 S c r ( V S 1 ) = 0.0039 , S c r ( V S 2 ) = 0.0016 , S c r ( V S 3 ) = 0.0526 , S c r ( V S 4 ) = 0.0072 , S c r ( V S 5 ) = 0.0531 , S c r ( V S 6 ) = 0.0189 , S c r ( V S 7 ) = 0.0811 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
A = 150 , B = 120 S c r ( V S 1 ) = 0.0126 , S c r ( V S 2 ) = 0.0098 , S c r ( V S 3 ) = 0.0451 , S c r ( V S 4 ) = 0.0004 , S c r ( V S 5 ) = 0.0456 , S c r ( V S 6 ) = 0.0112 , S c r ( V S 7 ) = 0.0885 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
Table 8. Effect of the parameter γ on final ranking orders utilizing the T-SPFSSPWHM operator.
Table 8. Effect of the parameter γ on final ranking orders utilizing the T-SPFSSPWHM operator.
ParameterScore ValuesRanking Order
γ = 4 S c r ( V S 1 ) = 0.0510 , S c r ( V S 2 ) = 0.0311 , S c r ( V S 3 ) = 0.0892 , S c r ( V S 4 ) = 0.0382 , S c r ( V S 5 ) = 0.0934 , S c r ( V S 6 ) = 0.1085 , S c r ( V S 7 ) = 0.0548 . V S 6 > V S 5 > V S 3 > V S 1 > V S 4 > V S 2 > V S 7
γ = 8 S c r ( V S 1 ) = 0.0970 , S c r ( V S 2 ) = 0.0462 , S c r ( V S 3 ) = 0.1728 , S c r ( V S 4 ) = 0.0806 , S c r ( V S 5 ) = 0.1806 , S c r ( V S 6 ) = 0.1634 , S c r ( V S 7 ) = 0.0545 . V S 6 > V S 5 > V S 3 > V S 1 > V S 4 > V S 2 > V S 7
γ = 16 S c r ( V S 1 ) = 0.1789 , S c r ( V S 2 ) = 0.0812 , S c r ( V S 3 ) = 0.2101 , S c r ( V S 4 ) = 0.1434 , S c r ( V S 5 ) = 0.2170 , S c r ( V S 6 ) = 0.2042 , S c r ( V S 7 ) = 0.0440 . V S 5 > V S 3 > V S 6 > V S 1 > V S 4 > V S 2 > V S 7
γ = 20 S c r ( V S 1 ) = 0.1890 , S c r ( V S 2 ) = 0.0886 , S c r ( V S 3 ) = 0.2169 , S c r ( V S 4 ) = 0.1527 , S c r ( V S 5 ) = 0.2208 , S c r ( V S 6 ) = 0.2243 , S c r ( V S 7 ) = 0.0435 . V S 6 > V S 5 > V S 3 > V S 1 > V S 4 > V S 2 > V S 7
γ = 30 S c r ( V S 1 ) = 0.1977 , S c r ( V S 2 ) = 0.1056 , S c r ( V S 3 ) = 0.2224 , S c r ( V S 4 ) = 0.1612 , S c r ( V S 5 ) = 0.2308 , S c r ( V S 6 ) = 0.2444 , S c r ( V S 7 ) = 0.0401 . V S 6 > V S 5 > V S 3 > V S 1 > V S 4 > V S 2 > V S 7
γ = 50 S c r ( V S 1 ) = 0.2016 , S c r ( V S 2 ) = 0.1170 , S c r ( V S 3 ) = 0.2292 , S c r ( V S 4 ) = 0.1666 , S c r ( V S 5 ) = 0.2371 , S c r ( V S 6 ) = 0.2543 , S c r ( V S 7 ) = 0.0386 . V S 6 > V S 5 > V S 3 > V S 1 > V S 4 > V S 2 > V S 7
γ = 100 S c r ( V S 1 ) = 0.2042 , S c r ( V S 2 ) = 0.1234 , S c r ( V S 3 ) = 0.2322 , S c r ( V S 4 ) = 0.1703 , S c r ( V S 5 ) = 0.2388 , S c r ( V S 6 ) = 0.2578 , S c r ( V S 7 ) = 0.0364 . V S 6 > V S 5 > V S 3 > V S 1 > V S 4 > V S 2 > V S 7
Table 9. Effect of the parameter γ on final ranking orders utilizing the T-SPFSSPWGHM operator.
Table 9. Effect of the parameter γ on final ranking orders utilizing the T-SPFSSPWGHM operator.
Parameter Score ValuesRanking Order
γ = 4 S c r ( V S 1 ) = 0.0705 , S c r ( V S 2 ) = 0.0648 , S c r ( V S 3 ) = 0.0367 , S c r ( V S 4 ) = 0.0558 , S c r ( V S 5 ) = 0.03669 , S c r ( V S 6 ) = 0.0522 , S c r ( V S 7 ) = 0.1338 . V S 3 > V S 5 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
γ = 8 S c r ( V S 1 ) = 0.0685 , S c r ( V S 2 ) = 0.0680 , S c r ( V S 3 ) = 0.0303 , S c r ( V S 4 ) = 0.0485 , S c r ( V S 5 ) = 0.0305 , S c r ( V S 6 ) = 0.0453 , S c r ( V S 7 ) = 0.1722 . V S 3 > V S 5 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
γ = 16 S c r ( V S 1 ) = 0.0748 , S c r ( V S 2 ) = 0.0883 , S c r ( V S 3 ) = 0.0356 , S c r ( V S 4 ) = 0.0499 , S c r ( V S 5 ) = 0.0359 , S c r ( V S 6 ) = 0.0474 , S c r ( V S 7 ) = 0.2128 . V S 3 > V S 5 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
γ = 20 S c r ( V S 1 ) = 0.0803 , S c r ( V S 2 ) = 0.0924 , S c r ( V S 3 ) = 0.0388 , S c r ( V S 4 ) = 0.0514 , S c r ( V S 5 ) = 0.0391 , S c r ( V S 6 ) = 0.0491 , S c r ( V S 7 ) = 0.2214 . V S 3 > V S 5 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
γ = 30 S c r ( V S 1 ) = 0.0997 , S c r ( V S 2 ) = 0.1012 , S c r ( V S 3 ) = 0.0453 , S c r ( V S 4 ) = 0.0546 , S c r ( V S 5 ) = 0.0455 , S c r ( V S 6 ) = 0.0525 , S c r ( V S 7 ) = 0.2335 . V S 3 > V S 5 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
γ = 50 S c r ( V S 1 ) = 0.1237 , S c r ( V S 2 ) = 0.1116 , S c r ( V S 3 ) = 0.0526 , S c r ( V S 4 ) = 0.0584 , S c r ( V S 5 ) = 0.0528 , S c r ( V S 6 ) = 0.0566 , S c r ( V S 7 ) = 0.2424 . V S 3 > V S 5 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
γ = 100 S c r ( V S 1 ) = 0.1415 , S c r ( V S 2 ) = 0.1225 , S c r ( V S 3 ) = 0.05923 , S c r ( V S 4 ) = 0.0620 , S c r ( V S 5 ) = 0.05925 , S c r ( V S 6 ) = 0.0610 , S c r ( V S 7 ) = 0.2500 . V S 3 > V S 5 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
Table 10. Effect of the parameter q on final ranking orders utilizing T-SPFSSPWHM and T-SPFSSPWGHM operators.
Table 10. Effect of the parameter q on final ranking orders utilizing T-SPFSSPWHM and T-SPFSSPWGHM operators.
ParameterScore Values Utilizing T-SPFSSPWHM OperatorScore Values Utilizing T-SPFSSPWHM OperatorRanking Orders
q = 1 S c r ( V S 1 ) = 0.0835 , S c r ( V S 2 ) = 0.0020 , S c r ( V S 3 ) = 0.1545 , S c r ( V S 4 ) = 0.0516 , S c r ( V S 5 ) = 0.1254 , S c r ( V S 6 ) = 0.0384 , S c r ( V S 7 ) = 0.1155 . S c r ( V S 1 ) = 0.1446 , S c r ( V S 2 ) = 0.1786 , S c r ( V S 3 ) = 0.0558 , S c r ( V S 4 ) = 0.1185 , S c r ( V S 5 ) = 0.0550 , S c r ( V S 6 ) = 0.1009 , S c r ( V S 7 ) = 0.2521 . V S 3 > V S 5 > V S 1 > V S 4 > V S 6 > V S 2 > V S 7
and
V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
q = 3 S c r ( V S 1 ) = 0.0278 , S c r ( V S 2 ) = 0.0302 , S c r ( V S 3 ) = 0.2872 , S c r ( V S 4 ) = 0.3415 , S c r ( V S 5 ) = 0.2812 , S c r ( V S 6 ) = 0.3259 , S c r ( V S 7 ) = 0.1611 . S c r ( V S 1 ) = 0.2333 , S c r ( V S 2 ) = 0.0180 , S c r ( V S 3 ) = 0.0740 , S c r ( V S 4 ) = 0.1601 , S c r ( V S 5 ) = 0.0749 , S c r ( V S 6 ) = 0.2939 , S c r ( V S 7 ) = 0.0786 . V S 1 > V S 2 > V S 7 > V S 5 > V S 3 > V S 6 > V S 4
and
V S 6 > V S 1 > V S 4 > V S 5 > V S 3 > V S 2 > V S 7
q = 5 S c r ( V S 1 ) = 0.0120 , S c r ( V S 2 ) = 0.0425 , S c r ( V S 3 ) = 0.0915 , S c r ( V S 4 ) = 0.0723 , S c r ( V S 5 ) = 0.0926 , S c r ( V S 6 ) = 0.0891 , S c r ( V S 7 ) = 0.0153 . S c r ( V S 1 ) = 0.1296 , S c r ( V S 2 ) = 0.0015 , S c r ( V S 3 ) = 0.0329 , S c r ( V S 4 ) = 0.0278 , S c r ( V S 5 ) = 0.0332 , S c r ( V S 6 ) = 0.2233 , S c r ( V S 7 ) = 0.0640 . V S 5 > V S 3 > V S 6 > V S 4 > V S 2 > V S 7 > V S 1
and
V S 6 > V S 1 > V S 5 > V S 3 > V S 4 > V S 2 > V S 7
q = 7 S c r ( V S 1 ) = 0.0808 , S c r ( V S 2 ) = 0.0777 , S c r ( V S 3 ) = 0.0897 , S c r ( V S 4 ) = 0.0810 , S c r ( V S 5 ) = 0.0907 , S c r ( V S 6 ) = 0.0915 , S c r ( V S 7 ) = 0.0145 . S c r ( V S 1 ) = 0.0156 , S c r ( V S 2 ) = 0.0154 , S c r ( V S 3 ) = 0.0877 , S c r ( V S 4 ) = 0.0337 , S c r ( V S 5 ) = 0.1071 , S c r ( V S 6 ) = 0.2859 , S c r ( V S 7 ) = 0.0504 . V S 6 > V S 5 > V S 3 > V S 4 > V S 1 > V S 2 > V S 7
and
V S 6 > V S 5 > V S 3 > V S 4 > V S 1 > V S 2 > V S 7
q = 9 S c r ( V S 1 ) = 0.0814 , S c r ( V S 2 ) = 0.0788 , S c r ( V S 3 ) = 0.0856 , S c r ( V S 4 ) = 0.0802 , S c r ( V S 5 ) = 0.0863 , S c r ( V S 6 ) = 0.0880 , S c r ( V S 7 ) = 0.0310 . S c r ( V S 1 ) = 0.0347 , S c r ( V S 2 ) = 0.0347 , S c r ( V S 3 ) = 0.0239 , S c r ( V S 4 ) = 0.2086 , S c r ( V S 5 ) = 0.0424 , S c r ( V S 6 ) = 0.1413 , S c r ( V S 7 ) = 0.0450 . V S 6 > V S 5 > V S 3 > V S 4 > V S 1 > V S 2 > V S 7
and
V S 4 > V S 6 > V S 5 > V S 3 > V S 1 > V S 2 > V S 7
Table 11. Comparison with existing approaches.
Table 11. Comparison with existing approaches.
Aggregation OperatorsScore ValuesRanking Order
T-SPFPWA operator [38] S c r ( V S 1 ) = 0.2335 , S c r ( V S 2 ) = 0.1975 , S c r ( V S 3 ) = 0.2881 , S c r ( V S 4 ) = 0.2201 , S c r ( V S 5 ) = 0.2902 , S c r ( V S 6 ) = 0.2704 , S c r ( V S 7 ) = 0.0716 . V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
T-SPFPGWA operator [38] S c r ( V S 1 ) = 0.3280 , S c r ( V S 2 ) = 0.3291 , S c r ( V S 3 ) = 0.2458 , S c r ( V S 4 ) = 0.2913 , S c r ( V S 5 ) = 0.2461 , S c r ( V S 6 ) = 0.2852 , S c r ( V S 7 ) = 0.3938 . V S 3 > V S 5 > V S 6 > V S 4 > V S 2 > V S 1 > V S 7
T-SPFWA operator [4] S c r ( V S 1 ) = 0.0211 , S c r ( V S 2 ) = 0.0036 , S c r ( V S 3 ) = 0.0806 , S c r ( V S 4 ) = 0.0128 , S c r ( V S 5 ) = 0.0834 , S c r ( V S 6 ) = 0.0656 , S c r ( V S 7 ) = 0.0971 . V S 5 > V S 3 > V S 6 > V S 1 > V S 4 > V S 2 > V S 7
T-SPFWG operator [4] S c r ( V S 1 ) = 0.0262 , S c r ( V S 2 ) = 0.0268 , S c r ( V S 3 ) = 0.0285 , S c r ( V S 4 ) = 0.0111 , S c r ( V S 5 ) = 0.0321 , S c r ( V S 6 ) = 0.0059 , S c r ( V S 7 ) = 0.1271 . V S 5 > V S 3 > V S 6 > V S 4 > V S 1 > V S 2 > V S 7
In this article S c r ( V S 1 ) = 0.0432 , S c r ( V S 2 ) = 0.0297 , S c r ( V S 3 ) = 0.0813 , S c r ( V S 4 ) = 0.0418 , S c r ( V S 5 ) = 0.0840 , S c r ( V S 6 ) = 0.0733 , S c r ( V S 7 ) = 0.0382 . V S 5 > V S 3 > V S 6 > V S 1 > V S 4 > V S 2 > V S 7
In this article S c r ( V S 1 ) = 0.0660 , S c r ( V S 2 ) = 0.0414 , S c r ( V S 3 ) = 0.0342 , S c r ( V S 4 ) = 0.0580 , S c r ( V S 5 ) = 0.0301 , S c r ( V S 6 ) = 0.0558 , S c r ( V S 7 ) = 0.0796 . V S 5 > V S 3 > V S 2 > V S 6 > V S 4 > V S 1 > V S 7
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Khan, Q.; Gwak, J.; Shahzad, M.; Alam, M.K. A Novel Approached Based on T-Spherical Fuzzy Schweizer-Sklar Power Heronian Mean Operator for Evaluating Water Reuse Applications under Uncertainty. Sustainability 2021, 13, 7108. https://0-doi-org.brum.beds.ac.uk/10.3390/su13137108

AMA Style

Khan Q, Gwak J, Shahzad M, Alam MK. A Novel Approached Based on T-Spherical Fuzzy Schweizer-Sklar Power Heronian Mean Operator for Evaluating Water Reuse Applications under Uncertainty. Sustainability. 2021; 13(13):7108. https://0-doi-org.brum.beds.ac.uk/10.3390/su13137108

Chicago/Turabian Style

Khan, Qaisar, Jeonghwan Gwak, Muhammad Shahzad, and Muhammad Kamran Alam. 2021. "A Novel Approached Based on T-Spherical Fuzzy Schweizer-Sklar Power Heronian Mean Operator for Evaluating Water Reuse Applications under Uncertainty" Sustainability 13, no. 13: 7108. https://0-doi-org.brum.beds.ac.uk/10.3390/su13137108

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

Article Metrics

Back to TopTop