Next Article in Journal
Mean-Square Estimation of Nonlinear Functionals via Kalman Filtering
Previous Article in Journal
Low Complexity and High Accuracy Estimation of Frequency Offsets for OFDM-Based Cable Transmission Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hesitant Picture 2-Tuple Linguistic Aggregation Operators Based on Archimedean T-Norm and T-Conorm and Their Use in Decision-Making

1
School of Science, Dalian Maritime University, Dalian 116026, China
2
School of Information Engineering, Southwest University of Science and Technology, Mianyang 621010, China
*
Authors to whom correspondence should be addressed.
Symmetry 2018, 10(11), 629; https://doi.org/10.3390/sym10110629
Submission received: 11 October 2018 / Revised: 6 November 2018 / Accepted: 7 November 2018 / Published: 12 November 2018

Abstract

:
An aggregation operator performs the task of fusing multiple sources of information, which plays a pivotal part in realizing a collective opinion in most decision-making activities. Considering the increasing complexity of decision-making situations, it is imperative to extend aggregation operators for fusing uncertain information with the different forms of attribute values. This study focuses on the development of picture fuzzy sets and aims to design a managerial decision-making solving method. Some operational principles of hesitant picture 2-tuple linguistic variables on account of the Archimedean t-norm and t-conorm are initiated, on which two hesitant picture 2-tuple linguistic weighted operators are established by taking various weight forms. Moreover, we explore the aggregation operators’ idempotency, boundedness, and monotonicity, as well as analyze some particular forms of these operators. Furthermore, these aggregation operators are employed to design a method of deriving an overall performance from evaluation of experts with hesitant picture 2-tuple linguistic terms. An example of selecting service outsourcing supplier is carried out to show the procedures of decision-making with a detailed comparative analysis.

1. Introduction

Decision-making is a common practical activity. One of its aims is to identify the optimal option from several feasible alternatives. There are plenty of plans that involve making choices in our daily life, such as choosing a university to study abroad, recruiting excellent staff, and choosing a suitable career. Decision information is mainly derived from the preferences and judgment information of decision-makers. In the decision-making process, how to describe and fuse the judgment information of experts are two key issues. There has been an aggregation of approaches for forming preferences, which have been developed from different aspects.
In traditional decision-making approaches, decision-makers quantify their preference for each alternative in the form with precise numerical values on the feasible alternatives. Numerical representation methods play pivotal roles in characterizing the preferences of decision-makers with simple forms, which are easy to be calculated. Due to the increasing amount of uncertain and complex information in the decision-making environment, we require to deal with various uncertain types of information, which can include incomplete, imprecise, and even conflicting information [1,2,3]. Since numerical measures are insufficient for describing complex uncertainty or users’ preferences, one tends to evaluate alternatives in the form of natural language. When evaluating many multi-attribute decision-making (MADM) issues, experts are more likely to adopt linguistic values, such as ‘general’, ‘good’, and ‘very good’, to express their opinions. For example, online shopping has increased annually with the use of the Internet, and customers might rate their satisfaction with responses regarding the following aspects: high quality, high speed of delivery, convenient, and easy to return and exchange [4,5]. As shown above, customers usually express their preference information with fuzzy linguistic terms instead of numerical values. With the advent of such applications, the expression and analysis of uncertainty with linguistic terms can assist experts in making intelligent decisions by simulating human cognitive information [6,7,8,9].
Several types of fuzzy set-based methods have been introduced to better describe the judgments and preferences of experts in the form of linguistic terms. Two kinds of typical methods for capturing uncertainty information are symbolic computational methods [10,11,12,13,14] and membership function methods [15,16,17,18,19,20]. Symbolic computational methods describe linguistic terms by introducing ordinal labels and their operational principles. Membership function methods perform a cardinal representation of the linguistic term by establishing a one-to-one correlation between the initial linguistic terms and fuzzy sets. Semantically, compared with the methods mentioned later, these former methods are simpler and more direct, however, because they take a predefined linguistic term as the final operational result. This may cause information loss [21]. To address this issue, linguistic term sets and real numbers (or membership functions) have been integrated to design new methods aligning with the way of human decision-making presentation. In addition, they bring some new fusion techniques of symbolic computational methods in solving decision-making problems [22,23]. 2-Tuple linguistic variables, coined by Herrera and Martínez [24], consist of a symbolic linguistic element and a real number, which can characterize the expert’s preference with consecutive linguistic information and they can effectively avert the information loss and distortion. The 2-tuple linguistic method has been widely employed to address decision-making problems in various fields [25].
In our daily lives, situations exist that demand human opinions including more types of answers: yes, abstain, no, refusal. For example, consider an example of ten board members voting on a candidate for chairman. The voting results are divided into four groups: four suggest agreement, three offer disagreement, two choose abstaining, and one selects refusal [26]. To solve the above-mentioned situation, picture fuzzy set (PFS) was coined by Cuong [27], in which every element is associated with three functions and they can characterize the grades of membership from different aspects. Differing from traditional fuzzy sets and intuitionistic fuzzy sets, PFS performs capturing human decision opinions with more answers in the process of solving a particular problem. The main condition of PFS is that the sum of the three degrees is not to exceed one, and thus we also regard PFS as a standard neutrosophic set [28]. The development of PFS comes with a variety of progress in both new theories and practical applications. Thão and Dinh [29] studied the approximation properties of PFS by combining rough sets, which provides a new perspective for exploring the set properties of PFS. Wei [30] presented some flexible ways to deal with decision-making problems by establishing eight similarity measures between PFSs. Le et al. [31] established an original PFS inference system that improves the reasoning performance of traditional fuzzy inference systems. Dutta and Ganju [32] applied the interval-valued picture fuzzy sets to medical diagnosis based on the distance measure, which offers a new method for capturing and solving uncertainty information in clinical research.
In essence, PFS is a representation method of cognitive information based on membership functions. However, assigning values to portray the cognitive information accurately is a challenging task. In many decision-making activities, some linguistic terms are more suitable to depict the subjective imprecision of human cognition. To take full advantage of PFS and linguistic variables, Wei [33] proposed picture 2-tuple linguistic set (P2TLS), which is suitable to describe the decision-makers’ confidence level. Subsequently, the pertinent information fusion mechanism and comparison principals of P2TLS are explored in [34,35,36]. Although P2TLS has successfully addressed some decision-making problems, they still have room to enhance their effectiveness in some complex decision-making situations. P2TLS is considered as a representation mechanism of single-value information that fails to characterize the hesitant cognitive information when decision-makers facing complex situations. In this study, to deal with this issue, we introduce the concept of hesitant picture 2-tuple linguistic set (HP2TLS) based on the thoughts of intuitionistic hesitant fuzzy set [37], which not only can decrease the information loss and distortion, but also can express the degree of reliability by introducing the information about decision-makers’ confidence level.
In MADM, aggregation operators can be used to fuse different experts’ evaluation information to a group opinion or integrate values concerning different attributes into an overall performance. Different aggregation operators have been developed to serve as the corresponding specific functions, and a slew of aggregation operators have arisen within different situations. Some weighted geometric aggregation operators of 2-tuple linguistic sets were offered in [38], in which both the weights and the attribute preference values are in the form of 2-tuple linguistic information. Xu and Wang [39] introduced some power aggregation operators for taking into account the influence of all arguments under the environment of 2-tuple linguistic variables. Ge and Wei [40] came up with the hesitant 2-tuple weighted aggregation operators in the context of hesitant 2-tuple linguistic information, which consider both the weight of the linguistic information and the position weight. Wang et al. [41] considered the interrelationship of attributes and the prioritization relationship of experts in the process of decision-making by deducing the prioritized and correlated aggregation operators of hesitant 2-tuple linguistic terms. The Archimedean t-norm and t-conorm [42,43] can generalize most of the existing t-norms and t-conorms, such as algebraic and Einstein t-norms and t-conorms [44], which can be used to address the different relationships of aggregated arguments under different attributes’ values including intuitionistic fuzzy sets [45], intuitionistic fuzzy numbers [46], interval-valued fuzzy terms [47,48], single-values neutrosophic numbers [44] and 2-tuple linguistic information [49], etc. To develop more general forms of information fusion mechanisms for hesitant picture 2-tuple variables, this study is concerned with establishing new operational principles for hesitant picture 2-tuple linguistic variables and developing two aggregation operators based on Archimedean t-norm and t-conorm (ATS-HP2TWA operator, ATS-HP2TLWG operator). In addition, we introduce four specific examples of ATS-HP2TLWA and ATS-HP2TLWG operator by taking diverse forms of two auxiliary functions and develop a novel approach to address a practical MADM problem within the hesitant picture 2-tuple situation. The designed decision-making method can provide more choices for the decision-makers in the process of decision-making for reflecting their preferences in choosing aggregation functions.
The remainder of this paper is structured as follows: Section 2 presents some fundamental concepts about P2TLS and Archimedean operators. Then, we introduce the definition of HP2TLS based on P2TLS. In Section 3, some new operational principles and pertinent theorems about HP2TLS are proposed. In Section 4, some aggregation operators are introduced. In addition, their pertinent properties are also demonstrated. In Section 5, we come up with a method for MADM problems under the situation of the HP2TLS. Moreover, a detailed example is given to explain the applicability and flexibility of the aforementioned method in Section 6. Some conclusions are drawn in the final section.

2. Preliminaries

In MADM problems solving, a linguistic label with an ordered structure is usually predefined to act as a reference quantitative scale. S = { s 0 , s 1 , s 2 , , s T } is a collection of linguistic labels, where s j is a linguistic variable and satisfies the following order relationships: s i > s j , iff i > j and negative relationship n e g ( s j ) = s T j for j { 1 , 2 , , T } . To address MADM problems, Herrera and Martinez [24,25,50] introduced a novel model called 2-tuple linguistic term, which is made up of a pair of numbers ( s j , α j ) , where s j S and α j represents a real number within [ 1 2 , 1 2 ) . When the aggregated value does not precisely match the s j , α j denotes the difference between the aggregated value and s j [24].
Definition 1.
Let σ be a real number in [ 0 , T ] . σ and the 2-tuple linguistic term can be transformed by using the functions : [ 0 , T ] S × [ 1 2 , 1 2 ) and 1 : S × [ 1 2 , 1 2 ) [ 0 , T ] , which are given below [51]:
( σ ) = ( s j , α j ) ,
1 ( s j , α j ) = j + α j = σ w i t h s j , j = r o u n d ( σ ) , α j = σ j , α j [ 1 2 , 1 2 ) .
The element of the linguistic label collection S = { s 0 , s 1 , , s T } can be transformed into a 2-tuple linguistic term: A L : S S × [ 1 2 , 1 2 ) , A L ( s j ) = ( s j , 0 ) [52]. In 2017, Wei [38] put forward the fundamental idea of P2TLS, which combines PFSs [27] and 2-tuple linguistic terms for characterizing uncertainty information.
Definition 2.
Let b be a P2TLS in universe X, which is defined below [33]:
b = { ( s θ ( x ) , α ) , μ b ( x ) , η b ( x ) , ν b ( x ) | x X } ,
where s θ ( x ) S and α [ 1 2 , 1 2 ) . μ b ( x ) , η b ( x ) and ν b ( x ) are all in the unit interval [ 0 , 1 ] with 0 μ b ( x ) + η b ( x ) + ν b ( x ) 1 . μ b ( x ) , η b ( x ) and ν b ( x ) represent the grades of memberships of x to ( s θ ( x ) , α ) from positive, neutral and negative aspects, respectively.
For the sake of simplicity, b i = ( s θ ( b i ) , α b i ) , μ b i , η b i , ν b i is called a picture 2-tuple linguistic element, where μ b i , η b i , ν b i [ 0 , 1 ] , 0 μ b i + η b i + ν b i 1 , s θ ( b i ) S and α b i [ 1 2 , 1 2 ) . The collection of b i forms a HP2TLS, denoted as b = { ( s θ ( b i ) , α b i ) , μ b i , η b i , ν b i } 1 i N ( b ) , and N ( b ) stands for the elements’ number of b.
Definition 3.
Let b = { ( s θ ( b i ) , α b i ) , μ b i , η b i , ν b i } ( i = 1 , , N ( b ) ) be a HP2TLS, the score function of b is described as follows:
S C ( b ) = i = 1 N ( b ) 1 ( s θ ( b i ) , α b i ) · 1 + μ b i ν b i 2 N ( b ) .
Definition 4.
Let b = { ( s θ ( b i ) , α b i ) , μ b i , η b i , ν b i } ( i = 1 , , N ( b ) ) be a HP2TLS, the accuracy function of b is given below:
A C ( b ) = i = 1 N ( b ) 1 ( s θ ( b i ) , α b i ) · μ b i + η b i + ν b i 2 N ( b ) .
Definition 5.
Let b and e be two hesitant picture 2-tuple linguistic sets (HP2TLSs) on S = { s 0 , s 1 , s 2 , , s T } , the detailed formulas determining the order relation between b and e are listed below:
(1) 
if SC(b) < SC(e), then b < e,
(2) 
if SC(b) > SC(e), then b > e,
(3) 
when SC(b) = SC(e), and
(a) 
AC(b) = AC(e), then b = e,
(b) 
AC(b) < AC(e), then b < e,
(c) 
AC(b) > AC(e), then b > e.

3. Operational Laws of Hesitant Picture 2-Tuple Linguistic Sets

Archimedean t-norm and t-conorm emerge as the extended forms of binary operations that can induce some aggregation operators to fuse imprecise information by taking diverse forms of the additive function ϑ ( u ) and its dual function δ ( u ) = ϑ ( 1 u ) [53].
Definition 6.
Ψ : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is called a t-norm, when Ψ meets the following four requirements, for any z, z , u, v [ 0 , 1 ] [42,43]:
  • Ψ ( 1 , z ) = z .
  • Ψ ( z , u ) = Ψ ( u , z ) .
  • Ψ ( z , Ψ ( u , v ) ) = Ψ ( Ψ ( z , u ) , v ) .
  • If z < z , u v , then Ψ ( z , u ) Ψ ( z , v ) .
Definition 7.
Φ : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is called a t-conorm, when Φ meets the following four requirements, for any z, z , u, v [ 0 , 1 ] [42,43]:
  • Φ ( 0 , z ) = z .
  • Φ ( z , u ) = Φ ( u , z ) .
  • Φ ( z , Φ ( u , v ) ) = Φ ( Φ ( z , u ) , v ) .
  • If z < z , u v , then Φ ( z , u ) Φ ( z , v ) .
Definition 8.
If Ψ ( u , v ) is continuous and Ψ ( u , u ) < u for all u ( 0 , 1 ) , then Ψ ( u , v ) forms the Archimedean t-norm [42,43].
The Archimedean t-norm can be determined by a strictly decreasing additive function ϑ : [ 0 , 1 ] [ 0 , + ] , which can be described as follows:
Ψ ( u , v ) = ϑ 1 ( ϑ ( u ) + ϑ ( v ) ) ,
where ϑ 1 ( · ) is an inverse function and ϑ ( 1 ) = 0 . Similarly, the formula of Archimedean t-conorm Φ ( u , v ) is expressed below:
Φ ( u , v ) = δ 1 ( δ ( u ) + δ ( v ) ) ,
where δ ( u ) = ϑ ( 1 u ) and δ ( 0 ) = 0 . Inspired by operational principles in previous publications [45,49], in this paper, we discuss some new operational principles for HP2TLSs. To obtain the simplified operational principles, a one-to-one mapping function d ( u ) is established as follows [49]:
d ( u ) = u T ,   for   all u [ 0 , T ] , b 1 = 1 ( s θ ( b ) , α b ) , b 1 = 1 ( s θ ( b ) , α b ) .
Definition 9.
Let b = { ( s θ ( b i ) , α b i ) , μ b i , η b i , ν b i } ( i = 1 , 2 , , N ( b ) ) and b = { ( s θ ( b i ) , α b i ) , μ b i , η b i , ν b i } ( i = 1 , 2 , , N ( b ) ) be two HP2TLSs, the following formulas are considered as their operational principles:
  • Addition operation
    b b = { ( T · δ 1 ( δ [ d ( b 1 ) ] + δ [ d ( b 1 ) ] ) ) , δ 1 ( δ ( μ b ) + δ ( μ b ) ) , ϑ 1 ( ϑ ( η b ) + ϑ ( η b ) ) , ϑ 1 ( ϑ ( ν b ) + ϑ ( ν b ) ) | ( s θ ( b ) , α b ) , μ b , η b , ν b b , ( s θ ( b ) , α b ) , μ b , η b , ν b b } ;
  • Multiplication operation
    b b = { ( T · ϑ 1 ( ϑ [ d ( b 1 ) ] + ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( ϑ ( μ b ) + ϑ ( μ b ) ) , δ 1 ( δ ( η b ) + δ ( η b ) ) , δ 1 ( δ ( ν b ) + δ ( ν b ) ) | ( s θ ( b ) , α b ) , μ b , η b , ν b b , ( s θ ( b ) , α b ) , μ b , η b , ν b b } ;
  • Scalar-multiplication operation
    κ b = { ( T · δ 1 ( κ δ [ d ( b 1 ) ] ) ) , δ 1 ( κ δ ( μ b ) ) , ϑ 1 ( κ ϑ ( η b ) ) , ϑ 1 ( κ ϑ ( ν b ) ) | ( s θ ( b ) , α b ) , μ b , η b , ν b b } , κ > 0 ;
  • Exponential operation
    b κ = { ( T · ϑ 1 ( κ ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( κ ϑ ( μ b ) ) , δ 1 ( κ δ ( η b ) ) , δ 1 ( κ δ ( ν b ) ) | ( s θ ( b ) , α b ) , μ b , η b , ν b b } , κ > 0 .
In the following, some special aggregation operators are explored by taking diverse forms of additive function ϑ ( u ) and its dual function δ ( u ) = ϑ ( 1 u ) . At the same time, for the sake of simplicity, ( s θ ( b ) , α b ) , μ b , η b , ν b b and ( s θ ( b ) , α b ) , μ b , η b , ν b b are omitted in the operation process of HP2TLSs in the sequel.
Remark 1.
If ϑ ( u ) = log ( u ) , δ ( u ) = log ( 1 u ) , then one has the following results:
(1) 
b b = b 1 + b 1 b 1 · b 1 T , μ b + μ b μ b μ b , η b η b . ν b ν b .
(2) 
b b = b 1 · b 1 T , μ b μ b , η b + η b η b η b , ν b + ν b ν b ν b .
(3) 
κ b = ( T · ( 1 ( 1 b 1 T ) κ ) ) , 1 ( 1 μ b ) κ , ( η b ) κ , ( ν b ) κ , κ > 0 .
(4) 
b κ = ( ( b 1 ) κ · T 1 κ ) , μ b κ , 1 ( 1 η b ) κ , 1 ( 1 ν b ) κ , κ > 0 .
Remark 2.
If ϑ ( u ) = log 2 u u , δ ( u ) = log 2 ( 1 u ) 1 u , then the following equalities hold:
(1) 
b b = T 2 · b 1 + b 1 T 2 + b 1 · b 1 , μ b + μ b 1 + μ b μ b , η b η b 1 + ( 1 η b ) ( 1 η b ) , ν b ν b 1 + ( 1 ν b ) ( 1 ν b ) .
(2) 
b b = T · b 1 · b 1 T 2 + ( T b 1 ) ( T b 1 ) , μ b μ b 1 + ( 1 μ b ) ( 1 μ b ) , η b + η b 1 + η b η b , ν b + ν b 1 + ν b ν b .
(3) 
κ b = ( T · ( T + b 1 ) κ ( T b 1 ) κ ( T + b 1 ) κ + ( T b 1 ) κ ) , ( 1 + μ b ) κ ( 1 μ b ) κ ( 1 + μ b ) κ + ( 1 μ b ) κ , 2 η b κ ( 2 η b ) κ + η b κ , 2 ν b κ ( 2 ν b ) κ + ν b κ , κ > 0 .
(4) 
b κ = ( T · 2 ( b 1 ) κ ( 2 T b 1 ) κ + ( b 1 ) κ ) , 2 μ b κ ( 2 μ b ) κ + μ b κ , ( 1 + η b ) κ ( 1 η b ) κ ( 1 + η b ) κ + ( 1 η b ) κ , ( 1 + ν b ) κ ( 1 ν b ) κ ( 1 + ν b ) κ + ( 1 ν b ) κ , κ > 0 .
Theorem 1.
Let b and b be two HP2TLSs, and the fundamental properties of the above-mentioned operational principles are acquired as:
(1) 
b b = b b ,
(2) 
b b = b b ,
(3) 
κ ( b b ) = ( κ b ) ( κ b ) ,
(4) 
( b b ) κ = b κ ( b ) κ ,
(5) 
( κ 1 + κ 2 ) b = ( κ 1 b ) ( κ 2 b ) ,
(6) 
b κ 1 b κ 2 = b κ 1 + κ 2 .
Proof. 
(1)
b b = { ( T · δ 1 ( δ [ d ( b 1 ) ] + δ [ d ( b 1 ) ] ) ) , δ 1 ( δ ( μ b ) + δ ( μ b ) ) , ϑ 1 ( ϑ ( η b ) + ϑ ( η b ) ) , ϑ 1 ( ϑ ( ν b ) + ϑ ( ν b ) ) } , = { ( T · δ 1 ( δ [ d ( b 1 ) ] + δ [ d ( b 1 ) ] ) ) , δ 1 ( δ ( μ b ) + δ ( μ b ) ) , ϑ 1 ( ϑ ( η b ) + ϑ ( η b ) ) , ϑ 1 ( ϑ ( ν b ) + ϑ ( ν b ) ) } , = b b .
(2)
b b = { ( T · ϑ 1 ( ϑ [ d ( b 1 ) ] + ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( ϑ ( μ b ) + ϑ ( μ b ) ) , δ 1 ( δ ( η b ) + δ ( η b ) ) , δ 1 ( δ ( ν b ) + δ ( ν b ) ) } , = { ( T · ϑ 1 ( ϑ [ d ( b 1 ) ] + ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( ϑ ( μ b ) + ϑ ( μ b ) ) , δ 1 ( δ ( η b ) + δ ( η b ) ) , δ 1 ( δ ( ν b ) + δ ( ν b ) ) } , = b b .
(3)
κ ( b b ) = { ( T · δ 1 ( κ δ [ d ( T · δ 1 ( δ ( d ( b 1 ) ) + δ ( d ( b 1 ) ) ) ) ] ) ) , δ 1 ( κ δ ( δ 1 ( δ ( μ b ) + δ ( μ b ) ) ) ) , ϑ 1 ( κ ϑ ( ϑ 1 ( ϑ ( η b ) + ϑ ( η b ) ) ) ) , ϑ 1 ( κ ϑ ( ϑ 1 ( ϑ ( ν b ) + ϑ ( ν b ) ) ) ) } = { ( T · δ 1 ( κ ( δ [ d ( b 1 ) ] + δ [ d ( b 1 ) ] ) ) ) , δ 1 ( κ ( δ ( μ b ) + δ ( μ b ) ) ) , ϑ 1 ( κ ( ϑ ( η b ) + ϑ ( η b ) ) ) , ϑ 1 ( κ ( ϑ ( ν b ) + ϑ ( ν b ) ) ) } .
( κ b ) ( κ b ) = { ( T · δ 1 ( δ [ d ( T · δ 1 ( κ δ [ d ( b 1 ) ] ) ) ] + δ [ d ( T · δ 1 ( κ δ [ d ( b 1 ) ] ) ) ] ) ) , δ 1 ( δ ( δ 1 ( κ δ ( μ b ) ) ) + δ ( δ 1 ( κ δ ( μ b ) ) ) ) , ϑ 1 ( ϑ ( ϑ 1 ( κ ϑ ( η b ) ) ) + ϑ ( ϑ 1 ( κ ϑ ( η b ) ) ) ) , ϑ 1 ( ϑ ( ϑ 1 ( κ ϑ ( ν b ) ) ) + ϑ ( ϑ 1 ( κ ϑ ( ν b ) ) ) ) } = { ( T · δ 1 ( κ ( δ [ d ( b 1 ) ] + δ [ d ( b 1 ) ] ) ) ) , δ 1 ( κ ( δ ( μ b ) + δ ( μ b ) ) ) , ϑ 1 ( κ ( ϑ ( η b ) + ϑ ( η b ) ) ) , ϑ 1 ( κ ( ϑ ( ν b ) + ϑ ( ν b ) ) ) } .
By comparing the above equations, we can obtain κ ( b b ) = ( κ b ) ( κ b ) .
(4)
( b b ) κ = { ( T · ϑ 1 ( κ ϑ [ d ( T · ϑ 1 ( ϑ [ d ( b 1 ) ] + ϑ [ d ( b 1 ) ] ) ) ] ) ) , ϑ 1 ( κ ϑ ( ϑ 1 ( ϑ ( μ b ) + ϑ ( μ b ) ) ) ) , δ 1 ( κ δ ( δ 1 ( δ ( η b ) + δ ( η b ) ) ) ) , δ 1 ( κ δ ( δ 1 ( δ ( ν b ) + δ ( ν b ) ) ) ) } = { ( T · ϑ 1 ( κ ( ϑ [ d ( b 1 ) ] + ϑ [ d ( b 1 ) ] ) ) ) , ϑ 1 ( κ ( ϑ ( μ b ) + ϑ ( μ b ) ) ) , δ 1 ( κ ( δ ( η b ) + δ ( η b ) ) ) , δ 1 ( κ ( δ ( ν b ) + δ ( ν b ) ) ) } . b κ ( b ) κ = { ( T · ϑ 1 ( κ ϑ [ d ( b 1 ) ] + κ ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( κ ϑ ( μ b ) + κ ϑ ( μ b ) ) , δ 1 ( κ δ ( η b ) + κ δ ( η b ) ) , δ 1 ( κ δ ( ν b ) + κ δ ( ν b ) ) } = { ( T · ϑ 1 ( κ ( ϑ [ d ( b 1 ) ] + ϑ [ d ( b 1 ) ] ) ) ) , ϑ 1 ( κ ( ϑ ( μ b ) + ϑ ( μ b ) ) ) , δ 1 ( κ ( δ ( η b ) + δ ( η b ) ) ) , δ 1 ( κ ( δ ( ν b ) + δ ( ν b ) ) ) } , = ( b b ) κ .
(5)
Notice that
( κ 1 + κ 2 ) b = { ( T · δ 1 ( ( κ 1 + κ 2 ) δ [ d ( b 1 ) ] ) ) , δ 1 ( ( κ 1 + κ 2 ) δ ( μ b ) ) , ϑ 1 ( ( κ 1 + κ 2 ) ϑ ( η b ) ) , ϑ 1 ( ( κ 1 + κ 2 ) ϑ ( ν b ) ) } .
( κ 1 b ) ( κ 2 b ) = { ( T · δ 1 ( κ 1 δ [ d ( b 1 ) ] + κ 2 δ [ d ( b 1 ) ] ) ) , δ 1 ( κ 1 δ ( μ b ) + κ 2 δ ( μ b ) ) , ϑ 1 ( κ 1 ϑ ( η b ) + κ 2 ϑ ( η b ) ) , ϑ 1 ( κ 1 ϑ ( ν b ) + κ 2 ϑ ( ν b ) ) } = { ( T · δ 1 ( ( κ 1 + κ 2 ) δ [ d ( b 1 ) ] ) ) , δ 1 ( ( κ 1 + κ 2 ) δ ( μ b ) ) , ϑ 1 ( ( κ 1 + κ 2 ) ϑ ( η b ) ) , ϑ 1 ( ( κ 1 + κ 2 ) ϑ ( ν b ) ) } .
By comparing the above equations, we can obtain ( κ 1 + κ 2 ) b = ( κ 1 b ) ( κ 2 b ) .
(6)
Based on
b κ 1 = { ( T · ϑ 1 ( κ 1 ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( κ 1 ϑ ( μ b ) ) , δ 1 ( κ 1 δ ( η b ) ) , δ 1 ( κ 1 δ ( ν b ) ) } a n d b κ 2 = { ( T · ϑ 1 ( κ 2 ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( κ 2 ϑ ( μ b ) ) , δ 1 ( κ 2 δ ( η b ) ) , δ 1 ( κ 2 δ ( ν b ) ) } ,
the following formulas are obtained:
b κ 1 b κ 2 = { ( T · ϑ 1 ( ϑ [ d ( T · ϑ 1 ( κ 1 ϑ [ d ( b 1 ) ] ) ) ] + ϑ [ d ( T · ϑ 1 ( κ 2 ϑ [ d ( b 1 ) ] ) ) ] ) ) , ϑ 1 ( ϑ ( ϑ 1 ( κ 1 ϑ ( μ b ) ) ) + ϑ ( ϑ 1 ( κ 2 ϑ ( μ b ) ) ) ) , δ 1 ( δ ( δ 1 ( κ 1 δ ( η b ) ) ) + δ ( δ 1 ( κ 2 δ ( η b ) ) ) ) , δ 1 ( δ ( δ 1 ( κ 1 δ ( ν b ) ) ) + δ ( δ 1 ( κ 2 δ ( ν b ) ) ) ) } = { ( T · ϑ 1 ( κ 1 ϑ [ d ( b 1 ) ] + κ 2 ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( κ 1 ϑ ( μ b ) + κ 2 ϑ ( μ b ) ) , δ 1 ( κ 1 δ ( η b ) + κ 2 δ ( η b ) ) , δ 1 ( κ 1 δ ( ν b ) + κ 2 δ ( ν b ) ) } . b κ 1 + κ 2 = { ( T · ϑ 1 ( ( κ 1 + κ 2 ) ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( ( κ 1 + κ 2 ) ϑ ( μ b ) ) , δ 1 ( ( κ 1 + κ 2 ) δ ( η b ) ) , δ 1 ( ( κ 1 + κ 2 ) δ ( ν b ) ) } = { ( T · ϑ 1 ( κ 1 ϑ [ d ( b 1 ) ] + κ 2 ϑ [ d ( b 1 ) ] ) ) , ϑ 1 ( κ 1 ϑ ( μ b ) + κ 2 ϑ ( μ b ) ) , δ 1 ( κ 1 δ ( η b ) + κ 2 δ ( η b ) ) , δ 1 ( κ 1 δ ( ν b ) + κ 2 δ ( ν b ) ) } .
By using the above equations, we can obtain b κ 1 b κ 2 = b κ 1 + κ 2 .
 □

4. Some Aggregation Operators of HP2TLSs Based on Archimedean T-norm and T-conorm

In this section, according to the Archimedean t-norm and the t-conorm [42,43], some pertinent aggregation operators are deduced under the context of HP2TLS.
Definition 10.
Let b i ( i = 1 , 2 , , n ) be some HP2TLSs, which are assigned some weights w = ( w 1 , w 2 , , w n ) with w i [ 0 , 1 ] and i = 1 n w i = 1 , then the Archimedean t-norm and t-conorm based hesitant picture 2-tuple linguistic weighted averaging (ATS-HP2TLWA) operator is as follows:
ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) = b 1 , , b n i = 1 n w i b i .
Theorem 2.
Let b i ( i = 1 , 2 , , n ) be some HP2TLSs; then, the ATS-HP2TLWA operator is formulated below:
ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · δ 1 ( i = 1 n w i δ [ d ( b i 1 ) ] ) ) , δ 1 ( i = 1 n w i δ ( μ i ) ) , ϑ 1 ( i = 1 n w i ϑ ( η i ) ) , ϑ 1 ( i = 1 n w i ϑ ( ν i ) ) } ,
where ( s θ ( b i ) , α b i ) , μ i , η i , ν i b i , b i 1 = 1 ( s θ ( b i ) , α b i ) .
Next, we give a detailed study of the properties of the ATS-HP2TLWA operator.
Theorem 3.
Let b i ( i = 1 , 2 , , n ) be some HP2TLSs. Then, several properties of the ATS-HP2TLWA operator are examined below:
(1) 
(Idempotency): Let b i be some HP2TLSs, if all b i ( i = 1 , 2 , , n ) are identical, i.e., b i = b , for all i, then
ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) = b .
Proof.Let b i = b and x , μ , η , ν b , where x = ( s θ ( b ) , α b ) , for all ( i = 1 , 2 , , n ) , then we have
ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) ATS-HP 2 T L W A ( b , b , , b ) = b { ( T · δ 1 ( i = 1 n w i δ [ d ( b 1 ) ] ) ) , δ 1 ( i = 1 n w i δ ( μ ) ) , ϑ 1 ( i = 1 n w i ϑ ( η ) ) , ϑ 1 ( i = 1 n w i ϑ ( ν ) ) } = b { ( s θ ( b ) , α b ) , μ , η , ν } = b .
 □
(2) 
(Boundedness): Let b i ( i = 1 , 2 , , n ) be some HP2TLSs, if b = min { b i } and b + = max { b i } , then
b ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) b + ,
where
b = min { b i } = { min ( s θ ( b i ) , α b i ) , min ( μ i ) , max ( η i ) , max ( ν i ) | ( s θ ( b i ) , α b i ) , μ i , η i , ν i b } , b + = max { b i } = { max ( s θ ( b i ) , α b i ) , max ( μ i ) , min ( η i ) , min ( ν i ) | ( s θ ( b i ) , α b i ) , μ i , η i , ν i b } .
Proof.Since d ( u ) = u T , δ ( u ) and δ 1 ( u ) are two increasing functions, ϑ ( u ) and ϑ 1 ( u ) are two decreasing functions, then we have:
d ( b 1 ) d ( b i 1 ) . δ [ d ( b 1 ) ] δ [ d ( b i 1 ) ] i = 1 n w i δ [ d ( b 1 ) ] i = 1 n w i δ [ d ( b i 1 ) ] ( T · δ 1 ( i = 1 n w i δ [ d ( b 1 ) ] ) ) ( T · δ 1 ( i = 1 n w i δ [ d ( b i 1 ) ] ) ) .
In the same way, we can obtain δ 1 ( i = 1 n w i δ ( min ( μ i ) ) ) δ 1 ( i = 1 n w i δ ( μ i ) ) , ϑ 1 ( i = 1 n w i ϑ ( min ( η i ) ) ) ϑ 1 ( i = 1 n w i ϑ ( η i ) ) , ϑ 1 ( i = 1 n w i ϑ ( min ( ν i ) ) ) ϑ 1 ( i = 1 n w i ϑ ( ν i ) ) . According to Definition 3, 4, and 5, we can verify that b ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) . Similarity, ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) b + can be proved. Thus, the following inequality holds:
b ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) b + .
 □
(3) 
(Monotonicity): Let b i and b i ( i = 1 , 2 , , n ) be two HP2TLSs, and ( s θ ( b i ) , α b i ) , μ i , η i , ν i b i , ( s θ ( b i ) , α b i ) , μ i , η i , ν i b i . If any b i and b i satisfy ( s θ ( b i ) , α b i ) , μ i , η i , ν i ( s θ ( b i ) , α b i ) , μ i , η i , ν i , then
ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) .
Proof. 
Since d ( u ) = u T , δ ( u ) and δ 1 ( u ) are two increasing functions, then ϑ ( u ) and ϑ 1 ( u ) are two decreasing functions. If any b i and b i satisfy b i b i , then we can obtain the following:
( s θ ( b i ) , α b i ) , μ i , η i , ν i ( s θ ( b i ) , α b i ) , μ i , η i , ν i ( s θ ( b i ) , α b i ) ( s θ ( b i ) , α b i ) , μ i μ i , η i η i , ν i ν i d ( b i 1 ) d ( b i 1 ) δ [ d ( b i 1 ) ] δ [ d ( b i 1 ) ] i = 1 n w i δ [ d ( b i 1 ) ] i = 1 n w i δ [ d ( b i 1 ) ] ( T · δ 1 ( i = 1 n w i δ [ d ( b i 1 ) ] ) ) ( T · δ 1 ( i = 1 n w i δ [ d ( b i 1 ) ] ) ) .
Similarly, we can obtain δ 1 ( i = 1 n w i δ ( μ i ) ) δ 1 ( i = 1 n w i δ ( μ i ) ) , ϑ 1 ( i = 1 n w i ϑ ( η i ) ) ϑ 1 ( i = 1 n w i ϑ ( η i ) ) , ϑ 1 ( i = 1 n w i ϑ ( ν i ) ) ϑ 1 ( i = 1 n w i ϑ ( ν i ) ) .
According to Definitions (3)–(5), we can get
ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) ATS-HP 2 T L W A ( b 1 , b 2 , , b n ) .
 □
Remark 3.
If ϑ ( u ) = log ( u ) , δ ( u ) = log ( 1 u ) , then the ATS-HP2TLWA operator is simplified to the weighted averaging operator of HP2TLSs (HP2TLWA),
H P 2 T L W A ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · ( 1 i = 1 n ( 1 d ( b i 1 ) ) w i ) ) , 1 i = 1 n ( 1 μ i ) w i , i = 1 n η i w i , i = 1 n ν i w i } .
Remark 4.
If ϑ ( u ) = log 2 u u , δ ( u ) = log 2 ( 1 u ) 1 u , then the ATS-HP2TLWA operator is simplified to the Einstein weighted averaging operator of HP2TLSs (EHP2TLWA),
E H P 2 T L W A ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · i = 1 n ( 1 + d ( b i 1 ) ) w i i = 1 n ( 1 d ( b i 1 ) ) w i i = 1 n ( 1 + d ( b i 1 ) ) w i + i = 1 n ( 1 d ( b i 1 ) ) w i ) , i = 1 n ( 1 + μ i ) w i i = 1 n ( 1 μ i ) w i i = 1 n ( 1 + μ i ) w i + i = 1 n ( 1 μ i ) w i , 2 i = 1 n η i w i i = 1 n ( 2 η i ) w i + i = 1 n η i w i , 2 i = 1 n ν i w i i = 1 n ( 2 ν i ) w i + i = 1 n ν i w i } .
Remark 5.
If ϑ ( u ) = log γ + ( 1 γ ) u u , δ ( u ) = log 1 ( 1 γ ) u 1 u and γ > 0 , then the ATS-HP2TLWA operator is simplified to the Hamacher weighted averaging operator of HP2TLSs (HHP2TLWA),
H H P 2 T L W A ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · i = 1 n ( 1 + ( γ 1 ) d ( b i 1 ) ) w i i = 1 n ( 1 d ( b i 1 ) ) w i i = 1 n ( 1 + ( γ 1 ) d ( b i 1 ) ) w i + ( γ 1 ) i = 1 n ( 1 d ( b i 1 ) ) w i ) , i = 1 n ( 1 + ( γ 1 ) μ i ) w i i = 1 n ( 1 μ i ) w i i = 1 n ( 1 + ( γ 1 ) μ i ) w i + ( γ 1 ) i = 1 n ( 1 μ i ) w i , γ i = 1 n η i w i i = 1 n ( 1 + ( γ 1 ) ( 1 η i ) ) w i + ( γ 1 ) i = 1 n η i w i , γ i = 1 n ν i w i i = 1 n ( 1 + ( γ 1 ) ( 1 ν i ) ) w i + ( γ 1 ) i = 1 n ν i w i } .
Remark 6.
If ϑ ( u ) = log γ 1 γ u 1 , δ ( u ) = log γ 1 γ 1 u 1 and γ > 0 , then the ATS-HP2TLWA is simplified to the Frank weighted averaging operator of HP2TLSs (FHP2TLWA),
F H P 2 T L W A ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · ( 1 log γ ( 1 + i = 1 n ( γ 1 d ( b i 1 ) 1 ) w i γ 1 ) ) ) , 1 log γ ( 1 + i = 1 n ( γ 1 μ i 1 ) w i γ 1 ) , log γ ( 1 + i = 1 n ( γ η i 1 ) w i γ 1 ) , log γ ( 1 + i = 1 n ( γ ν i 1 ) w i γ 1 ) } .
Definition 11.
Let b i ( i = 1 , 2 , , n ) be some HP2TLSs, which are assigned some weights w defined in Definition (10), then the Archimedean t-norm and t-conorm based hesitant picture 2-tuple linguistic weighted geometric (ATS-HP2TLWG) operator is as follows:
ATS-HP 2 T L W G ( b 1 , b 2 , , b n ) = b 1 , , b n i = 1 n b i w i .
Theorem 4.
Let b i ( i = 1 , 2 , , n ) be some HP2TLSs, then the ATS-HP2TLWG operator is formulated as follows:
ATS-HP 2 T L W G ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · ϑ 1 ( i = 1 n w i ϑ [ d ( b i 1 ) ] ) ) , ϑ 1 ( i = 1 n w i ϑ ( μ i ) ) , δ 1 ( i = 1 n w i δ ( η i ) ) , δ 1 ( i = 1 n w i δ ( ν i ) ) } .
Similarly, we can see that the ATS-HP2TLWG operator meets idempotency, boundedness, and monotonicity as well. Additionally, we explore several particular examples of the ATS-HP2TLWG operator for the diverse forms of function ϑ ( u ) and its dual function δ ( u ) .
Remark 7.
If ϑ ( u ) = log ( u ) , δ ( u ) = log ( 1 u ) , then the ATS-HP2TLWG operator is simplified to the weighted geometric operator of HP2TLSs (HP2TLWG),
H P 2 T L W G ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · ( i = 1 n ( d ( b i 1 ) ) w i ) ) , i = 1 n μ i w i , 1 i = 1 n ( 1 η i ) w i , 1 i = 1 n ( 1 ν i ) w i } .
Remark 8.
If ϑ ( u ) = log 2 u u , δ ( u ) = log 2 ( 1 u ) 1 u , then the ATS-HP2TLWG operator is simplified to the Einstein weighted geometric operator of HP2TLSs (EHP2TLWG),
E H P 2 T L W G ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · 2 i = 1 n ( d ( b i 1 ) ) w i i = 1 n ( 2 d ( b i 1 ) ) w i + i = 1 n ( d ( b i 1 ) ) w i ) , 2 i = 1 n μ i w i i = 1 n ( 2 μ i ) w i + i = 1 n μ i w i , i = 1 n ( 1 + η i ) w i i = 1 n ( 1 η i ) w i i = 1 n ( 1 + η i ) w i + i = 1 n ( 1 η i ) w i , i = 1 n ( 1 + ν i ) w i i = 1 n ( 1 ν i ) w i i = 1 n ( 1 + ν i ) w i + i = 1 n ( 1 ν i ) w i } .
Remark 9.
If ϑ ( u ) = log γ + ( 1 γ ) u u , δ ( u ) = log 1 ( 1 γ ) u 1 u and γ > 0 , then the ATS-HP2TLWG operator is simplified to the Hamacher weighted geometric operator of HP2TLSs (HHP2TLWG),
H H P 2 T L W G ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · γ i = 1 n ( d ( b i 1 ) ) w i i = 1 n ( 1 + ( γ 1 ) d ( b i 1 ) ) w i + ( γ 1 ) i = 1 n ( 1 d ( b i 1 ) ) w i ) , γ i = 1 n μ i w i i = 1 n ( 1 + ( γ 1 ) ( 1 μ i ) ) w i + ( γ 1 ) i = 1 n μ i w i , i = 1 n ( 1 + ( γ 1 ) η i ) w i i = 1 n ( 1 η i ) w i i = 1 n ( 1 + ( γ 1 ) η i ) w i + ( γ 1 ) i = 1 n ( 1 η i ) w i , i = 1 n ( 1 + ( γ 1 ) ν i ) w i i = 1 n ( 1 ν i ) w i i = 1 n ( 1 + ( γ 1 ) ν i ) w i + ( γ 1 ) i = 1 n ( 1 ν i ) w i } .
Remark 10.
If ϑ ( u ) = log γ 1 γ u 1 , δ ( u ) = log γ 1 γ 1 u 1 and γ > 0 , then the ATS-HP2TLWA operator is simplified to the Frank weighted geometric operator of HP2TLSs (FHP2TLWG),
F H P 2 T L W G ( b 1 , b 2 , , b n ) = b 1 , , b n { ( T · log γ ( 1 + i = 1 n ( γ d ( b i 1 ) 1 ) w i γ 1 ) ) , log γ ( 1 + i = 1 n ( γ μ i 1 ) w i γ 1 ) , 1 log γ ( 1 + i = 1 n ( γ 1 η i 1 ) w i γ 1 ) , 1 log γ ( 1 + i = 1 n ( γ 1 ν i 1 ) w i γ 1 ) } .

5. A Novel Method of Solving MADM Problems

In this section, the detailed steps of solving MADM problems under the situation of HP2TLS are elaborated. Let D = { D 1 , D 2 , , D m } be a collection of m alternatives and C = { C 1 , C 2 , , C n } be a collection of n attributes and its corresponding weight vector w defined in Definition (10). Suppose that R = ( r i j ) m × n is the judgment information matrix, where r i j is an HP2TLS that represents the evaluation information of the alternative D i with regards to the attribute C j .
Step 1: Obtain the judgment information matrix:
R = ( r i j ) m × n .
Step 2: Fuse all values r i j ( j = 1 , 2 , n ) of each alternative D i by using the ATS-HP2TLWA operator or the ATS-HP2TLWG operator. Then, we can obtain the collective results:
r i = ATS-HP 2 T L W A ( r i 1 , r i 2 , , r i n ) = r i 1 , , r i n { ( T · δ 1 ( j = 1 n w j δ [ d ( r i j 1 ) ] ) ) , δ 1 ( j = 1 n w j δ ( μ i j ) ) , ϑ 1 ( j = 1 n w j ϑ ( η i j ) ) , ϑ 1 ( j = 1 n w j ϑ ( ν i j ) ) }
or
r i = ATS-HP 2 T L W G ( r i 1 , r i 2 , , r i n ) = r i 1 , , r i n { ( T · ϑ 1 ( j = 1 n w j ϑ [ d ( r i j 1 ) ] ) ) , ϑ 1 ( j = 1 n w j ϑ ( μ i j ) ) , δ 1 ( j = 1 n w j δ ( η i j ) ) , δ 1 ( j = 1 n w j δ ( ν i j ) ) } .
Step 3: Rank r i ( i = 1 , , 5 ) according to descending order with respect to the values derived from Definitions (3)–(5), and the ideal alternative can be derived.

6. Application of the Designed Method and Discussion

We select an example [33] to show the practicality of the designed method. Outsourcing a common business activity in which partial job functions are farmed out to a third party. The scope of internal core technology service outsourcing projects is expanding. When enterprises face competitions and challenges, it is necessary to to collaborate with other parties for sharing the resources and profits. Therefore, choosing the right outsourcing suppliers become a key foundation for enterprises development. This study aims to design a practical method for the identification of technical service outsourcing suppliers under the situation of hesitant picture 2-tuple linguistic information.
There are five potential service outsourcing suppliers for a communications industry D i ( i = 1 , 2 , 3 , 4 , 5 ) . A team of experts is invited for identifying the most appropriate choice from the five possible service outsourcing suppliers by considering four attributes, which include commercial integrity ( C 1 ), technical level ( C 2 ), management quality ( C 3 ), and service performance ( C 4 ). At the same time, the attributes’ weights are set to w = ( 0.2 , 0.1 , 0.3 , 0.4 ) . Later, based on the judgment information provided by experts, the judgment information matrix R = ( r i j ) 5 × 4 can be constructed. The linguistic term set is taken as S = { s 0 e x t r e m e l y b a d , s 1 v e r y b a d , s 2 b a d , s 3 m e d i u m , s 4 g o o d , s 5 v e r y g o o d , s 6 e x t r e m e l y g o o d } .
Next, we apply the designed method in Section 5 to solve the above-mentioned problem to obtain the ideal solution.
Step 1: Obtain the judgment information matrix, which is delineated in Table 1.
Step 2: Employ the ATS-HP2TLWA operator or the ATS-HP2TLWG operator to aggregate all attributes of D i ( i = 1 , 2 , 3 , 4 , 5 ) . Then, collective results of the two operators are given in Table 2 and Table 3, separately. Through Table 2, we can find that EHP2TLWA operator is a special form of HHP2TLWA operator. When γ = 2 , HHP2TLWA operator degenerates into an EHP2TLWA operator.
Step 3: Obtain score values and sort the alternatives in accordance with Definitions (3)–(5), and the results of two operators are presented in Table 4 and Table 5, separately.
To further explore the effects of a parameter in the HHP2TLWA operator, the FHP2TLWA operator, the HHP2TLWG operator, and the FHP2TLWG operator, we observe changes of score values with γ increasing, and the analysis results are displayed in Figure 1, Figure 2, Figure 3 and Figure 4, separately.
In Figure 1, the score values of the alternatives, which are received by the HHP2TLWA operator, keep a smaller variability. As γ is increasing from 1 to 51, we indicate that score values of the five alternatives D i ( i = 1 , 2 , 3 , 4 , 5 ) are decreasing, but the ranking results always keep r 5 > r 3 > r 2 > r 1 > r 4 . In addition, when γ is greater than 20, the score values of D 2 and D 3 are almost overlapping. Figure 2 displays the score values of each alternative derived from the FHP2TLWA operator. As γ is increasing from 1 to 51, the score values of alternatives are increasing and keep a greater variability. D 2 , D 3 , and D 5 are almost overlapping, when γ reaches 30, but the ranking result r 5 > r 3 > r 2 > r 1 > r 4 remains unchanged. Figure 3 represents the changing trajectory of the HHP2TLWG operator score values. All score values of the alternatives are increasing with γ changing. When γ reaches 30, D 2 and D 3 are almost overlapping, but ranking order of the alternatives remains r 5 > r 2 > r 3 > r 1 > r 4 . Figure 4 notes the score values of five alternatives D i ( i = 1 , 2 , 3 , 4 , 5 ) achieved by the FHP2TLWG operator. When the value of γ is larger than 2.6, the score values of alternatives tend to zero. Therefore, the range of parameter values is between 1.5 and 2.6. By carefully analyzing Figure 4, it can be observed that the higher the value of γ is, the lower the score values are of each alternative. However, the order of relations among alternatives holds r 5 > r 2 > r 3 > r 1 > r 4 , and when γ is greater than 2, the score values of D 2 , D 3 , and D 5 are almost overlapping.
From the above analysis, it is clear that the score values of the five alternatives D i ( i = 1 , 2 , 3 , 4 , 5 ) change as γ changed. However, the ranking results of the alternatives do not change in the HHP2TLWA operator, the FHP2TLWA operator, HHP2TLWG operator and the FHP2TLWG operator. Consequently, this means that the ranking result basically remains constant with the parameter γ changing in the preceding four operators.

7. Conclusions

In this study, we extended the Archimedean t-norm and t-conorm into the context of HP2TLS, aimed at developing the approaches of information fusion with HP2TLSs. Firstly, some new operational principles about HP2TLSs were derived. Subsequently, we introduced two new aggregation operators, called the ATS-HP2TLWA operator and the ATS-HP2TLWG operator, based on new operational principles. In addition, we demonstrated the aggregation operators’ properties. Meanwhile, some specific examples were examined based on assigning different functions in the ATS-HP2TLWA and the ATS-HP2TLWG operators. A method for identifying the ideal alternative was also designed regarding the introduced operators. A single example was applied to highlight the applicability and flexibility of the improved decision-making method. Futhermore, in four specific aggregation operators, we gave a detailed discussion comparing the changing trends of the score values and the ideal option with γ changing.

Author Contributions

Funding acquisition, L.W. and X.F.; Methodology, Y.W.; Supervision, L.W.; Validation, X.F. and H.W.; Visualization, H.W.; Writing-original draft, Y.W.; Writing-review & editing, L.W. and X.F.

Funding

This work is supported by the Natural Science Foundation of China (Nos. 61773352, 61803065), the National Nuclear Energy Development Project of China (No. 18zg6103), the Science and Technology Planning Project of Sichuan Province (2018JY0522) and the Fundamental Research Funds for the Central Universities (Nos. 3132018225, 3132016306).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Park, J.H.; Kwun, Y.C.; Son, M.J. A generalized intuitionistic fuzzy soft set theoretic approach to decision making problems. Int. J. Fuzzy Logic Intell. Syst. 2011, 11, 71–76. [Google Scholar] [CrossRef]
  2. Xiao, G.Q.; Li, K.L.; Li, K.Q. Reporting/most influential objects in uncertain databases based on probabilistic reverse top-k queries. Inf. Sci. 2017, 405, 207–226. [Google Scholar] [CrossRef]
  3. Xiao, G.Q.; Li, K.L.; Zhou, X.; Li, K.Q. Efficient monochromatic and bichromatic probabilistic reverse top-k query processing for uncertain big data. J. Comput. Syst. Sci. 2017, 89, 92–113. [Google Scholar] [CrossRef]
  4. Shenbaga, T.S. A study on the customer satisfaction towards online shopping. Sumedha J. Manag. 2015, 4, 4–15. [Google Scholar]
  5. Trong, V.H.; Tan, N.; Khanh, V.; Gim, G. Evaluating factors influencing consumer satisfaction towards online shopping in viet nam. J. Emerg. Trends Comput. Inf. Sci. 2014, 5, 67–71. [Google Scholar]
  6. Akusok, A.; Miche, Y.; Hegedus, J.; Rui, N.; Lendasse, A. A two-stage methodology using K-NN and false-positive minimizing ELM for nominal data classification. Cognit. Comput. 2014, 6, 432–445. [Google Scholar] [CrossRef]
  7. Czubenko, M.; Kowalczuk, Z.; Ordys, A. Autonomous driver based on an intelligent system of decision-making. Cognit. Comput. 2015, 7, 569–581. [Google Scholar] [CrossRef] [PubMed]
  8. Meng, F.Y.; Chen, X.H. Correlation coefficients of hesitant fuzzy sets and their application based on fuzzy measures. Cognit. Comput. 2015, 7, 445–463. [Google Scholar] [CrossRef]
  9. Yang, J.; Gong, L.Y.; Tang, Y.F.; Yan, J.; He, H.B.; Zhang, L.Q.; Li, G. An improved SVM-based cognitive diagnosis algorithm for operation states of distribution grid. Cognit. Comput. 2015, 7, 582–593. [Google Scholar] [CrossRef]
  10. Herrera, F.; Herrera-Viedma, E. Choice functions and mechanisms for linguistic preference relations. Eur. J. Oper. Res. 2000, 120, 144–161. [Google Scholar] [CrossRef]
  11. Herrera, F.; Herrera-Viedma, E. Linguistic decision analysis: Steps for solving decision problems under linguistic information. Fuzzy Sets Syst. 2000, 115, 67–82. [Google Scholar] [CrossRef]
  12. Herrera, F.; Herrera-Viedma, E.; Verdegay, J.L. A model of consensus in group decision making under linguistic assessments. Fuzzy Sets Syst. 1996, 78, 73–87. [Google Scholar] [CrossRef]
  13. Wu, Q.; Wang, F.; Zhou, L.G.; Chen, H.Y. Method of multiple attribute group decision making based on 2-dimension interval type-2 fuzzy aggregation operators with multi-granularity linguistic information. Int. J. Fuzzy Syst. 2017, 19, 1880–1903. [Google Scholar] [CrossRef]
  14. Xu, Z.S. A method based on linguistic aggregation operators for group decision making with linguistic preference relations. Inf. Sci. 2014, 166, 19–30. [Google Scholar] [CrossRef]
  15. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 2012, 20, 87–96. [Google Scholar] [CrossRef]
  16. Kim, T.; Sotirova, E.; Shannon, A.; Atanassova, V.; Atanassov, K.; Jang, L. Interval valued intuitionistic fuzzy evaluations for analysis of a student’s knowledge in university e-learning courses. Int. J. Fuzzy Logic Intell. Syst. 2018, 18, 190–195. [Google Scholar] [CrossRef]
  17. Qin, J.D.; Liu, X.W.; Pedrycz, W. A multiple attribute interval type-2 fuzzy group decision making and its application to supplier selection with extended LINMAP method. Soft Comput. 2017, 21, 3207–3226. [Google Scholar] [CrossRef]
  18. Xia, M.M.; Xu, Z.S. Hesitant fuzzy information aggregation in decision making. Int. J. Approx. Reason. 2011, 52, 395–407. [Google Scholar] [CrossRef] [Green Version]
  19. Xia, M.M.; Xu, Z.S.; Chen, N. Some hesitant fuzzy aggregation operators with their application in group decision making. Group Decis. Negot. 2013, 22, 259–279. [Google Scholar] [CrossRef]
  20. Zadeh, L.A. Fuzzy Sets, Fuzzy logic, & Fuzzy Systems. Fuzzy Sets 1996, 8, 394–432. [Google Scholar]
  21. Martínez, L.; Rodriguez, R.M.; Herrera, F. The 2-Tuple Linguistic Model-Computing with Words in Decision Making; Springer Publishing Company: New York, NY, USA, 2015. [Google Scholar]
  22. Chen, Z.C.; Liu, P.H.; Pei, Z. An approach to multiple attribute group decision making based on linguistic intuitionistic fuzzy numbers. Int. J. Comput. Intell. Syst. 2015, 8, 747–760. [Google Scholar] [CrossRef] [Green Version]
  23. Wang, J.Q.; Li, H.B. Multi-criteria decision-making method based on aggregation operators for intuitionistic linguistic fuzzy numbers. Control Decis. 2010, 25, 1571–1574. [Google Scholar]
  24. Herrera, F.; Martinez, L. A 2-tuple fuzzy linguistic representation model for computing with words. IEEE Trans. Fuzzy Syst. 2000, 8, 746–752. [Google Scholar]
  25. Herrera, F.; Martinez, L. A model based on linguistic 2-tuples for dealing with multigranular hierarchical linguistic contexts in multi-expert decision-making. IEEE Trans. Syst. Man Cybern. Part B Cybern. 2000, 31, 227–234. [Google Scholar] [CrossRef] [PubMed]
  26. Wang, R.; Li, Y.L. Picture hesitant fuzzy set and its application to multiple criteria decision-making. Symmetry 2018, 10. [Google Scholar] [CrossRef]
  27. Cuong, B.C. Picture fuzzy sets-first results: Part 1. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  28. Cuong, B.C.; Prhong, P.H.; Smarandache, F. Smarandache. Standard neutrosophic soft theory: Some first results. Neutrosophic Sets Syst. 2016, 12, 80–91. [Google Scholar]
  29. Thão, N.X.; Dinh, N.V. Rough picture fuzzy set and picture fuzzy topologies. J. Comput. Sci. Cybern. 2015, 31, 245–253. [Google Scholar]
  30. Wei, G.W. Some cosine similarity measures for picture fuzzy sets and their applications to strategic decision making. Informatica 2017, 28, 547–564. [Google Scholar] [CrossRef]
  31. Le, H.S.; Viet, P.V.; Hai, P.V. Picture inference system: A new fuzzy inference system on picture fuzzy set. Appl. Intell. 2017, 46, 652–669. [Google Scholar]
  32. Dutta, P.; Ganju, S. Application of interval valued picture fuzzy set in medical diagnosis. In Proceedings of the 19th International Conference on Knowledge Discovery and Fuzzy Systems, Mumbai, India, 7–8 February 2017. [Google Scholar]
  33. Wei, G.W. Picture 2-tuple linguistic Bonferroni mean operators and their application to multiple attribute decision making. Int. J. Fuzzy Syst. 2017, 19, 997–1010. [Google Scholar] [CrossRef]
  34. Nie, R.X.; Wang, J.Q.; Wang, T.L. A hybrid outranking method for greenhouse gas emissions’ institution selection with picture 2-tuple linguistic information. Comput. Appl. Math. 2018. [Google Scholar] [CrossRef]
  35. Wei, G.W.; Alsaadi, F.E.; Hayat, T.; Alsaedi, A. Picture 2-tuple linguistic aggregation operators in multiple attribute decision making. Soft Comput. 2018, 22, 989–1002. [Google Scholar] [CrossRef]
  36. Zhang, X.Y.; Wang, J.Q.; Hu, J.H. On novel operational laws and aggregation operators of picture 2-tuple linguistic information for MCDM problems. Int. J. Fuzzy Syst. 2018, 20, 958–969. [Google Scholar] [CrossRef]
  37. Beg, I.; Rashid, T. Group decision making using intuitionistic hesitant fuzzy sets. Int. J. Fuzzy Logic Intell. Syst. 2014, 14, 181–187. [Google Scholar] [CrossRef]
  38. Wei, G.W. A method for multiple attribute group decision making based on the ET-WG and ET-OWG operators with 2-tuple linguistic information. Exp. Syst. Appl. 2010, 37, 7895–7900. [Google Scholar] [CrossRef]
  39. Xu, Y.J.; Wang, H.M. Approaches based on 2-tuple linguistic power aggregation operators for multiple attribute group decision making under linguistic environment. Soft Comput. 2011, 11, 3988–3997. [Google Scholar] [CrossRef]
  40. Ge, S.N.; Wei, C.P. A hesitant fuzzy language decision making method based on 2-tuple. Oper. Res. Manag. Sci. 2017, 26, 108–114. (In Chinese) [Google Scholar]
  41. Wang, L.D.; Wang, Y.J.; Liu, X.D. Prioritized aggregation operators and correlated aggregation operators for hesitant 2-tuple linguistic variables. Symmetry 2018, 10. [Google Scholar] [CrossRef]
  42. Klir, G.J.; Yuan, B. Fuzzy sets and fuzzy logic: Theory and applications. Prent. Hall 1995, 1, 283–287. [Google Scholar]
  43. Nguyen, H.T.; Walker, E.A. A First Course in Fuzzy Logic; CRC Press: Boca Raton, FL, USA, 1997. [Google Scholar]
  44. Liu, P.D. The aggregation operators based on Archimedean t-conorm and t-norm for single-valued neutrosophic numbers and their application to decision making. Int. J. Fuzzy Syst. 2016, 18, 849–863. [Google Scholar] [CrossRef]
  45. Xia, M.M.; Xu, Z.S.; Zhu, B. Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm. Knowl. Based Syst. 2012, 31, 78–88. [Google Scholar] [CrossRef]
  46. Liu, P.D.; Chen, S.M. Heronian aggregation operators of intuitionistic fuzzy numbers based on the Archimedean t-norm and t-conorm. In Proceedings of the 2016 International Conference on Machine Learning & Cybernetics, Jeju, Korea, 10–13 July 2016; pp. 686–691. [Google Scholar]
  47. Yu, D. Group decision making under interval-valued multiplicative intuitionistic fuzzy environment based on Archimedean t-conorm and t-norm. Int. J. Intell. Syst. 2015, 30, 590–616. [Google Scholar] [CrossRef]
  48. Zhang, Z.M.; Wu, C. Some interval-valued hesitant fuzzy aggregation operators based on Archimedean t-norm and t-conorm with their application in multi-criteria decision making. Int. J. Intell. Syst. 2014, 27, 2737–2748. [Google Scholar]
  49. Tao, Z.F.; Chen, H.Y.; Zhou, L.G.; Liu, J.P. On new operational laws of 2-tuple linguistic information using Archimedean t-norm and s-norm. Knowl. Based Syst. 2014, 66, 156–165. [Google Scholar] [CrossRef]
  50. Herrera, F.; Martinez, L. An approach for combining linguistic and numerical information based on the 2-tuple fuzzy linguistic representation model in decision-making. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 2000, 8, 539–562. [Google Scholar] [CrossRef]
  51. Yang, W.; Chen, Z.P. New aggregation operators based on the Choquet integral and 2-tuple linguistic information. Expert Syst. Appl. 2012, 39, 2662–2668. [Google Scholar] [CrossRef]
  52. Zhang, W.C.; Xu, Y.J.; Wang, H.M. A consensus reaching model for 2-tuple linguistic multiple attribute group decision making with incomplete weight information. Int. J. Syst. Sci. 2016, 47, 389–405. [Google Scholar] [CrossRef]
  53. Zhang, Z.M. Archimedean operations-based interval-valued hesitant fuzzy ordered weighted operators and their application to multi-criteria decision making. Br. J. Math. Comput. Sci. 2016, 17, 1–34. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Variation of ranking with γ in the HHP2TLWA operator.
Figure 1. Variation of ranking with γ in the HHP2TLWA operator.
Symmetry 10 00629 g001
Figure 2. Variation of ranking with γ in the FHP2TLWA operator.
Figure 2. Variation of ranking with γ in the FHP2TLWA operator.
Symmetry 10 00629 g002
Figure 3. Variation of ranking with γ in the HHP2TLWG operator.
Figure 3. Variation of ranking with γ in the HHP2TLWG operator.
Symmetry 10 00629 g003
Figure 4. Variation of ranking with γ in the FHP2TLWG operator.
Figure 4. Variation of ranking with γ in the FHP2TLWG operator.
Symmetry 10 00629 g004
Table 1. Hesitant picture 2-tuple linguistic decision matrix.
Table 1. Hesitant picture 2-tuple linguistic decision matrix.
C 1 C 2
D 1 { ( s 4 , 0 ) , 0.53 , 0.33 , 0.09 } { ( s 2 , 0 ) , 0.89 , 0.08 , 0.03 ,
( s 3 , 0 ) , 0.75 , 0.05 , 0.06 }
D 2 { ( s 1 , 0 ) , 0.73 , 0.12 , 0.08 } { ( s 4 , 0 ) , 0.13 , 0.64 , 0.21 }
D 3 { ( s 5 , 0 ) , 0.91 , 0.03 , 0.02 } { ( s 1 , 0 ) , 0.07 , 0.09 , 0.05 }
D 4 { ( s 5 , 0 ) , 0.85 , 0.09 , 0.05 , { ( s 5 , 0 ) , 0.74 , 0.16 , 0.10 }
( s 4 , 0 ) , 0.54 , 0.35 , 0.11 }
D 5 { ( s 5 , 0 ) , 0.90 , 0.05 , 0.02 , { ( s 1 , 0 ) , 0.68 , 0.08 , 0.21 }
( s 6 , 0 ) , 0.91 , 0.03 , 0.02 }
C 3 C 4
D 1 { ( s 1 , 0 ) , 0.73 , 0.12 , 0.08 } { ( s 4 , 0 ) , 0.13 , 0.64 , 0.21 }
D 2 { ( s 3 , 0 ) , 0.03 , 0.82 , 0.13 , { ( s 4 , 0 ) , 0.73 , 0.15 , 0.08 }
( s 4 , 0 ) , 0.74 , 0.15 , 0.11 }
D 3 { ( s 4 , 0 ) , 0.04 , 0.85 , 0.1 } { ( s 2 , 0 ) , 0.68 , 0.26 , 0.06 ,
( s 3 , 0 ) , 0.75 , 0.08 , 0.06 }
D 4 { ( s 3 , 0 ) , 0.02 , 0.89 , 0.05 } { ( s 1 , 0 ) , 0.08 , 0.84 , 0.06 }
D 5 { ( s 3 , 0 ) , 0.05 , 0.87 , 0.06 , { ( s 4 , 0 ) , 0.13 , 0.75 , 0.09 }
( s 4 , 0 ) , 0.68 , 0.26 , 0.06 }
Table 2. The aggregated information based on the ATS-HP2TLWA operator.
Table 2. The aggregated information based on the ATS-HP2TLWA operator.
HP2TLWA OperatorEHP2TLWA Operator
D 1 { ( s 3 , 0.1783 ) , 0.5597 , 0.2756 , 0.1092 , { ( s 3 , 0.0832 ) , 0.5307 , 0.2913 , 0.1104 ,
( s 3 , 0.2583 ) , 0.5220 , 0.2629 , 0.1171 } ( s 3 , 0.1717 ) , 0.4977 , 0.2794 , 0.1180 }
D 2 { ( s 3 , 0.2870 ) , 0.5545 , 0.2761 , 0.1019 , { ( s 3 , 0.2257 ) , 0.5222 , 0.2987 , 0.1023 ,
( s 4 , 0.4022 ) , 0.6999 , 0.1659 , 0.0969 } ( s 4 , 0.4610 ) , 0.6939 , 0.1688 , 0.0972 }
D 3 { ( s 3 , 0.4821 ) , 0.6159 , 0.2166 , 0.0551 , { ( s 3 , 0.3757 ) , 0.5758 , 0.2398 , 0.0554 ,
( s 4 , 0.2442 ) , 0.6520 , 0.1352 , 0.0551 } ( s 4 , 0.3069 ) , 0.6130 , 0.1511 , 0.0554 }
D 4 { ( s 3 , 0.0404 ) , 0.2807 , 0.6078 , 0.0675 , { ( s 3 , 0.1667 ) , 0.2486 , 0.6418 , 0.0676 ,
( s 3 , 0.3532 ) , 0.4251 , 0.4632 , 0.0576 } ( s 3 , 0.1870 ) , 0.3665 , 0.5182 , 0.0577 }
D 5 { ( s 4 , 0.1550 ) , 0.4756 , 0.3647 , 0.0642 , { ( s 4 , 0.2132 ) , 0.4175 , 0.4172 , 0.0647 ,
( s 4 , 0.0918 ) , 0.6217 , 0.2539 , 0.0642 , ( s 4 , 0.0501 ) , 0.5905 , 0.2776 , 0.0647 ,
( s 6 , 0 ) , 0.4866 , 0.3293 , 0.0642 , ( s 6 , 0 ) , 0.4266 , 0.3839 , 0.0647 ,
( s 6 , 0 ) , 0.6296 , 0.2292 , 0.0642 } ( s 6 , 0 ) , 0.5976 , 0.2536 , 0.0647 }
HHP2TLWA Operator ( γ = 2 )FHP2TLWA Operator ( γ = 2 )
D 1 { ( s 3 , 0.0832 ) , 0.5307 , 0.2913 , 0.1104 , { ( s 3 , 0.1346 ) , 0.5458 , 0.2841 , 0.1100 ,
( s 3 , 0.1717 ) , 0.4977 , 0.2794 , 0.1180 } ( s 3 , 0.2187 ) , 0.5108 , 0.2720 , 0.1177 }
D 2 { ( s 3 , 0.2257 ) , 0.5222 , 0.2987 , 0.1023 , { ( s 3 , 0.2587 ) , 0.5402 , 0.2874 , 0.1021 ,
( s 4 , 0.4610 ) , 0.6939 , 0.1688 , 0.0972 } ( s 4 , 0.4292 ) , 0.6971 , 0.1674 , 0.0971 }
D 3 { ( s 3 , 0.3757 ) , 0.5758 , 0.2398 , 0.0554 , { ( s 3 , 0.4286 ) , 0.5971 , 0.2287 , 0.0553 ,
( s 4 , 0.3069 ) , 0.6130 , 0.1511 , 0.0554 } ( s 4 , 0.2763 ) , 0.6338 , 0.1434 , 0.0553 }
D 4 { ( s 3 , 0.1667 ) , 0.2486 , 0.6418 , 0.0676 , { ( s 3 , 0.1003 ) , 0.2669 , 0.6237 , 0.0676 ,
( s 3 , 0.1870 ) , 0.3665 , 0.5182 , 0.0577 } ( s 3 , 0.2717 ) , 0.3982 , 0.4902 , 0.0577 }
D 5 { ( s 4 , 0.2132 ) , 0.4175 , 0.4172 , 0.0647 , { ( s 4 , 0.1847 ) , 0.4478 , 0.3916 , 0.0645 ,
( s 4 , 0.0501 ) , 0.5905 , 0.2776 , 0.0647 , ( s 4 , 0.0710 ) , 0.6065 , 0.2665 , 0.0645 ,
( s 6 , 0 ) , 0.4266 , 0.3839 , 0.0647 , ( s 6 , 0 ) , 0.4578 , 0.3574 , 0.0645 ,
( s 6 , 0 ) , 0.5976 , 0.2536 , 0.0647 } ( s 6 , 0 ) , 0.6139 , 0.2423 , 0.0645 }
Table 3. The aggregated information based on the ATS-HP2TLWG operator.
Table 3. The aggregated information based on the ATS-HP2TLWG operator.
HP2TLWG OperatorEHP2TLWG Operator
D 1 { ( s 2 , 0.4623 ) , 0.3502 , 0.4146 , 0.1317 , { ( s 3 , 0.4223 ) , 0.3773 , 0.3936 , 0.1296 ,
( s 3 , 0.4358 ) , 0.3443 , 0.4127 , 0.1344 } ( s 3 , 0.3174 ) , 0.3685 , 0.3910 , 0.1326 }
D 2 { ( s 3 , 0.2192 ) , 0.2358 , 0.5070 , 0.1090 , { ( s 3 , 0.1267 ) , 0.2708 , 0.4679 , 0.1082 ,
( s 3 , 0.0314 ) , 0.6168 , 0.2145 , 0.1029 } ( s 3 , 0.1475 ) , 0.6379 , 0.2029 , 0.1022 }
D 3 { ( s 3 , 0.2405 ) , 0.2454 , 0.5059 , 0.0634 , { ( s 3 , 0.1334 ) , 0.2835 , 0.4608 , 0.0631 ,
( s 3 , 0.2453 ) , 0.2552 , 0.4610 , 0.0634 } ( s 3 , 0.3358 ) , 0.2987 , 0.4002 , 0.0631 }
D 4 { ( s 2 , 0.2533 ) , 0.1058 , 0.7611 , 0.0591 , { ( s 2 , 0.3935 ) , 0.1187 , 0.7394 , 0.0590 ,
( s 2 , 0.1550 ) , 0.0966 , 0.7766 , 0.0713 } ( s 2 , 0.2597 ) , 0.1041 , 0.7634 , 0.0710 }
D 5 { ( s 3 , 0.3401 ) , 0.1696 , 0.6943 , 0.0805 , { ( s 3 , 0.4344 ) , 0.1869 , 0.6680 , 0.0793 ,
( s 3 , 0.4641 ) , 0.1700 , 0.6930 , 0.0805 , ( s 4 , 0.3983 ) , 0.1876 , 0.6658 , 0.0793 ,
( s 4 , 0.3589 ) , 0.3710 , 0.4849 , 0.0805 , ( s 4 , 0.2599 ) , 0.4046 , 0.4519 , 0.0793 ,
( s 4 , 0.2236 ) , 0.3719 , 0.4828 , 0.0805 } ( s 4 , 0.0845 ) , 0.4059 , 0.4487 , 0.0793 }
HHP2TLWA Operator ( γ = 2 )FHP2TLWA Operator ( γ = 2 )
D 1 { ( s 3 , 0.4547 ) , 0.3773 , 0.3936 , 0.1296 , { ( s 3 , 0.4779 ) , 0.3641 , 0.4053 , 0.1310 ,
( s 3 , 0.3549 ) , 0.3685 , 0.3910 , 0.1326 } ( s 3 , 0.3741 ) , 0.3569 , 0.4032 , 0.1338 }
D 2 { ( s 3 , 0.1564 ) , 0.2708 , 0.4679 , 0.1082 , { ( s 3 , 0.1708 ) , 0.2545 , 0.4885 , 0.1087 ,
( s 3 , 0.1055 ) , 0.6379 , 0.2029 , 0.1022 } ( s 3 , 0.0918 ) , 0.6277 , 0.2093 , 0.1026 }
D 3 { ( s 3 , 0.1239 ) , 0.2835 , 0.4608 , 0.0631 , { ( s 3 , 0.1886 ) , 0.2652 , 0.4843 , 0.0633 ,
( s 3 , 0.3361 ) , 0.2987 , 0.4002 , 0.0631 } ( s 3 , 0.2898 ) , 0.2775 , 0.4327 , 0.0633 }
D 4 { ( s 2 , 0.3948 ) , 0.1187 , 0.7394 , 0.0590 , { ( s 2 , 0.3230 ) , 0.1126 , 0.7505 , 0.0591 ,
( s 2 , 0.2445 ) , 0.1041 , 0.7634 , 0.0710 } ( s 2 , 0.2090 ) , 0.1009 , 0.7697 , 0.0712 }
D 5 { ( s 3 , 0.4303 ) , 0.1869 , 0.6680 , 0.0793 , { ( s 3 , 0.3866 ) , 0.1784 , 0.6820 , 0.0801 ,
( s 4 , 0.2870 ) , 0.1876 , 0.6658 , 0.0793 , ( s 4 , 0.4731 ) , 0.1789 , 0.6803 , 0.0801 ,
( s 4 , 0.2793 ) , 0.4046 , 0.4519 , 0.0793 , ( s 4 , 0.3092 ) , 0.3879 , 0.4698 , 0.0801 ,
( s 5 , 0.4720 ) , 0.4059 , 0.4487 , 0.0793 } ( s 4 , 0.1588 ) , 0.3889 , 0.4672 , 0.0801 }
Table 4. Rankings of alternatives and score values matrix based on the ATS-HP2TLWA operator.
Table 4. Rankings of alternatives and score values matrix based on the ATS-HP2TLWA operator.
HP2TLWA OperatorEHP2TLWA OperatorHHP2TLWA Operator ( γ = 2 )FHP2TLWA Operator ( γ = 2 )
D 1 2.29692.18882.18882.2462
D 2 2.63552.55782.55742.5999
D 3 2.85812.72132.72132.7910
D 4 2.04401.87931.87931.9658
D 5 3.71583.58393.58393.6514
Ranking r 5 > r 3 > r 2 > r 1 > r 4 r 5 > r 3 > r 2 > r 1 > r 4 r 5 > r 3 > r 2 > r 1 > r 4 r 5 > r 3 > r 2 > r 1 > r 4
Table 5. Rankings of alternatives and score values matrix based on the ATS-HP2TLWG operator
Table 5. Rankings of alternatives and score values matrix based on the ATS-HP2TLWG operator
HP2TLWA OperatorEHP2TLWA OperatorHHP2TLWA Operator ( γ = 2 )FHP2TLWA Operator ( γ = 2 )
D 1 1.52571.63291.61121.5805
D 2 1.93072.04352.01881.9892
D 3 1.78241.90521.90811.8435
D 4 1.14201.21771.21411.1804
D 5 2.12352.24352.43622.1812
Ranking r 5 > r 2 > r 3 > r 1 > r 4 r 5 > r 2 > r 3 > r 1 > r 4 r 5 > r 2 > r 3 > r 1 > r 4 r 5 > r 2 > r 3 > r 1 > r 4

Share and Cite

MDPI and ACS Style

Wang, Y.; Wang, L.; Wang, H.; Feng, X. Hesitant Picture 2-Tuple Linguistic Aggregation Operators Based on Archimedean T-Norm and T-Conorm and Their Use in Decision-Making. Symmetry 2018, 10, 629. https://doi.org/10.3390/sym10110629

AMA Style

Wang Y, Wang L, Wang H, Feng X. Hesitant Picture 2-Tuple Linguistic Aggregation Operators Based on Archimedean T-Norm and T-Conorm and Their Use in Decision-Making. Symmetry. 2018; 10(11):629. https://doi.org/10.3390/sym10110629

Chicago/Turabian Style

Wang, Yanjun, Lidong Wang, Huijuan Wang, and Xinghua Feng. 2018. "Hesitant Picture 2-Tuple Linguistic Aggregation Operators Based on Archimedean T-Norm and T-Conorm and Their Use in Decision-Making" Symmetry 10, no. 11: 629. https://doi.org/10.3390/sym10110629

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