Next Article in Journal
The Loss-Averse Retailer’s Order Decisions Under Risk Management
Next Article in Special Issue
A Comparative Analysis of Simulated Annealing and Variable Neighborhood Search in the ATCo Work-Shift Scheduling Problem
Previous Article in Journal
Satisfying Bank Capital Requirements: A Robustness Approach in a Modified Roy Safety-First Framework
Previous Article in Special Issue
Dual Hesitant Pythagorean Fuzzy Heronian Mean Operators in Multiple Attribute Decision Making
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Hesitant Fuzzy Hamacher Power-Aggregation Operators for Multiple-Attribute Decision-Making

1
Department of Data Information, Korea Maritime and Ocean University, Busan 606-791, Korea
2
Department of Applied Mathematics, Pukyong National University, Busan 608-737, Korea
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(7), 594; https://doi.org/10.3390/math7070594
Submission received: 31 May 2019 / Revised: 21 June 2019 / Accepted: 26 June 2019 / Published: 2 July 2019
(This article belongs to the Special Issue Optimization for Decision Making)

Abstract

:
As an extension of the fuzzy set, the hesitant fuzzy set is used to effectively solve the hesitation of decision-makers in group decision-making and to rigorously express the decision information. In this paper, we first introduce some new hesitant fuzzy Hamacher power-aggregation operators for hesitant fuzzy information based on Hamacher t-norm and t-conorm. Some desirable properties of these operators is shown, and the interrelationships between them are given. Furthermore, the relationships between the proposed aggregation operators and the existing hesitant fuzzy power-aggregation operators are discussed. Based on the proposed aggregation operators, we develop a new approach for multiple-attribute decision-making problems. Finally, a practical example is provided to illustrate the effectiveness of the developed approach, and the advantages of our approach are analyzed by comparison with other existing approaches.

1. Introduction

Since the fuzzy set (FS) was introduced by Zadeh [1], it has received much attention for its applicability. Some classical extensions of the FS, such as the interval-valued fuzzy set (IVFS) [2], intuitionistic fuzzy set (IFS) [3], interval-valued intuitionistic fuzzy set (IVIFS) [4], type-2 fuzzy set (T2FS) [5], type-n fuzzy set (TnFS) [5], and fuzzy multiset (FMS) [6], were then developed. However, it is often faced with the fact that the difficulty of setting membership degree for an element in a set arises not from the possibility distribution of possible values (as in T2FS) or the margin of error (as in IVFS or IFS), but from the hesitation between several different values. The concept of hesitant fuzzy set (HFS) was introduced by Narukawa and Torra [7,8] to deal with such cases. The HFS has the advantage of representing the membership degree of one element to a set by a set of possible values between 0 and 1, so it is an effective tool to represent a decision-maker’s hesitation in expressing his/her preferences for objects than the FS or its classical extensions. In this regard, the HFS theory has been applied to many practical applications such as decision-making [9,10,11,12,13,14,15,16,17,18].
The goal of multiple-attribute decision-making (MADM), based on preferences provided by the decision-makers, is to select the most desirable alternative(s) from a given set of feasible alternatives. MADM methods classified as conventional and fuzzy. The conventional MADM methods are seen inadequate to handle uncertainty in linguistic terms [19]. Hence, it is proposed to apply MADM methods with the FS and its extensions to cope with vagueness in a decision-making process. Furthermore, these fuzzy methods enable more concrete results. Besides, the FS and its extensions helps to decision-makers to express their opinions by means of linguistic terms. Therefore, more sensitive results can be obtained by applying fuzzy MADM methods to various science and engineering fields such as supplier selection and forecasting [20,21,22,23].
The aggregation operators are most commonly used as tools to combine each individual preference information into the overall preference information and to elicit collective preference value for each alternative. The power average (PA) and power-ordered weighted average (POWA), introduced by Yager [24], are the nonlinear weighted average aggregation tools whose weight vectors depend on the input arguments and allow the argument values to support each other [25]. In particular, compared to most aggregation operators, the PA and POWA operators have the advantage of incorporating information about the relationship between argument values that are combined. So these operators have received a lot of attention from researchers in recent years, particularly Xu and Yager [25], Zhou et al. [26] and Zhang [15] introduced some new power-aggregation operators, including the weighted generalizations of these operators. However, these power-aggregation operators only deal with arguments, which are exact numerical values.
In real life, we often face situations where input arguments are expressed not as exact numerical values but as interval numbers [27], intuitionistic fuzzy numbers [28,29,30], interval-valued intuitionistic fuzzy numbers [31], linguistic variables [32,33,34], uncertain linguistic variables [35,36,37], or hesitant fuzzy elements (HFEs) [10,11]. Many extensions of power-aggregation operators have been proposed to address these situations: the uncertain power-aggregation operators [25,38,39], intuitionistic fuzzy power-aggregation operators [26,40], interval-valued intuitionistic fuzzy power-aggregation operators [40], linguistic power-aggregation operators [41,42,43,44] and hesitant fuzzy power-aggregation operators [15,18]. In particular, with respect to HFEs, Zhang [15] proposed a family of hesitant fuzzy power-aggregation operators, including the hesitant fuzzy power-weighted average/geometric (HFPWA or HFPWG), generalized hesitant fuzzy power-weighted average/geometric (GHFPWA or GHFPWG), hesitant fuzzy power-ordered weighted average/geometric (HFPOWA or HFPOWG), and generalized hesitant fuzzy power-ordered weighted average/geometric (GHFPOWA or GHFPOWG) operators, and applied them to solve multiple criteria group decision-making problems under hesitant fuzzy environment.
It is worthwhile to mention that operational rules play a key role in integrating information using power-aggregation operators. A lot of research about power-aggregation operators for the FS and its extensions has been done by operational rules using various pairs of triangular norm (shortly t-norm) and triangular conorm (shortly t-conorm) [45] in recent years. The aforementioned hesitant fuzzy power-aggregation operators, such as the HFPWA, HFPWG, GHFPWA, GHFPWG, HFPOWA, HFPOWG, GHFPOWA, and GHFPOWG operators, are based on the algebraic product and algebraic sum operational rules on HFEs, which are a pair of the special dual t-norm and t-conorm [45]. The algebraic product and algebraic sum are the basic operations on HFEs, they are not the only ones. The Einstein t-norm and t-conorm, as another pair of special t-norm and dual t-conorm, are alternatives to the algebraic product and algebraic sum, respectively, for operational rules on HFEs. Yu [16] extended the Einstein t-norm and t-conorm to HFEs, and developed some hesitant fuzzy Einstein aggregation operators based on the Einstein product and Einstein sum operational rules on HFEs. By mean of these operational rules on HFEs, Yu et al. [18] proposed a wide range of hesitant fuzzy power-aggregation operators, such as the hesitant fuzzy Einstein power-weighted average/geometric (HFEPWA or HFEPWG), generalized hesitant fuzzy Einstein power-weighted average/geometric (GHFEPWA or GHFEPWG), hesitant fuzzy Einstein power-ordered weighted average/geometric (HFEPOWA or HFEPOWG), and generalized hesitant fuzzy Einstein power-ordered weighted average/geometric (GHFEPOWA or GHFEPOWG) operators, and applied them to deal with MADM with hesitant fuzzy information. Hamacher [46] proposed a more generalized t-norm and t-conorm, called the Hamacher t-norm and t-conorm. These Hamacher t-norm and t-conorm are more general and flexible because they are a generalization of the algebraic t-norm and t-conorm and the Einstein t-norm and t-conorm [46]. Tan et al. [17] gave some operations on HFEs based on Hamacher t-norm and t-conorm, and developed some hesitant fuzzy Hamacher aggregation operators. In this paper, by means of Hamacher operations on HFEs, we propose a family of hesitant fuzzy Hamacher power-aggregation operators that allow decision-makers to have more choices in MADM problems. This study is very necessary because it is an integrated treatment of works by Zhang [15] and Yu et al. [18].
To do so, this paper is organized as follows: In Section 2, some basic concepts and notions of HFSs and Hamacher operations of HFEs based on the Hamacher t-norm and t-conorm are reviewed. Some results of Hamacher operations of HFEs are investigated. In Section 3, we present a wide range of hesitant fuzzy Hamacher power-aggregation operators for hesitant fuzzy information, some of their basic properties are discussed, and the relationships between the proposed operators and the existing hesitant fuzzy aggregation operators are investigated. In Section 4, we apply the proposed operators to develop an approach to MADM with hesitant fuzzy information. An example application of the new approach is provided, and a comparison with other hesitant fuzzy MADM approaches is performed. Some concluding remarks is given in Section 5.

2. Basic Concepts and Operations

2.1. Triangular Norms and Conorms

The operators play an important role in the beginning of FS theory. The t-norm and t-conorm used to define generalized union and intersection, respectively, is one of the important concepts in FS theory. They are defined as follows.
Definition 1.
[45] A triangular norm (t-norm) is a binary operation T on the unit interval [ 0 , 1 ] , i.e., a function T : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] , such that for all x , y , z [ 0 , 1 ] , the following four axioms are satisfied:
  • (1) (Boundary condition) T ( 1 , x ) = x ;
  • (2) (Commutativity) T ( x , y ) = T ( y , x ) ;
  • (3) (Associativity) T ( x , T ( y , z ) ) = T ( T ( x , y ) , z ) ;
  • (4) (Monotonicity) T ( x 1 , y 1 ) T ( x 2 , y 2 ) if x 1 x 2 and y 1 y 2 .
The corresponding triangular conorm (t-conorm) of T (or the dual of T) is the function S : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] defined by S ( x , y ) = 1 T ( 1 x , 1 y ) for each x , y [ 0 , 1 ] .
Among many t-norms and t-conorms, there are the following basic t-norms and t-conorms: minimum T M and maximum S M , algebraic product T A and algebraic sum S A , Einstein product T E and Einstein sum S E , bounded difference T B and bounded sum S B , and drastic product T D and drastic sum S D , given respectively as follows:
T M ( x , y ) = min ( x , y ) , S M ( x , y ) = max ( x , y ) ; T A ( x , y ) = x y , S A ( x , y ) = x + y x y ; T E ( x , y ) = x y 1 + ( 1 x ) ( 1 y ) , S E ( x , y ) = x + y 1 + x y ; T B ( x , y ) = max ( 0 , x + y 1 ) , S B ( x , y ) = min ( 1 , x + y ) ; T D ( x , y ) = 0 , if ( x , y ) [ 0 , 1 ) 2 min ( x , y ) , otherwise , S D ( x , y ) = 1 , if ( x , y ) ( 0 , 1 ] 2 max ( x , y ) , otherwise .
These t-norms and t-conorms are ordered as follows:
T D T B T E T A T M , and S M S A S E S B S D .
From (1), since the drastic product T D and minimum T M are the smallest and the largest t-norms, respectively, we know that T D T T M for any t-norm T. In particular, the algebraic product T A and the Einstein product T E are two prototypic examples of the class of strict Archimedean t-norms [45].
Hamacher [46] proposed, as more generalized t-norm and t-conorm, the Hamacher t-norm and t-conorm as follows:
T H ζ ( x , y ) = x y ζ + ( 1 ζ ) ( x + y x y ) , S H ζ ( x , y ) = x + y x y ( 1 ζ ) x y ζ + ( 1 ζ ) x y , ζ > 0 .
From (2), when ζ = 1 , then the Hamacher t-norm and t-conorm reduce to the algebraic t-norm T A and t-conorm S A , respectively; when ζ = 2 , then then the Hamacher t-norm and t-conorm reduce to the Einstein t-norm T E and t-conorm S E , respectively.

2.2. Hesitant Fuzzy Sets and Hesitant Fuzzy Elements

In the following, some basic concepts of hesitant fuzzy set and hesitant fuzzy element are briefly reviewed [7,8,10].
Definition 2.
[7,8] Let X be a fixed set, a hesitant fuzzy set (HFS) on X is defined in terms of function h that returns a subset of [ 0 , 1 ] when applied to X. The HFS can be represented as the following mathematical symbol:
E = { x , h E ( x ) | x X } ,
where h E ( x ) is a set of values in [ 0 , 1 ] that denote the possible membership degrees of the element x X to the set E. For convenience, we refer to h = h E ( x ) as a hesitant fuzzy element (HFE) and to H the set of all HFEs.
Given three HFEs h, h 1 and h 2 , Torra and Narukawa [7,8] and Xia and Xu [10] defined the following HFE operations:
(1) h c = γ h { 1 γ } ;
(2) h 1 h 2 = γ 1 h 1 , γ 2 h 2 { γ 1 γ 2 } ;
(3) h 1 h 2 = γ 1 h 1 , γ 2 h 2 { γ 1 γ 2 } ;
(4) h λ = γ h { γ λ } , λ > 0 ;
(5) λ h = γ h { 1 ( 1 γ ) λ } , λ > 0 ;
(6) h 1 h 2 = γ 1 h 1 , γ 2 h 2 { γ 1 + γ 2 γ 1 γ 2 } ;
(7) h 1 h 2 = γ 1 h 1 , γ 2 h 2 { γ 1 γ 2 } .
Xia and Xu [10] also defined the following comparison rules for HFEs:
Definition 3.
[10] For a HFE h, s ( h ) = γ h γ l ( h ) is called the score function of h, where l ( h ) is the number of elements in h. For two HFEs h 1 and h 2 ,
  • if s ( h 1 ) > s ( h 2 ) , then h 1 is superior to h 2 , denoted by h 1 > h 2 ;
  • if s ( h 1 ) = s ( h 2 ) , then h 1 is indifferent to h 2 , denoted by h 1 = h 2 .
Let h 1 and h 2 be two HFEs. In the most case, l ( h 1 ) l ( h 2 ) ; for convenience, let l = max { l ( h 1 ) , l ( h 2 ) } . To compare h 1 and h 2 , Xu and Xia [11] extended the shorter HFE until the length of both HFEs was the same. The simplest way to extend the shorter HFE is to add the same value repeatedly. In fact, we can extend the shorter ones by adding any values in them. The selection of these values mainly depends on the decision-makers’ risk preferences. Optimists anticipate desirable outcomes and may add the maximum value, while pessimists expect unfavorable outcomes and may add the minimum value [11]. In this paper, we assume that the decision-makers are all pessimistic (other situation can also be studied similarly).
Xu and Xia [11] proposed various distance measures for HFEs, including the hesitant normalized Hamming distance defined as follows:
d ( h 1 , h 2 ) = 1 l i = 1 l h 1 σ ( i ) h 2 σ ( i ) ,
where h 1 σ ( i ) and h 2 σ ( i ) are the ith largest values in h 1 and h 2 , respectively.
Intrinsically, the addition and multiplication operators proposed by Xia and Xu [10] are algebraic sum and algebraic product operational rules on HFEs, respectively, and are a special pair of dual t-norm and t-conorm. Recently, Tan et al. [17] extended these operations to obtain more general operations on HFEs by means of the Hamacher t-norm and t-conorm as follows:
Definition 4.
[17] For any given three HFEs h, h 1 , h 2 , and ζ > 0 , the Hamacher operations on HFEs are defined as follows:
  • (1) h 1 H h 2 = γ 1 h 1 , γ 2 h 2 γ 1 + γ 2 γ 1 γ 2 ( 1 ζ ) γ 1 γ 2 1 ( 1 ζ ) γ 1 γ 2 ;
  • (2) h 1 H h 2 = γ 1 h 1 , γ 2 h 2 γ 1 γ 2 ζ + ( 1 ζ ) ( γ 1 + γ 2 γ 1 γ 2 ) ;
  • (3) λ · H h = γ h ( 1 + ( ζ 1 ) γ ) λ ( 1 γ ) λ ( 1 + ( ζ 1 ) γ ) λ + ( ζ 1 ) ( 1 γ ) λ , λ > 0 ;
  • (4) h H λ = γ h ζ γ λ ( 1 + ( ζ 1 ) ( 1 γ ) ) λ + ( ζ 1 ) γ λ , λ > 0 .
In particular, if ζ = 1 , then these operations on HFEs reduce to those proposed by Xia and Xu [10]; if ζ = 2 , then these operations on HFEs reduce to the following:
  • (1) h 1 ε h 2 = γ 1 h 1 , γ 2 h 2 γ 1 + γ 2 1 γ 1 γ 2 ;
  • (2) h 1 ε h 2 = γ 1 h 1 , γ 2 h 2 γ 1 γ 2 1 + ( 1 γ 1 ) ( 1 γ 2 ) ;
  • (3) λ · ε h = γ h ( 1 + γ ) λ ( 1 γ ) λ ( 1 + γ ) λ + ( 1 γ ) λ , λ > 0 ;
  • (4) h ε λ = γ h 2 γ λ ( 2 γ ) λ + γ λ , λ > 0 ,
which are defined as Einstein operations on HFEs by Yu [16].
Theorem 1.
Let h, h 1 and h 2 be three HFEs, λ > 0 , λ 1 > 0 and λ 2 > 0 , then
  • (1) h 1 H h 2 = h 2 H h 1 ;
  • (2) h H ( h 1 H h 2 ) = ( h H h 1 ) H h 2 ;
  • (3) λ 1 · H ( λ 2 · H h ) = ( λ 1 λ 2 ) · H h ;
  • (4) λ · H ( h 1 H h 2 ) = ( λ · H h 1 ) H ( λ · H h 2 ) ;
  • (5) h 1 H h 2 = h 2 H h 1 ;
  • (6) h H ( h 1 H h 2 ) = ( h H h 1 ) H h 2 ;
  • (7) ( h 1 H h 2 ) H λ = h 1 H λ H h 2 H λ ;
  • (8) ( h H λ 1 ) H λ 2 = h H ( λ 1 λ 2 ) .
Proof. 
Since (1), (2), (5) and (6) are trivial, we prove (3), (4), (7) and (8).
(3) Since λ 2 · H h = γ h ( 1 + ( ζ 1 ) γ ) λ 2 ( 1 γ ) λ 2 ( 1 + ( ζ 1 ) γ ) λ 2 + ( ζ 1 ) ( 1 γ ) λ 2 , then we have
λ 1 · H ( λ 2 · H h ) = γ h 1 + ( ζ 1 ) ( 1 + ( ζ 1 ) γ ) λ 2 ( 1 γ ) λ 2 ( 1 + ( ζ 1 ) γ ) λ 2 + ( ζ 1 ) ( 1 γ ) λ 2 λ 1 1 ( 1 + ( ζ 1 ) γ ) λ 2 ( 1 γ ) λ 2 ( 1 + ( ζ 1 ) γ ) λ 2 + ( ζ 1 ) ( 1 γ ) λ 2 λ 1 1 + ( ζ 1 ) ( 1 + ( ζ 1 ) γ ) λ 2 ( 1 γ ) λ 2 ( 1 + ( ζ 1 ) γ ) λ 2 + ( ζ 1 ) ( 1 γ ) λ 2 λ 1 + ( ζ 1 ) 1 ( 1 + ( ζ 1 ) γ ) λ 2 ( 1 γ ) λ 2 ( 1 + ( ζ 1 ) γ ) λ 2 + ( ζ 1 ) ( 1 γ ) λ 2 λ 1 = γ h ( 1 + ( ζ 1 ) γ ) ( λ 1 λ 2 ) ( 1 γ ) ( λ 1 λ 2 ) ( 1 + ( ζ 1 ) γ ) ( λ 1 λ 2 ) + ( ζ 1 ) ( 1 γ ) ( λ 1 λ 2 ) = ( λ 1 λ 2 ) · H h .
(4) Since h 1 H h 2 = γ 1 h 1 , γ 2 h 2 γ 1 + γ 2 γ 1 γ 2 ( 1 ζ ) γ 1 γ 2 1 ( 1 ζ ) γ 1 γ 2 , by the operational law (3) in Definition 4, we have
λ · H ( h 1 H h 2 ) = γ 1 h 1 , γ 2 h 2 ( 1 + ( ζ 1 ) γ 1 + γ 2 γ 1 γ 2 ( 1 ζ ) γ 1 γ 2 1 ( 1 ζ ) γ 1 γ 2 ) λ ( 1 γ 1 + γ 2 γ 1 γ 2 ( 1 ζ ) γ 1 γ 2 1 ( 1 ζ ) γ 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 1 + γ 2 γ 1 γ 2 ( 1 ζ ) γ 1 γ 2 1 ( 1 ζ ) γ 1 γ 2 ) λ + ( ζ 1 ) ( 1 γ 1 + γ 2 γ 1 γ 2 ( 1 ζ ) γ 1 γ 2 1 ( 1 ζ ) γ 1 γ 2 ) λ = γ 1 h 1 , γ 2 h 2 ( 1 + ( ζ 1 ) γ 1 ) ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 1 ) ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 1 ) ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 1 ) ( 1 γ 2 ) λ .
Since λ · H h 1 = γ 1 h 1 ( 1 + ( ζ 1 ) γ 1 ) λ ( 1 γ 1 ) λ ( 1 + ( ζ 1 ) γ 1 ) λ + ( ζ 1 ) ( 1 γ 1 ) λ and λ · H h 2 = γ 2 h 2 ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 2 ) λ , we have
( λ · H h 1 ) H ( λ · H h 2 ) = γ 1 h 1 , γ 2 h 2 ( 1 + ( ζ 1 ) γ 1 ) λ ( 1 γ 1 ) λ ( 1 + ( ζ 1 ) γ 1 ) λ + ( ζ 1 ) ( 1 γ 1 ) λ + ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 1 ) λ ( 1 γ 1 ) λ ( 1 + ( ζ 1 ) γ 1 ) λ + ( ζ 1 ) ( 1 γ 1 ) λ ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 2 ) λ ( 1 ζ ) ( 1 + ( ζ 1 ) γ 1 ) λ ( 1 γ 1 ) λ ( 1 + ( ζ 1 ) γ 1 ) λ + ( ζ 1 ) ( 1 γ 1 ) λ · ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 2 ) λ 1 ( 1 ζ ) ( 1 + ( ζ 1 ) γ 1 ) λ ( 1 γ 1 ) λ ( 1 + ( ζ 1 ) γ 1 ) λ + ( ζ 1 ) ( 1 γ 1 ) λ · ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 2 ) λ = γ 1 h 1 , γ 2 h 2 ( 1 + ( ζ 1 ) γ 1 ) ( 1 + ( ζ 1 ) γ 2 ) λ ( 1 γ 1 ) ( 1 γ 2 ) λ ( 1 + ( ζ 1 ) γ 1 ) ( 1 + ( ζ 1 ) γ 2 ) λ + ( ζ 1 ) ( 1 γ 1 ) ( 1 γ 2 ) λ .
Hence λ · H ( h 1 H h 2 ) = ( λ · H h 1 ) H ( λ · H h 2 ) .
(7) Since h 1 H h 2 = γ 1 h 1 , γ 2 h 2 γ 1 γ 2 ζ + ( 1 ζ ) ( γ 1 + γ 2 γ 1 γ 2 ) , by the operational law (4) in Definition 4, we have
( h 1 H h 2 ) H λ = γ 1 h 1 , γ 2 h 2 ζ γ 1 γ 2 ζ + ( 1 ζ ) ( γ 1 + γ 2 γ 1 γ 2 ) λ 1 + ( ζ 1 ) ( 1 γ 1 γ 2 ζ + ( 1 ζ ) ( γ 1 + γ 2 γ 1 γ 2 ) ) λ + ( ζ 1 ) γ 1 γ 2 ζ + ( 1 ζ ) ( γ 1 + γ 2 γ 1 γ 2 ) λ = γ 1 h 1 , γ 2 h 2 ζ γ 1 λ γ 2 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) ( 1 + ( ζ 1 ) ( 1 γ 2 ) ) λ + ( ζ 1 ) γ 1 λ γ 2 λ .
Since h 1 H λ = γ 1 h 1 ζ γ 1 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) λ + ( ζ 1 ) γ 1 λ and h 2 H λ = γ 2 h 2 ζ γ 2 λ ( 1 + ( ζ 1 ) ( 1 γ 2 ) ) λ + ( ζ 1 ) γ 2 λ , we have
h 1 H λ H h 2 H λ = γ 1 h 1 , γ 2 h 2 ζ γ 1 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) λ + ( ζ 1 ) γ 1 λ · ζ γ 2 λ ( 1 + ( ζ 1 ) ( 1 γ 2 ) ) λ + ( ζ 1 ) γ 2 λ ζ + ( 1 ζ ) ζ γ 1 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) λ + ( ζ 1 ) γ 1 λ + ζ γ 2 λ ( 1 + ( ζ 1 ) ( 1 γ 2 ) ) λ + ( ζ 1 ) γ 2 λ ζ γ 1 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) λ + ( ζ 1 ) γ 1 λ · ζ γ 2 λ ( 1 + ( ζ 1 ) ( 1 γ 2 ) ) λ + ( ζ 1 ) γ 2 λ = γ 1 h 1 , γ 2 h 2 ζ γ 1 λ γ 2 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) ( 1 + ( ζ 1 ) ( 1 γ 2 ) ) λ + ( ζ 1 ) γ 1 λ γ 2 λ .
Hence ( h 1 H h 2 ) H λ = h 1 H λ H h 2 H λ .
(8) Since h H λ 1 = γ h ζ γ λ 1 ( 1 + ( ζ 1 ) ( 1 γ ) ) λ 1 + ( ζ 1 ) γ λ 1 , we have
( h H λ 1 ) H λ 2 = γ h ζ ζ γ λ 1 ( 1 + ( ζ 1 ) ( 1 γ ) ) λ 1 + ( ζ 1 ) γ λ 1 λ 2 1 + ( ζ 1 ) ( 1 ζ γ λ 1 ( 1 + ( ζ 1 ) ( 1 γ ) ) λ 1 + ( ζ 1 ) γ λ 1 ) λ 2 + ( ζ 1 ) ζ γ λ 1 ( 1 + ( ζ 1 ) ( 1 γ ) ) λ 1 + ( ζ 1 ) γ λ 1 λ 2 = γ h ζ γ ( λ 1 λ 2 ) ( 1 + ( ζ 1 ) ( 1 γ ) ) ( λ 1 λ 2 ) + ( ζ 1 ) γ ( λ 1 λ 2 ) = h H ( λ 1 λ 2 ) .
However, the operational laws ( λ 1 · H h ) H ( λ 2 · H h ) = ( λ 1 + λ 2 ) · H h and h H λ 1 H h H λ 2 = h H ( λ 1 + λ 2 ) do not hold in general. To illustrate these, we give an example as follows:
Example 1.
Let h = { 0 . 3 , 0 . 5 } , λ 1 = λ 2 = 1 and ζ = 3 , then
( λ 1 · H h ) H ( λ 2 · H h ) = h H h = i , j = 1 , 2 γ i + γ j + γ i γ j 1 + 2 γ i γ j = { 0 . 5874 , 0 . 7308 , 0 . 7308 , 0 . 8333 } , ( λ 1 + λ 2 ) · H h = 2 · H h = i = 1 , 2 ( 1 + 2 γ i ) 2 ( 1 γ i ) 2 ( 1 + 2 γ i ) 2 + 2 ( 1 γ i ) 2 = { 0 . 5874 , 0 . 8333 } .
From Definition 3, we have s ( ( λ 1 · H h ) H ( λ 2 · H h ) ) = 0 . 7199 > 0 . 7104 = s ( ( λ 1 + λ 2 ) · H h ) and thus ( λ 1 · H h ) H ( λ 2 · H h ) ( λ 1 + λ 2 ) · H h . Furthermore, we have s ( h H λ 1 H h H λ 2 ) = 0 . 0971 < 0 . 1060 = s ( h H ( λ 1 + λ 2 ) ) and thus h H λ 1 H h H λ 2 h H ( λ 1 + λ 2 ) .

3. Hesitant Fuzzy Hamacher Power-Weighted Aggregation Operators

In this section, based on the Hamacher operation, we shall extend the power-aggregation operators to accommodate the situations where the input arguments are HFEs.

3.1. Hesitant Fuzzy Hamacher Power-Weighted Average/geometric Operators

Based on the PA operator [24] and hesitant fuzzy Hamacher weighted average (HFHWA) operator [17], we firstly define the hesitant fuzzy Hamacher power-weighted average (HFHPWA) operator as follows.
Definition 5.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 . A hesitant fuzzy Hamacher power-weighted average (HFHPWA) operator is a function H n H such that
HFHPWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n w i ( 1 + T ( h i ) ) · H h i i = 1 n w i ( 1 + T ( h i ) ) ,
where parameter ζ > 0 , T ( h i ) = j = 1 , j i n w j Sup ( h i , h j ) and Sup ( h i , h j ) is the support for h i from h j , satisfying the following conditions:
  • (1) Sup ( h i , h j ) [ 0 , 1 ] ;
  • (2) Sup ( h i , h j ) = Sup ( h j , h i ) ;
  • (3) Sup ( h i , h j ) Sup ( h s , h t ) if d ( h i , h j ) d ( h s , h t ) , where d is the hesitant normalized Hamming distance measure between two HFEs given in Equation (4).
Here, the support measure ( Sup ) can be used to measure the closeness of a preference value with other preference value because it is essentially similarity measure.
Theorem 2.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then the aggregated value by HFHPWA operator is also a HFE, and
HFHPWA ζ ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) .
Proof. 
Equation (6) can be proved by mathematical induction on n as follows.
For n = 1 , the result of Equation (6) is clear.
Suppose that Equation (6) holds for n = k , that is
HFHPWA ζ ( h 1 , h 2 , , h k ) = γ 1 h 1 , γ 2 h 2 , , γ k h k i = 1 k 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) i = 1 k 1 γ i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) i = 1 k 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 k 1 γ i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) .
Then, when n = k + 1 , by Definitions 4 and 5, we have
HFHPWA ζ ( h 1 , h 2 , , h k + 1 ) = H i = 1 k w i ( 1 + T ( h i ) ) · H h i i = 1 k + 1 w i ( 1 + T ( h i ) ) H w k + 1 ( 1 + T ( h k + 1 ) ) · H h k + 1 i = 1 k + 1 w i ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ k h k i = 1 k 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k 1 γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 k 1 γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) H γ k + 1 h k + 1 1 + ( ζ 1 ) γ k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) 1 γ k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) 1 + ( ζ 1 ) γ k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) + ( ζ 1 ) 1 γ k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) .
Let a 1 = i = 1 k 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) , b 1 = i = 1 k 1 γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) , a 2 = 1 + ( ζ 1 ) γ k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) and b 2 = 1 γ k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) , then
HFHPWA ζ ( h 1 , h 2 , , h k + 1 ) = γ 1 h 1 , γ 2 h 2 , , γ k h k a 1 b 1 a 1 + ( ζ 1 ) b 1 H γ k + 1 h k + 1 a 2 b 2 a 2 + ( ζ 1 ) b 2 = γ 1 h 1 , , γ k h k , γ k + 1 h k + 1 a 1 b 1 a 1 + ( ζ 1 ) b 1 + a 2 b 2 a 2 + ( ζ 1 ) b 2 a 1 b 1 a 1 + ( ζ 1 ) b 1 · a 2 b 2 a 2 + ( ζ 1 ) b 2 ( 1 ζ ) a 1 b 1 a 1 + ( ζ 1 ) b 1 · a 2 b 2 a 2 + ( ζ 1 ) b 2 1 ( 1 ζ ) a 1 b 1 a 1 + ( ζ 1 ) b 1 · a 2 b 2 a 2 + ( ζ 1 ) b 2 = γ 1 h 1 , γ 2 h 2 , , γ k + 1 h k + 1 a 1 a 2 b 1 b 2 a 1 a 2 + ( ζ 1 ) b 1 b 2
= γ 1 h 1 , γ 2 h 2 , , γ k + 1 h k + 1 i = 1 k + 1 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k + 1 1 γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k + 1 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 k + 1 1 γ i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) ,
i.e., Equation (6) holds for n = k + 1 . Thus, Equation (6) holds for all n. □
Remark 1.
(1) If Sup ( h i , h j ) = k , for all i j , then
HFHPWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n w i · H h i = γ 1 h 1 , γ 2 h 2 , , γ n h n 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 ,
which indicates that when all supports are the same, the HFHPWA operator reduces to the hesitant fuzzy Hamacher weighted average (HFHWA) operator [17].
(2) For the HFHPWA operator, if ζ = 1 , then the HFHPWA operator reduces to the following:
HFHPWA 1 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n 1 i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) )
which is called the hesitant fuzzy power-weighted average (HFPWA) operator and if ζ = 2 , then the HFHPWA operator reduces to the hesitant fuzzy Einstein power-weighted average (HFEPWA) operator [18]:
HFHPWA 2 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n 1 + γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) .
To analyze the relationship between the HFHPWA operator and the HFPWA operator, we introduce the following lemma.
Lemma 1.
[47,48] Let x i > 0 , w i > 0 , i = 1 , 2 , , n , and i = 1 n w i = 1 , then i = 1 n x i w i i = 1 n w i x i , with equality if and only if x 1 = x 2 = = x n .
Theorem 3.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then
HFHPWA ζ ( h 1 , h 2 , , h n ) HFPWA ( h 1 , h 2 , , h n ) .
Proof. 
For any γ i h i ( i = 1 , 2 , , n ), by Lemma 1, we have
i = 1 n 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 + ( ζ 1 ) γ i + ( ζ 1 ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 γ i = ζ .
Then,
i = 1 n 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) = 1 ζ i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 ζ i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) ζ = 1 i = 1 n 1 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) ,
which implies that H i = 1 n w i ( 1 + T ( h i ) ) · H h i i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) h i i = 1 n w i ( 1 + T ( h i ) ) . Thus, we obtain HFHPWA ζ ( h 1 , h 2 , , h n ) HFPWA ( h 1 , h 2 , , h n ) . □
Theorem 3 shows that the values aggregated by the HFHPWA operator are not larger than those obtained by the HFPWA operator. That is to say, the HFHPWA operator reflects the decision-maker’s pessimistic attitude than the HFPWA operator in aggregation process. Furthermore, based on Theorem 2, we have the properties of the HFHPWA operator as follows.
Theorem 4.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then we have the followings:
  • (1) Boundedness: If h = min { γ i | γ i h i } and h + = max { γ i | γ i h i } , then
    h HFHPWA ζ ( h 1 , h 2 , , h n ) h + .
  • (2) Monotonicity: Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, if w = ( w 1 , w 2 , , w n ) T is also the weight vector of h i , and γ i γ i for any h i and h i ( i = 1 , 2 , , n ), then
    HFHPWA ζ ( h 1 , h 2 , , h n ) HFHPWA ζ ( h 1 , h 2 , , h n ) .
Proof. 
(1) Let f ( x ) = 1 + ( ζ 1 ) x 1 x , x [ 0 , 1 ) , then f ( x ) = ζ ( 1 x ) 2 > 0 and thus f ( x ) is an increasing function. Since h γ i h + for all i, then f ( h ) f ( γ i ) f ( h + ) , i.e., 1 + ( ζ 1 ) h 1 h 1 + ( ζ 1 ) γ i 1 γ i 1 + ( ζ 1 ) h + 1 h + . For convenience, let t i = w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) . Since w = ( w 1 , w 2 , , w n ) T is the weight vector of h i satisfying w i [ 0 , 1 ] and i = 1 n w i = 1 , then for all i, we have
1 + ( ζ 1 ) h 1 h t i 1 + ( ζ 1 ) γ i 1 γ i t i 1 + ( ζ 1 ) h + 1 h + t i 1 + ζ h 1 h t i 1 + ( ζ 1 ) γ i 1 γ i t i 1 + ζ h + 1 h + t i i = 1 n 1 + ζ h 1 h t i i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i i = 1 n 1 + ζ h + 1 h + t i 1 + ζ h 1 h i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i 1 + ζ h + 1 h + ζ + ζ h 1 h i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i + ( ζ 1 ) ζ + ζ h + 1 h +
1 ζ + ζ h + 1 h + 1 i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i + ( ζ 1 ) 1 ζ + ζ h 1 h 1 h + ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i 1 h ζ 1 h + ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i 1 h h 1 ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i h + h i = 1 n 1 + ( ζ 1 ) γ i t i i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i h + .
Thus, we have h HFHPWA ζ ( h 1 , h 2 , , h n ) h + .
(2) Let f ( x ) = 1 + ( ζ 1 ) x 1 x , x [ 0 , 1 ) , then by (1), f ( x ) is an increasing function. If for all h i and h i , γ i γ i , then 1 + ( ζ 1 ) γ i 1 γ i 1 + ( ζ 1 ) γ i 1 γ i . For convenience, let t i = w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) , then we have
1 + ( ζ 1 ) γ i 1 γ i t i 1 + ( ζ 1 ) γ i 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i + ( ζ 1 ) i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i + ( ζ 1 ) 1 i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i + ( ζ 1 ) 1 i = 1 n 1 + ( ζ 1 ) γ i 1 γ i t i + ( ζ 1 ) ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i 1 ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i 1 ζ i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i i = 1 n 1 γ i t i i = 1 n 1 + ( ζ 1 ) γ i t i + ( ζ 1 ) i = 1 n 1 γ i t i .
Thus, by Theorem 2, HFHPWA ζ ( h 1 , h 2 , , h n ) HFHPWA ζ ( h 1 , h 2 , , h n ) . □
However, the HFHPWA operator is neither idempotent nor commutative, as illustrated by the following example.
Example 2.
Let h 1 = { 0 . 8 , 0 . 6 } , h 2 = { 0 . 9 , 0 . 5 } and h 3 = { 0 . 7 , 0 . 6 } be three HFEs, w = ( 0 . 3 , 0 . 5 , 0 . 2 ) T be the weight vector of h 1 , h 2 and h 3 . Assume that Sup ( h i , h j ) ( i , j = 1 , 2 , 3 , i j ) is the support for h i from h j given by Sup ( h i , h j ) = 1 d ( h i , h j ) , where d ( h i , h j ) is the hesitant Hamming distance between h i and h j . Then by Theorem 2, we have
HFHPWA 5 ( h 1 , h 2 , h 3 ) = { 0 . 8388 , 0 . 6555 , 0 . 7942 , 0 . 5797 , 0 . 8261 , 0 . 6332 , 0 . 7786 , 0 . 5549 } , HFHPWA 5 ( h 2 , h 3 , h 1 ) = { 0 , 8013 , 0 . 7683 , 0 . 6723 , 0 . 6255 , 0 . 7650 , 0 . 7275 , 0 . 6208 , 0 . 5701 } , HFHPWA 5 ( h 3 , h 3 , h 3 ) = { 0 . 7000 , 0 . 6559 , 0 . 6704 , 0 . 6237 , 0 . 6793 , 0 . 6334 , 0 . 6485 , 0 . 6000 } .
From Definition 3, we have s ( h 1 ) = s ( h 2 ) = 0 , 7 , s ( h 3 ) = 0 . 65 , s ( HFHPWA 5 ( h 1 , h 2 , h 3 ) ) = 0 . 7076 , s ( HFHPWA 5 ( h 2 , h 3 , h 1 ) ) = 0 . 6938 and s ( HFHPWA 5 ( h 3 , h 3 , h 3 ) ) = 0 . 6514 . Then s ( HFHPWA 5 ( h 3 , h 3 , h 3 ) ) s ( h 3 ) and thus HFHPWA 5 ( h 3 , h 3 , h 3 ) h 3 , which implies that the HFHPWA operator is not idempotent. Furthermore, since s ( HFHPWA 5 ( h 1 , h 2 , h 3 ) ) s ( HFHPWA 5 ( h 2 , h 3 , h 1 ) ) , we have HFHPWA 5 ( h 1 , h 2 , h 3 ) HFHPWA 5 ( h 2 , h 3 , h 1 ) . Thus, the HFHPWA operator is not commutative.
Based on the power geometric (PG) operator [25] and hesitant fuzzy Hamacher weighted geometric (HFHWG) operator [17], we also define the hesitant fuzzy Hamacher power-weighted geometric operator as follows.
Definition 6.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 . A hesitant fuzzy Hamacher power-weighted geometric (HFHPWG) operator is a function H n H such that
HFHPWG ζ ( h 1 , h 2 , , h n ) = H i = 1 n h i H w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) ,
where parameter ζ > 0 , T ( h i ) = j = 1 , j i n w j Sup ( h i , h j ) and Sup ( h i , h j ) is the support for h i from h j .
Theorem 5.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then the aggregated value by HFHPWG operator is also a HFE, and
HFHPWG ζ ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n ζ i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) .
Proof. 
Similar to the proof of Theorem 2, Equation (11) can be proved by mathematical induction on n. □
Remark 2.
(1) If Sup ( h i , h j ) = k , for all i j , then
HFHPWG ζ ( h 1 , h 2 , , h n ) = H i = 1 n h i H w i
which indicates that when all supports are the same, the HFHPWG operator reduces to the hesitant fuzzy Hamacher weighted geometric (HFHWG) operator [17].
(2) If ζ = 1 , then then the HFHPWG operator reduces to the following:
HFHPWG 1 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) )
which is called the hesitant fuzzy power-weighted geometric (HFPWG) operator and if ζ = 2 , then the HFHPWG operator reduces to the hesitant fuzzy Einstein power-weighted geometric (HFEPWG) operator [18]:
HFHPWG 2 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n 2 i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 2 γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) .
Theorem 6.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then
HFHPWG ζ ( h 1 , h 2 , , h n ) HFPWG ( h 1 , h 2 , , h n ) .
Proof. 
For any γ i h i ( i = 1 , 2 , , n ), by Lemma 1, we have
i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 + ( ζ 1 ) ( 1 γ i ) + ( ζ 1 ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) γ i = ζ .
Then,
ζ i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) ,
which implies that H i = 1 n h i H w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n h i w i ( 1 + T ( h i ) ) h i i = 1 n w i ( 1 + T ( h i ) ) , i.e., HFHPWG ζ ( h 1 , h 2 , , h n ) HFPWG ( h 1 , h 2 , , h n ) . □
Theorem 6 shows that the HFHPWG operator reflects the decision-maker’s more optimistic attitude than the HFPWG operator in aggregation process. Furthermore, similar to Theorem 4, we have the properties of the HFHPWG operator as follows.
Theorem 7.
bLet h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then we have the followings:
  • (1) Boundedness: If h = min { γ i | γ i h i } and h + = max { γ i | γ i h i } , then
    h HFHPWG ζ ( h 1 , h 2 , , h n ) h + .
  • (2) Monotonicity: Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, if w = ( w 1 , w 2 , , w n ) T is also the weight vector of h i , and γ i γ i for any h i and h i ( i = 1 , 2 , , n ), then
    HFHPWG ζ ( h 1 , h 2 , , h n ) HFHPWG ζ ( h 1 , h 2 , , h n ) .
Proof. 
(1) Let g ( x ) = 1 + ( ζ 1 ) ( 1 x ) x , x ( 0 , 1 ] , then g ( x ) = ζ x 2 < 0 , thus g ( x ) is a decreasing function. Since h γ i h + for all i, then g ( h ) g ( γ i ) g ( h + ) , i.e., 1 + ( ζ 1 ) ( 1 h + ) h + 1 + ( ζ 1 ) ( 1 γ i ) γ i 1 + ( ζ 1 ) ( 1 h ) h . Since w = ( w 1 , w 2 , , w n ) T is the weight vector of h i satisfying w i [ 0 , 1 ] and i = 1 n w i = 1 , then for all i, let t i = w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) , we have
1 + ( ζ 1 ) ( 1 h + ) h + t i 1 + ( ζ 1 ) ( 1 γ i ) γ i t i 1 + ( ζ 1 ) ( 1 h ) h t i i = 1 n 1 + ( ζ 1 ) ( 1 h + ) h + t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 h ) h t i ζ h + ( ζ 1 ) i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i ζ h ( ζ 1 )
ζ h + i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i + ( ζ 1 ) ζ h h ζ 1 i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i + ( ζ 1 ) h + ζ h ζ i = 1 n γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) t i + ( ζ 1 ) i = 1 n γ i t i h + ζ h ζ i = 1 n γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) t i + ( ζ 1 ) i = 1 n γ i t i h +
Thus, we have h HFHPWG ζ ( h 1 , h 2 , , h n ) h + .
(2) Let g ( x ) = 1 + ( ζ 1 ) ( 1 x ) x , x ( 0 , 1 ] , then by (1), g ( x ) is a decreasing function. Then for all i, γ i γ i , we have 1 + ( ζ 1 ) ( 1 γ i ) γ i 1 + ( ζ 1 ) ( 1 γ i ) γ i . For convenience, let t i = w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) , then we have
1 + ( ζ 1 ) ( 1 γ i ) γ i t i 1 + ( ζ 1 ) ( 1 γ i ) γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i + ( ζ 1 ) i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i + ( ζ 1 ) 1 i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i + ( ζ 1 ) 1 i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) γ i t i + ( ζ 1 ) ζ i = 1 n γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) t i + ( ζ 1 ) i = 1 n γ i t i ζ i = 1 n γ i t i i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) t i + ( ζ 1 ) i = 1 n γ i t i .
Thus, by Theorem 5, HFHPWG ζ ( h 1 , h 2 , , h n ) HFHPWG ζ ( h 1 , h 2 , , h n ) . □
However, the HFHPWG operator is also neither idempotent nor commutative, as illustrated by the following example.
Example 3.
Let h 1 , h 2 and h 3 be three HFEs, w be the weight vector of them, and Sup ( h i , h j ) ( i , j = 1 , 2 , 3 , i j ) be the support for h i from h j given in Example 2. Then by Theorem 5, we have
HFHPWG 5 ( h 1 , h 1 , h 1 ) = { 0 . 8000 , 0 . 7095 , 0 . 7390 , 0 . 6455 , 0 . 7573 , 0 . 6644 , 0 . 6945 , 0 . 6000 } , HFHPWG 5 ( h 1 , h 2 , h 3 ) = { 0 . 8277 , 0 . 6398 , 0 . 7678 , 0 . 5751 , 0 . 8077 , 0 . 6177 , 0 . 7467 , 0 . 5532 } , HFHPWG 5 ( h 2 , h 3 , h 1 ) = { 0 , 7881 , 0 . 7438 , 0 . 6611 , 0 . 6145 , 0 . 7445 , 0 . 6989 , 0 . 6152 , 0 . 5686 } .
According to Definition 3, we have s ( HFHPWG 5 ( h 1 , h 1 , h 1 ) ) = 0 . 7013 , s ( HFHPWG 5 ( h 1 , h 2 , h 3 ) ) = 0 . 6920 and s ( HFHPWG 5 ( h 2 , h 3 , h 1 ) ) = 0 . 6793 . Then s ( HFHPWG 5 ( h 1 , h 1 , h 1 ) ) s ( h 1 ) and thus HFHPWG 5 ( h 1 , h 1 , h 1 ) h 1 , which implies that the HFHPWG operator is not idempotent. Furthermore, since s ( HFHPWG 5 ( h 1 , h 2 , h 3 ) ) s ( HFHPWG 5 ( h 2 , h 3 , h 1 ) ) , we have HFHPWG 5 ( h 1 , h 2 , h 3 ) HFHPW 5 ( h 2 , h 3 , h 1 ) . Thus, the HFHPWG operator is not commutative.
Theorem 8.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then we have
  • (1) HFHPWA ζ ( h 1 c , h 2 c , , h n c ) = ( HFHPWG ζ ( h 1 , h 2 , , h n ) ) c ;
  • (2) HFHPWG ζ ( h 1 c , h 2 c , , h n c ) = ( HFHPWA ζ ( h 1 , h 2 , , h n ) ) c .
Proof. 
Since (2) is similar (1), we only prove (1).
HFHPWA ζ ( h 1 c , h 2 c , , h n c ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ n h n 1 ζ i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n 1 + ( ζ 1 ) ( 1 γ i ) w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n γ i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) = ( HFHPWG ζ ( h 1 , h 2 , , h n ) ) c .

3.2. Generalized Hesitant Fuzzy Hamacher Power-Weighted Average/Geometric Operators

Definition 7.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 . For a parameter λ > 0 , a generalized hesitant fuzzy Hamacher power-weighted average (GHFHPWA) operator is a function H n H such that
GHFHPWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n w i ( 1 + T ( h i ) ) · H h i H λ i = 1 n w i ( 1 + T ( h i ) ) H 1 λ ,
where parameter ζ > 0 , T ( h i ) = j = 1 , j i n w j Sup ( h i , h j ) and Sup ( h i , h j ) is the support for h i from h j .
Theorem 9.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then the aggregated value by GHFHPWA operator is also a HFE, and
GHFHPWA ζ ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n ζ i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ + ( ζ 1 ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ ,
where a i = ( 1 + ( ζ 1 ) ( 1 γ i ) ) λ + ( ζ 2 1 ) γ i λ and b i = ( 1 + ( ζ 1 ) ( 1 γ i ) ) λ γ i λ .
Proof. 
We first use the mathematical induction on n to prove
H i = 1 n w i ( 1 + T ( h i ) ) · H h i H λ i = 1 n w i ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) .
(1) When n = 1 , since w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) = 1 , we have
H i = 1 n w i ( 1 + T ( h i ) ) · H h i H λ i = 1 n w i ( 1 + T ( h i ) ) = h 1 H λ = γ 1 h 1 ζ γ 1 λ ( 1 + ( ζ 1 ) ( 1 γ 1 ) ) λ + ( ζ 1 ) γ 1 λ = γ 1 h 1 a 1 b 1 a 1 + ( ζ 1 ) b 1 .
Thus, Equation (17) holds for n = 1 .
(2) Suppose that Equation (17) holds for n = k , that is
H i = 1 k w i ( 1 + T ( h i ) ) · H h i H λ i = 1 k w i ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ k h k i = 1 k a i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) i = 1 k b i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) i = 1 k a i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 k b i w i ( 1 + T ( h i ) ) i = 1 k w i ( 1 + T ( h i ) ) ,
then, when n = k + 1 , by the operational laws in Definition 4, we have
H i = 1 k + 1 w i ( 1 + T ( h i ) ) · H h i H λ i = 1 k + 1 w i ( 1 + T ( h i ) ) = H i = 1 k w i ( 1 + T ( h i ) ) · H h i H λ i = 1 k + 1 w i ( 1 + T ( h i ) ) H w k + 1 ( 1 + T ( h k + 1 ) ) · H h k + 1 H λ i = 1 k + 1 w i ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ k h k i = 1 k a i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k b i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k a i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 k b i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) H γ k + 1 h k + 1 a k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) b k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) a k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) + ( ζ 1 ) b k + 1 w k + 1 ( 1 + T ( h k + 1 ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ k h k , γ k + 1 h k + 1 i = 1 k + 1 a i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k + 1 b i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) i = 1 k + 1 a i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 k + 1 b i w i ( 1 + T ( h i ) ) i = 1 k + 1 w i ( 1 + T ( h i ) ) ,
i.e., Equation (17) holds for n = k + 1 . Thus, Equation (17) holds for all n.
Hence, by the operational laws in Definition 4, we have
GHFHPWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n w i ( 1 + T ( h i ) ) · H h i H λ i = 1 n w i ( 1 + T ( h i ) ) H 1 λ = γ 1 h 1 , γ 2 h 2 , , γ n h n ζ i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ 1 + ( ζ 1 ) ( 1 i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) ) 1 λ + ( ζ 1 ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 1 ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ = γ 1 h 1 , γ 2 h 2 , , γ n h n ζ i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ + ( ζ 1 ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ ,
which completes the proof of the theorem. □
Remark 3.
(1) If Sup ( h i , h j ) = k , for all i j , then
GHFHPWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n w i · H h i H λ H 1 λ
and thus, the GHFHPWA operator reduces to the generalized hesitant fuzzy Hamacher weighted average (GHFHWA) operator [17].
(2) If ζ = 1 , then the GHFHPWA operator reduces to the generalized hesitant fuzzy power-weighted average (GHFPWA) operator [15]:
GHFHPWA 1 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n 1 i = 1 n 1 γ i λ w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ
and if ζ = 2 , then the GHFHPWA operator reduces to the generalized hesitant fuzzy Einstein power-weighted average (GHFEPWA) operator [18]:
GHFHPWA 2 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n 2 i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + 3 i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ + i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ ,
where a i = ( 2 γ i ) λ + 3 γ i λ , b i = ( 2 γ i ) λ γ i λ .
(3) If λ = 1 , then a i = ζ ( 1 + ( ζ 1 ) γ i ) and b i = ζ ( 1 γ i ) , and thus the GHFHPWA operator reduces to the HFHPWA operator.
In particular, if w = ( 1 n , 1 n , , 1 n ) T , then the GHFHPWA operator reduces to the generalized hesitant fuzzy Hamacher power average (GHFHPA) operator:
GHFHPA ζ ( h 1 , h 2 , , h n ) = H i = 1 n ( 1 + T ( h i ) ) · H h i H λ i = 1 n ( 1 + T ( h i ) ) H 1 λ = γ 1 h 1 , γ 2 h 2 , , γ n h n ζ i = 1 n a i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) i = 1 n b i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) 1 λ i = 1 n a i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n b i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) 1 λ + ( ζ 1 ) i = 1 n a i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n b i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ ,
where a i = ( 1 + ( ζ 1 ) ( 1 γ i ) ) λ + ( ζ 2 1 ) γ i λ , b i = ( 1 + ( ζ 1 ) ( 1 γ i ) ) λ γ i λ and T ( h i ) = 1 n j = 1 , j i n Sup ( h i , h j ) .
Definition 8.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 . For λ > 0 , a generalized hesitant fuzzy Hamacher power-weighted geometric (GHFHPWG) operator is a function H n H such that
GHFHPWG ζ ( h 1 , h 2 , , h n ) = 1 λ · H H i = 1 n λ · H h i H w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) ,
where ζ > 0 , T ( h i ) = j = 1 , j i n w j Sup ( h i , h j ) and Sup ( h i , h j ) is the support for h i from h j .
Theorem 10.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i ( i = 1 , 2 , , n ) such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then the aggregated value by GHFHPWG operator is also a HFE, and
GHFHPWG ζ ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ + ( ζ 1 ) i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ ,
where c i = ( 1 + ( ζ 1 ) γ i ) λ + ( ζ 2 1 ) ( 1 γ i ) λ and d i = ( 1 + ( ζ 1 ) γ i ) λ ( 1 γ i ) λ .
Proof. 
Similar to the proof of Theorem 9, Equation (23) can be proved by mathematical induction on n. □
In particular, if w = ( 1 n , 1 n , , 1 n ) T , then the GHFHPWG operator reduces to the generalized hesitant fuzzy Hamacher power geometric (GHFHPG) operator:
GHFHPA ζ ( h 1 , h 2 , , h n ) = 1 λ · H H i = 1 n λ · H h i H ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n c i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n d i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) 1 λ i = 1 n c i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) i = 1 n d i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) 1 λ i = 1 n c i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) + ( ζ 2 1 ) i = 1 n d i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) 1 λ + ( ζ 1 ) i = 1 n c i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) i = 1 n d i ( 1 + T ( h i ) ) i = 1 n ( 1 + T ( h i ) ) 1 λ ,
where c i = ( 1 + ( ζ 1 ) γ i ) λ + ( ζ 2 1 ) ( 1 γ i ) λ , d i = ( 1 + ( ζ 1 ) γ i ) λ ( 1 γ i ) λ and T ( h i ) = 1 n j = 1 , j i n Sup ( h i , h j ) .
Remark 4.
(1) If ζ = 1 , then the GHFHPWG operator reduces to the generalized hesitant fuzzy power-weighted geometric (GHFPWG) operator [15]:
GHFHPWG 1 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n γ i λ w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ .
and if ζ = 2 , then the GHFHPWG operator reduces to the generalized hesitant fuzzy Einstein power-weighted geometric (GHFEPWG) operator [18]:
GHFHPWG 2 ( h 1 , h 2 , , h n ) = γ 1 h 1 , γ 2 h 2 , , γ n h n i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + 3 i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) + 3 i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ + ( ζ 1 ) i = 1 n c i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) i = 1 n d i w i ( 1 + T ( h i ) ) i = 1 n w i ( 1 + T ( h i ) ) 1 λ ,
where c i = ( 1 + γ i ) λ + 3 ( 1 γ i ) λ , d i = ( 1 + γ i ) λ ( 1 γ i ) λ . (2) If Sup ( h i , h j ) = k , for all i j , then
GHFHPWG ζ ( h 1 , h 2 , , h n ) = 1 λ · H H i = 1 n λ · H h i H w i
and thus, the GHFHPWG operator reduces to the generalized hesitant fuzzy Hamacher weighted geometric (GHFHWG) operator [17].
(3) If λ = 1 , then c i = ζ ( 1 + ( ζ 1 ) ( 1 γ i ) ) and d i = ζ γ i , and so the GHFHPWG operator reduces to the HFHPWG operator.
Theorem 11.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs and w = ( w 1 , w 2 , , w n ) T be the weight vector of h i such that w i [ 0 , 1 ] and i = 1 n w i = 1 , then we have
  • (1) GHFHPWA ζ ( h 1 c , h 2 c , , h n c ) = ( GHFHPWG ζ ( h 1 , h 2 , , h n ) ) c ;
  • (2) GHFHPWG ζ ( h 1 c , h 2 c , , h n c ) = ( GHFHPWA ζ ( h 1 , h 2 , , h n ) ) c .
Proof. 
Similar to the proof of Theorem 8. □

3.3. Hesitant Fuzzy Hamacher Power-Ordered Weighted Average/Geometric Operators

Motivated by the idea of the POWA operator [24], POWG operator [25] and Hamacher operations, we define the hesitant fuzzy Hamacher power-ordered weighted average (HFHPOWA) operator and hesitant fuzzy Hamacher power-ordered weighted geometric (HFHPOWG) operator as follows.
Definition 9.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs. A hesitant fuzzy Hamacher power-ordered weighted average (HFHPOWA) operator is a function H n H such that
HFHPOWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n u i · H h σ ( i ) ,
where parameter ζ > 0 , h σ ( i ) is the ith largest HFE of h j ( j = 1 , 2 , , n ), and u i ( i = 1 , 2 , , n ) is a collection of weights such that
u i = g R i T V g R i 1 T V , R i = j = 1 i V σ ( j ) , T V = i = 1 n V σ ( i ) , V σ ( i ) = 1 + T ( h σ ( i ) ) , T ( h σ ( i ) ) = j = 1 , j i n Sup ( h σ ( i ) , h σ ( j ) ) ,
where T ( h σ ( i ) ) denotes the support of ith largest HFE by all of the other HFEs, Sup ( h σ ( i ) , h σ ( j ) ) indicates the support of the ith largest HFE for the jth largest HFE, and g : [ 0 , 1 ] [ 0 , 1 ] is a basic unit-interval monotone (BUM) function with the following properties: (1) g ( 0 ) = 0 ; (2) g ( 1 ) = 1 ; and (3) g ( x ) g ( y ) if x > y .
Theorem 12.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, then the aggregated value by HFHPOWA operator is also an HFE, and
HFHPOWA ζ ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n 1 + ( ζ 1 ) γ σ ( i ) u i i = 1 n 1 γ σ ( i ) u i i = 1 n 1 + ( ζ 1 ) γ σ ( i ) u i + ( ζ 1 ) i = 1 n 1 γ σ ( i ) u i ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Remark 5.
(1) If Sup ( h i , h j ) = k for all i j and g ( x ) = x , then u i = 1 n , i = 1 , 2 , , n , and so
HFHPOWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n 1 n · H h i
which indicates that the HFHPOWA operator reduces to the hesitant fuzzy Hamacher average (HFHA) operator [17].
(2) If ζ = 1 , then the HFHPOWA operator reduces to the hesitant fuzzy power-ordered weighted average (HFPOWA) operator [15]:
HFHPOWA 1 ( h 1 , h 2 , , h n ) = i = 1 n u i h σ ( i ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) 1 i = 1 n 1 γ σ ( i ) u i ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29). If ζ = 2 , then the HFHPOWA operator (30) reduces to the hesitant fuzzy Einstein power-ordered weighted average (HFEPOWA) operator [18]:
HFHPOWA 2 ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n 1 + γ σ ( i ) u i i = 1 n 1 γ σ ( i ) u i i = 1 n 1 + γ σ ( i ) u i + i = 1 n 1 γ σ ( i ) u i ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Similar to Theorems 3 and 4, we have the properties of HFHPOWA operator as follows.
Theorem 13.
If h i ( i = 1 , 2 , , n ) is a collection of HFEs and u i ( i = 1 , 2 , , n ) is the collection of the weights which satisfies the condition (29), then
HFHPOWA ζ ( h 1 , h 2 , , h n ) HFPOWA ( h 1 , h 2 , , h n ) .
Theorem 14.
If h i ( i = 1 , 2 , , n ) is a collection of HFEs and u i ( i = 1 , 2 , , n ) is the collection of the weights which satisfies the condition (29), then we have the followings:
  • (1) Boundedness: If h = min { γ i | γ i h i } and h + = max { γ i | γ i h i } , then
    h HFHPOWA ζ ( h 1 , h 2 , , h n ) h + .
  • (2) Monotonicity: Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, if for any h σ ( i ) and h σ ( i ) ( i = 1 , 2 , , n ), γ σ ( i ) γ σ ( i ) , then
    HFHPOWA ζ ( h 1 , h 2 , , h n ) HFHPWA ζ ( h 1 , h 2 , , h n ) .
Definition 10.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs. A hesitant fuzzy Hamacher power-ordered weighted geometric (HFHPOWG) operator is a function H n H such that
HFHPOWG ζ ( h 1 , h 2 , , h n ) = H i = 1 n h σ ( i ) H u i ,
where parameter ζ > 0 , h σ ( i ) is the ith largest HFE of h j ( j = 1 , 2 , , n ), and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Theorem 15.
If h i ( i = 1 , 2 , , n ) is a collection of HFEs, then the aggregated value by HFHPOWG operator is also an HFE, and
HFHPOWG ζ ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) ζ i = 1 n γ σ ( i ) u i i = 1 n 1 + ( ζ 1 ) ( 1 γ σ ( i ) ) u i + ( ζ 1 ) i = 1 n γ σ ( i ) u i ,
where h σ ( i ) is the ith largest HFE of h j ( j = 1 , 2 , , n ) and u i ( i = 1 , 2 , , n ) is the collection of the weights satisfying the condition (29).
Remark 6.
(1) If Sup ( h i , h j ) = k , for all i j , and g ( x ) = x , then
HFHPOWG ζ ( h 1 , h 2 , , h n ) = H i = 1 n h i H 1 n
which indicates that the HFHPOWG operator reduces to the hesitant fuzzy Hamacher geometric (HFHG) operator [17].
(2) If ζ = 1 , then the HFHPOWG operator (34) reduces to the hesitant fuzzy power-ordered weighted geometric (HFPOWG) operator [15]:
HFHPOWG 1 ( h 1 , h 2 , , h n ) = i = 1 n h σ ( i ) u i = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n γ σ ( i ) u i ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29). If ζ = 2 , then the HFHPOWG operator (34) reduces to the hesitant fuzzy Einstein power-ordered weighted geometric (HFEPOWG) operator [18]:
HFHPOWG 2 ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) 2 i = 1 n γ σ ( i ) u i i = 1 n 2 γ σ ( i ) u i + i = 1 n γ σ ( i ) u i ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Similar to Theorems 6–8, we have the properties of HFHPOWG operator as follows.
Theorem 16.
If h i ( i = 1 , 2 , , n ) is a collection of HFEs and u i ( i = 1 , 2 , , n ) is the collection of the weights which satisfies the condition (29), then
HFHPOWG ζ ( h 1 , h 2 , , h n ) HFPOWG ( h 1 , h 2 , , h n ) .
Theorem 17.
If h i ( i = 1 , 2 , , n ) is a collection of HFEs and u i ( i = 1 , 2 , , n ) is the collection of the weights which satisfies the condition (29), then we have the followings:
  • (1) Boundedness: If h = min { γ i | γ i h i } and h + = max { γ i | γ i h i } , then
    h HFHPOWG ζ ( h 1 , h 2 , , h n ) h + .
  • (2) Monotonicity: Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, if for any h σ ( i ) and h σ ( i ) ( i = 1 , 2 , , n ), γ σ ( i ) γ σ ( i ) , then
    HFHPOWG ζ ( h 1 , h 2 , , h n ) HFHPOWG ζ ( h 1 , h 2 , , h n ) .
Theorem 18.
If h i ( i = 1 , 2 , , n ) is a collection of HFEs and u i ( i = 1 , 2 , , n ) is the collection of the weights satisfying the condition (29), then we have
  • (1) HFHPOWA ζ ( h 1 c , h 2 c , , h n c ) = ( HFHPOWG ζ ( h 1 , h 2 , , h n ) ) c ;
  • (2) HFHPOWG ζ ( h 1 c , h 2 c , , h n c ) = ( HFHPOWA ζ ( h 1 , h 2 , , h n ) ) c .
In what follows, we define the generalized hesitant fuzzy Hamacher power-ordered weighted average (GHFHPOWA) operator and generalized hesitant fuzzy Hamacher power-ordered weighted geometric (GHFHPOWG) operator.
Definition 11.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs. For λ > 0 , a generalized hesitant fuzzy Hamacher power-ordered weighted average (GHFHPOWA) operator is a function H n H such that
GHFHPOWA ζ ( h 1 , h 2 , , h n ) = H i = 1 n u i · H h σ ( i ) H λ H 1 λ ,
where ζ > 0 , h σ ( i ) is the ith largest HFE of h j ( j = 1 , 2 , , n ), and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Theorem 19.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, then the aggregated value by GHFHPOWA operator is also an HFE, and
GHFHPOWA ζ ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) ζ i = 1 n a i u i i = 1 n b i u i 1 λ i = 1 n a i u i + ( ζ 2 1 ) i = 1 n b i u i 1 λ + ( ζ 1 ) i = 1 n a i u i i = 1 n b i u i 1 λ ,
where a i = ( 1 + ( ζ 1 ) ( 1 γ σ ( i ) ) λ + ( ζ 2 1 ) γ σ ( i ) λ , b i = ( 1 + ( ζ 1 ) ( 1 γ σ ( i ) ) ) λ γ σ ( i ) λ and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Remark 7.
(1) If λ = 1 , then a i = ζ ( 1 + ( ζ 1 ) γ σ ( i ) ) and b i = ζ ( 1 γ σ ( i ) ) , and thus the GHFHPOWA operator reduces to the HFHPOWA operator. In fact, by Equation (38), we have
GHFHPOWA ζ ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) ζ i = 1 n a i u i i = 1 n b i u i 1 λ i = 1 n a i u i + ( ζ 2 1 ) i = 1 n b i u i 1 λ + ( ζ 1 ) i = 1 n a i u i i = 1 n b i u i 1 λ = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n a i u i i = 1 n b i u i i = 1 n a i u i + ( ζ 1 ) i = 1 n b i u i = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n 1 + ( ζ 1 ) γ σ ( i ) u i i = 1 n 1 γ σ ( i ) u i i = 1 n 1 + ( ζ 1 ) γ σ ( i ) u i + ( ζ 1 ) i = 1 n 1 γ σ ( i ) u i = HFHPOWA ζ ( h 1 , h 2 , , h n ) .
(2) If ζ = 1 , then the GHFHPOWA operator reduces to the generalized hesitant fuzzy power-ordered weighted average (GHFPOWA) operator [15]:
GHFHPOWA 1 ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) 1 i = 1 n 1 γ σ ( i ) λ u i 1 λ ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29), and if ζ = 2 , then the GHFHPOWA operator reduces to the generalized hesitant fuzzy Einstein power-ordered weighted average (GHFEPOWA) operator [18]:
GHFHPOWA 2 ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) 2 i = 1 n a i u i i = 1 n b i u i 1 λ i = 1 n a i u i + 3 i = 1 n b i u i 1 λ + i = 1 n a i u i i = 1 n b i u i 1 λ ,
where a i = ( 2 γ σ ( i ) ) λ + 3 γ σ ( i ) λ , b i = ( 2 γ σ ( i ) ) λ γ σ ( i ) λ and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Definition 12.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs. For λ > 0 , a generalized hesitant fuzzy Hamacher power-ordered weighted geometric (GHFHPOWG) operator is a function H n H such that
GHFHPOWG ζ ( h 1 , h 2 , , h n ) = 1 λ · H H i = 1 n λ · H h σ ( i ) H u i ,
where ζ > 0 , h σ ( i ) is the ith largest HFE of h j ( j = 1 , 2 , , n ), and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Theorem 20.
Let h i ( i = 1 , 2 , , n ) be a collection of HFEs, then the aggregated value by GHFHPOWG operator is also an HFE, and
GHFHPOWG ζ ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n c i u i + ( ζ 2 1 ) i = 1 n d i u i 1 λ i = 1 n c i u i i = 1 n d i u i 1 λ i = 1 n c i u i + ( ζ 2 1 ) i = 1 n d i u i 1 λ + ( ζ 1 ) i = 1 n c i u i i = 1 n d i u i 1 λ ,
where c i = ( 1 + ( ζ 1 ) γ σ ( i ) ) λ + ( ζ 2 1 ) ( 1 γ σ ( i ) ) λ , d i = ( 1 + ( ζ 1 ) γ σ ( i ) ) λ ( 1 γ σ ( i ) ) λ and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).
Remark 8.
(1) If λ = 1 , then c i = ζ ( 1 + ( ζ 1 ) ( 1 γ σ ( i ) ) ) and d i = ζ γ σ ( i ) , and the GHFHPOWG operator reduces to the HFHPOWG operator.
(2) If ζ = 1 , then the GHFHPOWG operator reduces to the generalized hesitant fuzzy power-ordered weighted geometric (GHFPOWG) operator [15]:
GHFHPOWG 1 ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n γ σ ( i ) λ u i 1 λ ,
where u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29), and if ζ = 2 , then the GHFHPOWG operator reduces to the generalized hesitant fuzzy Einstein power-ordered weighted geometric (GHFEPOWG) operator [18]:
GHFHPOWG 2 ( h 1 , h 2 , , h n ) = γ σ ( 1 ) h σ ( 1 ) , γ σ ( 2 ) h σ ( 2 ) , , γ σ ( n ) h σ ( n ) i = 1 n c i u i + 3 i = 1 n d i u i 1 λ i = 1 n c i u i i = 1 n d i u i 1 λ i = 1 n c i u i + 3 i = 1 n d i u i 1 λ + i = 1 n c i u i i = 1 n d i u i 1 λ ,
where c i = ( 1 + γ σ ( i ) ) λ + 3 ( 1 γ σ ( i ) ) λ , d i = ( 1 + γ σ ( i ) ) λ ( 1 γ σ ( i ) ) λ , and u i ( i = 1 , 2 , , n ) is a collection of weights satisfying the condition (29).

4. Method for Multiple-Attribute Decision-Making Based on Hesitant Fuzzy Hamacher Power-Aggregation Operators

In this section, we use hesitant fuzzy Hamacher power-aggregation operators to develop an approach to MADM with hesitant fuzzy information.
Let X = { x 1 , x 2 , , x n } be a set of n alternatives, and G = { g 1 , g 2 , , g m } be a set of m attributes, whose weight vector is w = ( w 1 , w 2 , , w m ) T , satisfying w i > 0 ( i = 1 , 2 , , m ) and i = 1 m w i = 1 , where w i denotes the importance degree of the attribute g i . Suppose the group of decision-makers provides the evaluating value that the alternative x j ( i = 1 , 2 , , n ) satisfies the attribute g i ( j = 1 , 2 , , m ) represented by the HFEs h i j ( i = 1 , 2 , , m ; j = 1 , 2 , , n ). All these HFEs are contained in the hesitant fuzzy decision matrix D = h i j m × n .
The following steps can be used to solve the MADM problem under the hesitant fuzzy environment, and obtain an optimal alternative:
Step 1: Obtain the normalized hesitant fuzzy decision matrix. In general, the attribute set G can be divided two subsets: G 1 and G 2 , where G 1 and G 2 are the set of benefit attributes and cost attributes, respectively. If all the attributes are of the same type, then the evaluation values do not need normalization, whereas if there are benefit attributes and cost attributes in MADM, in such cases, we may transform the evaluation values of cost type into the evaluation values of the benefit type by the following normalization formula:
r i j = h i j , j G 1 h i j c , j G 2 ,
where h i j c = γ i j h ¯ i j { 1 γ i j } is the complement of h i j . Then we obtain the normalized hesitant fuzzy decision matrix H = r i j m × n .
Step 2: Calculate the supports
Sup ( r i j , r k j ) = 1 d ( r i j , r k j ) , j = 1 , 2 , , n , i , k = 1 , 2 , , m ,
which satisfy conditions (1)–(3) in Definition 5. Here we assume that d ( r i j , r k j ) is the hesitant normalized Hamming distance between r i j and r k j given in Equation (4).
Step 3: Calculate the weights of evaluating values. Use the weights w i ( i = 1 , 2 , , m ) of attributes g i ( i = 1 , 2 , , m ) to calculate the weighted support T ( r i j ) of the HFE r i j by the other HFEs r k j ( k = 1 , 2 , , m , and k i ):
T ( r i j ) = k = 1 , k i m w k Sup ( r i j , r k j )
and then use the weights w i ( i = 1 , 2 , , m ) of attributes g i ( i = 1 , 2 , , m ) to calculate the weights ρ i j ( i = 1 , 2 , , m ) that are associated with HFEs r i j ( i = 1 , 2 , , m ):
ρ i j = w i ( 1 + T ( r i j ) ) i = 1 m w i ( 1 + T ( r i j ) ) , i = 1 , 2 , , m ,
where ρ i j 0 , i = 1 , 2 , , m , and i = 1 m ρ i j = 1 .
Step 4: Compute overall assessments of alternatives. Use the HFHPWA operator (Equation (6)):
r j = HFHPWA ζ ( h 1 , h 2 , , h n ) = γ 1 j r 1 j , γ 2 j r 2 j , , γ m j r m j i = 1 m 1 + ( ζ 1 ) γ i j ρ i j i = 1 m 1 γ i j ρ i j i = 1 m 1 + ( ζ 1 ) γ i j ρ i j + ( ζ 1 ) i = 1 m 1 γ i j ρ i j ,
or the HFHPWG operator (Equation (11)):
r j = HFHPWG ζ ( h 1 , h 2 , , h n ) = γ 1 j r 1 j , γ 2 j r 2 j , , γ m j r m j ζ i = 1 m γ i j ρ i j i = 1 m 1 + ( ζ 1 ) ( 1 γ i j ) ρ i j + ( ζ 1 ) i = 1 m γ i j ρ i j .
to aggregate all the evaluating values r ¯ i j ( 1 = 1 , 2 , , m ) of the jth column and get the overall rating value r ¯ j corresponding to the alternative x j ( j = 1 , 2 , , n ).
Step 5: Rank the order of all alternatives. Use the method in Definition 3 to rank the overall rating values r j ( j = 1 , 2 , , n ), rank all the alternatives x j ( j = 1 , 2 , , n ) in accordance with r j ( j = 1 , 2 , , n ) in descending order, and finally select the most desirable alternative(s) with the largest overall evaluation value.
Step 6: End.
Remark 9.
As previously discussed, a family of hesitant fuzzy Hamacher power-aggregation operators, including the HFHPWA, HFHPWG, GHFHPWA, GHFHPWG, HFHPOWA, HFHPOWG, GHFHPOWA, and GHFHPOWG operators, is proposed for aggregating hesitant fuzzy information. This family is composed of two kinds: the HFHPWA operator and HFHPWG operator, and other aggregation operators are developed based on them. Therefore, in Step 3, the HFHPWA and HFHPWG operators are chosen to aggregate hesitant fuzzy information.
Example 4.
There is a five-member board of directors of a company. They plan to invest their money in a suitable project with a lot of potential over the next five years [17]. Assume that the board of directors will evaluate the four possible projects X = { x 1 , x 2 , x 3 , x 4 } . To evaluate and rank these projects, four attributes G = { g 1 , g 2 , g 3 , g 4 } are suggested by the Balances Score Card Methodology, i.e., (1) g 1 is the financial perspective; (2) g 2 is the customer satisfaction; (3) g 3 is the internal business process perspective; and (4) g 4 is the learning and growth perspective. Please note that these attributes are all benefit attributes and the corresponding weight vector is w = ( 0 . 2 , 0 . 3 , 0 . 15 , 0 . 35 ) T . The five members of the board of directors provide the evaluating values of the projects x j ( j = 1 , 2 , 3 , 4 ) with respect to attributes g i ( i = 1 , 2 , 3 , 4 ) and construct their hesitant fuzzy decision matrix D = ( h i j ) 4 × 4 (see Table 1), where h i j H is a HFE that denotes all of the possible values for alternative x j under the attribute g i .
Then we use the above proposed approach to choose the optimal project.
Step 1: Since these attributes are all benefit attributes, it is not necessary to normalize the decision matrix D.
Step 2: Use Equation(46) to calculate the supports Sup ( h i j , h k j ) ( j = 1 , 2 , 3 , 4 , i , k = 1 , 2 , 3 , 4 , i k ). For simplicity, we denote ( Sup ( h i j , h k j ) ) 1 × 4 by Sup i k , which refers to the supports between the ith and kth columns of D:
Sup 12 = Sup 21 = ( 0 . 900 , 0 . 750 , 0 . 900 , 0 . 800 ) , Sup 13 = Sup 31 = ( 0 . 800 , 0 . 950 , 0 . 950 , 0 . 867 ) , Sup 14 = Sup 41 = ( 0 . 800 , 0 . 850 , 0 . 975 , 0 . 633 ) , Sup 23 = Sup 32 = ( 0 . 860 , 0 . 750 , 0 . 850 , 0 . 667 ) , Sup 24 = Sup 42 = ( 0 . 860 , 0 . 600 , 0 . 925 , 0 . 495 ) , Sup 34 = Sup 43 = ( 0 . 920 , 0 . 850 , 0 . 925 , 0 . 767 ) .
Step 3: Use Equation (47) to calculate the weighted support T ( h i j ) of HFE h i j by the other HFEs h k j ( k = 1 , 2 , 3 , 4 , k i ), which are contained in the matrix T = ( T ( h i j ) ) 4 × 4 :
T = 0 . 6700 0 . 6650 0 . 7538 0 . 5916 0 . 6100 0 . 4725 0 . 6313 0 . 4333 0 . 7400 0 . 7125 0 . 7688 0 . 6420 0 . 5560 0 . 4775 0 . 6113 0 . 3902
and use Equation (48) to calculate the weights ρ i j of HFEs h i j ( i = 1 , 2 , 3 , 4 ), which are contained in the matrix V = ( ρ i j ) 4 × 4 :
V = 0 . 2058 0 . 2150 0 . 2101 0 . 2149 0 . 2977 0 . 2852 0 . 2932 0 . 2903 0 . 1609 0 . 1659 0 . 1589 0 . 1663 0 . 3356 0 . 3339 0 . 3378 0 . 3285 .
Step 4: Let ζ = 0 . 5 and use the HFHPWA operator (Equation (49)) to aggregate all of the evaluating values h i j ( i = 1 , 2 , 3 , 4 ) in the jth column of D and then, derive the overall rating value h j ( j = 1 , 2 , 3 , 4 ) of the alternative x j ( j = 1 , 2 , 3 , 4 ). The overall rating values h j are not listed here because of limited space. Using Definition 3, we calculate the score functions s ( h j ) of h j ( j = 1 , 2 , 3 , 4 ) as follows:
s ( h 1 ) = 0 . 5741 , s ( h 2 ) = 0 . 6195 , s ( h 3 ) = 0 . 5256 , s ( h 4 ) = 0 . 6646 .
Then we rank the h j ( j = 1 , 2 , 3 , 4 ) in descending order of s ( h j ) :
h 4 > h 2 > h 1 > h 3 .
Step 5: Rank all the alternatives x j ( j = 1 , 2 , 3 , 4 ) as follows:
x 4 x 2 x 1 x 3 .
Thus, the best alternative is x 4 .
Furthermore, let ζ = 0 . 1 , 0 . 3 , 0 . 5 , 3 , 5 , 7 , respectively, which represents different preferences for decision-makers on decision information. We can obtain the corresponding score values and rankings of the alternatives (listed in Table 2).
To explain how the different parameter value ζ plays a role in the aggregation operator, we use the different values ζ, given by decision-makers. As shown in Table 2, the score values obtained by the HPHPWA operator become smaller as the parameter value ζ increases. Thus, decision-makers can choose the parameter value ζ according to their preferences.
If the HFHPWA operator is replaced by HFHPWG operator in the above Step 4, Table 3 lists the score values of overall rating values and rankings of alternatives. The score values obtained by the HFHPWG operator become larger as parameter ζ increases. Comparing Table 2 with Table 3, we can observe that the score value obtained by the HFHPWA operator greater than the score value obtained by the HFHPWG operator for the same parameter value ζ and the same aggregation value. For HFHPWA operators, the parameter value does not affect the final rankings of the alternatives, but for the HFHPWG operators it is shown that the choice of parameter value has a greater impact on the score values and thus the rankings of the alternatives. In the above analysis, we see that while the best alternative obtained by the HFHPWA operator are the same as that obtained by the HFHPWG operator, the rankings of the alternatives differs between the HFHPWA and HFHPWG operators.
To compare our approach with some other approaches, we apply Xia and Xu’s approach [10], Zhu et al.’s approach [13], and Tan et al.’s approach [17] to above example. The results of the rankings of the alternatives are shown in Table 4 below.
From this analysis, we can see that the best alternative is the same for the both HFHPWA and HFHPWG operators, or both HFWA and HFWG operators, or both HFHWA and HFHWG operators, but the ranking of alternatives is different between the HFHPWA and HFHPWG operators, or HFWA and HFWG operators, or HFHWA and HFHWG operators. It reflects that the final results may be different by different types of hesitant fuzzy aggregation operators. Also, the ranking of alternatives obtained by the hesitant fuzzy TOPSIS method is the same those by the HFHPWA, HFWA, and HFHWA operators. This result shows the validity of the proposed approach in this paper.
Compared with the existing hesitant fuzzy MADM approaches, our proposed approach has two advantages: First, decision-makers often have an optimistic or pessimistic attitude in the face of decision information. In this case, optimistic attitude often leads to a preference for risk-seeking, and pessimistic one results in a preference for avoiding risk. The parameter ζ takes into account the decision-maker’s subjective attitude to decision-making problem and are therefore useful in obtaining a better decision result. Second, different parameter values clearly indicate changes in the ranking of alternatives. Compared to a fixed evaluated result obtained by existing aggregation operators such as the HFWA and HFWG operators, our evaluated result can better reflect the variety.

5. Conclusions

Hesitant fuzzy information aggregation is one of key issues in the hesitant fuzzy MADM, an important field of research in decision science in an uncertain environment as well as HFS theory. Based on Hamacher operations of HFEs, in this paper, we have developed a family of hesitant fuzzy Hamacher power-aggregation operators, including the HFHWPA, HFHPWG, GHFHPWA, GHFHPWG, HFHPOWA, HFHPOWG, GHFHPOWA, and GHFHPOWG operators. Some basic properties of the proposed aggregation operators, such as boundedness and monotonicity, and the relationships between them have been investigated and discussed. We compared the proposed aggregation operators with the hesitant fuzzy aggregation operators developed by Yu et al. [18] and Zhang [15] and represented their corresponding relations. These proposed hesitant fuzzy Hamacher power-aggregation operators are integrated treatment of operators proposed by Yu et al. [18] and Zhang [15], and provide a complement to the existing work on HFSs. An approach of the hesitant fuzzy MADM based on the HFHPWA and HFHPWG operators has been developed and an example of money investment selection has been provided to describe the hesitant fuzzy MADM process. Some advantages of our proposed approach are shown by comparison with those previously proposed by Xia and Xu [10], Zhu et al. [13] and Tan et al. [17].
In future work, we will present a series of hesitant fuzzy power-aggregation operators using Frank t-norm and t-conorm and apply them to develop approaches for multiple-attribute group decision-making. Furthermore, we will discuss the extension of power-aggregation operators to probabilistic hesitant fuzzy environment.

Author Contributions

J.H.P. drafted the initial manuscript and conceived the MADM framework. M.J.S. provided the relevant literature review and illustrated example. M.J.S. and K.H.K. revised the manuscript and analyzed the data.

Funding

This work was supported by a Research Grant of Pukyong National University (2019).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  3. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  4. Atanassov, K.; Gargov, G. Interval-valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
  5. Dubois, D.; Prade, H. Fuzzy Sets and Systems: Theory and Applications; Academic Press: Cambridge, MA, USA, 1980. [Google Scholar]
  6. Miyamoto, S. Fuzzy multisets and their generalizations. In Proceedings of the International Conference on Membrane Computing, Curtea de Arges, Romania, 21–25 August 2000; pp. 225–236. [Google Scholar]
  7. Torra, V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  8. Torra, V.; Narukawa, Y. On hesitant fuzzy sets and decision. In Proceedings of the 18th IEEE International Conference on Fuzzy Systems, Jeju Island, Korea, 20–24 August 2009; pp. 1378–1382. [Google Scholar]
  9. Rodríguez, R.; Martínez, L.; Herrera, E. Hesitant fuzzy linguistic term sets for decision making. IEEE Trans. Fuzzy Syst. 2012, 20, 109–119. [Google Scholar] [CrossRef]
  10. 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]
  11. Xu, Z.S.; Xia, M.M. Distance and similarity measures for hesitant fuzzy sets. Inf. Sci. 2011, 181, 2128–2138. [Google Scholar] [CrossRef]
  12. Wei, G.W. Hesitant fuzzy prioritized operatros and their application to multiple attribute group decision making. Knowl.-Based Syst. 2012, 31, 176–182. [Google Scholar] [CrossRef]
  13. Zhu, B.; Xu, Z.S.; Xia, M.M. Hesitant fuzzy geometric Bonferroni means. Inf. Sci. 2012, 205, 72–85. [Google Scholar] [CrossRef]
  14. Xia, M.M.; Xu, Z.S.; Chen, N. Some hesitant fuzzy aggregation operators with their application in group decision making. Group Dec. Negoit. 2013, 22, 259–279. [Google Scholar] [CrossRef]
  15. Zhang, Z.M. Hesitant fuzzy power aggregation operators and their application to multiple attribute group decision making. Inf. Sci. 2013, 234, 150–181. [Google Scholar] [CrossRef]
  16. Yu, D.J. Some hesitant fuzzy infromation aggregation operators based on Einstein operational laws. Int. J. Intell. Syst. 2014, 29, 320–340. [Google Scholar] [CrossRef]
  17. Tan, C.; Yi, W.; Chen, X. Hesitant fuzzy Hamacher aggregation operators for multicriteria decision making. Appl. Soft Comput. 2015, 26, 325–349. [Google Scholar] [CrossRef]
  18. Yu, Q.; Hou, F.; Zhai, Y.; Du, Y. Some hesitant fuzzy Einstein aggregation operators and their application to multiple attribute group decision making. Int. J. Intell. Syst. 2016, 31, 722–746. [Google Scholar] [CrossRef]
  19. Kahraman, C.; Oztaysi, B.; Ucal Sarı, I.; Turanoglu, E. Fuzzy analytic hierarchy process with interval type-2 fuzzy sets. Knowl. Base Syst. 2016, 59, 48–57. [Google Scholar] [CrossRef]
  20. Wang, C.N.; Yang, C.Y.; Cheng, H.C. Fuzzy multi-criteria decision-making model for supplier evaluation and selection in wind power plant project. Mathematics 2019, 7, 417. [Google Scholar] [CrossRef]
  21. Ziemba, P.; Becker, J. Analysis of the digital divide using fuzzy forecasting. Symmetry 2019, 11, 166. [Google Scholar] [CrossRef]
  22. Mari, S.I.; Memon, M.S.; Ramzan, M.B.; Qureshi, S.M.; Iqbal, M.W. Interactive fuzzy multi criteria decision making approach for supplier selection and order allocation in a resilient supply China. Mathematics 2019, 7, 137. [Google Scholar] [CrossRef]
  23. Wang, T.C.; Tsai, S.Y. Solar panel supplier selection for the photovoltaic system design by using fuzzy multi-criteria decision making (MCDM) approaches. Energies 2018, 11, 1989. [Google Scholar] [CrossRef]
  24. Yager, R.R. The power average operator. IEEE Trans. Syst. Man Cybern. 2001, 31, 724–731. [Google Scholar] [CrossRef]
  25. Xu, Z.S.; Yager, R.R. Power-geometric operators and their use in group decision making. IEEE Trans. Fuzzy Syst. 2010, 18, 94–105. [Google Scholar]
  26. Zhou, L.G.; Chen, H.Y.; Liu, J.P. Generalized power aggregation operators and their applications in group decision making. Comput. Ind. Eng. 2012, 62, 989–999. [Google Scholar] [CrossRef]
  27. Xu, R.N.; Zhai, X.Y. Extensions of the analytic hierarchy process in fuzzy environment. Fuzzy Sets Syst. 1992, 52, 251–257. [Google Scholar]
  28. Chen, T.Y. A comparative analysis of score functions for multiple criteria decision making in intuitionistic fuzzy settings. Inf. Sci. 2011, 181, 3652–3676. [Google Scholar] [CrossRef]
  29. Guo, K.H.; Li, W.L. An attitudinal-based method for constructing intuitionistic fuzzy information in hybrid MADM under uncertainty. Inf. Sci. 2012, 208, 28–38. [Google Scholar] [CrossRef]
  30. Wu, J.Z.; Chen, F.; Nie, C.P.; Zhang, Q. Intuitionistic fuzzy-valued Choquet integral and its application in multicriteria decision making. Inf. Sci. 2013, 222, 509–527. [Google Scholar] [CrossRef]
  31. Xu, Z.S. Methods for aggregating interval-valued intuitionistic fuzzy information and their application to decision making. Control Decis. 2007, 22, 215–219. [Google Scholar]
  32. Chou, J.R. A linguistic evaluation approach for unversal design. Inf. Sci. 2012, 190, 76–94. [Google Scholar] [CrossRef]
  33. Delgado, M.; Herrera, F.; Herrera-Viedma, E.; Martínez, L. Combining numerical and linguistic information in group decision making. Inf. Sci. 1998, 107, 177–194. [Google Scholar] [CrossRef]
  34. Delgado, M.; Herrera, F.; Herrera-Viedma, E.; Martínez, L. A fusion approach for managing multigranularity linguistic term sets in decision making. Fuzzy Sets Syst. 2000, 114, 43–58. [Google Scholar]
  35. Xu, Z.S. Uncertain linguistic aggregation opweerators based on approach to multiple attribute group decision making under uncertain linguistic environment. Inf. Sci. 2004, 168, 171–184. [Google Scholar] [CrossRef]
  36. Xu, Z.S. Induced uncertain linguistic OWA operators applied to group decision making. Inf. Fusion 2006, 7, 231–238. [Google Scholar] [CrossRef]
  37. Xu, Z.S. An approach based on the uncertain LOWG and induced uncertain LOWG operators to group decision making with uncertain multiplicative linguistic preference relations. Decis. Support Syst. 2006, 41, 488–499. [Google Scholar] [CrossRef]
  38. Xu, Z.S.; Cai, X.Q. Uncertain power average operators for aggregating interval fuzzy preference relations. Group Dec. Negoit. 2012, 21, 381–397. [Google Scholar] [CrossRef]
  39. Park, J.H.; Park, J.M.; Seo, J.J.; Kwun, Y.C. Power harmonic operators and their applications in group decision making. J. Comput. Anal. Appl. 2013, 15, 1120–1137. [Google Scholar]
  40. Xu, Z.S. Approaches to multiple attribute group decision making based on intuitionistic fuzzy power aggregation operators. Knowl.-Based Syst. 2011, 24, 749–760. [Google Scholar] [CrossRef]
  41. Xu, Y.J.; Merigó, J.M.; Wang, H.M. Linguistic power aggregation operators and their application to muktiple attribute group decision making. Appl. Math. Model. 2012, 36, 5427–5444. [Google Scholar] [CrossRef]
  42. Xu, Y.J.; Wang, H.M. Approaches based on 2-tuple linguistic power aggregation operators for multiple attribute group decision making under linguistic environment. Appl. Soft Comput. 2011, 11, 3988–3997. [Google Scholar] [CrossRef]
  43. Xu, Y.J.; Wang, H.M. Power geometric operators for group decision making under multiplicative linguistic preference relations. Int. J. Uncertain. Fuzz. Knowl. Based Syst. 2012, 20, 139–159. [Google Scholar] [CrossRef]
  44. Zhou, L.G.; Chen, H.Y. A generalization of the power aggregation operators for linguistic environment and its application in group decision making. Knowl.-Based Syst. 2012, 26, 216–224. [Google Scholar] [CrossRef]
  45. Klement, E.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  46. Hamacher, H. Uber Logische Verknunpfungenn Unssharfer Aussagen undderen Zugenhorige Bewertungsfunktione; Trappl, R., Klir, G.J., Riccardi, L., Eds.; Progress in Cybernatics and Systems Research: Washington, DC, USA, 1978; Volume 3, pp. 276–288. [Google Scholar]
  47. Xu, Z.S. On consistency of the weighted geometric mean complex judgement matrix in AHP. Eur. J. Oper. Res. 2000, 126, 683–687. [Google Scholar] [CrossRef]
  48. Torra, V.; Narukawa, Y. Modeling Decisions: Information Fusion and Aggregation Operators; Springer: Berlin, Germany, 2007. [Google Scholar]
Table 1. Hesitant fuzzy decision matrix D.
Table 1. Hesitant fuzzy decision matrix D.
x 1 x 2 x 3 x 4
g 1 { 0 . 2 , 0 . 4 , 0 . 7 } { 0 . 2 , 0 . 4 , 0 . 7 , 0 . 9 } { 0 . 3 , 0 . 5 , 0 . 6 , 0 . 7 } { 0 . 3 , 0 . 5 , 0 . 6 }
g 2 { 0 . 2 , 0 . 6 , 0 . 8 } { 0 . 1 , 0 . 2 , 0 . 4 , 0 . 5 } { 0 . 2 , 0 . 4 , 0 . 5 , 0 . 6 } { 0 . 2 , 0 . 4 }
g 3 { 0 . 2 , 0 . 3 , 0 . 6 , 0 . 7 , 0 . 9 } { 0 . 3 , 0 . 4 , 0 . 6 , 0 . 9 } { 0 . 3 , 0 . 5 , 0 . 7 , 0 . 8 } { 0 . 5 , 0 . 6 , 0 . 7 }
g 4 { 0 . 3 , 0 . 4 , 0 . 5 , 0 . 7 , 0 . 8 } { 0 . 5 , 0 . 6 , 0 . 8 , 0 . 9 } { 0 . 2 , 0 . 5 , 0 . 6 , 0 . 7 } { 0 . 8 , 0 . 9 }
Table 2. Score values obtained with the HFHPWA operator and rankings of alternatives.
Table 2. Score values obtained with the HFHPWA operator and rankings of alternatives.
Aggregation OperatorScore ValuesRankings
HFHPWA 0 . 1 s ( h 1 ) = 0 . 5957 , s ( h 2 ) = 0 . 6501 , s ( h 3 ) = 0 . 5318 , s ( h 4 ) = 0 . 7000 x 4 x 2 x 1 x 3
HFHPWA 0 . 3 s ( h 1 ) = 0 . 5826 , s ( h 2 ) = 0 . 6314 , s ( h 3 ) = 0 . 5298 , s ( h 4 ) = 0 . 6780 x 4 x 2 x 1 x 3
HFHPWA 0 . 5 s ( h 1 ) = 0 . 5741 , s ( h 2 ) = 0 . 6195 , s ( h 3 ) = 0 . 5256 , s ( h 4 ) = 0 . 6646 x 4 x 2 x 1 x 3
HFHPWA 3 s ( h 1 ) = 0 . 5419 , s ( h 2 ) = 0 . 5752 , s ( h 3 ) = 0 . 5063 , s ( h 4 ) = 0 . 6186 x 4 x 2 x 1 x 3
HFHPWA 5 s ( h 1 ) = 0 . 5350 , s ( h 2 ) = 0 . 5653 , s ( h 3 ) = 0 . 5017 , s ( h 4 ) = 0 . 6095 x 4 x 2 x 1 x 3
HFHPWA 7 s ( h 1 ) = 0 . 5313 , s ( h 2 ) = 0 . 5598 , s ( h 3 ) = 0 . 4993 , s ( h 4 ) = 0 . 6047 x 4 x 2 x 1 x 3
Table 3. Score values obtained with the HFHPWG operator and rankings of alternatives.
Table 3. Score values obtained with the HFHPWG operator and rankings of alternatives.
Aggregation Operator Score Values Rankings
HFHPWG 0 . 1 s ( h 1 ) = 0 . 4397 , s ( h 2 ) = 0 . 4118 , s ( h 3 ) = 0 . 4187 , s ( h 4 ) = 0 . 4673 x 4 x 1 x 3 x 2
HFHPWG 0 . 3 s ( h 1 ) = 0 . 4520 , s ( h 2 ) = 0 . 4321 , s ( h 3 ) = 0 . 4373 , s ( h 4 ) = 0 . 4824 x 4 x 1 x 3 x 2
HFHPWG 0 . 5 s ( h 1 ) = 0 . 4603 , s ( h 2 ) = 0 . 4444 , s ( h 3 ) = 0 . 4483 , s ( h 4 ) = 0 . 4930 x 4 x 1 x 3 x 2
HFHPWG 3 s ( h 1 ) = 0 . 4935 , s ( h 2 ) = 0 . 4936 , s ( h 3 ) = 0 . 4904 , s ( h 4 ) = 0 . 5410 x 4 x 2 x 1 x 3
HFHPWG 5 s ( h 1 ) = 0 . 5009 , s ( h 2 ) = 0 . 5027 , s ( h 3 ) = 0 . 5005 , s ( h 4 ) = 0 . 5536 x 4 x 2 x 1 x 3
HFHPWG 7 s ( h 1 ) = 0 . 5049 , s ( h 2 ) = 0 . 5126 , s ( h 3 ) = 0 . 5061 , s ( h 4 ) = 0 . 5608 x 4 x 2 x 3 x 1
Table 4. Rankings of alternatives by other approaches.
Table 4. Rankings of alternatives by other approaches.
ApproachUse ToolRankings
Xia and Xu [10]HFWA operator x 4 x 2 x 1 x 3
HFWG operator x 4 x 1 x 3 x 2
Zhu et al. [13]Hesitant fuzzy TOPSIS x 4 x 2 x 1 x 3
Tan et al. [17]HFHWA operator x 4 x 2 x 1 x 3
HFHWG operator x 4 x 3 x 1 x 2 ( ζ ( 0 , 0 . 36 ] )
x 4 x 1 x 3 x 2 ( ζ ( 0 . 36 , 1 . 39 ] )
x 4 x 1 x 2 x 3 ( ζ ( 1 . 39 , 3 . 50 ] )
x 4 x 2 x 1 x 3 ( ζ ( 3 . 50 , 10 . 0 ] )

Share and Cite

MDPI and ACS Style

Son, M.J.; Park, J.H.; Ko, K.H. Some Hesitant Fuzzy Hamacher Power-Aggregation Operators for Multiple-Attribute Decision-Making. Mathematics 2019, 7, 594. https://doi.org/10.3390/math7070594

AMA Style

Son MJ, Park JH, Ko KH. Some Hesitant Fuzzy Hamacher Power-Aggregation Operators for Multiple-Attribute Decision-Making. Mathematics. 2019; 7(7):594. https://doi.org/10.3390/math7070594

Chicago/Turabian Style

Son, Mi Jung, Jin Han Park, and Ka Hyun Ko. 2019. "Some Hesitant Fuzzy Hamacher Power-Aggregation Operators for Multiple-Attribute Decision-Making" Mathematics 7, no. 7: 594. https://doi.org/10.3390/math7070594

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