Next Article in Journal
Separability of the Planar 1/ρ2 Potential in Multiple Coordinate Systems
Previous Article in Journal
Three Flavor Quasi-Dirac Neutrino Mixing, Oscillations and Neutrinoless Double Beta Decay
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Complex T-Spherical Fuzzy Aggregation Operators with Application to Multi-Attribute Decision Making

1
Department of Mathematics and Statistics, International Islamic University, Islamabad 44000, Pakistan
2
Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li 32023, Taiwan
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(8), 1311; https://doi.org/10.3390/sym12081311
Submission received: 13 July 2020 / Revised: 29 July 2020 / Accepted: 31 July 2020 / Published: 5 August 2020

Abstract

:
In this paper, the novel approach of complex T-spherical fuzzy sets (CTSFSs) and their operational laws are explored and also verified with the help of examples. CTSFS composes the grade of truth, abstinence, and falsity with a condition that the sum of q-power of the real part (also for imaginary part) of the truth, abstinence, and falsity grades cannot be exceeded from a unit interval. Additionally, to examine the interrelationships among the complex T-spherical fuzzy numbers (CTSFNs), we propose two aggregation operators, called complex T-spherical fuzzy weighted averaging (CTSFWA) and complex T-spherical fuzzy weighted geometric (CTSFWG) operators. A multi-attribute decision making (MADM) problem is resolved based on CTSFNs by using the proposed CTSFWA and CTSFWG operators. To examine the proficiency and reliability of the explored works, we use an example to make comparisons between the proposed operators and some existing operators. Based on the comparison results, the proposed CTSFWA and CTSFWG operators are well suited in the fuzzy environment with legitimacy and prevalence by contrasting other existing operators.

1. Introduction

Multi-attribute decision making (MADM) can be delineated as a method for choosing the most ideal alternative(s) among accessible choices. Settling on choices and decisions is a part of our normal life because we always face decisions. In reality, with the unpredictability of decision-making (DM) issues and the fuzziness of DM conditions, MADM accepts a significant part as a result of which we cannot generally have complete exact data [1]. To manage such issues, Zadeh [2] coordinated the creative thought of fuzzy sets (FSs) which relate each part of the universal set to a one of a kind genuine number, called a participation degree (PD), in [0,1]. Additionally, Atanassove [3] explored the intuitionistic fuzzy set (IFS) which contains the grades ‘satisfactory’ and ‘dissatisfactory’, whose sum is not exceeded from a unit interval. The conditions of IFS are very restricted for choosing the grade of ‘satisfactory’ or ‘dissatisfactory’. To improve the retractions of IFS, the theory of Pythagorean FS (PFS) was proposed by Yager [4], with a new condition that the sum of the squares of both is not exceeded from a unit interval. Because of the expansion in volumes and multifaceted nature of ongoing data, the theory of q-rung orthopair FS (QROFS) was considered by Yager [5], with a modified condition that the sum of q-powers of the satisfactory and the dissatisfactory grades is limited to a unit interval. Both IFS and PFS are exceptional instances of QROFS. We can contend that QROFS is progressively broad in light of the fact that as the bar builds, the satisfactory space of the orthopair increments and more orthopairs meet the limited conditions.
In real decision making, DMs may offer their feelings with more responses for a decision index, such as positive, negative, neutral, and abstinence. In order to express this information, Cuong [6] investigated the picture FS (PiFS)—which contains positive, abstinence, and negative grades—whose sum is bounded to [0,1]. However, in some cases, for a MD, it is very difficult to face some limitations, and so the spherical FS (SFS), established by Ullah et al. [7], is more powerful compared to IFS and PiFS. The constraint of SFS is that the sum of squares of positive, abstinence, and negative grades belongs to [0,1]. When a DM gives 0.9 for positive grade, 0.85 for abstinence grade, and 0.8 for negative grade, the PiFS and SFS are not able to parse it, and so the idea of T-spherical fuzzy set (TSFS) was established by Mahmood et al. [8], in which the sum of q-powers of positive, abstinence, and negative grades belong to [0,1]. The TSFS is more powerful compared to PiFS and SFS, and had been applied on evaluation of investment policy [9].
Many researchers had also raised a question: what will be the result if we change the range of the FS into unit disc in a complex plane? For coping with such kind of issue, the theory of complex FS (CFS), explored by Ramot et al. [10], which contains the grade of complex-valued supporting belonging to unit disc in a complex plane in the form of polar co-ordinates. Additionally, Alkouri and Salleh [11] improved CFS to explore complex intuitionistic FS (CIFS) that contains the grade of supporting and the grade of supporting against in the form of complex number in a unit disc with the condition that the sum of real part (also for the imaginary part) of the supporting grade and supporting against grade is not exceeded from a unit interval. Additionally, Ullah et al. [12] modified CIFS to explore the complex PFS (CPFS) with the condition that the sum of the squares of the real parts (also for imaginary parts) of the supporting and supporting against grades cannot be exceeded from a unit interval. After CPFS was introduced, the complex QROFS (CQROFS) [13] was demonstrated as a compelling device for delineating the vulnerability of MADM issues. The CQROFS is additionally described by the participation degree and the non-membership degree, whose aggregate of q-powers of the real part (also for imaginary part) is not exactly or equivalent to 1. Thus, CQROFS is broader than CIFS and CPFS.
Until now, CQROFS seems to be a broader extension of fuzzy sets, but in some circumstances, CQROFS cannot handle well. In this paper, we propose a novel approach of complex T-spherical fuzzy sets (CTSFSs). The proposed CTSFS can deal some circumstances better than CFS, CIFS, CPFS, or even CQROFS. We will give an example to explain it in the next section. Thus, the contributions of the paper are described as follows: (1) the novel approaches of CSFS and CTSFS with their operational laws are explored; (2) to examine the interrelationships among CTSFNs, we propose the aggregation operators, called CTSFWA and CTSFWG operators; (3) an MADM problem is resolved based on CTSFNs by using the CTSFWA and CTSFWG operators. To examine the proficiency and reliability of our works, we resolve an example and solve it by using the proposed operators and some existing operators; (4) the proposed operators are compared with existing operators with an MADM example.
The rest of the paper is organized as follows. In Section 2, we give a literature review and some preliminary definitions of FS, CFS, and TSFS with operational laws. In Section 3, the novel approach of CTSFS and its operational laws are explored. CTSFS composes the grade of truth, abstinence, and falsity with a conditions that the sum of q-power of the real part (also for imaginary part) of the truth, abstinence, and falsity grades is not exceeded from a unit interval. In Section 4, to examine the interrelationships among CTSFNs, we give the aggregation operators, called CTSFWA and CTSFWG. We also consider their special cases. In Section 5, a novel MADM based on the CTSFWA and CTSFWG operators is proposed. To examine the proficiency and reliability of the explored work, we resolve an MADM example and solve it by using the explored operators and some existing operators. These operators are also compared with some other operators. In Section 6, we give our conclusions.

2. Literature Review and Preliminary Definitions

In this section, we first have a literature review and then give some preliminary definitions.

2.1. Literature Review

Since Zadeh [2] first introduced fuzzy sets (FSs) in 1965 which give an approach to treating uncertainty different from that of probability, there were various extensions of FSs in the literature. Atanassove [3] considered intuitionistic FSs (IFSs) which contain the grades of membership and non-membership. Yager [4] extended IFS to Pythagorean FS (PFS) and then Yager [5] generalize IFS and PFS to the q-rung orthopair FS (QROFS). As a result, QROFS gives a more noteworthy range to select producers to communicate their questionable data with a key gadget to be adjusted to awkward and inconvenient fuzzy information. Since it was set up, it has gotten the thought of various investigators and it is utilized in various fields [14,15,16,17,18,19,20,21,22] in which Peng et al. [14] and Riaz et al. [15] considered aggregation operators; Du [16] proposed Makowski-type distance measures; Bai et al. [17], Liu et al. [18], and Liu and Wang [19] gave the Maclaurin symmetric mean; Wei et al. [20] considered the Heronian mean operator; Yin et al. [21] proposed product operations on QROFS graph; Shu et al. [22] studied integrations of QROFS.
Based on a similar idea of the picture FS (PiFS) proposed by Cuong [6], Ullah et al. [7] gave the spherical FS (SFS), and Mahmood et al. [8] recently established the idea of T-spherical fuzzy set (TSFS) that presents more powerfully than IFS, PiFS, and SFS. For extending FSs to unit disc in a complex plane, Ramot et al. [10] first proposed complex FSs (CFSs) in 2002 which contain the grade of complex-valued supporting belonging to unit disc in a complex plane. Recently, Liu et al. [13] extended QROFS to the complex QROFS (CQROFS). The CQROFS additionally presents that the aggregate of q-powers of the real part (also for imaginary part) is not exactly equivalent to 1. In general, CQROFS can take care of more issues that CIFS and CPFS cannot, for instance, if a DM problem gives the enrollment degree and the non-membership degree as 0.9 e i 2 π ( 0.9 ) and 0.8 e i 2 π ( 0.8 ) , separately, at that point it is just substantial for the CQROFS. All the CIFS and CPFS degrees are a piece of CQROFS degrees, which demonstrates that CQROFS is all the more impressive for dealing with unsure issues.
In view of sign quality for most parts in a wi-fi or versatile system, a gadget could either be associated or not associated with a fundamental switch. However, there is another situation regarding its availability in a flash change. Leave t alone be a fixed limit estimation of a wi-fi signal at which a gadget may get associated to a switch. At that point, if signal quality is over this limit regarding t, the gadget could be associated. In the event that signal quality is underneath t, the gadget could not be associated. Be that as it may, there are few situations when signal quality changes about this limit regarding t. In such circumstances, the status of gadget changes from associated with detached and the other way around in a short time frame. Along these lines, the portable or wi-fi gadgets can have the accompanying three cases: connected appropriately, disconnected, and fluctuates between the over two states. The above-discussed issue has multiple circumstances that cannot be well demonstrated with CFS, CIFS, CPFS, or even the broader CQROFS. In this sense, we propose a novel approach of complex T-spherical fuzzy sets (CTSFSs) in this paper where CTSFS composes the grade of truth, abstinence, and falsity with a condition that the sum of q-power of the real part (also for imaginary part) of the truth, abstinence, and falsity grades cannot be exceeded from a unit interval. Based on the complex T-spherical fuzzy numbers (CTSFNs), we propose two aggregation operators, complex T-spherical fuzzy weighted averaging (CTSFWA) and complex T-spherical fuzzy weighted geometric (CTSFWG). According to the CTSFWA and CTSFWG operators, we give a MADM solution.

2.2. Preliminary Definitions

The aim of this subsection is to review some fundamental definitions of FS, CFS, TSFS and their operational laws.
Definition 1 [2].
A FS Ϯ is defined as:
Ϯ = { ( x , ɱ Ϯ ( x ) ) / x X }
where ɱ Ϯ ( x ) denotes the grade of truth with a condition: 0 ɱ Ϯ ( x ) 1 .
Definition 2 [10].
A CFS Ϯ is defined as:
Ϯ = { ( x , ɱ Ϯ ( x ) ) / x X }
where ɱ Ϯ ( x ) = ɱ Ϯ ( x ) · e i . 2 π Ϣ ɱ Ϯ ( x ) denotes the grade of complex-valued truth with a condition: 0 ɱ Ϯ ( x ) , Ϣ ɱ Ϯ ( x ) 1 .
Definition 3 [8].
A TSFS Ϯ is defined as:
Ϯ = { ( x , ɱ Ϯ ( x ) , Ǟ Ϯ ( x ) , Ƒ Ϯ ( x ) ) / x X }
where ɱ Ϯ ( x ) , Ǟ Ϯ ( x ) and Ƒ Ϯ ( x ) denote the grade of truth, abstinence, and falsity with a condition: 0 ɱ Ϯ Ɋ ( x ) + Ǟ Ϯ Ɋ ( x ) + Ƒ Ϯ Ɋ ( x ) 1 . Additionally, the term H Ϯ ( x ) = ( 1 ( ɱ Ϯ Ɋ ( x ) + Ǟ Ϯ Ɋ ( x ) + Ƒ Ϯ Ɋ ( x ) ) ) 1 / Ɋ expresses the hesitancy grade of x . Moreover Ϯ = ( ɱ Ϯ , Ǟ Ϯ , Ƒ Ϯ ) is called a TSFN.
Definition 4 [8].
For any two TSFNs Ϯ j = ( ɱ j , Ǟ j , Ƒ j ) ,   j = 1 , 2 with γ > 0 , then
  • Ϯ j c = ( Ƒ j , Ǟ j , ɱ j ) ,   j = 1 , 2 , where Ϯ j c is the complement of Ϯj.
  • Ϯ 1 Ϯ 2 = ( ( ɱ 1 Ɋ + ɱ 2 Ɋ ɱ 1 Ɋ ɱ 2 Ɋ ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) , ( Ƒ 1 Ƒ 2 ) ) ;
  • Ϯ 1 Ϯ 2 = ( ( ɱ 1 ɱ 2 ) , ( Ƒ 1 Ɋ + Ƒ 2 Ɋ Ƒ 1 Ɋ Ƒ 2 Ɋ ) 1 Ɋ , ( Ƒ 1 Ɋ + Ƒ 2 Ɋ Ƒ 1 Ɋ Ƒ 2 Ɋ ) 1 Ɋ ) ;
  • γ Ϯ J = ( ( 1 ( 1 ɱ j Ɋ ) γ ) 1 Ɋ , Ǟ j γ , Ƒ j γ ) ,   j = 1 , 2 ;
  • Ϯ J γ = ( ɱ j γ , ( 1 ( 1 Ǟ j Ɋ ) γ ) 1 Ɋ , ( 1 ( 1 Ƒ j Ɋ ) γ ) 1 Ɋ ) ,   j = 1 , 2 .
Definition 5. [8]
For any TSFN Ϯ j = ( ɱ j , Ǟ j , Ƒ j ) , the score and accuracy function are defined as:
S ( Ϯ j ) = ( ɱ j Ɋ Ǟ j Ɋ Ƒ j Ɋ )
H ( Ϯ j ) = ( ɱ j Ɋ + Ǟ j Ɋ + Ƒ j Ɋ )
where ( Ϯ j ) [ 1 , 1 ] , H ( Ϯ j ) [ 0 , 1 ] . The relation between two TSFNs Ϯ j and Ϯ j can be defined as
  • If S ( Ϯ j ) > S ( Ϯ j ) then Ϯ j > Ϯ j .
  • If S ( Ϯ j ) = S ( Ϯ j ) and
    (1)
    If H ( Ϯ j ) > H ( Ϯ j ) then Ϯ j > Ϯ j .
    (2)
    If H ( Ϯ j ) = H ( Ϯ j ) then Ϯ j = Ϯ j .

3. Proposed Complex T-Spherical Fuzzy Sets

One aim of this study is to explore the novel approach of CTSFSs and their operational laws. These operational laws are also verify with the help of a numerical example.
Definition 6.
A CTSFS Ϯ is defined as:
Ϯ = { ( x , ɱ Ϯ ( x ) , Ǟ Ϯ ( x ) , Ƒ Ϯ ( x ) ) / x X }
where ɱ Ϯ ( x ) = ɱ Ϯ ( x ) · e i . 2 π Ϣ ɱ Ϯ ( x ) , Ǟ Ϯ ( x ) = Ǟ Ϯ ( x ) · e i . 2 π Ϣ Ǟ Ϯ ( x ) and Ƒ Ϯ ( x ) = Ƒ Ϯ ( x ) · e i . 2 π Ϣ Ƒ Ϯ ( x ) denote the grade of truth, abstinence, and falsity with the conditions: 0 ɱ Ϯ Ɋ ( x ) + Ǟ Ϯ Ɋ ( x ) + Ƒ Ϯ Ɋ ( x ) 1 and 0 Ϣ ɱ Ϯ Ɋ ( x ) + Ϣ Ǟ Ϯ Ɋ ( x ) + Ϣ Ƒ Ϯ Ɋ ( x ) 1 . Additionally, the term H Ϯ ( x ) = R · e i . 2 π Ϣ R c ( x ) such that R = ( 1 ( ɱ Ϯ Ɋ ( x ) + Ǟ Ϯ Ɋ ( x ) + Ƒ Ϯ Ɋ ( x ) ) ) 1 / Ɋ   and Ϣ R ( x ) = ( 1 ( Ϣ ɱ Ϯ Ɋ ( x ) + Ϣ Ǟ Ϯ Ɋ ( x ) + Ϣ Ƒ Ϯ Ɋ ( x ) ) ) 1 / Ɋ expresses the complex hesitancy grade of x. Moreover, Ϯ = ( ɱ · e i . 2 π Ϣ ɱ , Ǟ · e i . 2 π Ϣ Ǟ , Ƒ · e i . 2 π Ϣ Ƒ ) is called a CTSFN.
Definition 7.
For any two CTSFNs Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) ,   j = 1 , 2 with γ > 0 , then
  • Ϯ j c = ( Ƒ j · e i . 2 π Ϣ Ƒ j , Ǟ j · e i . 2 π Ϣ Ǟ j , ɱ j · e i . 2 π Ϣ ɱ j ) ,   j = 1 , 2 , where Ϯ j c is the complement of Ϯj.
  • Ϯ 1 Ϯ 2 = ( ( ɱ 1 Ɋ + ɱ 2 Ɋ ɱ 1 Ɋ ɱ 2 Ɋ ) 1 Ɋ · e i . 2 π · ( Ϣ ɱ 1 Ɋ + Ϣ ɱ 2 Ɋ Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) , ( Ƒ 1 Ƒ 2 ) · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) ) ;
  • Ϯ 1 Ϯ 2 = ( ( ɱ 1 ɱ 2 ) · e i . 2 π ( Ϣ ɱ 1 Ϣ ɱ 2 ) , ( Ǟ 1 Ɋ + Ǟ 2 Ɋ Ǟ 1 Ɋ Ǟ 2 Ɋ ) 1 Ɋ · e i . 2 π · ( Ϣ Ǟ 1 Ɋ + Ϣ Ǟ 2 Ɋ Ϣ Ǟ 1 Ɋ Ϣ Ǟ 2 Ɋ ) 1 Ɋ , ( Ƒ 1 Ɋ + Ƒ 2 Ɋ Ƒ 1 Ɋ Ƒ 2 Ɋ ) 1 Ɋ · e i . 2 π · ( Ϣ Ƒ 1 Ɋ + Ϣ Ƒ 2 Ɋ Ϣ Ƒ 1 Ɋ Ϣ Ƒ 2 Ɋ ) 1 Ɋ ) ;
  • γ Ϯ J = ( ( 1 ( 1 ɱ j Ɋ ) γ ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ j Ɋ ) γ ) 1 Ɋ , Ǟ j γ · e i . 2 π Ϣ Ǟ j γ , Ƒ j γ · e i . 2 π Ϣ Ƒ j γ ) ,   j = 1 , 2 ;
  • Ϯ J γ = ( ɱ j γ · e i . 2 π Ϣ ɱ j γ , ( 1 ( 1 Ǟ j Ɋ ) γ ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ j Ɋ ) γ ) 1 Ɋ , ( 1 ( 1 Ƒ j Ɋ ) γ ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ j Ɋ ) γ ) 1 Ɋ ) ,   j = 1 , 2 .
Theorem 1.
For any two CTSFNs Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) ,   j = 1 , 2 with n 1 , n 2 > 0 , then
  • Ϯ 1 Ϯ 2 = Ϯ 2 Ϯ 1 ;
  • Ϯ 1 Ϯ 2 = Ϯ 2 Ϯ 1 ;
  • n 1 ( Ϯ 1 Ϯ 2 ) = n 1 Ϯ 1 n 1 Ϯ 2 ;
  • n 1 Ϯ 1 n 2 Ϯ 1 = ( n 1 + n 2 ) Ϯ 1 ;
  • Ϯ 1 n 1 Ϯ 2 n 1 = Ϯ 1 n 1 + n 2 ;
  • Ϯ 1 n 1 Ϯ 2 n 1 = ( Ϯ 1 Ϯ 2 ) n 1 .
Proof
  • By Definition 7, we have
    Ϯ 1 Ϯ 2 = ( ( ɱ 1 Ɋ + ɱ 2 Ɋ ɱ 1 Ɋ ɱ 2 Ɋ ) 1 Ɋ · e i . 2 π · ( Ϣ ɱ 1 Ɋ + Ϣ ɱ 2 Ɋ Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) , ( Ƒ 1 Ƒ 2 ) · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) ) = ( ( ɱ 2 Ɋ + ɱ 1 Ɋ ɱ 2 Ɋ ɱ 1 Ɋ ) 1 Ɋ · e i . 2 π · ( Ϣ ɱ 2 Ɋ + Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ Ϣ ɱ 1 Ɋ ) 1 Ɋ , ( Ǟ 2 Ǟ 1 ) · e i . 2 π ( Ϣ Ǟ 2 Ϣ Ǟ 1 ) , ( Ƒ 2 Ƒ 1 ) · e i . 2 π ( Ϣ Ƒ 2 Ϣ Ƒ 1 ) ) = Ϯ 2 Ϯ 1
  • Obviously.
  • By Definition 7, we have
    n 1 ( Ϯ 1 Ϯ 2 ) = n 1 ( ( ɱ 1 Ɋ + ɱ 2 Ɋ ɱ 1 Ɋ ɱ 2 Ɋ ) 1 Ɋ · e i . 2 π · ( Ϣ ɱ 1 Ɋ + Ϣ ɱ 2 Ɋ Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) , ( Ƒ 1 Ƒ 2 ) · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) ) = ( ( ( 1 ( 1 ( ɱ 1 Ɋ + ɱ 2 Ɋ ɱ 1 Ɋ ɱ 2 Ɋ ) ) n 1 ) 1 Ɋ ) Ɋ · e i . 2 π · ( ( 1 ( 1 ( Ϣ ɱ 1 Ɋ + Ϣ ɱ 2 Ɋ Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ ) ) n 1 ) 1 Ɋ ) Ɋ , ( Ǟ 1 Ǟ 2 ) n 1 · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) n 1 , ( Ƒ 1 Ƒ 2 ) n 1 · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) n 1 )
Similarly, we have
n 1 Ϯ 1 = ( ( 1 ( 1 ɱ 1 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 1 Ɋ ) n 1 ) 1 Ɋ , Ǟ 1 n 1 · e i . 2 π Ϣ Ǟ 1 n 1 , Ƒ 1 n 1 · e i . 2 π Ϣ Ƒ 1 n 1 )
and n 1 Ϯ 2 = ( ( 1 ( 1 ɱ 2 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 2 Ɋ ) n 1 ) 1 Ɋ , Ǟ 2 n 1 · e i . 2 π Ϣ Ǟ 2 n 1 , Ƒ 2 n 1 · e i . 2 π Ϣ Ƒ 2 n 1 ) .
Thus, we have
n 1 Ϯ 1 n 1 Ϯ 2 = ( ( 1 ( 1 ɱ 1 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 1 Ɋ ) n 1 ) 1 Ɋ , Ǟ 1 n 1 · e i . 2 π Ϣ Ǟ 1 n 1 , Ƒ 1 n 1 · e i . 2 π Ϣ Ƒ 1 n 1 ) ( ( 1 ( 1 ɱ 2 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 2 Ɋ ) n 1 ) 1 Ɋ , Ǟ 2 n 1 · e i . 2 π Ϣ Ǟ 2 n 1 , Ƒ 2 n 1 · e i . 2 π Ϣ Ƒ 2 n 1 )
= ( ( ( ( 1 ( 1 ɱ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 ɱ 2 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 ɱ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 ɱ 2 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ) 1 Ɋ · e i . 2 π ( ( ( 1 ( 1 Ϣ ɱ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ϣ ɱ 2 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ ɱ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ ɱ 2 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) n 1 · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) n 1 , ( Ƒ 1 Ƒ 2 ) n 1 · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) n 1 )
= ( ( 1 ( 1 ɱ 1 Ɋ ɱ 2 Ɋ + ɱ 1 Ɋ ɱ 2 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π · ( 1 ( 1 Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ + Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ ) n 1 ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) n 1 · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) n 1 , ( Ƒ 1 Ƒ 2 ) n 1 · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) n 1 )
= ( ( 1 ( 1 ɱ 1 Ɋ ɱ 2 Ɋ + ɱ 1 Ɋ ɱ 2 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π · ( 1 ( 1 Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ + Ϣ ɱ 1 Ɋ Ϣ ɱ 2 Ɋ ) n 1 ) 1 Ɋ , ( Ǟ 1 Ǟ 2 ) n 1 · e i . 2 π ( Ϣ Ǟ 1 Ϣ Ǟ 2 ) n 1 , ( Ƒ 1 Ƒ 2 ) n 1 · e i . 2 π ( Ϣ Ƒ 1 Ϣ Ƒ 2 ) n 1 )
Hence, it is proven.
4.
Obviously.
5.
By Definition 7, we have
Ϯ 1 n 1 = ( ɱ 1 n 1 · e i . 2 π Ϣ ɱ 1 n 1 , ( 1 ( 1 Ǟ 1 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ Ɋ ) n 1 ) 1 Ɋ , ( 1 ( 1 Ƒ 1 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 1 ) 1 Ɋ )
and Ϯ 1 n 2 = ( ɱ 1 n 2 · e i . 2 π Ϣ ɱ 1 n 2 , ( 1 ( 1 Ǟ 1 Ɋ ) n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 2 ) 1 Ɋ , ( 1 ( 1 Ƒ 1 Ɋ ) n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 2 ) 1 Ɋ ) .
Then
Ϯ 1 n 1 Ϯ 1 n 2 = ( ɱ 1 n 1 · e i . 2 π Ϣ ɱ 1 n 1 , ( 1 ( 1 Ǟ 1 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 1 ) 1 Ɋ , ( 1 ( 1 Ƒ 1 Ɋ ) n 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 1 ) 1 Ɋ ) ( ɱ 1 n 2 · e i . 2 π Ϣ ɱ 1 n 2 , ( 1 ( 1 Ǟ 1 Ɋ ) n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 2 ) 1 Ɋ , ( 1 ( 1 Ƒ 1 Ɋ ) n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 2 ) 1 Ɋ )
= ( ( ɱ 1 n 1 ɱ 1 n 2 ) · e i . 2 π ( Ϣ ɱ 1 n 1 Ϣ ɱ 1 n 2 ) , ( ( ( 1 ( 1 Ǟ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ǟ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ǟ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ǟ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ) 1 Ɋ · e i . 2 π ( ( ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ) 1 Ɋ , ( ( ( 1 ( 1 Ƒ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ƒ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ƒ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ƒ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ) 1 Ɋ · e i . 2 π ( ( ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 2 ) 1 Ɋ ) Ɋ ) 1 Ɋ )
= ( ( ɱ 1 n 1 ɱ 1 n 2 ) · e i . 2 π ( Ϣ ɱ 1 n 1 Ϣ ɱ 1 n 2 ) , ( 1 ( 1 Ǟ 1 Ɋ ) n 1 ( 1 Ǟ 1 Ɋ ) n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 2 ) 1 Ɋ , ( 1 ( 1 Ƒ 1 Ɋ ) n 1 ( 1 Ƒ 1 Ɋ ) n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 2 ) 1 Ɋ )
= ( ɱ 1 n 1 + n 2 · e i . 2 π Ϣ ɱ 1 n 1 + n 2 , ( 1 ( 1 Ǟ 1 Ɋ ) n 1 + n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ǟ 1 Ɋ ) n 1 + n 2 ) 1 Ɋ , ( 1 ( 1 Ƒ 1 Ɋ ) n 1 + n 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ Ƒ 1 Ɋ ) n 1 + n 2 ) 1 Ɋ ) = Ϯ 1 n 1 + n 2
Hence, Ϯ 1 n 1 Ϯ 1 n 2 = Ϯ 1 n 1 + n 2 .
6.
Obviously. □
Definition 8. 
For any CTSFN Ϯ = ( ɱ · e i . 2 π Ϣ ɱ , Ǟ · e i . 2 π Ϣ Ǟ , Ƒ · e i . 2 π Ϣ Ƒ ) , the score and accuracy functions are defined as:
S ( Ϯ ) = 1 2 | ( ɱ Ɋ Ǟ Ɋ Ƒ Ɋ ) + ( Ϣ ɱ Ɋ Ϣ Ǟ Ɋ Ϣ Ƒ Ɋ ) |
H ( Ϯ ) = 1 2 | ( ɱ Ɋ + Ǟ Ɋ + Ƒ Ɋ ) + ( Ϣ ɱ Ɋ + Ϣ Ǟ Ɋ + Ϣ Ƒ Ɋ ) |
where ( Ϯ ) [ 1 , 1 ] , H ( Ϯ ) [ 0 , 1 ] . The relation between two CTSFNs Ϯ and Ϯ ˙ can be defined as
  • If S ( Ϯ ) > S ( Ϯ ˙ ) , then Ϯ > Ϯ ˙ ,
  • If S ( Ϯ ) = S ( Ϯ ˙ ) and
    (1)
    If H ( Ϯ ) > H ( Ϯ ˙ ) , then Ϯ > Ϯ ˙ .
    (2)
    If H ( Ϯ ) = H ( Ϯ ˙ ) , then Ϯ = Ϯ ˙ .

4. Complex T-Spherical Fuzzy Aggregation Operators and Theorems

The aims of this section is to explore aggregation operators, that are the complex T-spherical fuzzy weighted averaging (CTSFWA) and the complex T-spherical fuzzy weighted geometric (CTSFWG) operators. The weight vector is given as ω = ( ω 1 , ω 2 , ω k ) ɱ    with   j = 1 k ω j = 1 , ω j [ 0 , 1 ] ,   j = 1 , 2 , , k . Additionally, Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) ,   j = 1 , 2 , · · , k are used to express the family of CTSFNs.
Definition 9.
The CTSFWA is defined as C ɱ S Ƒ Ϣ Ǟ :   ɱ k ɱ ,   and
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ω 1 Ϯ 1 ω 2 Ϯ 2 ω k Ϯ k = j = 1 k ω j Ϯ j
Based on the operational laws of Cq-ROFNs, we give the following Theorem.
Theorem 2.
We have the following form of C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k ) :
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ( ( ( 1 j = 1 k ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) , j = 1 k Ǟ j ω j · e i . 2 π ( j = 1 k Ϣ Ǟ j ω j ) , j = 1 k Ƒ j ω j · e i . 2 π ( j = 1 k Ϣ Ƒ j ω j ) )
Proof. 
By using the mathematical indication, we prove Equation (10) as follows:
Case 1. For k = 2 , since
ω 1 Ϯ 1 = ( ( 1 ( 1 ɱ 1 Ɋ ) ω 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 1 Ɋ ) ω 1 ) 1 Ɋ , Ǟ 1 ω 1 · e i . 2 π Ϣ Ǟ 1 ω 1 , Ƒ 1 ω 1 · e i . 2 π Ϣ Ƒ 1 ω 1 ) ,
and ω 2 Ϯ 2 = ( ( 1 ( 1 ɱ 2 Ɋ ) ω 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 2 Ɋ ) ω 2 ) 1 Ɋ , Ǟ 2 ω 2 · e i . 2 π Ϣ Ǟ 2 ω 2 , Ƒ 2 ω 2 · e i . 2 π Ϣ Ƒ 2 ω 2 ) , we have
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 ) = ω 1 Ϯ 1 ω 2 Ϯ 2 = ( ( 1 ( 1 ɱ 1 Ɋ ) ω 1 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 1 Ɋ ) ω 1 ) 1 Ɋ , Ǟ 1 ω 1 · e i . 2 π Ϣ Ǟ 1 ω 1 , Ƒ 1 ω 1 · e i . 2 π Ϣ Ƒ 1 ω 1 ) ( ( 1 ( 1 ɱ 2 Ɋ ) ω 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 2 Ɋ ) ω 2 ) 1 Ɋ , Ǟ 2 ω 2 · e i . 2 π Ϣ Ǟ 2 ω 2 , Ƒ 2 ω 2 · e i . 2 π Ϣ Ƒ 2 ω 2 )
= ( ( ( ( 1 ( 1 ɱ 1 Ɋ ) ω 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 ɱ 2 Ɋ ) ω 2 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 ɱ 1 Ɋ ) ω 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 ɱ 2 Ɋ ) ω 2 ) 1 Ɋ ) Ɋ ) 1 Ɋ · e i . 2 π ( ( ( 1 ( 1 Ϣ ɱ 1 Ɋ ) ω 1 ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ϣ ɱ 2 Ɋ ) ω 2 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ ɱ 1 Ɋ ) ω 1 ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ ɱ 2 Ɋ ) ω 2 ) 1 Ɋ ) Ɋ ) 1 Ɋ , ( Ǟ 1 ω 1 Ǟ 2 ω 2 ) · e i . 2 π ( Ϣ Ǟ 1 ω 1 Ɋ Ǟ 2 ω 2 ) , ( Ƒ 1 ω 1 Ƒ 2 ω 2 ) · e i . 2 π ( Ϣ Ƒ 1 ω 1 Ϣ Ƒ 2 ω 2 ) ) = ( ( 1 ( 1 ɱ 1 Ɋ ) ω 1 ( 1 ɱ 2 Ɋ ) ω 2 ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ 1 Ɋ ) ω 1 ( 1 Ϣ ɱ 2 Ɋ ) ω 2 ) 1 Ɋ , ( Ǟ 1 ω 1 Ǟ 2 ω 2 ) · e i . 2 π ( Ϣ Ǟ 1 ω 1 Ϣ Ǟ 2 ω 2 ) , ( Ƒ 1 ω 1 Ƒ 2 ω 2 ) · e i . 2 π ( Ϣ Ƒ 1 ω 1 Ϣ Ƒ 2 ω 2 ) )
= ( ( ( 1 j = 1 2 ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 2 ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) , j = 1 2 Ǟ j ω j · e i . 2 π ( j = 1 2 Ϣ Ǟ j ω j ) , j = 1 2 Ƒ j ω j · e i . 2 π ( j = 1 2 Ϣ Ƒ j ω j ) )
Obviously, Equation (10) is kept for k = 2 .
Case 2. For k = m , let Equation (10) be held with
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ m ) = ( ( ( 1 j = 1 m ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 m ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) , j = 1 m Ǟ j ω j · e i . 2 π ( j = 1 m Ϣ Ǟ j ω j ) , j = 1 m Ƒ j ω j · e i . 2 π ( j = 1 m Ϣ Ƒ j ω j ) )
We next check that, for k = m + 1 , Equation (10) is also held:
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ m + 1 ) = ( ( ( 1 j = 1 m ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 m ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) , j = 1 m Ǟ j ω j · e i . 2 π ( j = 1 m Ϣ Ǟ j ω j ) , j = 1 m Ƒ j ω j · e i . 2 π ( j = 1 m Ϣ Ƒ j ω j ) ) ω m + 1 Ϯ m + 1
= ( ( ( ( ( 1 j = 1 m ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 ɱ m + 1 Ɋ ) ω m + 1 ) 1 Ɋ ) Ɋ ( ( 1 j = 1 m ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ ) Ɋ ( ( 1 ( 1 ɱ m + 1 Ɋ ) ω m + 1 ) 1 Ɋ ) Ɋ ) 1 Ɋ · e i . 2 π ( ( ( 1 j = 1 m ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) Ɋ + ( ( 1 ( 1 Ϣ ɱ m + 1 Ɋ ) ω m + 1 ) 1 Ɋ ) Ɋ ( ( 1 j = 1 m ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) Ɋ ( ( 1 ( 1 Ϣ ɱ m + 1 Ɋ ) ω m + 1 ) 1 Ɋ ) Ɋ ) 1 Ɋ ) , j = 1 m Ǟ j ω j Ǟ m + 1 ω m + 1 · e i . 2 π ( j = 1 m Ϣ Ǟ j ω j Ϣ Ǟ m + 1 ω m + 1 ) , j = 1 m Ƒ j ω j Ƒ m + 1 ω m + 1 · e i . 2 π ( j = 1 m Ϣ Ƒ j ω j Ϣ Ƒ m + 1 ω m + 1 ) )
= ( ( ( 1 j = 1 m + 1 ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 m + 1 ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) , j = 1 m + 1 Ǟ j ω j · e i . 2 π ( j = 1 m + 1 Ϣ Ǟ j ω j ) , j = 1 m + 1 Ƒ j ω j · e i . 2 π ( j = 1 m + 1 Ϣ Ƒ j ω j ) )
So, Equation (10) is kept for k = m + 1 . Thus, we prove it. □
Theorem 3.
(Idempotent) Let CTSFNs Ϯ j = Ϯ = ( ɱ · e i . 2 π Ϣ ɱ , Ǟ · e i . 2 π Ϣ Ǟ , Ƒ · e i . 2 π Ϣ Ƒ ) , j = 1 , 2 , , k . Then
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) = Ϯ
Proof. 
Because
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) = ( ( ( 1 j = 1 k ( 1 ɱ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) 1 Ɋ ) , j = 1 k Ǟ j ω j · e i . 2 π ( j = 1 k Ϣ Ǟ j ω j ) , j = 1 k Ƒ j ω j · e i . 2 π ( j = 1 k Ϣ Ƒ j ω j ) ) = ( ( ( 1 j = 1 k ( 1 ɱ Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 k ( 1 Ϣ ɱ Ɋ ) ω j ) 1 Ɋ ) , j = 1 k Ǟ ω j · e i . 2 π ( j = 1 k Ϣ Ǟ ω j ) , j = 1 k Ƒ ω j · e i . 2 π ( j = 1 k Ϣ Ƒ ω j ) ) = ( ( ( 1 ( 1 ɱ Ɋ ) j = 1 k ω j ) 1 Ɋ · e i . 2 π ( 1 ( 1 Ϣ ɱ Ɋ ) j = 1 k ω j ) 1 Ɋ ) , Ǟ j = 1 k ω j · e i . 2 π ( Ϣ Ǟ j = 1 k ω j ) , Ƒ j = 1 k ω j · e i . 2 π ( Ϣ Ƒ j = 1 k ω j ) ) = ( ɱ · e i . 2 π Ϣ ɱ , Ǟ · e i . 2 π Ϣ Ǟ , Ƒ · e i . 2 π Ϣ Ƒ ) = Ϯ .
Theorem 4.
(Monotonicity) For any two families of the CTSFNs Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) and Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) j = 1 , 2 , , k , if ɱ j     ɱ j , Ǟ j Ǟ j , Ƒ j Ƒ j , Ϣ ɱ j Ϣ ɱ j , Ϣ Ǟ j Ϣ Ǟ j and Ϣ Ƒ j Ϣ Ƒ j , then
C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k )
Proof. 
Because ɱ j ɱ j , Ǟ j Ǟ j , Ƒ j Ƒ j , Ϣ ɱ j Ϣ ɱ j , Ϣ Ǟ j Ϣ Ǟ j and Ϣ Ƒ j Ϣ Ƒ j , we have
1 ɱ j Ɋ     1 ɱ j Ɋ ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ǟ j ω j j = 1 k Ǟ j ω j   and   j = 1 k Ƒ j ω j j = 1 k Ƒ j ω j .
Similarly, for imaginary parts, we have
1 Ϣ ɱ j Ɋ 1 Ϣ ɱ j Ɋ ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ϣ Ǟ j ω j j = 1 k Ϣ Ǟ j ω j   and   j = 1 k Ϣ Ƒ j ω j j = 1 k Ϣ Ƒ j ω j .
Combing both real and imaginary parts, we have
( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ · e i . 2 π ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ǟ j ω j · e i . 2 π j = 1 k Ϣ Ǟ j ω j , j = 1 k Ƒ j ω j · e i . 2 π j = 1 k Ϣ Ƒ j ω j ) ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ · e i . 2 π ( ( 1 ( j = 1 k ( 1 Ϣ Ƒ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ǟ j ω j · e i . 2 π j = 1 k Ϣ Ǟ j ω j , j = 1 k Ƒ j ω j · e i . 2 π j = 1 k Ϣ Ƒ j ω j )
We assume that C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) = Ϯ and C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) = Ϯ . By using Definition (8) and Equation (2), we have S ( Ϯ ) S ( Ϯ ) .
Here there are two possibility which are discussed one by one.
  • When S ( Ϯ ) > S ( Ϯ ) , by Definition 8, we have
    C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) > C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) ;
  • When S ( Ϯ ) = S ( Ϯ ) , we have
    ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ · e i . 2 π ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ǟ j ω j · e i . 2 π j = 1 k Ϣ Ǟ j ω j j = 1 k Ƒ j ω j · e i . 2 π j = 1 k Ϣ Ƒ j ω j ) = ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ · e i . 2 π ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ǟ j ω j · e i . 2 π j = 1 k Ϣ Ǟ j ω j j = 1 k Ƒ j ω j · e i . 2 π j = 1 k Ϣ Ƒ j ω j )
Because ɱ j     ɱ j , Ǟ j Ǟ j , Ƒ j Ƒ j , Ϣ ɱ j Ϣ ɱ j , Ϣ Ǟ j Ϣ Ǟ j and Ϣ Ƒ j Ϣ Ƒ j , then
( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ = ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ǟ j ω j = j = 1 k Ǟ j ω j   and   j = 1 k Ƒ j ω j = j = 1 k Ƒ j ω j .
Similarly for imaginary parts, we have
( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ = ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ j = 1 k Ϣ Ǟ j ω j = j = 1 k Ϣ Ǟ j ω j   and   j = 1 k Ϣ Ƒ j ω j = j = 1 k Ϣ Ƒ j ω j .
Because the score functions are equal, we use the accuracy function such that
H ( Ϯ ) = H ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ · e i . 2 π ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ , j = 1 k Ǟ j ω j · e i . 2 π j = 1 k Ϣ Ǟ j ω j , j = 1 k Ƒ j ω j · e i . 2 π j = 1 k Ϣ Ƒ j ω j ) = 1 2 ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ + j = 1 k Ǟ j ω j + j = 1 k Ƒ j ω j + ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ + j = 1 k Ϣ Ǟ j ω j + j = 1 k Ϣ Ƒ j ω j ) = 1 2 ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ + j = 1 k Ǟ j ω j + j = 1 k Ƒ j ω j + ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ + j = 1 k Ϣ Ǟ j ω j + j = 1 k Ϣ Ƒ j ω j ) = H ( ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ · e i . 2 π ( ( 1 ( j = 1 k ( 1 Ϣ ɱ j Ɋ ) ω j ) ) 1 Ɋ ) Ɋ , j = 1 k Ǟ j ω j · e i . 2 π j = 1 k Ϣ Ǟ j ω j , j = 1 k Ƒ j ω j · e i . 2 π j = 1 k Ϣ Ƒ j ω j ) = H ( Ϯ ) .
From cases (1) and (2), it is proven. □
Theorem 5.
(Boundedness) For any CTSFNs Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) , j = 1 , 2 , , k , if Ϯ j + = ( max 1 j k ɱ j · e i . 2 π max 1 j k Ϣ ɱ j , min 1 j k Ǟ j · e i . 2 π min 1 j k Ϣ Ǟ j , min 1 j k Ƒ j · e i . 2 π min 1 j k Ϣ Ƒ j ) and Ϯ j = ( min 1 j k ɱ j · e i . 2 π min 1 j k Ϣ ɱ j , max 1 j k Ǟ j · e i . 2 π max 1 j k Ϣ Ǟ j , max 1 j k Ƒ j · e i . 2 π max 1 j k Ϣ Ƒ j ) , then
Ϯ j C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) Ϯ j +
Proof. 
We discuss two case separately for membership and non-membership grades (for real and imaginary parts) as follows:
  • For membership grade of C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) , we get
    ( 1 ( j = 1 k ( 1 min 1 j k ɱ j Ɋ ) ω j ) ) 1 Ɋ ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ( 1 ( j = 1 k ( 1 max 1 j k ɱ j Ɋ ) ω j ) ) 1 Ɋ ( 1 ( ( 1 min 1 j k ɱ j Ɋ ) j = 1 k ω j ) ) 1 Ɋ ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ ( 1 ( ( 1 max 1 j k ɱ j Ɋ ) j = 1 k ω j ) ) 1 Ɋ
    Because j = 1 k ω j = 1 , we have min 1 j k ɱ j ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ max 1 j k ɱ j .
  • For abstinence and non-membership grades of C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) , we obtain
    j = 1 k min 1 j k Ǟ j ω j j = 1 k Ǟ j ω j j = 1 k max 1 j k Ǟ j ω j min 1 j k Ǟ j j = 1 k ω j j = 1 k Ǟ j ω j max 1 j k Ǟ j j = 1 k ω j
Because j = 1 k ω j = 1 , we have min 1 j k Ǟ j j = 1 k Ǟ j ω j max 1 j k Ǟ j and then min 1 j k Ƒ j j = 1 k Ƒ j ω j max 1 j k Ƒ j
By combining the above two cases, we have
min 1 j k ɱ j max 1 j k Ǟ j max 1 j k Ƒ j ( ( 1 ( j = 1 k ( 1 ɱ j Ɋ ) ω j ) ) 1 Ɋ j = 1 k Ǟ j ω j j = 1 k Ƒ j ω j ) max 1 j k ɱ j min 1 j k Ǟ j min 1 j k Ƒ j
By the score function, we get
S ( Ϯ ) S ( Ϯ ) S ( Ϯ + ) .
According to cases (1) and (2) and the definition of the score function, we obtain
Ϯ j C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) Ϯ j + .
Next, we discuss the special cases of the proposed operator.
  • If Ɋ = 1, then CTSFWA (Equation (10)) is reduced to CPFWA, i.e.,
    C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ( ( ( 1 j = 1 k ( 1 ɱ j 1 ) ω j ) 1 · e i . 2 π ( 1 j = 1 k ( 1 Ϣ ɱ j 1 ) ω j ) 1 ) , j = 1 k Ǟ j ω j · e i . 2 π ( j = 1 k Ϣ Ǟ j ω j ) , j = 1 k Ƒ j ω j · e i . 2 π ( j = 1 k Ϣ Ƒ j ω j ) ) = C P Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k )
  • If Ɋ = 2 , then CTSFWA (Equation (10)) is reduced to CSFWA, i.e.,
    C ɱ S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ( ( ( 1 j = 1 k ( 1 ɱ j 2 ) ω j ) 1 2 · e i . 2 π ( 1 j = 1 k ( 1 Ϣ ɱ j 2 ) ω j ) 1 2 ) , j = 1 k Ǟ j ω j · e i . 2 π ( j = 1 k Ϣ Ǟ j ω j ) , j = 1 k Ƒ j ω j · e i . 2 π ( j = 1 k Ϣ Ƒ j ω j ) ) = C S Ƒ Ϣ Ǟ ( Ϯ 1 , Ϯ 2 , , Ϯ k ) ·        
Next, we propose the notion of the CTSFWG operator.
Definition 10.
The CTSFWG is expressed as C ɱ S Ƒ Ϣ G   :   ɱ k ɱ with
C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = Ϯ 1 ω 1 Ϯ 2 ω 2 Ϯ k ω k = j = 1 k Ϯ j ω j
Based on the operational laws of the CTSFNs, we can obtain the following Theorem.
Theorem 6. 
By using Definition 10, we get
C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ( j = 1 k ɱ j ω j · e i . 2 π ( j = 1 k Ϣ ɱ j ω j ) , ( ( 1 j = 1 k ( 1 Ǟ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 k ( 1 Ϣ Ǟ j Ɋ ) ω j ) 1 Ɋ ) , ( ( 1 j = 1 k ( 1 Ƒ j Ɋ ) ω j ) 1 Ɋ · e i . 2 π ( 1 j = 1 k ( 1 Ϣ Ƒ j Ɋ ) ω j ) 1 Ɋ ) )
Proof. 
Straightforward that is similar to Theorem 2. □
Theorem 7. 
(Idempotent) For any family of CTSFNs Ϯ j = Ϯ = ( ɱ · e i . 2 π Ϣ ɱ , Ǟ · e i . 2 π Ϣ Ǟ , Ƒ · e i . 2 π Ϣ Ƒ ) , j = 1 , 2 , , k , then
C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) = Ϯ
Proof. 
Straightforward that is similar to Theorem 3. □
Theorem 8.
(Monotonicity) For any family of Cq-ROFNs Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) and Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) j = 1 , 2 , , k , if ɱ j     ɱ j , Ǟ j Ǟ j , Ƒ j Ƒ j , Ϣ ɱ j Ϣ ɱ j , Ϣ Ǟ j Ϣ Ǟ j and Ϣ Ƒ j Ϣ Ƒ j , then
C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k )
Proof. 
Straightforward that is similar to Theorem 4. □
Theorem 9.
(Boundedness) For any family of CTSFNs Ϯ j = ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) , j = 1 , 2 , , k , if Ϯ j + = ( max 1 j k ɱ j · e i . 2 π max 1 j k Ϣ ɱ j , min 1 j k Ǟ j · e i . 2 π min 1 j k Ϣ Ǟ j , min 1 j k Ƒ j · e i . 2 π min 1 j k Ϣ Ƒ j ) and Ϯ j = ( min 1 j k ɱ j · e i . 2 π min 1 j k Ϣ ɱ j , max 1 j k Ǟ j · e i . 2 π max 1 j k Ϣ Ǟ j , max 1 j k Ƒ j · e i . 2 π m a x 1 j k Ϣ Ƒ j ) , then
Ϯ j C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , Ϯ 3 , , Ϯ k ) Ϯ j +
Proof. 
Straightforward that is similar to Theorem 5. □
Next, we discuss the special cases of the proposed operators.
  • If Ɋ = 1 , then CTSFWG (Equation (15)) is reduced to CPFWG, i.e.,
    C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ( j = 1 k ɱ j ω j · e i . 2 π ( j = 1 k Ϣ ɱ j ω j ) , ( ( 1 j = 1 k ( 1 Ǟ j 1 ) ω j ) 1 · e i . 2 π ( 1 j = 1 k ( 1 Ϣ Ǟ j 1 ) ω j ) 1 ) , ( ( 1 j = 1 k ( 1 Ƒ j 1 ) ω j ) 1 · e i . 2 π ( 1 j = 1 k ( 1 Ϣ Ƒ j 1 ) ω j ) 1 ) ) = C P Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , , Ϯ k ) .
  • If Ɋ = 2 , then CTSFWG (Equation (15)) is reduced to CSFWG, i.e.,
    C ɱ S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , , Ϯ k ) = ( j = 1 k ɱ j ω j · e i . 2 π ( j = 1 k Ϣ ɱ j ω j ) , ( ( 1 j = 1 k ( 1 Ǟ j 2 ) ω j ) 1 2 · e i . 2 π ( 1 j = 1 k ( 1 Ϣ Ǟ j 2 ) ω j ) 1 2 ) , ( ( 1 j = 1 k ( 1 Ƒ j 2 ) ω j ) 1 2 · e i . 2 π ( 1 j = 1 k ( 1 Ϣ Ƒ j 2 ) ω j ) 1 2 ) ) = C S Ƒ Ϣ G ( Ϯ 1 , Ϯ 2 , , Ϯ k ) .

5. Application to MADM Using the CTSFWA and CTSFGA Operators

To proficiently address the reliability and effectiveness of the explored works, we construct a multi-attribute decision making (MADM) problem based on CTSFNs by using the CTSFWA and CTSFWG operators. For this, we choose the following things, such as the family of alternatives, the family of attributes and their weight vectors. Let X = { X 1 , X 2 , , X m } , Ϯ = { c 1 , c 2 , , c n } , and ω = ( ω 1 , ω 2 , , ω n ) ɱ where i = 1 n ω i = 1 and each ω i [ 0 , 1 ] . Thus, the constructed MADM procedures are stated as follows:
Step 1: Based on Equation (19), we normalize the decision matrix D = ( Ϯ i j ) m × n , such that
R i j = { ( ɱ j · e i . 2 π Ϣ ɱ j , Ǟ j · e i . 2 π Ϣ Ǟ j , Ƒ j · e i . 2 π Ϣ Ƒ j ) f o r   b e n e f i t ( Ƒ j · e i . 2 π Ϣ Ƒ j , Ǟ j · e i . 2 π Ϣ Ǟ j , ɱ j · e i . 2 π Ϣ ɱ j ) f o r   c o s t
Step 2: Based on Equation (10) of Theorem 2 and Equation (15) of Theorem 6, we aggregate the decision matrix which is given in Step 1.
Step 3: Based on Equation (7) of Definition 8, we examine the score values of the aggregated values, which are given in Step 2.
Step 4: Rank to all alternatives
Step 5: End.
Example 1. 
A company wants to invest with another company to increase income, where there are four political companies called alternatives with four attributes as follows:
  • c 1 : Risk analysis.
  • c 2 : Growth conditions.
  • c 3 : Social political impact.
  • c 4 : Environmental impact.
To resolve this MADM problem, we may choose the weight vector with ( 0.25 , 0.45 , 0.20 , 0.1 ) ɱ that is a better fitted weight vector for this example. We mention that the users can assign their preferred weight vector. The information for the alternatives x i ( i = 1 , 2 , 3 , 4 ) and for the criteria Ϯ = { c 1 , c 2 , c 3 , c 4 } is expressed by the CTSFNs. The complex T-spherical fuzzy information is shown in Table 1.
Step 1: Based on Equation (19), we normalize the decision matrix D = ( Ϯ i j ) m × n , but there are not needed to normalize the information of Table 1.
Step 2: Based on Equations (10) and (15), we aggregate the decision matrix of Table 1 by using the weight vector ω = ( 0.25 , 0.45 , 0.20 , 0.1 ) ɱ , q = 1. The results are shown in Table 2.
Step 3: Based on Equation (7), we examine the score values of the aggregated values, which are given in Step 2. The results are shown in Table 3.
Step 4: Rank to all c 1 , c 2 , c 3 , c 4 with
c 4 c 3 c 2 c 1 c 4 c 3 c 2 c 1
From the above analysis, we get c 4 as the best one. We find that the result well matches the goal of the company.
Step 5: End.

5.1. Advantages of the Proposed Operators

To evaluate the proficiency and improve the quality of the research work, in this section, we examine the effectiveness of the proposed work. We choose the complex spherical fuzzy (CSF) kind of information and complex T-spherical fuzzy (CTSF) kind of information and solve it by using the proposed operators. In Example 1, we had chosen the complex picture fuzzy (CPF) kind of information to resolve it by using the proposed operators to express their reliability and effectiveness. We next choose the CSF type of information, as shown in Table 4.
Based on Equation (19), we normalize the decision matrix D = ( Ϯ i j ) m × n , but there are not needed to normalize the information of Table 1. Based on Equations (10) and (15), we aggregate the decision matrix of Table 4 by using the weight vector ω = ( 0.25 , 0.45 , 0.20 , 0.1 ) ɱ , q = 2. The results are shown in Table 5.
Based on Equation (7), we examine the score values of the aggregated values of Table 5, and the results are shown in Table 6.
Step 4: Rank to all c 1 , c 2 , c 3 , c 4 with
c 1 c 3 c 4 c 2 c 1 c 3 c 4 c 2
From the above analysis, we get c 1 to be the best one.
Next, we choose the CTSF type of information, which is shown in Table 7.
Based on Equations (10) and (15), we aggregate the decision matrix of Table 7 by using the weight vector ω = ( 0.25 , 0.45 , 0.20 , 0.1 ) ɱ , q = 7. The results are shown in Table 8.
Based on Equation (7), we examine the score values of the aggregated values of Table 8, and the results are shown in Table 9.
Step 4: Rank to all c 1 , c 2 , c 3 , c 4 with
c 3 c 1 c 2 c 4 c 3 c 1 c 2 c 4
From the above analysis, we get c 3 as the best one.

5.2. Comparisons of the Proposed Operators with Other Existing Operators

To express the reliability and effectiveness of the presented work in this study, we consider the following ideas for resolving the information of Table 1, Table 4, and Table 7 to show the proficiency of the proposed approach. To make the comparisons of the proposed approach, we consider the following existing operators. Garg et al. [23] explored the attractive aggregation operators based on T-SFS and their application in MAGDM problems. Liu et al. [24] established power muirhead mean operators based on T-SFS and their application in MAGDM problems. Ullah et al. [25] explored geometric aggregation operators based on T-SFS and their application in decision making. Munir et al. [26] evaluated the Einstein hybrid aggregation operator based on T-SFS and their application in decision making. Ashraf and Abdullah [27] examined the spherical fuzzy aggregation operator and their application. Ashraf et al. [28] examined the spherical fuzzy Dombi aggregation operator and their application in decision making. Jin et al. [29] explored the spherical fuzzy logarithmic aggregation operator and their application in decision making. Wang et al. [30] explored the geometric aggregation for PFS and their application in decision making. Garg [31] established the picture fuzzy aggregation operators and their application. Wei [32] explored the picture fuzzy aggregation operators and their application, and picture fuzzy hamacher aggregation operators was explored by Wei [33]. The comparative analysis of the proposed work with these existing operators for Table 1 is shown in Table 10.
From the above analysis, we find that these existing operators fail to rank c 1 , c 2 , c 3 , c 4 for the decision matrix of Table 1. However, our proposed operators with q = 1, q = 2, and q = 3 actually work well with the same best option c 4 .
Similarly, based on these operators, the comparative analysis of the proposed work for Table 4 is shown in Table 11.
From the above analysis, we find that these existing operators and our proposed operators with q = 1 fail to rank c 1 , c 2 , c 3 , c 4 for the decision matrix of Table 4. However, our proposed operators with q = 2 and q = 3 actually work well with the same best option c 1 .
Similarly, based on these operators, the comparative analysis of the proposed work for Table 7 is shown in Table 12.
From the above analysis, we find that these existing operators and our proposed operators with q = 1 and q = 2 fail to rank c 1 , c 2 , c 3 , c 4 for the decision matrix of Table 7. However, our proposed operators with q = 7 works well with the best option c 3 .

6. Conclusions

In general, the complex q-rung orthopair fuzzy set (CQROFS) is a wide generalization of fuzzy sets. However, CQROFS cannot handle well enough for some circumstances. In this paper, we propose the novel approach of complex T-spherical fuzzy set (CTSFS) with its operational laws where CTSFS composes the grade of truth, abstinence, and falsity with a condition in which the sum of q-power of the real part (also for imaginary part) of the truth, abstinence, and falsity grades is not exceeded from a unit interval. Using an example, we explain why the proposed CTSFS can handle some circumstances better than CFS, CIFS, CPFS, or even CQROFS. Furthermore, we construct the two aggregation operators—CTSFWA and CTSFWG—for examining the interrelationships among complex T-spherical fuzzy numbers (CTSFNs). We also give the properties of idempotent, monotonicity, and boundedness for CTSFNs. A MADM procedure using the CTSFWA and CTSFGA operators is created. To examine the proficiency and reliability of the proposed approach, we resolve a MADM problem and solve it by using the proposed operators and some existing operators with comparisons. The results actually demonstrate that the CTSFWA and CTSFWG operators are well suited in the fuzzy environment with legitimacy and prevalence by contrasting existing operators. In our future work, we will extend these approaches to complex neutrosophic sets, complex neutrosophic hesitant fuzzy sets, picture hesitant fuzzy sets, and T-spherical hesitant fuzzy sets.

Author Contributions

Conceptualization, Z.A. and T.M.; methodology, Z.A., T.M. and M.-S.Y.; software, Z.A.; validation, Z.A., T.M. and M.-S.Y.; formal analysis, Z.A., T.M. and M.-S.Y.; investigation, Z.A. and T.M.; resources, Z.A. and T.M.; data curation, Z.A.; writing—original draft preparation, Z.A. and T.M.; writing—review and editing, M.-S.Y.; visualization, Z.A. and M.-S.Y.; supervision, M.-S.Y.; project administration, Z.A.; funding acquisition, M.-S.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the Ministry of Science and technology (MOST) of Taiwan under Grant MOST-107-2118-M-033-002-MY2.

Acknowledgments

The authors would like to thank the anonymous referees for their helpful comments in improving the presentation of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Vlachos, I.K.; Sergiadis, G.D. Intuitionistic fuzzy information—Applications to pattern recognition. Pattern Recognit. Lett. 2007, 28, 197–206. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  3. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  4. 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]
  5. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  6. Cường, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409. [Google Scholar] [CrossRef] [Green Version]
  7. Ullah, K.; Mahmood, T.; Jan, N. Similarity measures for T-spherical fuzzy sets with applications in pattern recognition. Symmetry 2018, 10, 193. [Google Scholar] [CrossRef] [Green Version]
  8. 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]
  9. Ullah, K.; Hassan, N.; Mahmood, T.; Jan, N.; Hassan, M. Evaluation of investment policy based on multi-attribute decision-making using interval valued T-spherical fuzzy aggregation operators. Symmetry 2019, 11, 357. [Google Scholar] [CrossRef] [Green Version]
  10. Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
  11. Alkouri, A.M.D.J.S.; Salleh, A.R. Complex intuitionistic fuzzy sets. In AIP Conference Proceedings; American Institute of Physics: College Park, Maryland, 2012; Volume 1482, pp. 464–470. [Google Scholar]
  12. Ullah, K.; Mahmood, T.; Ali, Z.; Jan, N. On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition. Complex Intell. Syst. 2019, 6, 15–27. [Google Scholar] [CrossRef] [Green Version]
  13. Liu, P.; Mahmood, T.; Ali, Z. Complex Q-rung orthopair fuzzy aggregation operators and their applications in multi-attribute group decision making. Information 2020, 11, 5. [Google Scholar] [CrossRef] [Green Version]
  14. Peng, X.; Dai, J.; Garg, H. Exponential operation and aggregation operator for q-rung orthopair fuzzy set and their decision-making method with a new score function. Int. J. Intell. Syst. 2018, 33, 2255–2282. [Google Scholar] [CrossRef]
  15. Riaz, M.; Pamucar, D.; Farid, H.M.A.; Hashmi, M.R. Q-rung orthopair fuzzy prioritized aggregation operators and their application towards green supplier chain management. Symmetry 2020, 12, 976. [Google Scholar] [CrossRef]
  16. Du, W.S. Minkowski-type distance measures for generalized orthopair fuzzy sets. Int. J. Intell. Syst. 2018, 33, 802–817. [Google Scholar] [CrossRef]
  17. Bai, K.; Zhu, X.; Wang, J.; Zhang, R. Some partitioned Maclaurin symmetric mean based on q-rung orthopair fuzzy information for dealing with multi-attribute group decision making. Symmetry 2018, 10, 383. [Google Scholar] [CrossRef] [Green Version]
  18. Liu, P.; Chen, S.M.; Wang, P. Multiple-attribute group decision-making based on q-rung orthopair fuzzy power maclaurin symmetric mean operators. IEEE Trans. Syst. Man Cybern. Syst. 2018, 1–16. [Google Scholar] [CrossRef]
  19. Liu, P.; Wang, Y. Multiple attribute decision making based on q-rung orthopair fuzzy generalized Maclaurin symmetic mean operators. Inf. Sci. 2020, 518, 181–210. [Google Scholar] [CrossRef]
  20. Wei, G.; Gao, H.; Wei, Y. Some q-rung orthopair fuzzy Heronian mean operators in multiple attribute decision making. Int. J. Intell. Syst. 2018, 33, 1426–1458. [Google Scholar] [CrossRef]
  21. Yin, S.; Li, H.; Yang, Y. Product operations on q-rung orthopair fuzzy graphs. Symmetry 2019, 11, 588. [Google Scholar] [CrossRef] [Green Version]
  22. Shu, X.; Ai, Z.; Xu, Z.; Ye, Y. Integrations of q-rung orthopair fuzzy continuous information. IEEE Trans. Fuzzy Syst. 2019, 27, 1974–1985. [Google Scholar] [CrossRef]
  23. Garg, H.; Munir, M.; Ullah, K.; Mahmood, T.; Jan, N. Algorithm for T-spherical fuzzy multi-attribute decision making based on improved interactive aggregation operators. Symmetry 2018, 10, 670. [Google Scholar] [CrossRef] [Green Version]
  24. 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]
  25. Ullah, K.; Mahmood, T.; Jan, N.; Ali, Z. A Note on Geometric Aggregation Operators in T-Spherical Fuzzy Environment and Their Applications in Multi-Attribute Decision Making. J. Eng. Appl. Sci. 2018, 37, 75–86. [Google Scholar]
  26. Munir, M.; Kalsoom, H.; Ullah, K.; Mahmood, T.; Chu, Y.M. T-spherical fuzzy Einstein hybrid aggregation operators and their applications in multi-attribute decision making problems. Symmetry 2020, 12, 365. [Google Scholar] [CrossRef] [Green Version]
  27. Ashraf, S.; Abdullah, S. Spherical aggregation operators and their application in multiattribute group decision-making. Int. J. Intell. Syst. 2019, 34, 493–523. [Google Scholar] [CrossRef]
  28. 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, 11, 2731–2749. [Google Scholar] [CrossRef]
  29. Jin, Y.; Ashraf, S.; Abdullah, S. Spherical Fuzzy Logarithmic Aggregation Operators Based on Entropy and Their Application in Decision Support Systems. Entropy 2019, 21, 628. [Google Scholar] [CrossRef] [Green Version]
  30. Wang, C.; Zhou, X.; Tu, H.; Tao, S. Some geometric aggregation operators based on picture fuzzy sets and their application in multiple attribute decision making. Ital. J. Pure Appl. Math. 2017, 37, 477–492. [Google Scholar]
  31. Garg, H. Some picture fuzzy aggregation operators and their applications to multicriteria decision-making. Arab. J. Sci. Eng. 2017, 42, 5275–5290. [Google Scholar] [CrossRef]
  32. Wei, G. Picture fuzzy aggregation operators and their application to multiple attribute decision making. J. Intell. Fuzzy Syst. 2017, 33, 713–724. [Google Scholar] [CrossRef]
  33. Wei, G. Picture fuzzy Hamacher aggregation operators and their application to multiple attribute decision making. Fundam. Inform. 2018, 157, 271–320. [Google Scholar] [CrossRef]
Table 1. Original decision matrix.
Table 1. Original decision matrix.
x 1 x 2 x 3 x 4
c 1 ( 0.3 e i . 2 π ( 0.3 ) , 0.2 e i . 2 π ( 0.2 ) , 0.1 e i . 2 π ( 0.1 ) ) ( 0.31 e i . 2 π ( 0.31 ) , 0.21 e i . 2 π ( 0.21 ) , 0.11 e i . 2 π ( 0.11 ) ) ( 0.32 e i . 2 π ( 0.32 ) , 0.22 e i . 2 π ( 0.22 ) , 0.12 e i . 2 π ( 0.12 ) ) ( 0.33 e i . 2 π ( 0.33 ) , 0.23 e i . 2 π ( 0.23 ) , 0.13 e i . 2 π ( 0.13 ) )
c 2 ( 0.4 e i . 2 π ( 0.4 ) , 0.3 e i . 2 π ( 0.3 ) , 0.1 e i . 2 π ( 0.1 ) ) ( 0.41 e i . 2 π ( 0.41 ) , 0.31 e i . 2 π ( 0.31 ) , 0.11 e i . 2 π ( 0.11 ) ) ( 0.42 e i . 2 π ( 0.42 ) , 0.32 e i . 2 π ( 0.32 ) , 0.12 e i . 2 π ( 0.12 ) ) ( 0.43 e i . 2 π ( 0.43 ) , 0.33 e i . 2 π ( 0.33 ) , 0.13 e i . 2 π ( 0.13 ) )
c 3 ( 0.5 e i . 2 π ( 0.5 ) , 0.1 e i . 2 π ( 0.1 ) , 0.2 e i . 2 π ( 0.2 ) ) ( 0.51 e i . 2 π ( 0.51 ) , 0.11 e i . 2 π ( 0.11 ) , 0.21 e i . 2 π ( 0.21 ) ) ( 0.52 e i . 2 π ( 0.52 ) , 0.12 e i . 2 π ( 0.12 ) , 0.22 e i . 2 π ( 0.22 ) ) ( 0.53 e i . 2 π ( 0.53 ) , 0.13 e i . 2 π ( 0.13 ) , 0.23 e i . 2 π ( 0.23 ) )
c 4 ( 0.6 e i . 2 π ( 0.6 ) , 0.1 e i . 2 π ( 0.1 ) , 0.1 e i . 2 π ( 0.1 ) ) ( 0.61 e i . 2 π ( 0.61 ) , 0.11 e i . 2 π ( 0.11 ) , 0.11 e i . 2 π ( 0.11 ) ) ( 0.62 e i . 2 π ( 0.62 ) , 0.12 e i . 2 π ( 0.12 ) , 0.12 e i . 2 π ( 0.12 ) ) ( 0.63 e i . 2 π ( 0.63 ) , 0.13 e i . 2 π ( 0.13 ) , 0.13 e i . 2 π ( 0.13 ) )
Table 2. Aggregated values by using the proposed operators.
Table 2. Aggregated values by using the proposed operators.
CTSFWACTSFWG
c 1 ( 0.3116 e i . 2 π ( 0.3116 ) , 0.2113 e i . 2 π ( 0.2113 ) , 0.1111 e i . 2 π ( 0.1111 ) ) ( 0.3114 e i . 2 π ( 0.3114 ) , 0.2116 e i . 2 π ( 0.2116 ) , 0.1115 e i . 2 π ( 0.1115 ) )
c 2 ( 0.4116 e i . 2 π ( 0.4116 ) , 0.3114 e i . 2 π ( 0.3114 ) , 0.1111 e i . 2 π ( 0.1111 ) ) ( 0.4114 e i . 2 π ( 0.4114 ) , 0.3116 e i . 2 π ( 0.31116 ) , 0.1115 e i . 2 π ( 0.11115 ) )
c 3 ( 0.5116 e i . 2 π ( 0.5116 ) , 0.1111 e i . 2 π ( 0.1111 ) , 0.2113 e i . 2 π ( 0.2113 ) ) ( 0.5114 e i . 2 π ( 0.5114 ) , 0.1115 e i . 2 π ( 0.1115 ) , 0.2116 e i . 2 π ( 0.2116 ) )
c 4 ( 0.6116 e i . 2 π ( 0.6116 ) , 0.1111 e i . 2 π ( 0.1111 ) , 0.1111 e i . 2 π ( 0.1111 ) ) ( 0.6114 e i . 2 π ( 0.6114 ) , 0.1115 e i . 2 π ( 0.1115 ) , 0.1115 e i . 2 π ( 0.1115 ) )
Table 3. Score values of CTSFWA and CTSFWG.
Table 3. Score values of CTSFWA and CTSFWG.
Scores of CTSFWAScores of CTSFWG
c 1 0.0109 0.0117
c 2 0.0109 0.0117
c 3 0.1891 0.1883
c 4 0.3893 0.3883
Table 4. Original decision matrix.
Table 4. Original decision matrix.
x 1 x 2 x 3 x 4
c 1 ( 0.9 e i . 2 π ( 0.9 ) , 0.2 e i . 2 π ( 0.2 ) , 0.1 e i . 2 π ( 0.1 ) ) ( 0.91 e i . 2 π ( 0.91 ) , 0.21 e i . 2 π ( 0.21 ) , 0.11 e i . 2 π ( 0.11 ) ) ( 0.92 e i . 2 π ( 0.92 ) , 0.22 e i . 2 π ( 0.22 ) , 0.12 e i . 2 π ( 0.12 ) ) ( 0.93 e i . 2 π ( 0.93 ) , 0.23 e i . 2 π ( 0.23 ) , 0.13 e i . 2 π ( 0.13 ) )
c 2 ( 0.8 e i . 2 π ( 0.8 ) , 0.3 e i . 2 π ( 0.3 ) , 0.1 e i . 2 π ( 0.1 ) ) ( 0.81 e i . 2 π ( 0.81 ) , 0.31 e i . 2 π ( 0.31 ) , 0.11 e i . 2 π ( 0.11 ) ) ( 0.82 e i . 2 π ( 0.82 ) , 0.32 e i . 2 π ( 0.32 ) , 0.12 e i . 2 π ( 0.12 ) ) ( 0.83 e i . 2 π ( 0.83 ) , 0.33 e i . 2 π ( 0.33 ) , 0.13 e i . 2 π ( 0.13 ) )
c 3 ( 0.9 e i . 2 π ( 0.9 ) , 0.1 e i . 2 π ( 0.1 ) , 0.2 e i . 2 π ( 0.2 ) ) ( 0.91 e i . 2 π ( 0.91 ) , 0.91 e i . 2 π ( 0.11 ) , 0.21 e i . 2 π ( 0.21 ) ) ( 0.92 e i . 2 π ( 0.92 ) , 0.12 e i . 2 π ( 0.12 ) , 0.22 e i . 2 π ( 0.22 ) ) ( 0.93 e i . 2 π ( 0.93 ) , 0.13 e i . 2 π ( 0.13 ) , 0.23 e i . 2 π ( 0.23 ) )
c 4 ( 0.8 e i . 2 π ( 0.8 ) , 0.1 e i . 2 π ( 0.1 ) , 0.1 e i . 2 π ( 0.1 ) ) ( 0.81 e i . 2 π ( 0.81 ) , 0.11 e i . 2 π ( 0.11 ) , 0.11 e i . 2 π ( 0.11 ) ) ( 0.82 e i . 2 π ( 0.82 ) , 0.12 e i . 2 π ( 0.12 ) , 0.12 e i . 2 π ( 0.12 ) ) ( 0.83 e i . 2 π ( 0.83 ) , 0.13 e i . 2 π ( 0.13 ) , 0.13 e i . 2 π ( 0.13 ) )
Table 5. Aggregated values by using the proposed operators.
Table 5. Aggregated values by using the proposed operators.
CTSFWACTSFWG
c 1 ( 0.9116 e i . 2 π ( 0.9116 ) , 0.2113 e i . 2 π ( 0.2113 ) , 0.1111 e i . 2 π ( 0.1111 ) ) ( 0.9114 e i . 2 π ( 0.9114 ) , 0.2116 e i . 2 π ( 0.2116 ) , 0.1115 e i . 2 π ( 0.1115 ) )
c 2 ( 0.8116 e i . 2 π ( 0.8116 ) , 0.3114 e i . 2 π ( 0.3114 ) , 0.1111 e i . 2 π ( 0.1111 ) ) ( 0.8114 e i . 2 π ( 0.8114 ) , 0.3116 e i . 2 π ( 0.31116 ) , 0.1115 e i . 2 π ( 0.11115 ) )
c 3 ( 0.9116 e i . 2 π ( 0.9116 ) , 0.1111 e i . 2 π ( 0.1111 ) , 0.2113 e i . 2 π ( 0.2113 ) ) ( 0.9114 e i . 2 π ( 0.9114 ) , 0.1115 e i . 2 π ( 0.1115 ) , 0.2116 e i . 2 π ( 0.2116 ) )
c 4 ( 0.8116 e i . 2 π ( 0.8116 ) , 0.1111 e i . 2 π ( 0.1111 ) , 0.1111 e i . 2 π ( 0.1111 ) ) ( 0.8114 e i . 2 π ( 0.8114 ) , 0.1115 e i . 2 π ( 0.1115 ) , 0.1115 e i . 2 π ( 0.1115 ) )
Table 6. Score values of CTSFWA and CTSFWG.
Table 6. Score values of CTSFWA and CTSFWG.
Scores of CTSFWAScores of CTSFWG
c 1 0.774 0.7734
c 2 0.45 0.5488
c 3 0.774 0.7734
c 4 0.634 0.6327
Table 7. Original decision matrix.
Table 7. Original decision matrix.
x 1 x 2 x 3 x 4
c 1 ( 0.9 e i . 2 π ( 0.9 ) , 0.7 e i . 2 π ( 0.7 ) , 0.8 e i . 2 π ( 0.8 ) ) ( 0.91 e i . 2 π ( 0.91 ) , 0.71 e i . 2 π ( 0.71 ) , 0.81 e i . 2 π ( 0.81 ) ) ( 0.92 e i . 2 π ( 0.92 ) , 0.72 e i . 2 π ( 0.72 ) , 0.82 e i . 2 π ( 0.82 ) ) ( 0.93 e i . 2 π ( 0.93 ) , 0.73 e i . 2 π ( 0.73 ) , 0.83 e i . 2 π ( 0.83 ) )
c 2 ( 0.8 e i . 2 π ( 0.8 ) , 0.6 e i . 2 π ( 0.6 ) , 0.7 e i . 2 π ( 0.7 ) ) ( 0.81 e i . 2 π ( 0.81 ) , 0.61 e i . 2 π ( 0.61 ) , 0.71 e i . 2 π ( 0.71 ) ) ( 0.82 e i . 2 π ( 0.82 ) , 0.62 e i . 2 π ( 0.62 ) , 0.72 e i . 2 π ( 0.72 ) ) ( 0.83 e i . 2 π ( 0.83 ) , 0.63 e i . 2 π ( 0.63 ) , 0.73 e i . 2 π ( 0.73 ) )
c 3 ( 0.9 e i . 2 π ( 0.9 ) , 0.6 e i . 2 π ( 0.6 ) , 0.5 e i . 2 π ( 0.5 ) ) ( 0.91 e i . 2 π ( 0.91 ) , 0.61 e i . 2 π ( 0.61 ) , 0.51 e i . 2 π ( 0.51 ) ) ( 0.92 e i . 2 π ( 0.92 ) , 0.62 e i . 2 π ( 0.62 ) , 0.52 e i . 2 π ( 0.52 ) ) ( 0.93 e i . 2 π ( 0.93 ) , 0.63 e i . 2 π ( 0.63 ) , 0.53 e i . 2 π ( 0.53 ) )
c 4 ( 0.8 e i . 2 π ( 0.8 ) , 0.7 e i . 2 π ( 0.7 ) , 0.7 e i . 2 π ( 0.7 ) ) ( 0.81 e i . 2 π ( 0.81 ) , 0.71 e i . 2 π ( 0.71 ) , 0.71 e i . 2 π ( 0.71 ) ) ( 0.82 e i . 2 π ( 0.82 ) , 0.72 e i . 2 π ( 0.72 ) , 0.72 e i . 2 π ( 0.72 ) ) ( 0.83 e i . 2 π ( 0.83 ) , 0.73 e i . 2 π ( 0.73 ) , 0.73 e i . 2 π ( 0.73 ) )
Table 8. Aggregated values by using the proposed operators.
Table 8. Aggregated values by using the proposed operators.
CTSFWACTSFWG
c 1 ( 0.9116 e i . 2 π ( 0.9116 ) , 0.7113 e i . 2 π ( 0.2 ) , 0.8113 e i . 2 π ( 0.1 ) ) ( 0.9114 e i . 2 π ( 0.3 ) , 0.7116 e i . 2 π ( 0.2 ) , 0.8115 e i . 2 π ( 0.1 ) )
c 2 ( 0.8116 e i . 2 π ( 0.4 ) , 0.6114 e i . 2 π ( 0.3 ) , 0.7111 e i . 2 π ( 0.1 ) ) ( 0.8114 e i . 2 π ( 0.4 ) , 0.6116 e i . 2 π ( 0.3 ) , 0.7115 e i . 2 π ( 0.1 ) )
c 3 ( 0.9116 e i . 2 π ( 0.5 ) , 0.6111 e i . 2 π ( 0.1 ) , 0.5113 e i . 2 π ( 0.2 ) ) ( 0.9114 e i . 2 π ( 0.5 ) , 0.6115 e i . 2 π ( 0.1 ) , 0.5116 e i . 2 π ( 0.2 ) )
c 4 ( 0.8116 e i . 2 π ( 0.6 ) , 0.7111 e i . 2 π ( 0.1 ) , 0.7111 e i . 2 π ( 0.1 ) ) ( 0.8114 e i . 2 π ( 0.6 ) , 0.7115 e i . 2 π ( 0.1 ) , 0.7115 e i . 2 π ( 0.1 ) )
Table 9. Score values of CTSFWA and CTSFWG.
Table 9. Score values of CTSFWA and CTSFWG.
Scores of CTSFWAScores of CTSFWG
c 1 0.1973 0.1982
c 2 0.1081 0.1072
c 3 0.4822 0.4812
c 4 0.0481 0.0469
Table 10. Comparative analysis of the proposed work with existing operators for Table 1.
Table 10. Comparative analysis of the proposed work with existing operators for Table 1.
Methods OperatorsScore ValuesRanking Results
Garg et al. [23]WA Ƒ a i l e d
WG Ƒ a i l e d
Liu et al. [24]WA Ƒ a i l e d
WG Ƒ a i l e d
Ullah et al. [25]WA Ƒ a i l e d
WG Ƒ a i l e d
Munir et al. [26]WA Ƒ a i l e d
WG Ƒ a i l e d
Ashraf and Abdullah [27]WA Ƒ a i l e d
WG Ƒ a i l e d
Ashraf et al. [28]WA Ƒ a i l e d
WG Ƒ a i l e d
Jin et al. [29]WA Ƒ a i l e d
WG Ƒ a i l e d
Wang et al. [30]WA Ƒ a i l e d
WG Ƒ a i l e d
Garg [31]WA Ƒ a i l e d
WG Ƒ a i l e d
Wei [32]WA Ƒ a i l e d
WG Ƒ a i l e d
Wei [33]WA Ƒ a i l e d
WG Ƒ a i l e d
Proposed Operators (q = 1)WA S ( c 1 ) = 0.0195 , S ( c 2 ) = 0.0382 ,
S ( c 3 ) = 0.1232 , S ( c 4 ) = 0.2261
c 4 c 3 c 2 c 1
WG S ( c 1 ) = 0.0193 , S ( c 2 ) = 0.0379 ,
S ( c 3 ) = 0.1228 , S ( c 4 ) = 0.2258
c 4 c 3 c 2 c 1
Proposed Operators (q = 2)WA S ( c 1 ) = 0.0401 , S ( c 2 ) = 0.0601 ,
S ( c 3 ) = 0.2048 , S ( c 4 ) = 0.3494
c 4 c 3 c 2 c 1
WG S ( c 1 ) = 0.0396 , S ( c 2 ) = 0.0596 ,
S ( c 3 ) = 0.2042 , S ( c 4 ) = 0.3488
c 4 c 3 c 2 c 1
Proposed Operators (q = 3)WA S ( c 1 ) = 0.0109 , S ( c 2 ) = 0.0109 ,
S ( c 3 ) = 0.1891 , S ( c 4 ) = 0.3893
c 4 c 3 c 2 c 1
WG S ( c 1 ) = 0.0117 , S ( c 2 ) = 0.0117 ,
S ( c 3 ) = 0.1883 , S ( c 4 ) = 0.3883
c 4 c 3 c 2 c 1
Table 11. Comparative analysis of the proposed work with existing operators for Table 4.
Table 11. Comparative analysis of the proposed work with existing operators for Table 4.
Methods OperatorsScore ValuesRanking Results
Garg et al. [23]WA Ƒ a i l e d
WG Ƒ a i l e d
Liu et al. [24]WA Ƒ a i l e d
WG Ƒ a i l e d
Ullah et al. [25]WA Ƒ a i l e d
WG Ƒ a i l e d
Munir et al. [26]WA Ƒ a i l e d
WG Ƒ a i l e d
Ashraf and Abdullah [27]WA Ƒ a i l e d
WG Ƒ a i l e d
Ashraf et al. [28]WA Ƒ a i l e d
WG Ƒ a i l e d
Jin et al. [29]WA Ƒ a i l e d
WG Ƒ a i l e d
Wang et al. [30]WA Ƒ a i l e d
WG Ƒ a i l e d
Garg [31]WA Ƒ a i l e d
WG Ƒ a i l e d
Wei [32]WA Ƒ a i l e d
WG Ƒ a i l e d
Wei [33]WA Ƒ a i l e d
WG Ƒ a i l e d
Proposed Operators (q = 1)WA Ƒ a i l e d
WG Ƒ a i l e d
Proposed Operators (q = 2)WA S ( c 1 ) = 0.774 , S ( c 2 ) = 0.45 ,
S ( c 3 ) = 0.774 , S ( c 4 ) = 0.634
c 1 c 3 c 4 c 2
WG S ( c 1 ) = 0.7734 , S ( c 2 ) = 0.5488 ,
S ( c 3 ) = 0.7734 , S ( c 4 ) = 0.6327
c 1 c 3 c 4 c 2
Proposed Operators (q = 3)WA S ( c 1 ) = 0.812 , S ( c 2 ) = 0.48 ,
S ( c 3 ) = 0.812 , S ( c 4 ) = 0.74
c 1 c 3 c 4 c 2
WG S ( c 1 ) = 0.834 , S ( c 2 ) = 0.483 ,
S ( c 3 ) = 0.834 , S ( c 4 ) = 0.727
c 1 c 3 c 4 c 2
Table 12. Comparative analysis of the proposed work with existing operators for Table 7.
Table 12. Comparative analysis of the proposed work with existing operators for Table 7.
Methods OperatorsScore ValuesRanking Results
Garg et al. [23]WA Ƒ a i l e d
WG Ƒ a i l e d
Liu et al. [24]WA Ƒ a i l e d
WG Ƒ a i l e d
Ullah et al. [25]WA Ƒ a i l e d
WG Ƒ a i l e d
Munir et al. [26]WA Ƒ a i l e d
WG Ƒ a i l e d
Ashraf and Abdullah [27]WA Ƒ a i l e d
WG Ƒ a i l e d
Ashraf et al. [28]WA Ƒ a i l e d
WG Ƒ a i l e d
Jin et al. [29]WA Ƒ a i l e d
WG Ƒ a i l e d
Wang et al. [30]WA Ƒ a i l e d
WG Ƒ a i l e d
Garg [31]WA Ƒ a i l e d
WG Ƒ a i l e d
Wei [32]WA Ƒ a i l e d
WG Ƒ a i l e d
Wei [33]WA Ƒ a i l e d
WG Ƒ a i l e d
Proposed Operators (q = 1)WA Ƒ a i l e d
WG Ƒ a i l e d
Proposed Operators (q = 2)WA Ƒ a i l e d
WG Ƒ a i l e d
Proposed Operators (q = 7)WA S ( c 1 ) = 0.1973 , S ( c 2 ) = 0.1081 ,
S ( c 3 ) = 0.4822 , S ( c 4 ) = 0.0481
c 3 c 1 c 2 c 4
WG S ( c 1 ) = 0.1982 , S ( c 2 ) = 0.1072 ,
S ( c 3 ) = 0.4812 , S ( c 4 ) = 0.0469
c 3 c 1 c 2 c 4

Share and Cite

MDPI and ACS Style

Ali, Z.; Mahmood, T.; Yang, M.-S. Complex T-Spherical Fuzzy Aggregation Operators with Application to Multi-Attribute Decision Making. Symmetry 2020, 12, 1311. https://doi.org/10.3390/sym12081311

AMA Style

Ali Z, Mahmood T, Yang M-S. Complex T-Spherical Fuzzy Aggregation Operators with Application to Multi-Attribute Decision Making. Symmetry. 2020; 12(8):1311. https://doi.org/10.3390/sym12081311

Chicago/Turabian Style

Ali, Zeeshan, Tahir Mahmood, and Miin-Shen Yang. 2020. "Complex T-Spherical Fuzzy Aggregation Operators with Application to Multi-Attribute Decision Making" Symmetry 12, no. 8: 1311. https://doi.org/10.3390/sym12081311

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