Next Article in Journal
A New Radar Signal Recognition Method Based on Optimal Classification Atom and IDCQGA
Previous Article in Journal
An Integrated Decision Framework for Material Selection Procedure: A Case Study in a Detergent Manufacturer
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Triangular Cubic Hesitant Fuzzy Einstein Hybrid Weighted Averaging Operator and Its Application to Decision Making

1
Department of Mathematics, Hazara University Mansehra, Dhodial 21130, Pakistan
2
Department of Mathematics, University of New Mexico, Albuquerque, NM 87301, USA
3
Department of Mathematics, Comsats University Abbottabad, Abbottabad 22010, Pakistan
4
School of Mathematical Sciences, Faculty of Science and Technology, University Kebangsaan Malaysia, UKM Bangi Selangor DE 43600, Malaysia
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(11), 658; https://doi.org/10.3390/sym10110658
Submission received: 30 October 2018 / Revised: 14 November 2018 / Accepted: 14 November 2018 / Published: 20 November 2018

Abstract

:
In this paper, triangular cubic hesitant fuzzy Einstein weighted averaging (TCHFEWA) operator, triangular cubic hesitant fuzzy Einstein ordered weighted averaging (TCHFEOWA) operator and triangular cubic hesitant fuzzy Einstein hybrid weighted averaging (TCHFEHWA) operator are proposed. An approach to multiple attribute group decision making with linguistic information is developed based on the TCHFEWA and the TCHFEHWA operators. Furthermore, we establish various properties of these operators and derive the relationship between the proposed operators and the existing aggregation operators. Finally, a numerical example is provided to demonstrate the application of the established approach.

1. Introduction

Multicriteria decision-making (MCDM) problems seek great attention to practical fields, whose target is to find the best alternative(s) among the feasible options. In primitive times, decisions were framed without handling the uncertainties in the data, which may lead to inadequate results toward the real-life operating situations. Since all these facilitate the uncertainties to a great extent, they cannot withstand situations where the decision the maker has to consider the falsity corresponding to the truth a value ranging over an interval. IFSs have the advantage that permits the user to model some uncertainty on the membership function of the elements. That is, fuzzy sets require a membership degree for each element in the reference set, whereas an IFS permits us to include some hesitation on this value. Atanassov [1] originated the notion of intuitionistic fuzzy set (IFS), which is a generalization of Zadeh’s fuzzy sets [2]. The intuitionistic fuzzy set has three main parts: membership function, non-membership function, and hesitancy function. According to Zadeh [3], a conditional statement “If x = A then y = ” describes a relation between the two fuzzy variables x and y. He therefore suggests that the conditional statement should be represented by a fuzzy relation from U and V. Bustince et al. [4] analysed the existent relations between the structures of a relation and the structures of its complementary one. Deschrijver et al. [5] introduced the many theories to establish the relationships between intuitionistic fuzzy sets, interval-valued fuzzy sets, and interval-valued intuitionistic fuzzy sets. Through the last period, the AIFS theory has been suitably associated with aggregate intuitionistic fuzzy information [6,7]. Xu [8] developed some basic arithmetic aggregation operators, such as the intuitionistic fuzzy weighted averaging (IFWA) operator, intuitionistic fuzzy ordered weighted averaging (IFOWA) operator, and intuitionistic fuzzy hybrid averaging (IFHA) operator, for aggregating intuitionistic fuzzy values (IFVs). Chen and Xu [9] presented a structure which generalizes the idea of HFS [10] to IVHFS that makes possible the membership evaluation of a component into many realizable interval numbers. Torra [10] proposed the hesitant fuzzy set that permitted the membership having a set of possible values and discussed the relationship between the hesitant fuzzy set and intuitionistic fuzzy set. The hesitant fuzzy set can be applied to many decision-making problems. He also proved that the operations he proposed are consistent with the ones of the intuitionistic fuzzy set when applied to the envelope of the hesitant fuzzy set. To get the optimal alternative in a decision making problem with multiple attributes and multiple persons, there are usually two ways: (1) aggregate the decision makers’ opinions under each attribute for alternatives, then aggregate the collective values of attributes for each alternative; (2) aggregate the attribute values given by the decision makers for each alternative, and then aggregate the decision makers’ opinions for each alternative. Xia et al. [11] developed some operations and aggregation operators for hesitant fuzzy elements. Xia et al. [12] defined the reflect the correlation of the aggregation arguments, two methods are proposed to determine the aggregation weight vectors. Zeng et al. [13] developed an intuitionistic fuzzy ordered weighted distance (IFOWD) operator.
Decision-making is an integral part of modern management. Essentially, rational or sound decision making is taken as a primary function of management. Every manager takes hundreds and hundreds of decisions subconsciously or consciously making it as the key component in the role of a manager. Decisions play important roles as they determine both organizational and managerial activities. A decision can be defined as a course of action purposely chosen from a set of alternatives to achieve organizational or managerial objectives or goals. A decision-making process is a continuous and indispensable component of managing any organization or business activities. Decisions are made to sustain the activities of all business activities and organizational functioning. Decision theory has its root in economic theory, with the assumption that people make decisions to maximize utility on the basis of self-interest and rationality. This, however, does not consider the possibilities or effects of moderating or intervening factors that make decisions reference-dependent. Nonetheless, expected utility theory has been applied in the construction industry with some success and has been the predominant model for normative decision making. The theory is considered idealistic, however, because it focuses on how managers should make decisions rather than how they actually make decisions.
Technical people in the construction industry have been observed to exhibit a tendency for a normative approach to decision making, thereby weakening their ability to deal with uncertainty. Program management is dominated by technical staff and probably more than a few are struggling with tendencies toward this normative thinking phenomenon. An alternative approach is the descriptive decision theory.
Comparative analysis needs to be distinguished from the juxtaposition of descriptions of a series of cases. While sequential presentations of descriptive data are undoubtedly informative about the cases concerned they are only comparative in the weak sense of making the reader aware of differences and similarities. They whet the appetite to know more. Based on the algebraic sum, algebraic product, and operational laws on AIFSs, some aggregation operators have been proposed to overcome the lack of precision in the final results using the binary operations to carry the combination process. Xu and Yager [14] developed some basic geometric aggregation operators such as intuitionistic fuzzy weighted geometric (IFWG) operator, intuitionistic fuzzy ordered weighted geometric (IFOWG) operator, and intuitionistic fuzzy hybrid geometric (IFHG) operator, and applied them to multiple attribute decision making (MADM) based on AIFSs. Xu and Yager [15] defined dynamic IFWA operator and developed a procedure to solve the dynamic intuitionistic fuzzy MADM problems. Zhao et al. [16] developed some hesitant triangular fuzzy aggregation operators based on the Einstein operation: the hesitant triangular fuzzy Einstein weighted averaging (HTFEWA) operator, hesitant triangular fuzzy Einstein weighted geometric (HTFEWG) operator, hesitant triangular fuzzy Einstein ordered weighted averaging (HTFEOWA) operator, hesitant triangular fuzzy Einstein ordered weighted geometric (HTFEOWG) operator, hesitant triangular fuzzy Einstein hybrid average (HTFEHA) operator and hesitant triangular fuzzy Einstein hybrid geometric (HTFEHG) operator. Li et al. [17] developed to introduce some concepts of fuzzy measure and interval-valued intuitionistic uncertain linguistic variables based on Archimedean t-norm. Then, interval-valued intuitionistic uncertain linguistic weighted average(geometric) and interval-valued intuitionistic uncertain linguistic ordered weighted average operator based on Archimedean t-norm are developed. Furthermore, some desirable properties of these operators, such as commutativity, idempotency, and monotonicity have been studied, and interval-valued intuitionistic uncertain linguistic hybrid average operator based on Archimedean t-norm are developed.
Cubic set was introduced by Jun et al. [18]. Cubic sets are the extensions of fuzzy sets and intuitionistic fuzzy sets, in which there are two representations, one is utilized for the degree of membership and other is utilized for the degree of non-membership. The membership function is grip as interval while non-membership is thoroughly considered the ordinary fuzzy set.
Medina et al. [19] showed that the information common to both concept lattices can be seen as a sublattice of the Cartesian product of both concept lattices. Pozna et al. [20] proposed the attractive applications of signatures related to the modeling of fuzzy inference systems suggested and discussed. Jankowski et al. [21] proposed model revealed that a growing level of persuasion can increase results only to a certain extent. Kumar et al. [22] proposed the Artificial Bee Colony (ABC) algorithm is a swarm-based algorithm inspired by the intelligent foraging behavior of honey bees. In order to make use of the merits of both algorithms, a hybrid algorithm (IABCFCM) based on improved ABC and FCM algorithms.
Chen et al. [23] developed some hesitant triangular intuitionistic fuzzy aggregation operators and standardized hesitant triangular intuitionistic fuzzy aggregation operators. Xu et al. [24] provided a survey of the aggregation techniques of intuitionistic fuzzy information, and their applications in various fields, such as decision making, cluster analysis, medical diagnosis, forecasting, and manufacturing grid. Zhang [25] developed a series of aggregation operators for interval-valued intuitionistic hesitant fuzzy information.
Fahmi et al. [26] developed the hamming distance for the triangular cubic fuzzy number and weighted averaging operator. Fahmi et al. [27] proposed the cubic TOPSIS method and grey relational analysis set. Fahmi et al. [28] defined the triangular cubic fuzzy number and operational laws. The authors developed the triangular cubic fuzzy hybrid aggregation (TCFHA) administrator to total all individual fuzzy choice structure provided by the decision makers into the aggregate cubic fuzzy decision matrix. Amin et al. [29] defined the generalized triangular cubic linguistic hesitant fuzzy weighted geometric (GTCHFWG) operator, generalized triangular cubic linguistic hesitant fuzzy ordered weighted average (GTCLHFOWA) operator, generalized triangular cubic linguistic hesitant fuzzy ordered weighted geometric (GTCLHFOWG) operator, generalized triangular cubic linguistic hesitant fuzzy hybrid averaging (GTCLHFHA) operator and generalized triangular cubic linguistic hesitant fuzzy hybrid geometric (GTCLHFHG) operator. Fahmi et al. [30] developed Trapezoidal linguistic cubic hesitant fuzzy TOPSIS method to solve the MCDM method based on trapezoidal linguistic cubic hesitant fuzzy TOPSIS method. Fahmi et al. [31] define aggregation operators for triangular cubic linguistic hesitant fuzzy sets which include cubic linguistic fuzzy (geometric) operator, triangular cubic linguistic hesitant fuzzy weighted geometric (TCLHFWG) operator, triangular cubic linguistic hesitant fuzzy ordered weighted geometric (TCHFOWG) operator and triangular cubic linguistic hesitant fuzzy hybrid geometric (TCLHFHG) operator. Fahmi et al. [32] defined the trapezoidal cubic fuzzy weighted arithmetic averaging operator and weighted geometric averaging operator. Expected values, score function, and accuracy function of trapezoidal cubic fuzzy numbers are defined. Fahmi et al. [33] developed three arithmetic averaging operators, that is trapezoidal cubic fuzzy Einstein weighted averaging (TrCFEWA) operator, trapezoidal cubic fuzzy Einstein ordered weighted averaging (TrCFEOWA) operator and trapezoidal cubic fuzzy Einstein hybrid weighted averaging (TrCFEHWA) operator, for aggregating trapezoidal cubic fuzzy information. Fahmi et al. [34] defined some Einstein operations on cubic fuzzy set (CFS) and develop three arithmetic averaging operators, which are cubic fuzzy Einstein weighted averaging (CFEWA) operator, cubic fuzzy Einstein ordered weighted averaging (CFEOWA) operator and cubic fuzzy Einstein hybrid weighted averaging (CFEHWA) operator, for aggregating cubic fuzzy data. Amin et al. [35] introduced the new concept of the trapezoidal cubic hesitant fuzzy TOPSIS method.
Despite having a bulk of related literature on the problem under consideration, the following aspects related to triangular cubic hesitant fuzzy numbers (TCHFNs) and their aggregation operators motivated the researchers to carry it an in depth inquiry into the current study.
(1) The main advantages of the proposed operators are these aggregation operators provided more accurate and precious result as compare to the above mention operators.
(2) We generalized the concept of triangular cubic hesitant fuzzy numbers (TCHFNs), triangular intuitionistic fuzzy sets and introduce the concept of triangular cubic hesitant fuzzy numbers. If we take only one element in the membership degree of the triangular cubic hesitant fuzzy number, i.e., instead of the interval we take a fuzzy number, then we get triangular intuitionistic fuzzy numbers, similarly, if we take membership degree as the fuzzy number and non-membership degree equal to zero, then we get triangular fuzzy numbers.
(3) The objective of the study include:
Propose triangular cubic hesitant fuzzy number, operational laws, score value and accuracy value of TCHFNs.
Propose three aggregation operators, namely Triangular cubic hesitant fuzzy Einstein weighted averaging operator, Triangular cubic hesitant fuzzy Einstein ordered weighted averaging operator and Triangular cubic hesitant fuzzy Einstein hybrid weighted averaging operator.
Establish MADM program approach based triangular cubic hesitant fuzzy numbers.
Provide illustrative examples of MADM program.
(4) In order to testify the application of the developed method, we apply the triangular cubic hesitant fuzzy numbers in the decision making.
(5)The initial decision matrix is composed of LVs. In order to fully consider the randomness and ambiguity of the linguistic term, we convert LVs into the triangular cubic hesitant fuzzy numbers, and the decision matrix is transformed into the triangular cubic hesitant fuzzy matrix.
(6)The operator can fully express the uncertainty of the qualitative concept and triangular cubic hesitant fuzzy operators can capture the interdependencies among any multiple inputs or attributes by a variable parameter. The aggregation operators can take into account the importance of the attribute weights. Nevertheless, sometimes, for some MAGDM problems, the weights of the attributes are important factors for the decision process.
(7) As we have discussed earlier that Cubic sets are the generalization of intuitionistic hesitant fuzzy sets and a powerful tool to deal with fuzziness. Also, triangular intuitionistic hesitant fuzzy numbers are suitable to deal with fuzziness. However, there may be a situation where the decision maker may provide the degree of membership and nonmembership of a particular attribute in such a way that membership degree is a triangular interval hesitant fuzzy number and non-membership degree is a triangular hesitant fuzzy number. Therefore, to overcome this shortcoming we generalize the concept of triangular intuitionistic hesitant fuzzy numbers and introduce the concept of triangular cubic hesitant fuzzy sets which are very suitable to be used for depicting uncertain or hesitant fuzzy information. If we take only one element in the membership degree of the triangular cubic hesitant fuzzy number, i.e., instead of interval we take a hesitant fuzzy number, then we get triangular intuitionistic hesitant fuzzy numbers, similarly if we take membership degree as hesitant fuzzy number and nonmemberíship degree equal to zero, than we get triangular hesitant fuzzy numbers. Thus motivating by the idea proposed by Zhao et al. [16], in this paper we first proposed triangular cubic hesitant fuzzy number and including the Triangular cubic hesitant fuzzy Einstein weighted averaging (TCHFEWA) operator, triangular cubic hesitant fuzzy einstein ordered weighted averaging (TCHFEOWA) operator and triangular cubic hesitant fuzzy einstein hybrid weighted averaging (TCHFEHWA) operator.
This paper is organized as follows. In Section 2, we discuss some basic ideas to the fuzzy set and cubic set. In Section 3, we define the triangular cubic hesitant fuzzy numbers (TCHFNs) and operational laws. In Section 4, we present some Einstein operations on triangular cubic hesitant fuzzy numbers (TCHFNs) and analysis some desirable properties of the suggested operations. In Section 5, we first develop some novel arithmetic averaging operators, such as the triangular cubic hesitant fuzzy Einstein weighted averaging (TCHFEWA) operator, triangular cubic hesitant fuzzy Einstein ordered weighted averaging (TCHFEOWA) operator and triangular cubic hesitant fuzzy Einstein hybrid weighted averaging (TCHFEHWA) operator, for aggregating a collection of triangular cubic hesitant fuzzy numbers (TCHFNs). In Section 6, we relate the TCHFEHWA operator to MADM with triangular cubic hesitant fuzzy material. In Section 7, gives an example to illustrate the application of the developed method. In Section 8, we propose the comparison method. In Section 9, we consume a conclusion.

2. Preliminaries

Definition 1.
[2] Let H be a universe of discourse. Then the fuzzy set can be defined as: J = { h ¨ , Γ J ( h ¨ ) | h ¨ H } . A fuzzy set in a set H is denoted by Γ J : H I . The function Γ J ( h ¨ ) denoted the degree of membership of the element h ¨ to the set H, where I = [ 0 , 1 ] . The gathering of all fuzzy subsets of H is denoted by I H . Define a relation on I H as follows: ( Γ , η I H ) ( Γ η ( h ¨ h ¨ ) ( Γ ( h ¨ ) η ( h ¨ ) ) ) .
Definition 2.
[1] Let a set H be fixed, an AIFS A in H is defined as:
A = h ¨ , Γ A ( h ¨ ) , η A ( h ¨ ) | h ¨ H where Γ A and η A are mapping from H to the closed interval [ 0 , 1 ] such that 0 Γ A 1 , 0 η A 1 and 0 Γ A ( h ¨ ) + η A ( h ¨ ) 1 , for all h ¨ H , and they denote the degrees of membership and non-membership of element h ¨ H to set A , respectively. Let π A ( h ¨ ) = 1 Γ A ( h ¨ ) η A ( h ¨ ) , then it is usually called the intuitionistic fuzzy index of element h ¨ H to set A, representing the degree of indeterminacy or hesitation of h ¨ to A. It is obvious that 0 π A ( h ¨ ) 1 for every h ¨ H .
Definition 3.
[18] Let H is a nonempty set. By a cubic set in H we mean a structure F = { h , α ( h ) , β ¨ ( h ) : h H } in which α is an IVF set in H and β ¨ is a fuzzy set in H . A cubic set F = { h , α ( h ) , β ¨ ( h ) : h H } is simply denoted by F = α , β ¨ . Denote by c ¨ H the collection of all cubic sets in H . A cubic set F = α , β ¨ in which α ( h ) = 0 and β ¨ ( h ) = 1 (resp. α ( h ) = 1 And β ¨ ( h ) = 0 for all h H is denoted by 0 (resp. 1). A cubic set D = λ , ξ in which λ ( h ) = 0 and ξ ( h ) = 0 (resp. λ ( h ) = 1 and ξ ( h ) = 1 ) for all h H is denoted by 0 (resp. 1).
Definition 4.
[18] Let H is a non-empty set. A cubic set F = ( c ¨ , λ ) in H is said to be an internal cubic set if c ¨ ( h ) λ ( h ) c ¨ + ( h ) h H .
Definition 5.
[18] Let H is a non-empty set. A cubic set F = ( c ¨ , λ ) in H is said to be an external cubic set if λ ( h ) ( c ¨ ( h ) , c ¨ + ( h ) ) h H .
Definition 6.
[36] Triangular fuzzy number is defined as A = { a , b , c } , where a , b , c are real number and its membership function is given below
μ A ( x ) = 0 for x < a { ( x a ) ( b a ) } a x b 1 for x = b { ( c x ) ( c b ) } b < x c 0 for x > c
Definition 7.
[36] Let X be a fixed set, a triangular hesitant fuzzy set defined by A = { < x , T h A ( x ) > \ x X } , where T h A ( x ) is a set of some triangular values in a L , a M , a U .

3. Triangular Cubic Hesitant Fuzzy Number and Operational Laws

Definition 8.
Let b ˜ be the triangular cubic hesitant fuzzy number on the set of real numbers, its interval-valued triangular hesitant fuzzy set is defined as follows:
λ b ˜ ( h ) = { ( h p ) ( q p ) , ( h p + ) ( q + p + ) } ( p , q ) h < ( p + , q + ) { ( r h ) ( r q ) , ( r + h ) ( r + q + ) } ( q , r ) h < ( q + , r + ) 0 o t h e r w i s e
and its triangular hesitant fuzzy set is
Γ b ˜ ( h ) = { ( q h ) ( q p ) } p h < q { ( r h ) ( r q ) } q < h r 0 o t h e r w i s e where 0 λ b ˜ ( h ) 1 , 0 Γ b ˜ ( h ) 1 . Then the TCHFN b ˜ is given by b ˜ = [ p , q , r ] , p + , q + , r + ] , [ p , q , r ] and b ˜ is called triangular cubic hesitant fuzzy number.
Definition 9.
Let A ¨ 1 = [ p 1 ( z ) , q 1 ( z ) , r 1 ( z ) ] , [ p 1 + ( z ) , q 1 + ( z ) , r 1 + ( z ) ] , [ p 1 ( z ) , q 1 ( z ) , r 1 ( z ) ] | z Z and A ¨ 2 = [ p 2 ( z ) , q 2 ( z ) , r 2 ( z ) ] , [ p 2 + ( z ) , q 2 + ( z ) , r 2 + ( z ) ] , [ p 2 ( z ) , q 2 ( z ) , r 2 ( z ) ] | z Z are two triangular cubic hesitant fuzzy numbers (TCHFNs), some operations on triangular cubic hesitant fuzzy numbers (TCHFSs) are defined as follows:
A ¨ 1 A ¨ 2 i f f z Z , p 1 ( z ) p 2 ( z ) , q 1 ( z ) q 2 ( z ) , r 1 ( z ) r 1 ( z ) , p 1 + ( z ) p 2 + ( z ) , q 1 + ( z ) q 2 + ( z ) , r 1 + ( z ) r 1 + ( z ) and p 1 ( z ) p 2 ( z ) , q 1 ( z ) q 2 ( z ) , r 1 ( z ) r 2 ( z )
A ¨ 1 T , S A ¨ 2 = T [ p 1 ( z ) , p 2 ( z ) ] , T [ q 1 ( z ) , q 2 ( z ) ] , T [ r 1 ( z ) , r 2 ( z ) ] , T [ p 1 + ( z ) , p 2 + ( z ) ] , T [ q 1 + ( z ) , q 2 + ( z ) ] , T [ r 1 + ( z ) , r 2 + ( z ) ] , S [ p 1 ( z ) , p 2 ( z ) ] , S [ q 1 ( z ) , q 2 ( z ) ] , S [ r 1 ( z ) , r 2 ( z ) ] ,
A ¨ 1 T , S A ¨ 2 = S [ p 1 ( z ) , p 2 ( z ) ] , S [ q 1 ( z ) , q 2 ( z ) ] , S [ r 1 ( z ) , r 2 ( z ) ] , S [ p 1 + ( z ) , p 2 + ( z ) ] , S [ q 1 + ( z ) , q 2 + ( z ) ] , S [ r 1 + ( z ) , r 2 + ( z ) ] , T [ p 1 ( z ) , p 2 ( z ) ] , T [ q 1 ( z ) , q 2 ( z ) ] , T [ r 1 ( z ) , r 2 ( z ) ] .
Example 1.
Let A ¨ 1 = [ 0.4 , 0.6 , 0.8 ] , [ 0.6 , 0.8 , 0.10 ] , [ 0.5 , 0.7 , 0.9 ] and A ¨ 2 = [ 0.1 , 0.3 , 0.5 ] , [ 0.3 , 0.5 , 0.7 ] , [ 0.2 , 0.4 , 0.6 ] be two TCHFNs
(a) A ¨ 1 A ¨ 2 iff z Z , 0.4 0.1 , 0.6 0.3 , 0.8 0.5 , 0.6 0.3 , 0.8 0.5 , 0.10 0.7 and 0.5 0.2 , 0.7 0.4 , 0.9 0.6 ,
(b) A ¨ 1 T , S A ¨ 2 = T [ 0.4 , 0.1 ] , T [ 0.6 , 0.3 ] , T [ 0.8 , 0.5 ] , T [ 0.6 , 0.3 ] , T [ 0.8 , 0.5 ] , T [ 0.10 , 0.7 ] a n d S [ 0.5 , 0.2 ] , S [ 0.7 , 0.4 ] , S [ 0.9 , 0.6 ] ,
(c) A ¨ 1 T , S A ¨ 2 = S [ 0.4 , 0.1 ] , S [ 0.6 , 0.3 ] , S [ 0.8 , 0.5 ] , S [ 0.6 , 0.3 ] , S [ 0.8 , 0.5 ] , S [ 0.10 , 0.7 ] a n d T [ 0.5 , 0.2 ] , T [ 0.7 , 0.4 ] , T [ 0.9 , 0.6 ] .
where T denotes a t-norm and S a so-called t-conorm dual to the t-norm T, defined by S ( z , τ ) = 1 T ( 1 z , 1 τ ) .
Definition 10.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ + ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , | z Z be an TCHFN and then the score function S ( A ¨ ) , accuracy function H ( A ¨ ) , membership uncertainty index T ( A ¨ ) and hesitation uncertainty index G ( A ¨ ) of an TCHFN A ¨ are defined by
S ( A ¨ ) = p a , q b , r c , p + a + , q + b + , r + c + , p a , q b , r c [ [ p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] + [ p A ¨ + ( z ) + q A ¨ + ( z ) + r A ¨ + ( z ) ] ] [ p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] 9 ,
H ( A ¨ ) = p a , q b , r c , p + a + , q + b + , r + c + , p a , q b , r c [ [ p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] + [ p A ¨ + ( z ) + q A ¨ + ( z ) + r A ¨ + ( z ) ] ] + [ p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] 9 ,
T ( A ¨ ) = p a , q b , r c , p + a + , q + b + , r + c + , p a , q b , r c [ p A ¨ + ( z ) + q A ¨ + ( z ) + r A ¨ + ( z ) ] + p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] ,
G ( A ¨ ) = p a , q b , r c , p + a + , q + b + , r + c + , p a , q b , r c [ p A ¨ + ( z ) + q A ¨ + ( z ) + r A ¨ + ( z ) ] + p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] p A ¨ ( z ) + q A ¨ ( z ) + r A ¨ ( z ) ] .
Example 2.
Let A ¨ = [ 0.9 , 0.11 , 0.13 ] , [ 0.11 , 0.13 , 0.15 ] , [ 0.10 , 0.12 , 0.14 ] be a TCHFN. Then the score function S ( A ¨ ) , accuracy function H ( A ¨ ) , membership uncertainty index T ( A ¨ ) and hesitation uncertainty index G ( A ¨ ) of the TCHFN A ¨ are defined by
S ( A ¨ ) = [ 0.9 + 0.11 + 0.13 ] + [ 0.11 + 0.13 + 0.15 ] [ 0.10 0.12 0.14 ] 9 = 0.1877 ,
H ( A ¨ ) = [ 0.9 + 0.11 + 0.13 ] + [ 0.11 + 0.13 + 0.15 ] + [ 0.10 + 0.12 + 0.14 ] 9 = 0.21 ,
T ( A ¨ ) = [ 0.11 + 0.13 + 0.15 ] + [ 0.10 + 0.12 + 0.14 ] [ 0.9 0.11 0.13 ] = 0.09 ,
G ( A ¨ ) = [ 0.11 + 0.13 + 0.15 ] + [ 0.9 + 0.11 + 0.13 ] [ 0.10 0.12 0.14 ] = 1.69 .
Figure 1 represents the values of the the score function, accuracy function, membership uncertainty index and hesitation uncertainty index of the TCHFN A ¨ .

4. Some Einstein Operations on Triangular Cubic Hesitant Fuzzy Numbers

In this section, we introduce the Einstein t-norm T ( T ( z , τ ) = z τ 1 + ( 1 z ) ( 1 τ ) ) and its dual t-conorm S
( S ( z , τ ) = z + τ 1 + z τ )
then the generalized union D ) on TCHFNs A ¨ , A ¨ 1 and A ¨ 2 become to the Einstein sum (denoted by A ¨ 1 + A ¨ 2 ) on A ¨ 1 and A ¨ 2 as follows: A ¨ 1 + A ¨ 2 = p 1 a 1 , p 2 a 2 , q 1 b 1 , q 2 b 2 , r 1 c 1 , r 2 c 2 , p 1 + a 1 + , p 2 + a 2 + , q 1 + b 1 + , q 2 + b 2 + , r 1 + c 1 + , r 2 + c 2 + , p 1 ( z ) + p 2 ( z ) 1 + p 1 ( z ) p 2 ( z ) ) , p 1 + ( z ) + p 2 + ( z ) 1 + p 1 + ( z ) . p 2 + ( z ) ) , q 1 ( z ) + q 2 ( z ) 1 + q 1 ( z ) . q 2 ( z ) ) , q 1 + ( z ) + q 2 + ( z ) 1 + q 1 + ( z ) . q 2 + ( z ) ) , r 1 ( z ) + r 2 ( z ) 1 + r 1 ( z ) . r 2 ( z ) ) , r 1 + ( z ) + r 2 + ( z ) 1 + r 1 + ( z ) . r 2 + ( z ) ) , p 1 a 1 , p 2 a 2 , q 1 b 1 , q 2 b 2 , r 1 c 1 , r 2 c 2 p 1 p 2 ( 1 + ( 1 p 1 ( z ) ) 1 p 2 ( z ) ) , q 1 q 2 ( 1 + 1 q 1 ( z ) 1 q 2 ( z ) ) , r 1 r 2 ( 1 + 1 r 1 ( z ) 1 r 2 ( z ) )
By mathematical induction we can derive the multiplication operation on TCHFNs as follows: λ A ¨ = p a , q b , r c , p + a + , q + b + , r + c + [ 1 + p A ¨ ( z ) ] λ [ 1 p A ¨ ( z ) ] λ [ 1 + p A ¨ ( z ) ] λ + [ 1 p A ¨ ( z ) ] λ , [ 1 + p A ¨ + ( z ) ] λ [ 1 p A ¨ + ( z ) ] λ [ 1 + p A ¨ + ( z ) ] λ + [ 1 p A ¨ + ( z ) ] λ , [ 1 + q A ¨ ( z ) ] λ [ 1 q A ¨ ( z ) ] λ [ 1 + q A ¨ ( z ) ] λ + [ 1 q A ¨ ( z ) ] λ , [ 1 + q A ¨ + ( z ) ] λ [ 1 q A ¨ + ( z ) ] λ [ 1 + q A ¨ + ( z ) ] λ + [ 1 q A ¨ + ( z ) ] λ , [ 1 + r A ¨ ( z ) ] λ [ 1 r A ¨ ( z ) ] λ [ 1 + r A ¨ ( z ) ] λ + [ 1 r A ¨ ( z ) ] λ , [ 1 + r A ¨ + ( z ) ] λ [ 1 r A ¨ + ( z ) ] λ [ 1 + r A ¨ + ( z ) ] λ + [ 1 r A ¨ + ( z ) ] λ , p a , q b , r c 2 [ p A ¨ ( z ) ] λ [ ( 2 p A ¨ ( z ) ] λ + [ p A ¨ ( z ) ] λ , 2 [ q A ¨ ( z ) ] λ [ ( 2 q A ¨ ( z ) ] λ + [ q A ¨ ( z ) ] λ , 2 [ r A ¨ ( z ) ] λ [ ( 2 r A ¨ ( z ) ] λ + [ r A ¨ ( z ) ] λ .
Definition 11.
Let A ¨ = [ a ( z ) , b ( z ) , c ( z ) ] , a + ( z ) , b + ( z ) , c + ( z ) ] , [ a ( z ) , b ( z ) , c ( z ) ] | z Z , A ¨ 1 = [ a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] , [ a 1 + ( z ) , b 1 + ( z ) , c 1 + ( z ) ] , [ a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] | z Z and A ¨ 2 = [ a 2 ( z ) , b 2 ( z ) , c 2 ( z ) ] , [ a 2 + ( z ) , b 2 + ( z ) , c 2 + ( z ) ] , [ a 2 ( z ) , b 2 + ( z ) , c 2 + ( z ) ] , | z Z be any three TCHFNs. Then some Einstein operations of A ¨ 1 and A ¨ 2 can be defined as:
A ¨ 1 + A ¨ 2 = p 1 a 1 , p 2 a 2 , q 1 b 1 , q 2 b 2 , r 1 c 1 , r 2 c 2 , p 1 + a 1 + , p 2 + a 2 + , q 1 + b 1 + , q 2 + b 2 + , r 1 + c 1 + , r 2 + c 2 + , p 1 ( z ) + p 2 ( z ) 1 + p 1 ( z ) . p 2 ( z ) ) , p 1 + ( z ) + p 2 + ( z ) 1 + p 1 + ( z ) . p 2 + ( z ) ) , q 1 ( z ) + q 2 ( z ) 1 + q 1 ( z ) . q 2 ( z ) ) , q 1 + ( z ) + q 2 + ( z ) 1 + q 1 + ( z ) . q 2 + ( z ) ) , r 1 ( z ) + r 2 ( z ) 1 + r 1 ( z ) . r 2 ( z ) ) , r 1 + ( z ) + r 2 + ( z ) 1 + r 1 + ( z ) . r 2 + ( z ) ) , p 1 a 1 , p 2 a 2 , q 1 b 1 , q 2 b 2 , r 1 c 1 , r 2 c 2 p 1 p 2 ( 1 + 1 p 1 ( z ) 1 p 2 ( z ) ) , q 1 q 2 ( 1 + 1 q 1 ( z ) 1 q 2 ( z ) ) , r 1 r 2 ( 1 + ( 1 r 1 ( z ) 1 r 2 ( z ) ) ,
λ A ¨ = p a , q b , r c , p + a + , q + b + , r + c + [ 1 + p A ¨ ( z ) ] λ [ 1 p A ¨ ( z ) ] λ [ 1 + p A ¨ ( z ) ] λ + [ 1 p A ¨ ( z ) ] λ , [ 1 + p A ¨ + ( z ) ] λ [ 1 p A ¨ + ( z ) ] λ [ 1 + p A ¨ + ( z ) ] λ + [ 1 p A ¨ + ( z ) ] λ , [ 1 + q A ¨ ( z ) ] λ [ 1 q A ¨ ( z ) ] λ [ 1 + q A ¨ ( z ) ] λ + [ 1 q A ¨ ( z ) ] λ , [ 1 + q A ¨ + ( z ) ] λ [ 1 q A ¨ + ( z ) ] λ [ 1 + q A ¨ + ( z ) ] λ + [ 1 q A ¨ + ( z ) ] λ , [ 1 + r A ¨ ( z ) ] λ [ 1 r A ¨ ( z ) ] λ [ 1 + r A ¨ ( z ) ] λ + [ 1 r A ¨ ( z ) ] λ , [ 1 + r A ¨ + ( z ) ] λ [ 1 r A ¨ + ( z ) ] λ [ 1 + r A ¨ + ( z ) ] λ + [ 1 r A ¨ + ( z ) ] λ , p a , q b , r c 2 [ p A ¨ ( z ) ] λ [ ( 2 p A ¨ ( z ) ] λ + [ p A ¨ ( z ) ] λ , 2 [ q A ¨ ( z ) ] λ [ ( 2 q A ¨ ( z ) ] λ + [ q A ¨ ( z ) ] λ , 2 [ r A ¨ ( z ) ] λ [ ( 2 r A ¨ ( z ) ] λ + [ r A ¨ ( z ) ] λ .
Example 3.
Let A ¨ = [ 0.16 , 0.18 , 0.20 ] , [ 0.18 , 0.20 , 0.22 ] , [ 0.17 , 0.19 , 0.21 ] , A ¨ 1 = [ 0.2 , 0.4 , 0.6 ] , [ 0.4 , 0.6 , 0.8 ] , [ 0.3 , 0.5 , 0.7 ] and A ¨ 2 = [ 0.13 , 0.15 , 0.17 ] , [ 0.15 , 0.17 , 0.19 ] , [ 0.14 , 0.16 , 0.18 ] , be any three TCHFNs. Then some Einstein operations of A ¨ 1 and A ¨ 2 can be defined as follows: A ¨ 1 + A ¨ 2 = 0.2 + 0.13 ( 1 + ( 0.2 ) ( 0.13 ) ) , 0.4 + 0.15 ( 1 + ( 0.4 ) ( 0.15 ) ) , 0.4 + 0.15 ( 1 + ( 0.4 ) ( 0.15 ) ) , 0.6 + 0.17 ( 1 + ( 0.6 ) ( 0.17 ) ) , 0.6 + 0.17 ( 1 + ( 0.6 ) ( 0.17 ) , 0.8 + 0.19 ( 1 + ( 0.8 ) ( 0.19 ) ) , 0.3 0.14 ( 1 + ( 1 0.3 ( 1 0.14 ) ) , 0.5 0.16 1 + ( 1 0.5 1 0.16 ) , 0.7 0.18 ( 1 + ( 1 0.7 ( 1 0.18 ) ) = [ 0.3216 , 0.5188 , 0.6987 ] , [ 0.5188 , 0.6987 , 0.8593 ] , [ 0.0262 , 0.0563 , 0.1011 ] , λ A ¨ = [ 1 + 0.16 ] 0.25 [ 1 0.16 ] 0.25 [ 1 + 0.16 ] 0.25 + [ 1 0.16 ] 0.25 , [ 1 + 0.18 ] 0.50 [ 1 0.18 ] 0.50 [ 1 + 0.18 ] 0.50 + [ 1 0.18 ] 0.50 , [ 1 + 0.20 ] 0.25 [ 1 0.20 ] 0.25 [ 1 + 0.20 ] 0.25 + [ 1 0.20 ] 0.25 , [ 1 + 0.18 ] 0.25 [ 1 0.18 ] 0.25 [ 1 + 0.18 ] 0.25 + [ 1 0.18 ] 0.25 , [ 1 + 0.20 ] 0.50 [ 1 0.20 ] 0.50 [ 1 + 0.20 ] 0.50 + [ 1 0.20 ] 0.50 , [ 1 + 0.22 ] 0.25 [ 1 0.22 ] 0.25 [ 1 + 0.22 ] 0.25 + [ 1 0.22 ] 0.25 , 2 [ 0.17 ] 0.25 [ ( 2 0.17 ] 0.25 + [ 0.17 ] 0.25 , 2 [ 0.19 ] 0.50 [ ( 2 0.19 ] 0.50 + [ 0.19 ] 0.50 , 2 [ 0.21 ] 0.25 [ ( 2 0.21 ] 0.25 + [ 0.21 ] 0.25 = [ 0.0402 , 0.0907 , 0.0505 ] , [ 0.0907 , 0.0505 , 0.0558 ] , [ 0.6776 , 0.4893 , 0.7383 ] .
Proposition 1.
Lat A ¨ , A ¨ 1 and A ¨ 2 be three TCHFNs, λ , λ 1 , λ 2 > 0 , then we have:
(1)
A ¨ 1 + A ¨ 2 = A ¨ 2 + A ¨ 1 ,
(2)
λ ( A ¨ 1 + A ¨ 2 ) = λ A ¨ 2 + λ A ¨ 1 ,
(3)
λ 1 A ¨ + λ 2 A ¨ = ( λ 1 + λ 2 ) A ¨ .
Proof. 
(1) A 1 + A 2 = A 2 + A 1 ;
A 1 + A 2 = p 1 a 1 , p 2 a 2 , q 1 b 1 , q 2 b 2 , r 1 c 1 , r 2 c 2 [ p 1 ( h ) + p 2 ( h ) ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) , q 1 ( h ) + q 2 ( h ) ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) , r 1 ( h ) + r 2 ( h ) ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] , p 1 + a 1 + , p 2 + a 2 + , q 1 + b 1 + , q 2 + b 2 + , r 1 + c 1 + , r 2 + c 2 + , [ p 1 + ( h ) + p 2 + ( h ) ( 1 + p 1 + ( h ) ) ( 1 p 2 + ( h ) ) , q 1 + ( h ) + q 2 + ( h ) ( 1 + q 1 + ( h ) ) ( 1 q 2 + ( h ) ) , r 1 + ( h ) + r 1 + ( h ) ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] , p 1 a 1 , p 2 a 2 , q 1 b 1 , q 2 b 2 , r 1 c 1 , r 2 c 2 p 1 ( h ) p 2 ( h ) 1 + ( 1 p 1 ( h ) 1 p 2 ( h ) ) , q 1 ( h ) q 2 ( h ) 1 + ( 1 q 1 ( h ) 1 q 2 ( h ) ) , r 1 ( h ) r 2 ( h ) 1 + ( 1 r 1 ( h ) 1 r 2 ( h ) ) ] = p 2 a 2 , p 1 a 1 , q 2 b 2 , q 1 b 1 , r 2 c 2 , r 1 c 1 , [ p 2 ( h ) + p 1 ( h ) ( 1 + p 2 ( h ) ) ( 1 p 1 ( h ) ) , q 2 ( h ) + q 1 ( h ) ( 1 + q 2 ( h ) ) ( 1 q 1 ( h ) ) , r 2 ( h ) + r 1 ( h ) ( 1 + r 2 ( h ) ) ( 1 r 1 ( h ) ) ] , p 2 + a 2 + , p 1 + a 1 + , q 2 + b 2 + , q 1 + b 1 + , r 2 + c 2 + , r 1 + c 1 + , [ p 2 + ( h ) + p 1 + ( h ) ( 1 + p 2 + ( h ) ) ( 1 p 1 + ( h ) ) , q 2 + ( h ) + q 1 + ( h ) ( 1 + q 2 + ( h ) ) ( 1 q 1 + ( h ) ) , r 2 + ( h ) + r 1 + ( h ) ( 1 + r 2 + ( h ) ) ( 1 r 1 + ( h ) ) ] , p 2 a 2 , p 1 a 1 , q 2 b 2 , q 1 b 1 , r 2 c 2 , r 1 c 1 [ p 2 ( h ) p 1 ( h ) 1 + ( 1 p 2 ( h ) 1 p 1 ( h ) ) , q 2 ( h ) q 1 ( h ) 1 + ( 1 q 2 ( h ) 1 q 1 ( h ) ) , r 2 ( h ) . r 1 ( h ) 1 + ( 1 r 2 ( h ) 1 r 1 ( h ) ) ] = A 2 + A 1
Hence A 1 + A 2 = A 2 + A 1 .
(2) λ ( A 1 + A 2 ) = λ A 2 + λ A 1
λ ( A 1 + A 2 ) = p 2 a 2 , p 1 a 1 , q 2 b 2 , q 1 b 1 , r 2 c 2 , r 1 c 1 [ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ , [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ , [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ ] , p 2 + a 2 + , p 1 + a 1 + , q 2 + b 2 + , q 1 + b 1 + , r 2 + c 2 + , r 1 + c 1 + [ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ [ ( 1 + u p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ , [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ , [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ ] , p 2 a 2 , p 1 a 1 , q 2 b 2 , q 1 b 1 , r 2 c 2 , r 1 c 1 [ 2 [ p 1 ( h ) p 2 ( h ) ] λ [ ( 4 2 p 1 ( h ) 2 p 2 ( h ) p 1 ( h ) p 2 ( h ) ] λ + [ p 1 ( h ) p 2 ( h ) ] λ , 2 [ q 1 ( h ) q 2 ( h ) ] λ [ ( 4 2 q 1 ( h ) 2 q 2 ( h ) q 1 ( h ) q 2 ( h ) ] λ + [ q 1 ( h ) q 2 ( h ) ] λ , 2 [ r 1 ( h ) r 2 ( h ) ] λ [ ( 4 2 r 1 ( h ) 2 r 2 ( h ) r 1 ( h ) r 2 ( h ) ] λ + [ r 1 ( h ) r 2 ( h ) ] λ ] and we have λ A 1 = p 1 a 1 , q 1 b 1 , r 1 c 1 [ [ ( 1 + p 1 ( h ) ) λ ( 1 p 1 ( h ) ) λ ] [ ( 1 + p 1 ( h ) ) λ + ( 1 p 1 ( h ) ) λ ] , [ ( 1 + q 1 ( h ) ) λ ( 1 q 1 ( h ) ) λ ] [ ( 1 + q 1 ( h ) ) λ + ( 1 q 1 ( h ) ) λ ] , [ ( 1 + r 1 ( h ) ) λ ( 1 r 1 ( h ) ) λ ] [ ( 1 + r 1 ( h ) ) λ + ( 1 r 1 ( h ) ) λ ] ] , p 1 + a 1 + , q 1 + b 1 + , r 1 + c 1 + [ [ ( 1 + p 1 + ( h ) ) λ ( 1 p 1 + ( h ) ) λ ] [ ( 1 + p 1 + ( h ) ) λ + ( 1 p 1 + ( h ) ) λ ] , [ ( 1 + q 1 + ( h ) ) λ ( 1 q 1 + ( h ) ) λ ] [ ( 1 + q 1 + ( h ) ) λ + ( 1 q 1 + ( h ) ) λ ] , [ ( 1 + r 1 + ( h ) ) λ ( 1 r 1 + ( h ) ) λ ] [ ( 1 + r 1 + ( h ) ) λ + ( 1 r 1 + ( h ) ) λ ] ] , p 1 a 1 , q 1 b 1 , r 1 c 1 [ 2 p 1 λ ( h ) [ ( 2 p 1 ( h ) ] λ + [ p 1 ( h ) ] λ , 2 q 1 λ ( h ) [ ( 2 q 1 ( h ) ] λ + [ q 1 ( h ) ] λ , 2 r 1 λ ( h ) [ ( 2 r 1 ( h ) ] λ + [ r 1 ( h ) ] λ ]
λ A 2 = p 2 a 2 , q 2 b 2 , r 2 c 2 , [ [ ( 1 + p 2 ( h ) ) λ ( 1 p 2 ( h ) ) λ ] [ ( 1 + p 2 ( h ) ) λ + ( 1 p 2 ( h ) ) λ ] , [ ( 1 + q 2 ( h ) ) λ ( 1 q 2 ( h ) ) λ ] [ ( 1 + q 2 ( h ) ) λ + ( 1 q 2 ( h ) ) λ ] , [ ( 1 + r 2 ( h ) ) λ ( 1 r 2 ( h ) ) λ ] [ ( 1 + r 2 ( h ) ) λ + ( 1 r 2 ( h ) ) λ ] ] , p 2 + a 2 + , q 2 + b 2 + , r 2 + c 2 + , [ [ ( 1 + p 2 + ( h ) ) λ ( 1 p 2 + ( h ) ) λ ] [ ( 1 + p 2 + ( h ) ) λ + ( 1 p 2 + ( h ) ) λ ] , [ ( 1 + q 2 + ( h ) ) λ ( 1 q 2 + ( h ) ) λ ] [ ( 1 + q 2 + ( h ) ) λ + ( 1 q 2 + ( h ) ) λ ] , [ ( 1 + r 2 + ( h ) ) λ ( 1 r 2 + ( h ) ) λ ] [ ( 1 + r 2 + ( h ) ) λ + ( 1 r 2 + ( h ) ) λ ] ] , p 2 a 2 , q 2 b 2 , r 2 c 2 [ 2 p 2 λ ( h ) [ ( 2 p 2 ( h ) ] λ + [ p 2 ( h ) ] λ , 2 q 2 λ ( h ) [ ( 2 q 2 ( h ) ] λ + [ q 2 ( h ) ] λ , 2 r 2 λ ( h ) [ ( 2 r 2 ( h ) ] λ + [ r 2 ( h ) ] λ ]
λ A 2 + λ A 1 = p 2 a 2 , p 1 a 1 , q 2 b 2 , q 1 b 1 , r 2 c 2 , r 1 c 1 [ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ , [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ , [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ ] , p 2 + a 2 + , p 1 + a 1 + , q 2 + b 2 + , q 1 + b 1 + , r 2 + c 2 + , r 1 + c 1 + [ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ , [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ , [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ ] , p 2 a 2 , p 1 a 1 , q 2 b 2 , q 1 b 1 , r 2 c 2 , r 1 c 1 [ 2 [ p 2 ( h ) p 1 ( h ) ] λ [ ( 4 2 p 2 ( h ) 2 p 1 ( h ) p 2 ( h ) p 1 ( h ) ] λ + [ p 2 ( h ) p 1 ( h ) ] λ , 2 [ q 2 ( h ) q 1 ( h ) ] λ [ ( 4 2 q 2 ( h ) 2 q 1 ( h ) q 2 ( h ) q 1 ( h ) ] λ + [ q 2 ( h ) q 1 ( h ) ] λ , 2 [ r 2 ( h ) r 1 ( h ) ] λ [ ( 4 2 r 2 ( h ) 2 r 1 ( h ) r 2 ( h ) r 1 ( h ) ] λ + [ r 2 ( h ) r 1 ( h ) ] λ ] so, we have λ ( A 1 + A 2 ) = λ A 2 + λ A 1 .
(3) λ 1 A + λ 2 A = ( λ 1 + λ 2 ) A
λ 1 A = p a , q b , r c [ [ 1 + p A ( h ) ] λ 1 [ 1 p A ( h ) ] λ 1 [ 1 + p A ( h ) ] λ 1 + [ 1 p A ( h ) ] λ 1 , [ 1 + q A ( h ) ] λ 1 [ 1 q A ( h ) ] λ 1 [ 1 + q A ( h ) ] λ 1 + [ 1 q A ( h ) ] λ 1 , [ 1 + r A ( h ) ] λ 1 [ 1 r A ( h ) ] λ 1 [ 1 + r A ( h ) ] λ 1 + [ 1 r A ( h ) ] λ 1 ] , p + a + , q + b + , r + c + [ [ 1 + p A + ( h ) ] λ 1 [ 1 p A + ( h ) ] λ 1 [ 1 + p A + ( h ) ] λ 1 + [ 1 p A + ( h ) ] λ 1 , [ 1 + q A + ( h ) ] λ 1 [ 1 q A + ( h ) ] λ 1 [ 1 + q A + ( h ) ] λ 1 + [ 1 q A + ( h ) ] λ 1 , [ 1 + r A + ( h ) ] λ 1 [ 1 r A + ( h ) ] λ 1 [ 1 + r A + ( h ) ] λ 1 + [ 1 r A + ( h ) ] λ 1 ] , p a , q b , r c 2 [ p A ( h ) ] λ 1 [ ( 2 p A ( h ) ] λ 1 + [ p A ( h ) ] λ 1 , 2 [ q A ( h ) ] λ 1 [ ( 2 q A ( h ) ] λ 1 + [ q A ( h ) ] λ 1 , 2 [ r A ( h ) ] λ 1 [ ( 2 r A ( h ) ] λ 1 + [ r A ( h ) ] λ 1 ] and λ 2 A = p a , q b , r c [ [ 1 + p A ( h ) ] λ 2 [ 1 p A ( h ) ] λ 2 [ 1 + p A ( h ) ] λ 2 + [ 1 p A ( h ) ] λ 2 , [ 1 + q A ( h ) ] λ 2 [ 1 q A ( h ) ] λ 2 [ 1 + q A ( h ) ] λ 2 + [ 1 q A ( h ) ] λ 2 , [ 1 + r A ( h ) ] λ 2 [ 1 r A ( h ) ] λ 2 [ 1 + r A ( h ) ] λ 2 + [ 1 r A ( h ) ] λ 2 ] , p + a + , q + b + , r + c + [ [ 1 + p A + ( h ) ] λ 2 [ 1 p A + ( h ) ] λ 2 [ 1 + p A + ( h ) ] λ 2 + [ 1 p A + ( h ) ] λ 2 , [ 1 + q A + ( h ) ] λ 2 [ 1 q A + ( h ) ] λ 2 [ 1 + q A + ( h ) ] λ 2 + [ 1 q A + ( h ) ] λ 2 , [ 1 + r A + ( h ) ] λ 2 [ 1 r A + ( h ) ] λ 2 [ 1 + r A + ( h ) ] λ 2 + [ 1 r A + ( h ) ] λ 2 ] , p a , q b , r c [ 2 [ p A ( h ) ] λ 2 [ ( 2 p A ( h ) ] λ 2 + [ p A ( h ) ] λ 2 , 2 [ q A ( h ) ] λ 2 [ ( 2 q A ( h ) ] λ 2 + [ q A ( h ) ] λ 2 , 2 [ r A ( h ) ] λ 2 [ ( 2 r A ( h ) ] λ 2 + [ r A ( h ) ] λ 2 ]
= p a , q b , r c [ [ 1 + p A ( h ) ] λ 1 + λ 2 [ 1 p A ( h ) ] λ 1 + λ 2 [ 1 + p A ( h ) ] λ 1 + λ 2 + [ 1 p A ( h ) ] λ 1 + λ 2 , [ 1 + q A ( h ) ] λ 1 + λ 2 [ 1 q A ( h ) ] λ 1 + λ 2 [ 1 + q A ( h ) ] λ 1 + λ 2 + [ 1 q A ( h ) ] λ 1 + λ 2 , [ 1 + r A ( h ) ] λ 1 + λ 2 [ 1 r A ( h ) ] λ 1 + λ 2 [ 1 + r A ( h ) ] λ 1 + λ 2 + [ 1 r A ( h ) ] λ 1 + λ 2 ] , p + a + , q + b + , r + c + [ [ 1 + p A + ( h ) ] λ 1 + λ 2 [ 1 p A + ( h ) ] λ 1 + λ 2 [ 1 + p A + ( h ) ] λ 1 + λ 2 + [ 1 p A + ( h ) ] λ 1 + λ 2 , [ 1 + q A + ( h ) ] λ 1 + λ 2 [ 1 q A + ( h ) ] λ 1 + λ 2 [ 1 + q A + ( h ) ] λ 1 + λ 2 + [ 1 q A + ( h ) ] λ 1 + λ 2 , [ 1 + r A + ( h ) ] λ 1 + λ 2 [ 1 r A + ( h ) ] λ 1 + λ 2 [ 1 + r A + ( h ) ] λ 1 + λ 2 + [ 1 r A + ( h ) ] λ 1 + λ 2 ] , p a , q b , r c 2 [ p A ( h ) ] λ 1 + λ 2 [ ( 2 p A ( h ) ] λ 1 + λ 2 + [ p A ( h ) ] λ 1 + λ 2 , 2 [ q A ( h ) ] λ 1 + λ 2 [ ( 2 q A ( h ) ] λ 1 + λ 2 + [ q A ( h ) ] λ 1 + λ 2 , 2 [ r A ( h ) ] λ 1 + λ 2 [ ( 2 r A ( h ) ] λ 1 + λ 2 + [ r A ( h ) ] λ 1 + λ 2 ] = ( λ 1 + λ 2 ) A .  □
Remark 1.
If α 1 L TCHFN α 2 , then α 1 α 2 , that is the total order contains the usual partial order on L TCHFN .

5. Triangular Cubic Hesitant Fuzzy Arithmetic Averaging Operators Based on Einstein Operations

Definition 12.
An aggregation function f : [ 0 , 1 ] n [ 0 , 1 ] is a function non-decreasing in each argument, that is A ¨ j B ¨ j for all j { 1 , 2 , , n } implies f ( A ¨ 1 , A ¨ 2 , , A ¨ n ) f ( B ¨ 1 , B ¨ 2 , , B ¨ n ) and satisfying f ( 0 , 0 , , 0 ) = 0 and f ( 1 , 1 , , 1 ) = 1 .
Definition 13.
f L TCHFN : L TCHFN n L TCHFN is an aggregation function if it is monotone with respect to L TCHFN and satisfies f L TCHFN ( 0 L TCHFN , , 0 L TCHFN ) = 0 L TCHFN and f L TCHFN ( 1 L TCHFN , , 1 L TCHFN ) = 1 L TCHFN .

5.1. Triangular Cubic Hesitant Fuzzy Einstein Weighted Averaging Operator

Definition 14.
Let A ¨ = [ a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] , a 1 + ( z ) , b 1 + ( z ) , c 1 + ( z ) ] , a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] | z Z be a collection of TCHFNs in L TCHFN and ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then triangular cubic hesitant fuzzy Einstein weighted averaging operator of dimension n is a mapping TCHFEWA: L TCHFN n L TCHFN and defined by
T C H F E W A ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = ω ¨ 1 A ¨ 1 + ω ¨ 2 A ¨ 2 , , ω ¨ n A ¨ n .
If ω ¨ = ( 1 n , 1 n , , 1 n ) T . Then the TCHFEWA operator is reduced to triangular cubic fuzzy Einstein averaging operator of dimension n. Which is defined as follows:
T C H F E A ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = 1 n ( A ¨ 1 , A ¨ 2 , , A ¨ n ) .
Theorem 1.
Let A ¨ = [ a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] , a 1 + ( z ) , b 1 + ( z ) , c 1 + ( z ) ] , a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] | z Z be a collection of TCHFNs in L TCHFN . Then their aggregated value by using the TCHFEWA operator is also a TCHFN and TCHFEWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = p a , q b , r c j = 1 n [ 1 + p 1 ( z ) ] ω ¨ j = 1 n [ 1 p 1 ( z ) ] ω ¨ j = 1 n [ 1 + p 1 ( z ) ] ω ¨ + j = 1 n [ 1 p 1 ( z ) ] ω ¨ , j = 1 n [ 1 + q 1 ( z ) ] ω ¨ j = 1 n [ 1 q 1 ( z ) ] ω ¨ j = 1 n [ 1 + q 1 ( z ) ] ω ¨ + j = 1 n [ 1 q 1 ( z ) ] ω ¨ , j = 1 n [ 1 + r 1 ( z ) ] ω ¨ j = 1 n [ 1 r 1 ( z ) ] ω ¨ j = 1 n [ 1 + r 1 ( z ) ] ω ¨ + j = 1 n [ 1 r 1 ( z ) ] ω ¨ , p + a + , q + b + , r + c + j = 1 n [ 1 + p 1 + ( z ) ] ω ¨ j = 1 n [ 1 p 1 + ( z ) ] ω ¨ j = 1 n [ 1 + p 1 + ( z ) ] ω ¨ + j = 1 n [ 1 p 1 + ( z ) ] ω ¨ , j = 1 n [ 1 + q 1 + ( z ) ] ω ¨ j = 1 n [ 1 q 1 + ( z ) ] ω ¨ j = 1 n [ 1 + q 1 + ( z ) ] ω ¨ + j = 1 n [ 1 q 1 + ( z ) ] ω ¨ , j = 1 n [ 1 + r 1 + ( z ) ] ω ¨ j = 1 n [ 1 r 1 + ( z ) ] ω ¨ j = 1 n [ 1 + r 1 + ( z ) ] ω ¨ + j = 1 n [ 1 r 1 + ( z ) ] ω ¨ , p a , q b , r c 2 j = 1 n [ p 1 ( z ) ] ω ¨ j = 1 n [ ( 2 p 1 ( z ) ] ω ¨ + j = 1 n [ p 1 ( z ) ] ω ¨ , 2 j = 1 n [ q q ( z ) ] ω ¨ j = 1 n [ ( 2 q q ( z ) ] ω ¨ + j = 1 n [ q 1 ( z ) ] ω ¨ , 2 j = 1 n [ r 1 ( z ) ] ω ¨ j = 1 n [ ( 2 r 1 ( z ) ] ω ¨ + j = 1 n [ r 1 ( z ) ] ω ¨ . where ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 .
Proof. 
Assume that n = 1 , TCHFEWA ( A 1 , A 2 , , A n ) = j = 1 k w 1 A 1
( λ ( A 1 + A 2 ) = λ A 2 + λ A 1
λ ( A 1 + A 2 ) = p a , q b , r c [ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ , [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ , [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ ] , p + a + , q + b + , r + c + [ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ , [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ , [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ ] , p a , q b , r c [ 2 [ p 1 ( h ) p 2 ( h ) ] λ [ ( 4 2 p 1 ( h ) 2 p 2 ( h ) p 1 ( h ) p 2 ( h ) ] λ + [ p 1 ( h ) p 2 ( h ) ] λ , 2 [ q 1 ( h ) q 2 ( h ) ] λ [ ( 4 2 q 1 ( h ) 2 q 2 ( h ) q 1 ( h ) q 2 ( h ) ] λ + [ q 1 ( h ) q 2 ( h ) ] λ , 2 [ r 1 ( h ) r 2 ( h ) ] λ [ ( 4 2 r 1 ( h ) 2 r 2 ( h ) r 1 ( h ) r 2 ( h ) ] λ + [ r 1 ( h ) r 2 ( h ) ] λ ] and we have λ A 1 = p a , q b , r c [ [ ( 1 + p 1 ( h ) ) λ ( 1 p 1 ( h ) ) λ ] [ ( 1 + p 1 ( h ) ) λ + ( 1 p 1 ( h ) ) λ ] , [ ( 1 + q 1 ( h ) ) λ ( 1 q 1 ( h ) ) λ ] [ ( 1 + q 1 ( h ) ) λ + ( 1 q 1 ( h ) ) λ ] , [ ( 1 + r 1 ( h ) ) λ ( 1 r 1 ( h ) ) λ ] [ ( 1 + r 1 ( h ) ) λ + ( 1 r 1 ( h ) ) λ ] ] p + a + , q + b + , r + c + [ [ ( 1 + p 1 + ( h ) ) λ ( 1 p 1 + ( h ) ) λ ] [ ( 1 + p 1 + ( h ) ) λ + ( 1 p 1 + ( h ) ) λ ] , [ ( 1 + q 1 + ( h ) ) λ ( 1 q 1 + ( h ) ) λ ] [ ( 1 + q 1 + ( h ) ) λ + ( 1 q 1 + ( h ) ) λ ] , [ ( 1 + r 1 + ( h ) ) λ ( 1 r 1 + ( h ) ) λ ] [ ( 1 + r 1 + ( h ) ) λ + ( 1 r 1 + ( h ) ) λ ] ] , p a , q b , r c [ 2 p 1 λ ( h ) [ ( 2 p 1 ( h ) ] λ + [ p 1 ( h ) ] λ , 2 q 1 λ ( h ) [ ( 2 q 1 ( h ) ] λ + [ q 1 ( h ) ] λ , 2 r 1 λ ( h ) [ ( 2 r 1 ( h ) ] λ + [ r 1 ( h ) ] λ ]
λ A 2 = p a , q b , r c [ [ ( 1 + p 2 ( h ) ) λ ( 1 p 2 ( h ) ) λ ] [ ( 1 + p 2 ( h ) ) λ + ( 1 p 2 ( h ) ) λ ] , [ ( 1 + q 2 ( h ) ) λ ( 1 q 2 ( h ) ) λ ] [ ( 1 + q 2 ( h ) ) λ + ( 1 q 2 ( h ) ) λ ] , [ ( 1 + r 2 ( h ) ) λ ( 1 r 2 ( h ) ) λ ] [ ( 1 + r 2 ( h ) ) λ + ( 1 r 2 ( h ) ) λ ] ] p + a + , q + b + , r + c + [ [ ( 1 + p 2 + ( h ) ) λ ( 1 p 2 + ( h ) ) λ ] [ ( 1 + p 2 + ( h ) ) λ + ( 1 p 2 + ( h ) ) λ ] , [ ( 1 + q 2 + ( h ) ) λ ( 1 q 2 + ( h ) ) λ ] [ ( 1 + q 2 + ( h ) ) λ + ( 1 q 2 + ( h ) ) λ ] , [ ( 1 + r 2 + ( h ) ) λ ( 1 r 2 + ( h ) ) λ ] [ ( 1 + r 2 + ( h ) ) λ + ( 1 r 2 + ( h ) ) λ ] ] , p a , q b , r c [ 2 p 2 λ ( h ) [ ( 2 p 2 ( h ) ] λ + [ p 2 ( h ) ] λ , 2 q 2 λ ( h ) [ ( 2 q 2 ( h ) ] λ + [ q 2 ( h ) ] λ , 2 r 2 λ ( h ) [ ( 2 r 2 ( h ) ] λ + [ r 2 ( h ) ] λ ]
λ A 2 + λ A 1 = p a , q b , r c [ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ [ ( 1 + p 2 ( h ) ) ( 1 p 2 ( h ) ) ] λ [ ( 1 + p 1 ( h ) ) ( 1 p 1 ( h ) ) ] λ , [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ [ ( 1 + q 2 ( h ) ) ( 1 q 2 ( h ) ) ] λ [ ( 1 + q 1 ( h ) ) ( 1 q 1 ( h ) ) ] λ , [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ [ ( 1 + r 2 ( h ) ) ( 1 r 2 ( h ) ) ] λ [ ( 1 + r 1 ( h ) ) ( 1 r 1 ( h ) ) ] λ ] , p + a + , q + b + , r + c + [ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ [ ( 1 + p 2 + ( h ) ) ( 1 p 2 + ( h ) ) ] λ [ ( 1 + p 1 + ( h ) ) ( 1 p 1 + ( h ) ) ] λ , [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ [ ( 1 + q 2 + ( h ) ) ( 1 q 2 + ( h ) ) ] λ [ ( 1 + q 1 + ( h ) ) ( 1 q 1 + ( h ) ) ] λ , [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ [ ( 1 + r 2 + ( h ) ) ( 1 r 2 + ( h ) ) ] λ [ ( 1 + r 1 + ( h ) ) ( 1 r 1 + ( h ) ) ] λ ] , p a , q b , r c [ 2 [ p 2 ( h ) p 1 ( h ) ] λ [ ( 4 2 p 2 ( h ) 2 p 1 ( h ) p 2 ( h ) p 1 ( h ) ] λ + [ p 2 ( h ) p 1 ( h ) ] λ , 2 [ q 2 ( h ) q 1 ( h ) ] λ [ ( 4 2 q 2 ( h ) 2 q 1 ( h ) q 2 ( h ) q 1 ( h ) ] λ + [ q 2 ( h ) q 1 ( h ) ] λ , 2 [ r 2 ( h ) r 1 ( h ) ] λ [ ( 4 2 r 2 ( h ) 2 r 1 ( h ) r 2 ( h ) r 1 ( h ) ] λ + [ s 2 ( h ) s 1 ( h ) ] λ ] so, we have λ ( A 1 + A 2 ) = λ A 2 + λ A 1 .
λ 1 A + λ 2 A = ( λ 1 + λ 2 ) A
λ 1 A = p a , q b , r c [ [ 1 + p A ( h ) ] λ 1 [ 1 p A ( h ) ] λ 1 [ 1 + p A ( h ) ] λ 1 + [ 1 p A ( h ) ] λ 1 , [ 1 + q A ( h ) ] λ 1 [ 1 q A ( h ) ] λ 1 [ 1 + q A ( h ) ] λ 1 + [ 1 q A ( h ) ] λ 1 , [ 1 + r A ( h ) ] λ 1 [ 1 r A ( h ) ] λ 1 [ 1 + r A ( h ) ] λ 1 + [ 1 r A ( h ) ] λ 1 ] p + a + , q + b + , r + c [ [ 1 + p A + ( h ) ] λ 1 [ 1 p A + ( h ) ] λ 1 [ 1 + p A + ( h ) ] λ 1 + [ 1 p A + ( h ) ] λ 1 , [ 1 + q A + ( h ) ] λ 1 [ 1 q A + ( h ) ] λ 1 [ 1 + q A + ( h ) ] λ 1 + [ 1 q A + ( h ) ] λ 1 , [ 1 + r A + ( h ) ] λ 1 [ 1 r A + ( h ) ] λ 1 [ 1 + r A + ( h ) ] λ 1 + [ 1 r A + ( h ) ] λ 1 ] , p a , q b , r c [ 2 [ p A ( h ) ] λ 1 [ ( 2 p A ( h ) ] λ 1 + [ p A ( h ) ] λ 1 , 2 [ q A ( h ) ] λ 1 [ ( 2 q A ( h ) ] λ 1 + [ q A ( h ) ] λ 1 , 2 [ r A ( h ) ] λ 1 [ ( 2 r A ( h ) ] λ 1 + [ r A ( h ) ] λ 1 ] and λ 2 A = p a , q b , r c [ [ 1 + p A ( h ) ] λ 2 [ 1 p A ( h ) ] λ 2 [ 1 + p A ( h ) ] λ 2 + [ 1 p A ( h ) ] λ 2 , [ 1 + q A ( h ) ] λ 2 [ 1 q A ( h ) ] λ 2 [ 1 + q A ( h ) ] λ 2 + [ 1 q A ( h ) ] λ 2 , [ 1 + r A ( h ) ] λ 2 [ 1 r A ( h ) ] λ 2 [ 1 + r A ( h ) ] λ 2 + [ 1 r A ( h ) ] λ 2 ] , p + a + , q + b + , r + c + [ [ 1 + p A + ( h ) ] λ 2 [ 1 p A + ( h ) ] λ 2 [ 1 + p A + ( h ) ] λ 2 + [ 1 p A + ( h ) ] λ 2 , [ 1 + q A + ( h ) ] λ 2 [ 1 q A + ( h ) ] λ 2 [ 1 + q A + ( h ) ] λ 2 + [ 1 q A + ( h ) ] λ 2 , [ 1 + r A + ( h ) ] λ 2 [ 1 r A + ( h ) ] λ 2 [ 1 + r A + ( h ) ] λ 2 + [ 1 r A + ( h ) ] λ 2 ] , p a , q b , r c [ 2 [ p A ( h ) ] λ 2 [ ( 2 p A ( h ) ] λ 2 + [ p A ( h ) ] λ 2 , 2 [ q A ( h ) ] λ 2 [ ( 2 q A ( h ) ] λ 2 + [ q A ( h ) ] λ 2 , 2 [ r A ( h ) ] λ 2 [ ( 2 r A ( h ) ] λ 2 + [ r A ( h ) ] λ 2 ] = p a , q b , r c [ [ 1 + p A ( h ) ] λ 1 + λ 2 [ 1 p A ( h ) ] λ 1 + λ 2 [ 1 + p A ( h ) ] λ 1 + λ 2 + [ 1 p A ( h ) ] λ 1 + λ 2 , [ 1 + q A ( h ) ] λ 1 + λ 2 [ 1 q A ( h ) ] λ 1 + λ 2 [ 1 + q A ( h ) ] λ 1 + λ 2 + [ 1 q A ( h ) ] λ 1 + λ 2 , [ 1 + r A ( h ) ] λ 1 + λ 2 [ 1 r A ( h ) ] λ 1 + λ 2 [ 1 + r A ( h ) ] λ 1 + λ 2 + [ 1 r A ( h ) ] λ 1 + λ 2 ] , p + a + , q + b + , r + c + [ [ 1 + p A + ( h ) ] λ 1 + λ 2 [ 1 p A + ( h ) ] λ 1 + λ 2 [ 1 + p A + ( h ) ] λ 1 + λ 2 + [ 1 p A + ( h ) ] λ 1 + λ 2 , [ 1 + q A + ( h ) ] λ 1 + λ 2 [ 1 q A + ( h ) ] λ 1 + λ 2 [ 1 + q A + ( h ) ] λ 1 + λ 2 + [ 1 q A + ( h ) ] λ 1 + λ 2 , [ 1 + r A + ( h ) ] λ 1 + λ 2 [ 1 r A + ( h ) ] λ 1 + λ 2 [ 1 + r A + ( h ) ] λ 1 + λ 2 + [ 1 r A + ( h ) ] λ 1 + λ 2 ] , p a , q b , r c [ 2 [ p A ( h ) ] λ 1 + λ 2 [ ( 2 p A ( h ) ] λ 1 + λ 2 + [ p A ( h ) ] λ 1 + λ 2 , 2 [ q A ( h ) ] λ 1 + λ 2 [ ( 2 q A ( h ) ] λ 1 + λ 2 + [ q A ( h ) ] λ 1 + λ 2 , 2 [ r A ( h ) ] λ 1 + λ 2 [ ( 2 r A ( h ) ] λ 1 + λ 2 + [ r A ( h ) ] λ 1 + λ 2 ] = p a , q b , r c [ [ 1 + p 1 ( h ) ] ϖ 1 [ 1 p 1 ( h ) ] ϖ 1 [ 1 + p 1 ( h ) ] ϖ 1 + [ 1 p 1 ( h ) ] ϖ 1 , [ 1 + q 1 ( h ) ] ϖ 1 [ 1 q 1 ( h ) ] ϖ 1 [ 1 + q 1 ( h ) ] ϖ 1 + [ 1 q 1 ( h ) ] ϖ 1 , [ 1 + r 1 ( h ) ] ϖ 1 [ 1 r 1 ( h ) ] ϖ 1 [ 1 + r 1 ( h ) ] ϖ 1 + [ 1 r 1 ( h ) ] ϖ 1 ; p + a + , q + b + , r + c + [ 1 + p 1 + ( h ) ] ϖ 1 [ 1 p 1 + ( h ) ] ϖ 1 [ 1 + p 1 + ( h ) ] ϖ 1 + [ 1 p 1 + ( h ) ] ϖ 1 , [ 1 + q 1 + ( h ) ] ϖ 1 [ 1 q 1 + ( h ) ] ϖ 1 [ 1 + q 1 + ( h ) ] ϖ 1 + [ 1 q 1 + ( h ) ] ϖ 1 , [ 1 + r 1 + ( h ) ] ϖ 1 [ 1 r 1 + ( h ) ] ϖ 1 [ 1 + r 1 + ( h ) ] ϖ 1 + [ 1 r 1 + ( h ) ] ϖ 1 ; p a , q b , r c 2 [ p 1 ( h ) ] ϖ 1 [ ( 2 p 1 ( h ) ] ϖ 1 + [ p 1 ( h ) ] ϖ 1 , 2 [ q 1 ( h ) ] ϖ 1 [ ( 2 q 1 ( h ) ] ϖ 1 + [ q 1 ( h ) ] ϖ 1 , 2 [ r 1 ( h ) ] ϖ 1 [ ( 2 r 1 ( h ) ] ϖ 1 + [ r 1 ( h ) ] ϖ 1 .
Assume that n = k , TCHFEWA ( A 1 , A 2 , , A n ) = j = 1 k w j A j p a , q b , r c [ j = 1 k [ 1 + p 1 ( h ) ] ϖ j = 1 k [ 1 p 1 ( h ) ] ϖ j = 1 k [ 1 + p 1 ( h ) ] ϖ + j = 1 k [ 1 p 1 ( h ) ] ϖ , j = 1 k [ 1 + q 1 ( h ) ] ϖ j = 1 k [ 1 q 1 ( h ) ] ϖ j = 1 k [ 1 + q 1 ( h ) ] ϖ + j = 1 k [ 1 q 1 ( h ) ] ϖ , j = 1 k [ 1 + r 1 ( h ) ] ϖ j = 1 k [ 1 r 1 ( h ) ] ϖ j = 1 k [ 1 + r 1 ( h ) ] ϖ + j = 1 k [ 1 r 1 ( h ) ] ϖ ,
p + a + , q + b + , r + c + j = 1 k [ 1 + p 1 + ( h ) ] ϖ j = 1 k [ 1 p 1 + ( h ) ] ϖ j = 1 k [ 1 + p 1 + ( h ) ] ϖ + j = 1 k [ 1 p 1 + ( h ) ] ϖ , j = 1 k [ 1 + q 1 + ( h ) ] ϖ j = 1 k [ 1 q 1 + ( h ) ] ϖ j = 1 k [ 1 + q 1 + ( h ) ] ϖ + j = 1 k [ 1 q 1 + ( h ) ] ϖ , j = 1 k [ 1 + r 1 + ( h ) ] ϖ j = 1 k [ 1 r 1 + ( h ) ] ϖ j = 1 k [ 1 + r 1 + ( h ) ] ϖ + j = 1 k [ 1 r 1 + ( h ) ] ϖ ;
p a , q b , r c 2 j = 1 k [ p 1 ( h ) ] ϖ j = 1 k [ ( 2 p 1 ( h ) ] ϖ + j = 1 k [ p 1 ( h ) ] ϖ , 2 j = 1 k [ q 1 ( h ) ] ϖ j = 1 k [ ( 2 q 1 ( h ) ] ϖ + j = 1 k [ q 1 ( h ) ] ϖ , 2 j = 1 k [ r 1 ( h ) ] ϖ j = 1 k [ ( 2 r 1 ( h ) ] ϖ + j = 1 k [ r 1 ( h ) ] ϖ .
Then when n = k + 1 , we have TCHFEWA ( A 1 , A 2 , , A k + 1 ) = TCHFEWA ( A 1 , A 2 , , A k ) A k + 1 ) [ j = 1 k [ 1 + p 1 ( h ) ] ϖ j = 1 k [ 1 p 1 ( h ) ] ϖ j = 1 k [ 1 + p 1 ( h ) ] ϖ + j = 1 k [ 1 p 1 ( h ) ] ϖ , j = 1 k [ 1 + q 1 ( h ) ] ϖ j = 1 k [ 1 q 1 ( h ) ] ϖ j = 1 k [ 1 + q 1 ( h ) ] ϖ + j = 1 k [ 1 q 1 ( h ) ] ϖ , j = 1 k [ 1 + r 1 ( h ) ] ϖ j = 1 k [ 1 r 1 ( h ) ] ϖ j = 1 k [ 1 + r 1 ( h ) ] ϖ + j = 1 k [ 1 r 1 ( h ) ] ϖ ; j = 1 k [ 1 + p 1 + ( h ) ] ϖ j = 1 k [ 1 p 1 + ( h ) ] ϖ j = 1 k [ 1 + p 1 + ( h ) ] ϖ + j = 1 k [ 1 p 1 + ( h ) ] ϖ , j = 1 k [ 1 + q 1 + ( h ) ] ϖ j = 1 k [ 1 q 1 + ( h ) ] ϖ j = 1 k [ 1 + q 1 + ( h ) ] ϖ + j = 1 k [ 1 q 1 + ( h ) ] ϖ , j = 1 k [ 1 + r 1 + ( h ) ] ϖ j = 1 k [ 1 r 1 + ( h ) ] ϖ j = 1 k [ 1 + r 1 + ( h ) ] ϖ + j = 1 k [ 1 r 1 + ( h ) ] ϖ ; 2 j = 1 k [ p 1 ( h ) ] ϖ j = 1 k [ ( 2 p 1 ( h ) ] ϖ + j = 1 k [ p 1 ( h ) ] ϖ , 2 j = 1 k [ q 1 ( h ) ] ϖ j = 1 k [ ( 2 q 1 ( h ) ] ϖ + j = 1 k [ q 1 ( h ) ] ϖ , 2 j = 1 k [ r 1 ( h ) ] ϖ j = 1 k [ ( 2 r 1 ( h ) ] ϖ + j = 1 k [ r 1 ( h ) ] ϖ k + 1 [ j = 1 k + 1 [ 1 + p 1 ( h ) ] ϖ j = 1 k + 1 [ 1 p 1 ( h ) ] ϖ j = 1 k + 1 [ 1 + p 1 ( h ) ] ϖ + j = 1 k + 1 [ 1 p 1 ( h ) ] ϖ , j = 1 k + 1 [ 1 + q 1 ( h ) ] ϖ j = 1 k + 1 [ 1 q 1 ( h ) ] ϖ j = 1 k + 1 [ 1 + q 1 ( h ) ] ϖ + j = 1 k + 1 [ 1 q 1 ( h ) ] ϖ , j = 1 k + 1 [ 1 + r 1 ( h ) ] ϖ j = 1 k + 1 [ 1 r 1 ( h ) ] ϖ j = 1 k + 1 [ 1 + r 1 ( h ) ] ϖ + j = 1 k + 1 [ 1 r 1 ( h ) ] ϖ ; j = 1 k + 1 [ 1 + p 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 p 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 + p 1 + ( h ) ] ϖ + j = 1 k + 1 [ 1 p 1 + ( h ) ] ϖ , j = 1 k + 1 [ 1 + q 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 q 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 + q 1 + ( h ) ] ϖ + j = 1 k + 1 [ 1 q 1 + ( h ) ] ϖ , j = 1 k + 1 [ 1 + r 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 r 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 + r 1 + ( h ) ] ϖ + j = 1 k + 1 [ 1 r 1 + ( h ) ] ϖ ; 2 j = 1 k + 1 [ p 1 ( h ) ] ϖ j = 1 k + 1 [ ( 2 p 1 ( h ) ] ϖ + j = 1 k + 1 [ p 1 ( h ) ] ϖ , 2 j = 1 k + 1 [ q 1 ( h ) ] ϖ j = 1 k + 1 [ ( 2 q 1 ( h ) ] ϖ + j = 1 k + 1 [ q 1 ( h ) ] ϖ , 2 j = 1 k + 1 [ r 1 ( h ) ] ϖ j = 1 k + 1 [ ( 2 r 1 ( h ) ] ϖ + j = 1 k + 1 [ r 1 ( h ) ] ϖ = [ j = 1 k + 1 [ 1 + p 1 ( h ) ] ϖ j = 1 k [ 1 p 1 ( h ) ] ϖ j = 1 k + 1 [ 1 + p 1 ( h ) ] ϖ + j = 1 k [ 1 p 1 ( h ) ] ϖ , j = 1 k + 1 [ 1 + q 1 ( h ) ] ϖ j = 1 k [ 1 q 1 ( h ) ] ϖ j = 1 k + 1 [ 1 + q 1 ( h ) ] ϖ + j = 1 k [ 1 q 1 ( h ) ] ϖ , j = 1 k + 1 [ 1 + r 1 ( h ) ] ϖ j = 1 k [ 1 r 1 ( h ) ] ϖ j = 1 k + 1 [ 1 + r 1 ( h ) ] ϖ + j = 1 k [ 1 r 1 ( h ) ] ϖ , j = 1 k + 1 [ 1 + p 1 + ( h ) ] ϖ j = 1 k [ 1 p 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 + p 1 + ( h ) ] ϖ + j = 1 k [ 1 p 1 + ( h ) ] ϖ , j = 1 k + 1 [ 1 + q 1 + ( h ) ] ϖ j = 1 k [ 1 q 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 + q 1 + ( h ) ] ϖ + j = 1 k [ 1 q 1 + ( h ) ] ϖ , j = 1 k + 1 [ 1 + r 1 + ( h ) ] ϖ j = 1 k [ 1 r 1 + ( h ) ] ϖ j = 1 k + 1 [ 1 + r 1 + ( h ) ] ϖ + j = 1 k [ 1 r 1 + ( h ) ] ϖ , 2 j = 1 k + 1 [ p 1 ( h ) ] ϖ j = 1 k + 1 [ ( 2 p 1 ( h ) ] ϖ + j = 1 k + 1 [ p 1 ( h ) ] ϖ , 2 j = 1 k + 1 [ q 1 ( h ) ] ϖ j = 1 k + 1 [ ( 2 q 1 ( h ) ] ϖ + j = 1 k + 1 [ q 1 ( h ) ] ϖ , 2 j = 1 k + 1 [ r 1 ( h ) ] ϖ j = 1 k + 1 [ ( 2 r 1 ( h ) ] ϖ + j = 1 k + 1 [ r 1 ( h ) ] ϖ .
Especially, if w = ( 1 n , 1 n , , 1 n ) T , then the TCHFEWA operator is reduced to the triangular cubic hesitant fuzzy Einstein weighing averaging operator, which is shown as follows: [ j = 1 n [ 1 + p 1 ( h ) ] 1 n j = 1 n [ 1 p 1 ( h ) ] 1 n j = 1 n [ 1 + p 1 ( h ) ] 1 n + j = 1 n [ 1 p 1 ( h ) ] 1 n , j = 1 n [ 1 + q 1 ( h ) ] 1 n j = 1 n [ 1 q 1 ( h ) ] 1 n j = 1 n [ 1 + q 1 ( h ) ] 1 n + j = 1 n [ 1 q 1 ( h ) ] 1 n , j = 1 n [ 1 + r 1 ( h ) ] 1 n j = 1 n [ 1 r 1 ( h ) ] 1 n j = 1 n [ 1 + r 1 ( h ) ] 1 n + j = 1 n [ 1 r 1 ( h ) ] 1 n ; j = 1 n [ 1 + p 1 + ( h ) ] 1 n j = 1 n [ 1 p 1 + ( h ) ] 1 n j = 1 n [ 1 + p 1 + ( h ) ] 1 n + j = 1 n [ 1 p 1 + ( h ) ] 1 n , j = 1 n [ 1 + q 1 + ( h ) ] 1 n j = 1 n [ 1 q 1 + ( h ) ] 1 n j = 1 n [ 1 + q 1 + ( h ) ] 1 n + j = 1 n [ 1 q 1 + ( h ) ] 1 n , j = 1 n [ 1 + r 1 + ( h ) ] 1 n j = 1 n [ 1 r 1 + ( h ) ] 1 n j = 1 n [ 1 + r 1 + ( h ) ] 1 n + j = 1 n [ 1 r 1 + ( h ) ] 1 n ; 2 j = 1 n [ p 1 ( h ) ] 1 n j = 1 n [ ( 2 p 1 ( h ) ] 1 n + j = 1 n [ p 1 ( h ) ] 1 n , 2 j = 1 n [ q 1 ( h ) ] 1 n j = 1 n [ ( 2 q 1 ( h ) ] 1 n + j = 1 n [ q 1 ( h ) ] 1 n , 2 j = 1 n [ r 1 ( h ) ] 1 n j = 1 n [ ( 2 r 1 ( h ) ] 1 n + j = 1 n [ r 1 ( h ) ] 1 n .  □
Example 4.
Let A ¨ 1 = [ 0.2 , 0.4 , 0.6 ] , [ 0.4 , 0.3 , 0.8 ] , [ 0.3 , 0.5 , 0.7 ] , A ¨ 2 = [ 0.1 , 0.3 , 0.5 ] , [ 0.3 , 0.5 , 0.7 ] , [ 0.2 , 0.4 , 0.6 ] and A ¨ 3 = [ 0.5 , 0.7 , 0.9 ] , [ 0.7 , 0.9 , 0.11 ] , [ 0.6 , 0.8 , 0.10 ] be a collection of TCHFNs in L TCHFN and ω ¨ = ( 0.2 , 0.2 , 0.6 ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then their aggregated value by using the TCHFEWA operator is also a TCHFN and TCHFEWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = [ 1 + 0.2 ] 0.2 [ 1 + 0.1 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 0.2 ] 0.2 [ 1 0.1 ] 0.2 [ 1 0.5 ] 0.2 [ 1 + 0.2 ] 0.2 [ 1 + 0.1 ] 0.2 [ 1 + 0.5 ] 0.2 + [ 1 0.2 ] 0.2 [ 1 0.1 ] 0.2 [ 1 0.5 ] 0.2 , [ 1 + 0.4 ] 0.2 [ 1 + 0.3 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 0.4 ] 0.2 [ 1 0.3 ] 0.2 [ 1 0.5 ] 0.2 [ 1 + 0.4 ] 0.2 [ 1 + 0.3 ] 0.2 [ 1 + 0.5 ] 0.2 + [ 1 0.4 ] 0.2 [ 1 0.3 ] 0.2 [ 1 0.5 ] 0.2 , [ 1 + 0.6 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 + 0.9 ] 0.2 [ 1 0.6 ] 0.2 [ 1 0.5 ] 0.2 [ 1 0.9 ] 0.2 [ 1 + 0.6 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 + 0.9 ] 0.2 + [ 1 0.6 ] 0.2 [ 1 0.5 ] 0.2 [ 1 0.9 ] 0.2 , [ 1 + 0.4 ] 0.2 [ 1 + 0.3 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 0.4 ] 0.2 [ 1 0.3 ] 0.2 [ 1 0.5 ] 0.2 [ 1 + 0.4 ] 0.2 [ 1 + 0.3 ] 0.2 [ 1 + 0.5 ] 0.2 + [ 1 0.4 ] 0.2 [ 1 0.3 ] 0.2 [ 1 0.5 ] 0.2 , [ 1 + 0.6 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 + 0.9 ] 0.2 [ 1 0.6 ] 0.2 [ 1 0.5 ] 0.2 [ 1 0.9 ] 0.2 [ 1 + 0.6 ] 0.2 [ 1 + 0.5 ] 0.2 [ 1 + 0.9 ] 0.2 + [ 1 0.6 ] 0.2 [ 1 0.5 ] 0.2 [ 1 0.9 ] 0.2 , [ 1 + 0.8 ] 0.2 [ 1 + 0.7 ] 0.2 [ 1 + 0.11 ] 0.2 [ 1 0.8 ] 0.2 [ 1 0.7 ] 0.2 [ 1 0.11 ] 0.2 [ 1 + 0.8 ] 0.2 [ 1 + 0.7 ] 0.2 [ 1 + 0.11 ] 0.2 + [ 1 0.8 ] 0.2 [ 1 0.7 ] 0.2 [ 1 0.11 ] 0.2 , 2 [ ( 0.3 ) 0.6 ( 0.2 ) 0.6 ( 0.6 ) 0.6 ] [ ( 2 0.3 ) 0.6 ( 2 0.2 ) 0.6 ( 2 0.6 ) 0.6 ] + [ ( 0.3 ) 0.6 ( 0.2 ) 0.6 ( 0.6 ) 0.6 ] , 2 [ ( 0.5 ) 0.6 ( 0.4 ) 0.6 ( 0.8 ) 0.6 ] [ ( 2 0.5 ) 0.6 ( 2 0.4 ) 0.6 ( 2 0.8 ) 0.6 ] + [ ( 0.5 ) 0.6 ( 0.4 ) 0.6 ( 0.8 ) 0.6 ] , 2 [ ( 0.7 ) 0.6 ( 0.6 ) 0.6 ( 0.10 ) 0.6 ] [ ( 2 0.7 ) 0.6 ( 2 0.6 ) 0.6 ( 2 0.10 ) 0.6 ] + [ ( 0.7 ) 0.6 ( 0.6 ) 0.6 ( 0.10 ) 0.6 ] = 0.1687 , 0.2509 , 0.4951 , 0.2509 , 0.4951 , 0.3928 , 0.1075 , 0.3001 , 0.1324 .
Proposition 2.
Let A ¨ = [ a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] , a 1 + ( z ) , b 1 + ( z ) , c 1 + ( z ) ] , a 1 ( z ) , b 1 ( z ) , c 1 ( z ) ] | z Z be a collection of TCHFNs in L TCHFN and where ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 .
Then (1) (Idempotency): If all A j , j = 1 , 2 , , n are equal, i.e., A j = A , for all j = 1 , 2 , , n , then TCHFEWA ( A 1 , A 2 , , A n ) = A .
(2) (Boundary): If a min = min 1 j n a j , b min = min 1 j n b j , c min = min 1 j n c j , a min + = min 1 j n a j + , b min + = min 1 j n b j + , c min + = min 1 j n c j + , a max = max 1 j n a j , b max = max 1 j n b j , c max = max 1 j n c j , a max = max 1 j n a j , b max = max 1 j n b j , c max = max 1 j n c j , a max + = max 1 j n a j + , b max + = max 1 j n b j + , c max + = max 1 j n c j + , a min = min 1 j n a j , b min = min 1 j n b j , c min = min 1 j n c j , for all j = 1 , 2 , . . , n , we can obtain that [ a min ( h ) , b min ( h ) , c min ( h ) ] , a min + ( h ) , b min + ( h ) , c min + ( h ) ] , a max ( h ) , b max ( h ) , c max ( h ) | h H ≤TCHFEWA ( A 1 , A 2 , , A n ) [ a max ( h ) , b max ( h ) , c max ( h ) ] , a max + ( h ) , b max + ( h ) , c max + ( h ) ] , a min ( h ) , b min ( h ) , c min ( h ) ] h H .
(3) (Monotonicity): A = [ { a A ( h ) , b A ( h ) , c A ( h ) ] , [ a A + ( h ) , b A + ( h ) , c A + ( h ) ] , a A ( h ) , b A ( h ) , c A ( h ) ] | h H and B = [ a B ( h ) , b B ( h ) , c B ( h ) ] , a B + ( h ) , b B + ( h ) , c B + ( h ) ] , a B ( h ) , b B ( h ) , c B ( h ) ] | h H be two collection of TCHFNs in L TCHFN and A j L TCHFN B j i.e., a A ( h ) a B ( h ) , b A ( h ) b B ( h ) , c A ( h ) c B ( h ) , a A + ( h ) a B + ( h ) , b A + ( h ) b B + ( h ) , c A + ( h ) c B + ( h ) and a A ( h ) a B ( h ) , b A ( h ) b B ( h ) , c A ( h ) c B ( h ) then TCHFEWA ( A 1 , A 2 , , A n ) TCHFEWA ( B 1 , B 2 , , B n ) .

5.2. Triangular Cubic Hesitant Fuzzy Einstein Ordered Weighted Averaging Operator

We also develop a type of triangular cubic fuzzy Einstein ordered weighted averaging (TCFEOWA) operator.
Definition 15.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z be a collection of TCHFNs in L TCHFN , an TCHFEOWA operator of dimension n is a mapping TCHFEOWA: L TCHFN n L TCHFN , that has an associated vector ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . TCHFEOWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = ω ¨ 1 A ¨ ( σ ) 1 + ω ¨ 2 A ¨ ( σ ) 2 , , ω ¨ n A ¨ ( σ ) n , where ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) is a permutation of ( 1 , 2 , , n ) such that A ¨ σ ( 1 ) A ¨ σ ( j 1 ) for all j = 2 , 3 , , n (i.e., A ¨ σ ( j ) is the jth largest value in the collection ( A ¨ 1 , A ¨ 2 , , A ¨ n ) . If ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T = ( 1 n , 1 n , , 1 n ) T . Then the TCHFEOWA operator is reduced to the TCHFA operator (2) of dimension n.
Theorem 2.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z be a collection of TCHFNs in L TCHFN . Then their aggregated value by using the TCHFEOWA operator is also a TCHFN and TCHFEOWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) =
p a , q b , r c j = 1 n [ 1 + p σ ( j ) ( z ) ] ω ¨ j = 1 n [ 1 p σ ( j ) ( z ) ] ω ¨ j = 1 n [ 1 + p σ ( j ) ( z ) ] ω ¨ + j = 1 n [ 1 p σ ( j ) ( z ) ] ω ¨ , j = 1 n [ 1 + q σ ( j ) ( z ) ] ω ¨ j = 1 n [ 1 q σ ( j ) ( z ) ] ω ¨ j = 1 n [ 1 + q σ ( j ) ( z ) ] ω ¨ + j = 1 n [ 1 q σ ( j ) ( z ) ] ω ¨ , j = 1 n [ 1 + r σ ( j ) ( z ) ] ω ¨ j = 1 n [ 1 r σ ( j ) ( z ) ] ω ¨ j = 1 n [ 1 + r σ ( j ) ( z ) ] ω ¨ + j = 1 n [ 1 r σ ( j ) ( z ) ] ω ¨ , p + a + , q + b + , r + c + j = 1 n [ 1 + p σ ( j ) + ( z ) ] ω ¨ j = 1 n [ 1 p σ ( j ) + ( z ) ] ω ¨ j = 1 n [ 1 + p σ ( j ) + ( z ) ] ω ¨ + j = 1 n [ 1 p σ ( j ) + ( z ) ] ω ¨ , j = 1 n [ 1 + q σ ( j ) + ( z ) ] ω ¨ j = 1 n [ 1 q σ ( j ) + ( z ) ] ω ¨ j = 1 n [ 1 + q σ ( j ) + ( z ) ] ω ¨ + j = 1 n [ 1 q σ ( j ) + ( z ) ] ω ¨ , j = 1 n [ 1 + r σ ( j ) + ( z ) ] ω ¨ j = 1 n [ 1 r σ ( j ) + ( z ) ] ω ¨ j = 1 n [ 1 + r σ ( j ) + ( z ) ] ω ¨ + j = 1 n [ 1 r σ ( j ) + ( z ) ] ω ¨ p a , q b , r c 2 j = 1 n [ p σ ( j ) ( z ) ] ω ¨ j = 1 n [ ( 2 p σ ( j ) ( z ) ] ω ¨ + j = 1 n [ p σ ( j ) ( z ) ] ω ¨ , 2 j = 1 n [ q σ ( j ) ( z ) ] ω ¨ j = 1 n [ ( 2 q σ ( j ) ( z ) ] ω ¨ + j = 1 n [ q σ ( j ) ( z ) ] ω ¨ , 2 j = 1 n [ r σ ( j ) ( z ) ] ω ¨ j = 1 n [ ( 2 r σ ( j ) ( z ) ] ω ¨ + j = 1 n [ r σ ( j ) ( z ) ] ω ¨ ,
where ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) is a permutation of ( 1 , 2 , , n ) such that A ¨ σ ( 1 ) A ¨ σ ( j 1 ) for all j = 2 , 3 , , n , ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] , and j = 1 n ω ¨ j = 1 . If ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T = ( 1 n , 1 n , , 1 n ) T . Then the TCHFEOWA operator is reduced to the TCHFA operator (2) of dimension n. Where ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 .
Example 5.
Let A ¨ 1 = [ 0.4 , 0.6 , 0.8 ] , [ 0.6 , 0.8 , 0.10 ] , [ 0.5 , 0.7 , 0.9 ] , A ¨ 2 = [ 0.5 , 0.7 , 0.9 ] , [ 0.7 , 0.9 , 0.11 ] , [ 0.6 , 0.8 , 0.10 ] and A ¨ 3 = [ 0.2 , 0.4 , 0.6 ] , [ 0.4 , 0.6 , 0.8 ] , [ 0.3 , 0.5 , 0.7 ] be a collection of TCHFNs in L TCHFN and ω ¨ = ( 0.4 , 0.4 , 0.2 ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then their aggregated value by using the TCHFEOWA operator is also a TCHFN and TCHFEOWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) =
[ 1 + 0.4 ] 0.4 [ 1 + 0.5 ] 0.4 [ 1 + 0.2 ] 0.4 [ 1 0.4 ] 0.4 [ 1 0.5 ] 0.4 [ 1 0.2 ] 0.4 [ 1 + 0.4 ] 0.4 [ 1 + 0.5 ] 0.4 [ 1 + 0.2 ] 0.4 + [ 1 0.4 ] 0.4 [ 1 0.5 ] 0.4 [ 1 0.2 ] 0.4 , [ 1 + 0.6 ] 0.4 [ 1 + 0.7 ] 0.4 [ 1 + 0.4 ] 0.4 [ 1 0.6 ] 0.4 [ 1 0.7 ] 0.4 [ 1 0.4 ] 0.4 [ 1 + 0.6 ] 0.4 [ 1 + 0.7 ] 0.4 [ 1 + 0.4 ] 0.4 + [ 1 0.6 ] 0.4 [ 1 0.7 ] 0.4 [ 1 0.4 ] 0.4 , [ 1 + 0.8 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.6 ] 0.4 [ 1 0.8 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.6 ] 0.4 [ 1 + 0.8 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.6 ] 0.4 + [ 1 0.8 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.6 ] 0.4 , [ 1 + 0.6 ] 0.4 [ 1 + 0.7 ] 0.4 [ 1 + 0.4 ] 0.4 [ 1 0.6 ] 0.4 [ 1 0.7 ] 0.4 [ 1 0.4 ] 0.4 [ 1 + 0.6 ] 0.4 [ 1 + 0.7 ] 0.4 [ 1 + 0.4 ] 0.4 + [ 1 0.6 ] 0.4 [ 1 0.7 ] 0.4 [ 1 0.4 ] 0.4 , [ 1 + 0.8 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.6 ] 0.4 [ 1 0.8 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.6 ] 0.4 [ 1 + 0.8 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.6 ] 0.4 + [ 1 0.8 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.6 ] 0.4 , [ 1 + 0.10 ] 0.4 [ 1 + 0.11 ] 0.4 [ 1 + 0.8 ] 0.4 [ 1 0.10 ] 0.4 [ 1 0.11 ] 0.4 [ 1 0.8 ] 0.4 [ 1 + 0.10 ] 0.4 [ 1 + 0.11 ] 0.4 [ 1 + 0.8 ] 0.4 + [ 1 0.10 ] 0.4 [ 1 0.11 ] 0.4 [ 1 0.8 ] 0.4 , 2 [ ( 0.5 ) 0.2 ( 0.6 ) 0.2 ( 0.3 ) 0.2 ] [ ( 2 0.5 ) 0.2 ( 2 0.6 ) 0.2 ( 2 0.3 ) 0.2 ] + [ ( 0.5 ) 0.2 ( 0.6 ) 0.2 ( 0.3 ) 0.2 ] , 2 [ ( 0.7 ) 0.2 ( 0.8 ) 0.2 ( 0.5 ) 0.2 ] [ ( 2 0.7 ) 0.2 ( 2 0.4 ) 0.2 ( 2 0.8 ) 0.2 ] + [ ( 0.7 ) 0.2 ( 0.4 ) 0.2 ( 0.8 ) 0.2 ] , 2 [ ( 0.9 ) 0.2 ( 0.10 ) 0.2 ( 0.7 ) 0.2 ] [ ( 2 0.9 ) 0.2 ( 2 0.10 ) 0.2 ( 2 0.7 ) 0.2 ] + [ ( 0.9 ) 0.2 ( 0.10 ) 0.2 ( 0.7 ) 0.2 ] = 0.4384 , 0.6604 , 0.8631 , 0.6604 , 0.8631 , 0.4788 , 0.6477 , 0.7983 , 0.6404 .
Proposition 3.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z be a collection of TCHFNs in L TCHFN and where ω ¨ = ( ω ¨ 1 , ω ¨ 2 , . . . , ω ¨ n ) T be the weighting vector of the TCHFEOWA operator, such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then
TCHFEOWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) TCHFEOWA ( B ¨ 1 , B ¨ 2 , , B ¨ n )
where ( A ¨ 1 , A ¨ 2 , , A ¨ n ) is any permutation of ( B ¨ 1 , B ¨ 2 , , B ¨ n ) .
Corollary 1.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z be a collection of TCHFNs in L TCHFN and where ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of TCHFEOWA such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then
TCHFEOWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) TCHFEOWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) .

5.3. Triangular Cubic Hesitant Fuzzy Einstein Hybrid Weighted Averaging Operator

Deliberate that the TCHFEWA operator weights individual the TCHFNs and the TCHFEOWA operator weights individual the ordered positions of the TCHFNs. In what follows, we elaborate triangular cubic hesitant fuzzy hybrid averaging (TCHFEHWA) operator, which weights together the given TCHFN and its well-ordered position.
Definition 16.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z be a collection of TCHFNs in L TCHFN and ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then triangular cubic hesitant fuzzy Einstein hybrid weighted averaging operator of dimension n is a mapping TCHFEHWA : L TCHFN n L TCHFN , that has an associated vector w = ( w 1 , w 2 , , w n ) T such that w j [ 0 , 1 ] and j = 1 n w j = 1 . TCHFEHWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = p 1 A ¨ σ ( 1 ) + p 2 A ¨ σ ( 1 ) , , p n A ¨ σ ( 1 ) . If p = θ ω ¨ σ ( j ) + ( 1 θ ) w σ ( j ) with a balancing coefficient θ [ 0 , 1 ] , ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) is a permutation of ( 1 , 2 , , n ) such that A ¨ σ ( j ) A ¨ σ ( j 1 ) for all j = 2 , 3 , , n (i.e., A ¨ σ ( j ) is the jth largest value in the collection ( A ¨ 1 , A ¨ 2 , , A ¨ n ) .
Theorem 3.
Let A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z be a collection of TCHFNs in L TCHFN and ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then their aggregated value by using the TCHFEHWA operator, which has an associated vector ϖ = ( ϖ 1 , ϖ 2 , , ϖ n ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ϖ j [ 0 , 1 ] and j = 1 n ϖ j = 1 , is also an TCHFN and TCHFEHWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) =
p a , q b , r c [ j = 1 n [ 1 + p σ ( j ) ] ϖ j = 1 n [ 1 p σ ( j ) ] ϖ j = 1 n [ 1 + p σ ( j ) ] ϖ + j = 1 n [ 1 p σ ( j ) ] ϖ , j = 1 n [ 1 + q σ ( j ) ] ϖ j = 1 n [ 1 q σ ( j ) ] ϖ j = 1 n [ 1 + q σ ( j ) ] ϖ + j = 1 n [ 1 q σ ( j ) ] ϖ , j = 1 n [ 1 + r σ ( j ) ] ϖ j = 1 n [ 1 r σ ( j ) ] ϖ j = 1 n [ 1 + r σ ( j ) ] ϖ + j = 1 n [ 1 r σ ( j ) ] ϖ ] , p + a + , q + b + , r + c + [ j = 1 n [ 1 + p σ ( j ) + ] ϖ j = 1 n [ 1 p σ ( j ) + ] ϖ j = 1 n [ 1 + p σ ( j ) + ] ϖ + j = 1 n [ 1 p σ ( j ) + ] ϖ , j = 1 n [ 1 + q σ ( j ) + ] ϖ j = 1 n [ 1 q σ ( j ) + ] ϖ j = 1 n [ 1 + q σ ( j ) + ] ϖ + j = 1 n [ 1 q σ ( j ) + ] ϖ , j = 1 n [ 1 + r σ ( j ) + ] ϖ j = 1 n [ 1 r σ ( j ) + ] ϖ j = 1 n [ 1 + r σ ( j ) + ] ϖ + j = 1 n [ 1 r σ ( j ) + ] ϖ p a , q b , r c 2 j = 1 n [ p σ ( j ) ] ϖ j = 1 n [ ( 2 p σ ( j ) ] ϖ + j = 1 n [ p σ ( j ) ] ϖ , 2 j = 1 n [ q σ ( j ) ] ϖ j = 1 n [ ( 2 q σ ( j ) ] ϖ + j = 1 n [ q σ ( j ) ] ϖ , 2 j = 1 n [ r σ ( j ) ] ϖ j = 1 n [ ( 2 r σ ( j ) ] ϖ + j = 1 n [ r σ ( j ) ] ϖ .
If p = θ ω ¨ σ ( j ) + ( 1 θ ) ϖ σ ( j ) with a balancing coefficient θ [ 0 , 1 ] , ( σ ( 1 ) , σ ( 2 ) , , σ ( n ) ) is a permutation of ( 1 , 2 , , n ) such that A ¨ σ ( j ) A ¨ σ ( j 1 ) for all j = 2 , 3 , , n (i.e., A ¨ σ ( j ) is the jth largest value in the collection ( A ¨ 1 , A ¨ 2 , , A ¨ n ) .
Example 6.
Let A ¨ 1 = [ 0.8 , 0.10 , 0.12 ] , [ 0.10 , 0.12 , 0.14 ] , [ 0.9 , 0.11 , 0.13 ] , A ¨ 2 = [ 0.7 , 0.9 , 0.11 ] , [ 0.9 , 0.11 , 0.13 ] , [ 0.8 , 0.10 , 0.12 ] and A ¨ 3 = [ 0.202 , 0.204 , 0.206 ] , [ 0.204 , 0.206 , 0.208 ] , [ 0.203 , 0.205 , 0.207 ] be a collection of TCHFNs in L TCHFN and ω ¨ = ( 0.4 , 0.4 , 0.2 ) T is the weight vector of A ¨ j ( j = 1 , 2 , , n ) such that ω ¨ j [ 0 , 1 ] and j = 1 n ω ¨ j = 1 . Then their aggregated value by using the TCHFEHWA operator is also a TCHFN and TCHFEHWA ( A ¨ 1 , A ¨ 2 , , A ¨ n ) = [ 1 + 0.8 ] 0.4 [ 1 + 0.7 ] 0.4 [ 1 + 0.202 ] 0.4 [ 1 0.8 ] 0.4 [ 1 0.7 ] 0.4 [ 1 0.202 ] 0.4 [ 1 + 0.8 ] 0.4 [ 1 + 0.7 ] 0.4 [ 1 + 0.202 ] 0.4 + [ 1 0.8 ] 0.4 [ 1 0.7 ] 0.4 [ 1 0.202 ] 0.4 , [ 1 + 0.10 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.204 ] 0.4 [ 1 0.10 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.204 ] 0.4 [ 1 + 0.10 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.204 ] 0.4 + [ 1 0.10 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.204 ] 0.4 , [ 1 + 0.12 ] 0.4 [ 1 + 0.11 ] 0.4 [ 1 + 0.206 ] 0.4 [ 1 0.12 ] 0.4 [ 1 0.11 ] 0.4 [ 1 0.206 ] 0.4 [ 1 + 0.12 ] 0.4 [ 1 + 0.11 ] 0.4 [ 1 + 0.206 ] 0.4 + [ 1 0.12 ] 0.4 [ 1 0.11 ] 0.4 [ 1 0.206 ] 0.4 , , [ 1 + 0.10 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.204 ] 0.4 [ 1 0.10 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.204 ] 0.4 [ 1 + 0.10 ] 0.4 [ 1 + 0.9 ] 0.4 [ 1 + 0.204 ] 0.4 + [ 1 0.10 ] 0.4 [ 1 0.9 ] 0.4 [ 1 0.204 ] 0.4 , [ 1 + 0.12 ] 0.4 [ 1 + 0.11 ] 0.4 [ 1 + 0.206 ] 0.4 [ 1 0.12 ] 0.4 [ 1 0.11 ] 0.4 [ 1 0.206 ] 0.4 [ 1 + 0.12 ] 0.4 [ 1 + 0.11 ] 0.4 [ 1 + 0.206 ] 0.4 + [ 1 0.12 ] 0.4 [ 1 0.11 ] 0.4 [ 1 0.206 ] 0.4 , [ 1 + 0.14 ] 0.4 [ 1 + 0.13 ] 0.4 [ 1 + 0.208 ] 0.4 [ 1 0.14 ] 0.4 [ 1 0.13 ] 0.4 [ 1 0.208 ] 0.4 [ 1 + 0.14 ] 0.4 [ 1 + 0.13 ] 0.4 [ 1 + 0.208 ] 0.4 + [ 1 0.14 ] 0.4 [ 1 0.13 ] 0.4 [ 1 0.208 ] 0.4 , 2 [ ( 0.9 ) 0.2 ( 0.8 ) 0.2 ( 0.203 ) 0.2 ] [ ( 2 0.9 ) 0.2 ( 2 0.8 ) 0.2 ( 2 0.203 ) 0.2 ] + [ ( 0.9 ) 0.2 ( 0.8 ) 0.2 ( 0.203 ) 0.2 ] , 2 [ ( 0.11 ) 0.2 ( 0.10 ) 0.2 ( 0.205 ) 0.2 ] [ ( 2 0.11 ) 0.2 ( 2 0.10 ) 0.2 ( 2 0.205 ) 0.2 ] + [ ( 0.11 ) 0.2 ( 0.10 ) 0.2 ( 0.205 ) 0.2 ] , 2 [ ( 0.13 ) 0.2 ( 0.12 ) 0.2 ( 0.207 ) 0.2 ] [ ( 2 0.13 ) 0.2 ( 2 0.12 ) 0.2 ( 2 0.207 ) 0.2 ] + [ ( 0.13 ) 0.2 ( 0.12 ) 0.2 ( 0.207 ) 0.2 ] = 0.7005 , 0.6117 , 0.1742 0.6117 , 0.1742 , 0.1907 , 0.7283 , 0.3383 , 0.3602 .
Proposition 4.
The TCHFEHWA operator (4) satisfy the following properties:
(1) The weighting vector p = ( p 1 , p 2 , , p n ) T satisfies j = 1 n p j = 1 .
(2) The TCHFEHWA operator (4) is a TCHFEOWA operator with weights p.
(3) If θ = 1 then the TCHFEHWA operator (4) reduces to a TCHFEWA operator (1) with a weighting vector ω ¨ .
(4) If θ = 0 then the TCHFEHWA operator (4) reduces to a TCHFEOWA operator (3) with a weighting vector w .
Theorem 4.
The TCHFEHWA operator (4) generalizes both the TCHFEWA operator (1) and the TCHFEOWA operator (3).

6. An Approach to Multiple Attribute Decision Making with Triangular Cubic Hesitant Fuzzy Information

In this section, we shall utilize the triangular cubic hesitant fuzzy operator to multiple attribute decision making with linguistic information.
There are different factors affecting the chain of command in a program, such as the geographical location of projects, the capability of the engineers, staff, and workers, and the similarity of projects comprising the program. Other factors of much importance in constructing a program are the complexity of the projects, the level of the design, the availability of resources, and the technical know-how. In terms of program organization, delegation is very important to keep a tight control over a large number of projects comprising the program.
Alcantud et al. [37] developed two real implementations: (i) new metarankings of world academic institutions that build on real data from three reputed agencies, and (ii) a new procedure for improving teaching performance assessments which we illustrate with real data collected by ourselves.
Author(s)Tool(s)/method(s)
Based on HFEs scores
Xia and Xu [11]      Generalized hesitant fuzzy weighted averaging operator (GHFWA),
Generalized hesitant fuzzy weighted geometric operator (GHFWG)
Farhadinia [38]Series of score functions for hesitant fuzzy sets
Xia, Xu and Zhu [39]Weighted hesitant fuzzy geometric Bonferroni mean (WHFGBM)
Weighted hesitant fuzzy Choquet geometric Bonferroni mean (WHFCGBM)
Wei [40]Hesitant fuzzy prioritized operators
Based on distance measures
Xu and Xia [41]Distance measures of hesitant fuzzy elements
Xu and Xia [42]Generalized hesitant weighted distance
Li, Zeng and Li [43]Distance and similarity measures considering hesitancy degree
A multiple attribute decision making (MADM) problem is to find the best compromise solution from all feasible alternatives assessed on multiple attributes. Let z = { z 1 , z 2 , , z n } be a set of alternatives and G = { g 1 , g 2 , , g n } be the set of attributes. Suppose the rating of alternatives z i ( i = 1 , 2 , , n ) on attributes g j ( j = 1 , 2 , , m ) given by decision maker are TCHFNs in L T C H F N : A ¨ = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z , where [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ + ( z ) , c A ¨ + ( z ) ] , indicates the interval value triangular hesitant fuzzy number that the alternative z i satisfies the attribute g j and [ p A ¨ ( z ) , q A ¨ ( z ) , r A ¨ ( z ) ] indicates the triangular hesitant fuzzy number that the alternative z i does not satisfy the attribute g j , such that, an MADM problem can be concisely expressed in the triangular cubic hesitant fuzzy decision matrix D = ( A ¨ i j ) m × n = [ a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] , a A ¨ + ( z ) , b A ¨ ( z ) , c A ¨ + ( z ) ] , a A ¨ ( z ) , b A ¨ ( z ) , c A ¨ ( z ) ] | z Z .
Then, we utilize the triangular cubic hesitant fuzzy number to develop an approach to multiple attribute decision-making problems with linguistic information, which can be described as following:
Step 1: Define the triangular cubic hesitant fuzzy decision matrix
Step 2: Calculate the normalized triangular cubic hesitant fuzzy decision matrix. The following normalization formula E k = ( β ¨ i j k ) n × 1 ,
Accordingly, we attain the normalized triangular cubic hesitant fuzzy decision matrix E = ( β ¨ i j ) n × m .
Step 3: Utilize the TCHFEHWA operator to aggregate all the rating values β ¨ i j ( j = 1 , 2 , , m ) of the ith line and get the overall rating value β ¨ i j corresponding to the alternative z i ( i = 1 , 2 , , n ) , i.e., β ¨ i j = TCHFHWA ( β ¨ i 1 , β ¨ i 2 , , β ¨ i m ) =
p a , q b , r c i = 1 n [ 1 + p i ( z ) ] ω ¨ i = 1 n [ 1 p i ( z ) ] ω ¨ i = 1 n [ 1 + p i ( z ) ] ω ¨ + i = 1 n [ 1 p i ( z ) ] ω ¨ , i = 1 n [ 1 + q i ( z ) ] ω ¨ i = 1 n [ 1 q i ( z ) ] ω ¨ i = 1 n [ 1 + q i ( z ) ] ω ¨ + i = 1 n [ 1 q i ( z ) ] ω ¨ , i = 1 n [ 1 + r i ( z ) ] ω ¨ i = 1 n [ 1 r i ( z ) ] ω ¨ i = 1 n [ 1 + r i ( z ) ] ω ¨ + i = 1 n [ 1 r i ( z ) ] ω ¨ , p + a + , q + b + , r + c + i = 1 n [ 1 + p i + ( z ) ] ω ¨ i = 1 n [ 1 p i + ( z ) ] ω ¨ i = 1 n [ 1 + p i + ( z ) ] ω ¨ + i = 1 n [ 1 p i + ( z ) ] ω ¨ , i = 1 n [ 1 + q i + ( z ) ] ω ¨ i = 1 n [ 1 q i + ( z ) ] ω ¨ i = 1 n [ 1 + q i + ( z ) ] ω ¨ + i = 1 n [ 1 q i + ( z ) ] ω ¨ , i = 1 n [ 1 + r i + ( z ) ] ω ¨ i = 1 n [ 1 r i + ( z ) ] ω ¨ i = 1 n [ 1 + r i + ( z ) ] ω ¨ + i = 1 n [ 1 r i + ( z ) ] ω ¨ , p a , q b , r c 2 i = 1 n [ p i ( z ) ] ω ¨ i = 1 n [ ( 2 p i ( z ) ] ω ¨ + i = 1 n [ p i ( z ) ] ω ¨ , 2 i = 1 n [ q i ( z ) ] ω ¨ i = 1 n [ ( 2 q i ( z ) ] ω ¨ + i = 1 n [ q i ( z ) ] ω ¨ , 2 i = 1 n [ r i ( z ) ] ω ¨ i = 1 n [ ( 2 r i ( z ) ] ω ¨ + i = 1 n [ r i ( z ) ] ω ¨
where ω ¨ = ( ω ¨ 1 , ω ¨ 2 , , ω ¨ n ) T is the attribute weight vector of g j ( j = 1 , 2 , , m ) such that ω ¨ j [ 0 , 1 ] , ( j = 1 , 2 , , m ) and j = 1 n ω ¨ j = 1 . w = ( w 1 , w 2 , , w n ) T is the associated vector of the TCHFEHWA operator, such that w j [ 0 , 1 ] , j = 1 , 2 , , n and j = 1 n w j = 1 .
β ¨ i j = TCHFHWA ( β ¨ j 1 , β ¨ j 2 , , β ¨ j m ) = p a , q b , r c [ j = 1 n [ 1 + p σ ( j ) ] ϖ j = 1 n [ 1 p σ ( j ) ] ϖ j = 1 n [ 1 + p σ ( j ) ] ϖ + j = 1 n [ 1 p σ ( j ) ] ϖ , j = 1 n [ 1 + q σ ( j ) ] ϖ j = 1 n [ 1 q σ ( j ) ] ϖ j = 1 n [ 1 + q σ ( j ) ] ϖ + j = 1 n [ 1 q σ ( j ) ] ϖ , j = 1 n [ 1 + r σ ( j ) ] ϖ j = 1 n [ 1 r σ ( j ) ] ϖ j = 1 n [ 1 + r σ ( j ) ] ϖ + j = 1 n [ 1 r σ ( j ) ] ϖ ] , p + a + , q + b + , r + c + [ j = 1 n [ 1 + p σ ( j ) + ] ϖ j = 1 n [ 1 p σ ( j ) + ] ϖ j = 1 n [ 1 + p σ ( j ) + ] ϖ + j = 1 n [ 1 p σ ( j ) + ] ϖ , j = 1 n [ 1 + q σ ( j ) + ] ϖ j = 1 n [ 1 q σ ( j ) + ] ϖ j = 1 n [ 1 + q σ ( j ) + ] ϖ + j = 1 n [ 1 q σ ( j ) + ] ϖ , j = 1 n [ 1 + r σ ( j ) + ] ϖ j = 1 n [ 1 r σ ( j ) + ] ϖ j = 1 n [ 1 + r σ ( j ) + ] ϖ + j = 1 n [ 1 r σ ( j ) + ] ϖ p a , q b , r c 2 j = 1 n [ p σ ( j ) ] ϖ j = 1 n [ ( 2 p σ ( j ) ] ϖ + j = 1 n [ p σ ( j ) ] ϖ , 2 j = 1 n [ q σ ( j ) ] ϖ j = 1 n [ ( 2 q σ ( j ) ] ϖ + j = 1 n [ q σ ( j ) ] ϖ , 2 j = 1 n [ r σ ( j ) ] ϖ j = 1 n [ ( 2 r σ ( j ) ] ϖ + j = 1 n [ r σ ( j ) ] ϖ
Step 4: Calculate the scores function to aggregate the value of each alternative β ¨ i ( i = 1 , 2 , , n ) , then we have must find out the score value of the aggregate value of each alternative.
Step 5: Calculate all the score values of the alternatives in the form of descending order and select the best alternative β ¨ i which is the highest degree of the score value.
Next, we shall apply the TCHFEHWA operator to deal with the MADM problem, which involves the following algorithm steps.
Algorithm. A MAGDM approach based on the triangular cubic hesitant fuzzy number
Output: The Ranking of all the alternatives
Step 1: Define the triangular cubic hesitant fuzzy matrix
Step 2: Calculate the normalized triangular cubic hesitant fuzzy decision matrix to obtain the integrated information by aggregating individual information for all DMs.
Step 3: Utilize the TCHFEHWA operator to aggregate all the rating values β ¨ i j ( j = 1 , 2 , , m ) of the ith line and get the overall rating value β ¨ i j corresponding to the alternative z i ( i = 1 , 2 , , n ) .
Step 4: Calculate the scores function based on the (Eq. 4) of each alternative β ¨ i ( i = 1 , 2 , , n ) , then we have must find out the score value of the aggregate value of each alternative.
Step 5: Rank all the alternatives in the form of descending order and select the best alternative β ¨ i which is the highest degree of the score value.
Figure 2 is a flow chart describing the steps of the algorithm.

7. Illustrative Example

Regular exposures and disasters are yonder gentleman’s controller. Whatever can take the defensive events before its incidence or can ensure less injury by expressing an efficient disaster administration strategy so as to evade loss of humanoid life and additional essential resources is unique. Consider Pakistan where deluges hit numerous conditions and principal to vast loss of life and stuff. Directing on the disaster management, related particularly to four Indian States, taken as alternatives A i , i = 1 , 2 , 3 , viz., (Lahore, Mansehra, and Islamabad) which remained largely devastated during first half of the year 2018, suppose the Administration of Pakistan is trying to make the best decision on allocating reserves to these three conditions. When the whole situation is examined for major areas of fund allocation, it was found that money should be allocated in such a way that three major factors represented by C j , j = 1 , 2 , 3 namely: “Food Shortage”, “Amount of persons saved” and “Absence of substructure Rebuilding amenities” needed to be coped up. Suppose, different factors are prioritized state-wise in accordance with the weight vector ω ¨ = ( 0.25 , 0.50 , 0.25 ) . Thus, the aim of the problem is to determine the order in which states should be allocated the relief fund.
It ends with a discussion on how to aggregate information that is expressed in terms of linguistic variables. This is a crucial step of the process of decision making, as we need to be able to aggregate the various bits of “linguistic” information (that is expressed in linguistic format) on the issue at hand under the condition of fulfilling certain criteria. The following section then explicates how to model the decision-making process in various succeeding stages. One way to avoid the above problems associated with using membership functions is to use linguistic variables instead of fuzzy numbers, that is, to use variables whose values are not numbers but words or sentences in a natural or artificial language. Since words are in general less precise than numbers, the concept of a linguistic variable serves the purpose of providing a means to approximately characterize phenomena that are complex or ill-defined and hence not amenable to a crisp description in quantitative terms. Of course, in order for linguistic variables to be useful tools of analysis, one ought to be able to manipulate them through various operations. Generally, manipulating linguistic variables can be done in one of two ways. First, one can use linguistic variables by associating membership functions to them and then manipulating the membership functions, since linguistic variables are but a special category of fuzzy sets. Second, one can directly symbolically manipulate the linguistic variables themselves.
In the former case, the manipulation of linguistic variables is done by using the extension principle, which in essence allows the extension of usual algebraic and arithmetic manipulations to fuzzy sets. However, using extended arithmetic operations to handle fuzzy numbers increases the vagueness of results at every step of the calculation, and the shape of the membership functions is not preserved. The final results of this kind of method are fuzzy sets with membership functions that are often hard to interpret, thereby making the corresponding final linguistic variables outside the original set of linguistic terms that one starts from. In the second approach, based on using algebraic operations on the linguistic variables themselves, there is no need to manipulate any sort of membership functions at all. In the following, a summary of the contours of the symbolic approach is presented. The approach is introduced and illustrated by discussing a hypothetical situation in which state leaders have to make choices on how to build a security alignment. This is a fictitious example, hence there is no attempt to justify the posited underlying substantive assumptions for why certain variables are chosen.
The linguistic fuzzy analysis is mathematically rigorous, that is, it is built on a coherent mathematical framework of definitions, theorems, lemmas, and the like. A key idea behind this approach is to directly manipulate the available linguistic information and knowledge. In this pursuit, the first step is to choose the basic ingredients that are used in the symbolic manipulation. This means that the analyst has to choose a context-dependent linguistic term set to describe vague or imprecise information. For example, linguistic terms set for the linguistic variable Importance denoted by H(Importance), can be defined as H(Importance) = {important, not important, very important, not very important, fairly important}. Normally, in any one situation of a decision under multiple criteria, one is faced with a number of linguistic variables, not just one. It is easier to opt for the same linguistic terms set to describe a variation of the various linguistic concepts in the problem at hand, although this is not a requirement. The elements in the set will determine the level of distinction among different parts of the available information, called the granularity of uncertainty. Each value of the linguistic variables is characterized by a syntactic label and a semantic value or meaning. The label is a word or a sentence belonging to the chosen linguistic terms set. The meaning of the label is a fuzzy subset in a universe of discourse (a finite set of words and phrases). The choice of the linguistic terms set with its semantic is thus the first step of any linguistic approach to solving a problem.
Assume that the decision-maker procedures the linguistic terms to the evaluating estimates of the alternatives with reverence to different attributes individually as shown in Table 1. The relationship between the linguistic terms and the comparing TCHFNs in L TCHFN as appeared in Table 2 and Table 3.
Step 1: Define triangular cubic hesitant fuzzy Decision matrix Table 2 and Table 3.
Step 2: Get the normalized triangular cubic hesitant fuzzy decision matrix. The following normalization formula E k = ( β ¨ i j k ) n × 1 . The normalized decision matrix is presented in Table 4 and Table 5.
Hence, we acquire the standardized triangular cubic hesitant fuzzy decision matrix E = ( β ¨ i j ) n × m .
Step 3: Utilize the TCHFEHWA operator rating values in Table 6 and get the general rating value β ¨ i j as displayed in Table 7 to be compared to the alternative z i , w = ( 0.25 , 0.50 , 0.25 ) .
w = ( 0.25 , 0.25 , 0.50 )
Step 4: Calculate the scores function to aggregate the value of each alternative β ¨ i ( i = 1 , 2 , , n ) , then we have must to find out the score value of the aggregate value of each alternative. s ¨ 1 = 2.2924 9 = 0.2547 , s ¨ 2 = 3.2564 9 = 0.3618 , s ¨ 3 = 3.6926 9 = 0.4102 .
Step 5: Arrange the scores of all alternatives in the form of descending order and select that alternative which is the highest score function. Since s ¨ 3 > s ¨ 2 > s ¨ 1 , thus the most wanted alternative is s ¨ 3 .
Figure 3 is the graph illustrating the three ranking.

8. Comparison Analysis

In order to verify the validity and effectiveness of the proposed approach, a comparative study is conducted using the methods of interval-valued intuitionistic hesitant fuzzy number [25] and hesitant triangular intuitionistic fuzzy number [23], which are special cases of TCHFNs, to the same illustrative example.

8.1. A Comparison Analysis of the Existing MCDM Interval-Valued Intuitionistic Hesitant Fuzzy Number with Our Proposed Methods

An interval-valued intuitionistic hesitant fuzzy number can be considered as a special case of triangular cubic hesitant fuzzy numbers when there is the only element in membership and non-membership degree [25]. For comparison, the interval-valued intuitionistic hesitant fuzzy number can be transformed to the triangular cubic hesitant fuzzy number (TCHFN) by calculating the average value of the membership and nonmembership degrees. After transformation, the interval-valued intuitionistic hesitant fuzzy number are given in Table 8 and Table 9.
Step 1: Calculate the interval-valued intuitionistic hesitant fuzzy weighted averaging (IVIHFWA) operator ω = ( 0.3 , 0.2 , 0.5 ) T .
Step 2: Calculate the score value s 1 = 0.1553 , s 2 = 0.0705 , s 3 = 0.4855 .
Step 3: Rank all the alternatives. According to the ranking of score function S ( z i ) , the ranking is s 3 > s 1 > s 2 .
Figure 4 is the graph illustrating the position of the three scores.
The ranking of all alternatives s 3 > s 1 > s 2 and s 3 is the best selection. Obviously, the ranking is derived from the method proposed by Zhang [25], is different from the result of the proposed method. The main reasons are that an interval-valued intuitionistic hesitant fuzzy number only consider the triangular number, membership degrees of an element and nonmembership degrees, which may result in information interval-valued intuitionistic hesitant fuzzy number are not equal.

8.2. A Comparison Analysis of the Existing MCDM Hesitant Triangular Intuitionistic Fuzzy Number with Our Proposed Methods

The hesitant triangular intuitionistic fuzzy number can be considered as a special case of triangular cubic hesitant fuzzy numbers when there is the only element in membership and non-membership degree [23]. For comparison, the hesitant triangular intuitionistic fuzzy number can be transformed into the triangular cubic hesitant fuzzy number (TCHFN) by calculating the average value of the membership and nonmembership degrees. After transformation, the hesitant triangular intuitionistic fuzzy number are given in Table 10 and Table 11.
Step 1: Calculate the Hesitant triangular intutionistic fuzzy weighted geometric (HTIFWG) opeator ω = ( 0.3 , 0.2 , 0.5 ) T .
Step 2: Calculate the score value s 1 = 0.0165 , s 2 = 0.1083 , s 3 = 0.0279 .
Step 3: Rank all the alternatives. According to the ranking of score function S ( z i ) , the ranking is s 2 > s 1 > s 3 .
Figure 5 is the graph illustrating the position of the three scores. The ranking of all alternatives s 2 > s 1 > s 3 and s 2 is the best selection. Obviously, the ranking is derived from the method proposed by Chen et al. [23] in Table 12, is different from the result of the proposed method. The main reasons are that hesitant triangular intuitionistic fuzzy number only consider the triangular number, membership degrees of an element and nonmembership degrees, which may result in information hesitant triangular intuitionistic fuzzy number are not equal.
The following advantages of our proposal can be summarized on the basis of the above comparison analyses. Triangular cubic hesitant fuzzy number (TCHFN) are very suitable for illustrating uncertain or fuzzy information in MCDM problems because the membership and non-membership degrees can be two sets of several possible values, which cannot be achieved by interval-valued intuitionistic hesitant fuzzy number and intuitionistic triangular hesitant fuzzy number. On the basis of basis operations, aggregation operators and comparison method of triangular cubic hesitant fuzzy number (TCHFN) can be also used to process interval-valued intuitionistic hesitant fuzzy number and intuitionistic triangular hesitant fuzzy number after slight adjustments, because triangular cubic hesitant fuzzy number (TCHFN) can be considered as the generalized form of interval-valued intuitionistic hesitant fuzzy number and intuitionistic triangular hesitant fuzzy number. The defined operations of Triangular cubic hesitant fuzzy number (TCHFN) give us more accurate than the existing operators. This further enhanced the idea of decision making besides the established Q-fuzzy sets [44,45,46] and vague sets [47,48,49].

9. Conclusions

In this paper, we develop the new idea of triangular cubic hesitant fuzzy number and operational laws. We develop the score function S(A), accuracy function H(A), membership uncertainty index T(A) and hesitation uncertainty index G(A). We develop the Einstein operations on Triangular cubic hesitant fuzzy sets. We develop three arithmetic averaging operators, that are triangular cubic hesitant fuzzy Einstein weighted averaging (TCHFEWA) operator, triangular cubic hesitant fuzzy Einstein ordered weighted averaging (TCHFEOWA) operator and triangular cubic hesitant fuzzy Einstein hybrid weighted averaging (TCHFEHWA) operator, for gathering cubic hesitant fuzzy data. The TCHFEHWA operator simplifies both the TCHFEWA and TCHFEOWA operators. Moreover, we apply the developed aggregation operators to multiple attribute group decision-making with triangular cubic hesitant fuzzy information. We apply on the TCHFEHWA operator to multiple attribute decision making with the triangular cubic hesitant fuzzy material. Finally, a numerical example is used to illustrate the validity of the proposed approach in group decision-making problems. The advantages of this new method are that: (1) it is more reliable and reasonable to aggregate the Einstein information under the triangular cubic hesitant fuzzy numbers environment; (2) it offers an effective and powerful mathematics tool for the MADM under uncertainty and can provide more reliable and flexible aggregation results in decision making; (3) it not only considers relationships between the input arguments or the attributes, but also takes into account the correlation between input argument and itself or the interrelations between the attribute and itself, furthermore, interrelationships between input arguments or the attributes are tackled once. The new methods provide some reasonable and reliable MADM aggregation operators, which broaden the selection scope of the decision makers and offer theory Einstein for the MADM methods. In group decision-making problems, because the experts usually come from different speciality fields and have different backgrounds and levels of knowledge, they usually have diverging opinions. Thus, in future work, we will present a consensus model for group decision-making with trapezoidal cubic linguistic neutrosophic hesitant fuzzy information.

Author Contributions

All authors contributed equally.

Funding

This research was funded by Universiti Kebangsaan Malaysia- Grant No. GUP-2017-105.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Information and control. Fuzzy Sets 1965, 8, 338–353. [Google Scholar]
  3. Zadeh, L.A. Outline of a new approach to analysis of complex systems and decision processes interval-valued fuzzy sets. IEEE Trans. Syst. Man Cybern. SMC 1973, 3, 28–44. [Google Scholar] [CrossRef]
  4. Bustince, H.; Burillo, P. Structures on intuitionistic fuzzy relations. Fuzzy Sets Syst. 1996, 78, 293–303. [Google Scholar] [CrossRef]
  5. Deschrijver, G.; Kerre, E.E. On the relationship between some extensions of fuzzy set theory. Fuzzy Sets Syst. 2003, 133, 227–235. [Google Scholar] [CrossRef]
  6. Deschrijver, G.; Kerre, E.E. On the position of intuitionistic fuzzy set theory in the framework of theories modelling imprecision. Inf. Sci. 2007, 177, 1860–1866. [Google Scholar] [CrossRef]
  7. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [Google Scholar] [CrossRef]
  8. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  9. Chen, N.; Xu, Z.; Xia, M. Interval-valued hesitant preference relations and their applications to group decision making. Knowl.-Based Syst. 2013, 37, 528–540. [Google Scholar] [CrossRef]
  10. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  11. Xia, M.; Xu, Z. Hesitant fuzzy information aggregation in decision making. Int. J. Approx. Reason. 2011, 52, 395–407. [Google Scholar] [CrossRef] [Green Version]
  12. Xia, M.; Xu, Z.; Chen, N. Some hesitant fuzzy aggregation operators with their application in group decision making. Group Decis. Negot. 2013, 22, 259–279. [Google Scholar] [CrossRef]
  13. Zeng, S.; Su, W. Intuitionistic fuzzy ordered weighted distance operator. Knowl.-Based Syst. 2011, 24, 1224–1232. [Google Scholar] [CrossRef]
  14. 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]
  15. Xu, Z.; Yager, R.R. Dynamic intuitionistic fuzzy multi-attribute decision making. Int. J. Approx. Reason. 2008, 48, 246–262. [Google Scholar] [CrossRef]
  16. Zhao, X.; Lin, R.; Wei, G. Hesitant triangular fuzzy information aggregation based on Einstein operations and their application to multiple attribute decision making. Expert Syst. Appl. 2014, 41, 1086–1094. [Google Scholar] [CrossRef]
  17. Lia, J.; Zhang, X.L.; Gong, Z.T. Aggregating of Interval-valued Intuitionistic Uncertain Linguistic Variables based on Archimedean t-norm and It Applications in Group Decision Makings. J. Comput. Anal. Appl. 2018, 24, 874–885. [Google Scholar]
  18. Jun, Y.B.; Kim, C.S.; Yang, K.O. Cubic Sets. Ann. Fuzzy Math. Inform. 2011, 4, 83–98. [Google Scholar]
  19. Medina, J.; Ojeda-Aciego, M. Multi-adjoint t-concept lattices. Inf. Sci. 2010, 180, 712–725. [Google Scholar] [CrossRef]
  20. Pozna, C.; Minculete, N.; Precup, R.E.; Kóczy, L.T.; Ballagi, Á. Signatures: Definitions, operators and applications to fuzzy modelling. Fuzzy Sets Syst. 2012, 201, 86–104. [Google Scholar] [CrossRef]
  21. Jankowski, J.; Kazienko, P.; Wątróbski, J.; Lewandowska, A.; Ziemba, P.; Zioło, M. Fuzzy multi-objective modeling of effectiveness and user experience in online advertising. Expert Syst. Appl. 2016, 65, 315–331. [Google Scholar] [CrossRef]
  22. Kumar, A.; Kumar, D.; Jarial, S.K. A hybrid clustering method based on improved artificial bee colony and fuzzy C-Means algorithm. Int. J. Artif. Intell. 2017, 15, 24–44. [Google Scholar]
  23. Chen, J.; Huang, X. Hesitant Triangular Intuitionistic Fuzzy Information and Its Application to Multi-Attribute Decision Making Problem. J. Nonlinear Sci. Appl. 2017, 10, 1012–1029. [Google Scholar] [CrossRef]
  24. Xu, Z.S.; Cai, X. Recent advances in intuitionistic fuzzy information aggregation. Fuzzy Optim. Decis. Mak. 2010, 9, 359–381. [Google Scholar] [CrossRef]
  25. Zhang, Z. Interval-Valued Intuitionistic Hesitant Fuzzy Aggregation Operators and Their Application in Group Decision-Making. J. Appl. Math. 2013, 2013, 670285. [Google Scholar] [CrossRef]
  26. Fahmi, A.; Abdullah, S.; Amin, F.; Siddique, N.; Ali, A. Aggregation operators on triangular cubic fuzzy numbers and its application to multi-criteria decision making problems. J. Intell. Fuzzy Syst. 2017, 33, 3323–3337. [Google Scholar] [CrossRef]
  27. Fahmi, A.; Abdullah, S.; Amin, F.; Ali, A. Precursor Selection for Sol-Gel Synthesis of Titanium Carbide Nanopowders by a New Cubic Fuzzy Multi-Attribute Group Decision-Making Model. J. Intell. Syst. 2017. [Google Scholar] [CrossRef]
  28. Fahmi, A.; Abdullah, S.; Amin, F.; Ali, A. Weighted Average Rating (War) Method for Solving Group Decision Making Problem Using Triangular Cubic Fuzzy Hybrid Aggregation (Tcfha). Punjab Univ. J. Math. 2018, 50, 23–34. [Google Scholar]
  29. Amin, F.; Fahmi, A.; Abdullah, S.; Ali, A.; Ahmed, R.; Ghanu, F. Triangular cubic linguistic hesitant fuzzy aggregation operators and their application in group decision making. J. Intell. Fuzzy Syst. 2018, 34, 2401–2416. [Google Scholar] [CrossRef]
  30. Fahmi, A.; Abdullah, S.; Amin, F. Trapezoidal linguistic cubic hesitant fuzzy topsis method and application to group decision making program. J. New Theory 2017, 19, 27–47. [Google Scholar]
  31. Fahmi, A.; Abdullah, S.; Amin, F.; Ali, A.; Khan, W.A. Some geometric operators with Triangular Cubic Linguistic Hesitant Fuzzy number and Their Application in Group Decision-Making. J. Intell. Fuzzy Syst. 2018, 1–15. [Google Scholar] [CrossRef]
  32. Fahmi, A.; Abdullah, S.; Amin, F. Expected Values of Aggregation Operators on Cubic Trapezoidal Fuzzy Number and its Application to Multi-Criteria Decision Making Problems. J. New Theory 2018, 22, 51–65. [Google Scholar]
  33. Fahmi, A.; Abdullah, S.; Amin, F.; Khan, M.S.A. rapezoidal cubic fuzzy number einstein hybrid weighted averaging operators and its application to decision making. Soft Comput. 2018. [Google Scholar] [CrossRef]
  34. Fahmi, A.; Amin, F.; Abdullah, S.; Ali, A. Cubic fuzzy Einstein aggregation operators and its application to decision-making. Int. J. Syst.Sci. 2018, 49, 2385–2397. [Google Scholar] [CrossRef]
  35. Amin, F.; Fahmi, A.; Abdullah, S. Dealer using a new trapezoidal cubic hesitant fuzzy TOPSIS method and application to group decision-making program. Soft Comput. 2018, 1–14. [Google Scholar] [CrossRef]
  36. Pathinathan, T.; Johnson, S. Trapezoidal hesitant fuzzy multi-attribute decision making based on TOPSIS method. Int. Arch. Appl. Sci. Technol. 2015, 6, 39–49. [Google Scholar]
  37. Alcantud, J.C.R.; de Andrés Calle, R.; Torrecillas, M.J.M. Hesitant fuzzy worth: An innovative ranking methodology for hesitant fuzzy subsets. Appl. Soft Comput. 2016, 38, 232–243. [Google Scholar] [CrossRef]
  38. Farhadinia, B. A series of score functions for hesitant fuzzy sets. Inf. Sci. 2014, 277, 102–110. [Google Scholar] [CrossRef]
  39. Xia, M.; Xu, Z.; Zhu, B. Geometric Bonferroni means with their application in multi-criteria decision making. Knowl.-Based Syst. 2013, 40, 88–100. [Google Scholar] [CrossRef]
  40. Wei, G. Hesitant fuzzy prioritized operators and their application to multiple attribute decision making. Knowl.-Based Syst. 2012, 31, 176–182. [Google Scholar] [CrossRef]
  41. Xu, Z.; Xia, M. On distance and correlation measures of hesitant fuzzy information. Int. J. Intell. Syst. 2011, 26, 410–425. [Google Scholar] [CrossRef]
  42. Xu, Z.; Xia, M. Distance and similarity measures for hesitant fuzzy sets. Inf. Sci. 2011, 181, 2128–2138. [Google Scholar] [CrossRef]
  43. Li, D.; Zeng, W.; Li, J. New distance and similarity measures on hesitant fuzzy sets and their applications in multiple criteria decision making. Eng. Appl. Artif. Intell. 2015, 40, 11–16. [Google Scholar] [CrossRef]
  44. Adam, F.; Hassan, N. Q-fuzzy soft matrix and its application. AIP Conf. Proc. 2014, 1602, 772–778. [Google Scholar]
  45. Adam, F.; Hassan, N. Q-fuzzy soft set. Appl. Math. Sci. 2014, 8, 8689–8695. [Google Scholar] [CrossRef]
  46. Adam, F.; Hassan, N. Operations on Q-fuzzy soft set. Appl. Math. Sci. 2014, 8, 8697–8701. [Google Scholar] [CrossRef]
  47. Alhazaymeh, K.; Hassan, N. Vague soft set relations and functions. J. Intell. Fuzzy Syst. 2015, 28, 1205–1212. [Google Scholar]
  48. Al-Quran, A.; Hassan, N. Neutrosophic vague soft expert set theory. J. Intell. Fuzzy Syst. 2016, 30, 3691–3702. [Google Scholar] [CrossRef]
  49. Alhazaymeh, K.; Hassan, N. Mapping on generalized vague soft expert set. Int. J. Pure Appl. Math. 2014, 93, 369–376. [Google Scholar] [CrossRef]
Figure 1. Graph of functions of example 2.
Figure 1. Graph of functions of example 2.
Symmetry 10 00658 g001
Figure 2. Flowchart of the triangular cubic hesitant fuzzy information.
Figure 2. Flowchart of the triangular cubic hesitant fuzzy information.
Symmetry 10 00658 g002
Figure 3. Illustration of the ranking.
Figure 3. Illustration of the ranking.
Symmetry 10 00658 g003
Figure 4. Ranking values in the interval-valued intuitionistic hesitant fuzzy number.
Figure 4. Ranking values in the interval-valued intuitionistic hesitant fuzzy number.
Symmetry 10 00658 g004
Figure 5. Ranking values in the hesitant triangular intuitionistic fuzzy number.
Figure 5. Ranking values in the hesitant triangular intuitionistic fuzzy number.
Symmetry 10 00658 g005
Table 1. Linguistic terms of triangular cubic hesitant fuzzy values.
Table 1. Linguistic terms of triangular cubic hesitant fuzzy values.
Symmetry 10 00658 i001
Table 2. Triangular cubic hesitant fuzzy Decision matrix.
Table 2. Triangular cubic hesitant fuzzy Decision matrix.
Symmetry 10 00658 i002
Table 3. Triangular cubic hesitant fuzzy Decision matrix.
Table 3. Triangular cubic hesitant fuzzy Decision matrix.
Symmetry 10 00658 i003
Table 4. Normalized decision matrix.
Table 4. Normalized decision matrix.
Symmetry 10 00658 i004
Table 5. Normalized decision matrix table.
Table 5. Normalized decision matrix table.
Symmetry 10 00658 i005
Table 6. Rating value of the TCHFEHWA operator.
Table 6. Rating value of the TCHFEHWA operator.
Symmetry 10 00658 i006
Table 7. General rating value.
Table 7. General rating value.
Symmetry 10 00658 i007
Table 8. Interval-valued intuitionistic hesitant fuzzy decision matrix.
Table 8. Interval-valued intuitionistic hesitant fuzzy decision matrix.
Symmetry 10 00658 i008
Table 9. IVIHFWA operator.
Table 9. IVIHFWA operator.
Symmetry 10 00658 i009
Table 10. Hesitant triangular intuitionistic fuzzy decision matrix.
Table 10. Hesitant triangular intuitionistic fuzzy decision matrix.
Symmetry 10 00658 i010
Table 11. HTIFWG operator.
Table 11. HTIFWG operator.
Symmetry 10 00658 i011
Table 12. Comparison analysis with existing methods.
Table 12. Comparison analysis with existing methods.
Symmetry 10 00658 i012

Share and Cite

MDPI and ACS Style

Fahmi, A.; Amin, F.; Smarandache, F.; Khan, M.; Hassan, N. Triangular Cubic Hesitant Fuzzy Einstein Hybrid Weighted Averaging Operator and Its Application to Decision Making. Symmetry 2018, 10, 658. https://doi.org/10.3390/sym10110658

AMA Style

Fahmi A, Amin F, Smarandache F, Khan M, Hassan N. Triangular Cubic Hesitant Fuzzy Einstein Hybrid Weighted Averaging Operator and Its Application to Decision Making. Symmetry. 2018; 10(11):658. https://doi.org/10.3390/sym10110658

Chicago/Turabian Style

Fahmi, Aliya, Fazli Amin, Florentin Smarandache, Madad Khan, and Nasruddin Hassan. 2018. "Triangular Cubic Hesitant Fuzzy Einstein Hybrid Weighted Averaging Operator and Its Application to Decision Making" Symmetry 10, no. 11: 658. https://doi.org/10.3390/sym10110658

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