1,071
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Multi-Criteria Decision Making Model For Hotel Selection Problem Under Complex Dual Hesitant Fuzzy Information

, , , , & ORCID Icon
Article: 2300215 | Received 03 Jan 2023, Accepted 25 Nov 2023, Published online: 04 Jan 2024

ABSTRACT

The notion of the “complex dual hesitant fuzzy set (CDHFS)” is the combination of the “dual hesitant fuzzy set (DHFS)” and the “complex fuzzy set (CFS).” It is characterized by two degrees, namely the membership and nonmembership, in the form of a finite subset on a unit disc in the complex plane. CDHFS is useful for dealing with real-world problems involving uncertain or hard-to-predict information. Also, to approximate smoothly, the Einstein operators are well-known aggregation operators, while prioritized operators are effective tools for prioritization among criteria. Therefore, the goal of this study is to develop some prioritized aggregation operators under the CDHFS environment; namely the complex dual hesitant fuzzy prioritized averaging (CDHFPA) operator, the complex dual hesitant fuzzy prioritized geometric (CDHFPG) operator, the complex dual hesitant fuzzy Einstein prioritized averaging (CDHFEPA) operator, and complex dual hesitant fuzzy Einstein prioritized geometric (CDHFEPG) operator. Some properties of the proposed operators are investigated in detail. In addition, a multi-criteria decision-making (MCDM) method based on the proposed operators with the complex dual hesitant fuzzy setting is developed. Moreover, a numerical example is given for the application and effectiveness of the developed MCDM approach. A comparison study is also done with existing methods to show that the proposed MCDM method is better and more reliable. The study finds that if the expert’s preference is used to choose the right aggregation operators, the decision maker will have access to a wide range of compromise solutions.

Introduction

The fuzzy set (FS) theory was first initiated by Zadeh (Citation1965). It has been used widely and successfully in all areas of real-life decision-making problems (Yager Citation1977), and it is a good way to show data that needs to be clarified. Only the degree of membership function mapping to the close interval [0, 1] is defined by an FS. But because the membership function only has one value, it cannot show proof of endorsement or rejection in many cases. So, more than the information we can get from the FS is needed for many practical situations. To overcome this situation, Atanassov (Citation1986) was the first to develop the concept of an intuitionistic fuzzy set (IFS), which is an extension of FS. The IFS is characterized by membership and non-membership functions such that their sum 1. People think that IFS is better than traditional FS theory at dealing with ambiguity and uncertainty. The notion of IFS is widely applied to deal with decision-making (DM) problems (Beg and Rashid Citation2014; Boran et al. Citation2009; De, Biswas, and Roy Citation2001; Li Citation2005). Torra and Narukawa (Citation2009) and Torra (Citation2010) introduced the theory of hesitant fuzzy sets (HFS), which presented a new generalization form of FS. It is characterized by a membership function having a set of possible values from the close interval [0,1]. Based on the relationship between the hesitant fuzzy elements (HFEs) and the IF values (IFVs), Xia and Xu (Citation2011) developed some hesitant fuzzy (HF) operational laws. Zhu, Xu, and Xia (Citation2012) developed dual hesitant fuzzy set (DHFS) to generalize IFS with HFS. DHFSs comprise the membership hesitancy function and the nonmembership hesitancy function. These functions make it easier and more flexible to give each element in the domain a value. In this circumstance, we must deal with two different types of hesitancy. We do not face an interval of possibilities; rather, the current sets, including FSs, IFSs, and HFSs, can be regarded as special cases of DHFSs or some possibility distributions on the possible values or multiple occurrences of an element, but several different possible values indicate the epistemic degrees, whether there is certainty or uncertainty. For instance, in a multicriteria decision-making situation, some decision makers take into account 0.2, 0.3, and 0.4 as possible values for the membership degree of a into the set A, and 0.5, 0.6, and 0.7 as possible values for the nonmembership degrees instead of simply one integer or a tuple. Therefore, there is some restriction on the confidence and uncertainty of the potential values, which can more accurately reflect the initial information provided by the decision makers. Moreover, Limboo and Dutta (Citation2022) developed a q-rung orthopair basic probability assignment method and applied the concept to medical diagnosis. Furthermore, Das and Granados (Citation2022) initiated the notion of the FP-intuitionistic multi-fuzzy N-soft set and its induced FP-Hesitant N soft set, which are the extension of IFS and HFS, respectively. Riaz and Farid (Citation2022) developed some picture fuzzy aggregation operators and proposed an MCDM method for the selection of third-party logistic providers.

Some scholars have questioned what will happen if we convert the fuzzy set’s range into a unit disc in the complex plane. Due to this reason, Ramot et al. (Citation2002) developed the concept of complex fuzzy set (CFS), which contains the degree of membership function (amplitude and phase terms) as a complex number of a unit disc in the complex plane. CFS deals with two dimensions of information in a single set. CFS is an effective method for demonstrating how people believe that grades are formed. The complex fuzzy set considers only the degree of membership; the non-membership component of the data entities, which also assumes an equal role in evaluating the object in the decision-making process, is not given any weight. Although it is frequently challenging to describe the assessment of the membership degree by an accurate number in a fuzzy collection in the real world. After the appearance of CFS, many researchers have started working on it and applied the concept to MCDM problems (Xiao and Ding Citation2019; Munir et al. Citation2020; Ullah, Mahmood, and Garg Citation2020; Mahmood et al. Citation2019; Ali and Mahmood Citation2020a, Citation2020b; Liu, Mahmood, and Ali Citation2019).

CFS only deal with complex-valued membership degree but does not weigh the non-membership degree, which plays an equal role in the decision-making process for system evaluation. However, it is frequently challenging to represent membership degree estimation by a fuzzy set’s precise value in the real world. In these circumstances, using two dimensions of information rather than one may make it easier to portray the ambiguity and vagueness that exist in the real world. Due to uncertainties’ hesitant assessment in the intricate decision-making problem, an expansion of the existing theories may be very helpful for explaining uncertainties. Due to this, Liu, Mahmood, and Ali (Citation2019) expanded the definition of complex fuzzy sets to include complex intuitionistic fuzzy sets (CIFS) by integrating complex degrees of non-membership functions, and their fundamental characteristics were investigated. Garg and Rani (Citation2021, Citation2019) developed some aggregation operators to aggregate the CIF information.

Moreover, Garg et al. (Citation2021) extended the CFS notion and developed the complex hesitant fuzzy set (CHFS) concept. CHFS is the result of combining the HFS with CFS. CHFS have only the degree of membership function in which all the possible values belong from the close interval [0,1]. CHFS deals with the two-phase information precisely and is a better tool for tackling this information. Recently, Mahmood et al. (Citation2020) generalized the concept of CHFS and introduced the complex dual hesitant fuzzy set (CDHFS), characterized by complex valued hesitant fuzzy membership degree and complex valued hesitant fuzzy non-membership degree. The complex dual hesitant fuzzy set is characterized by complex-valued membership and nonmembership degrees and is represented in polar coordinates membership and nonmembership degrees give the extent of belongingness and does not belongingness of an object in a CDHFS, and the phase term associated with membership and nonmembership degree gives the additional information, generally related with periodicity. The phase terms are novel parameters of the membership and nonmembership degrees and these are the parameters which distinguish the CDHFS and traditional DHFS theories. The DHFS theory only considers one dimension at a time, which occasionally causes information loss.

Literature Review

The idea of aggregation operators plays an important role in aggregating overall preference data in making decisions where the experts provide the preference values for certain information. For this reason, numerous aggregation operators have been established. Xu (Citation2007) developed some IF weighted operators and discussed some properties of the developed operators. The aggregation operators for IFNs discussed above made the assumption that the attributes and the decision makers had the same priority level, which is something else that should be mentioned. However, in multiple attribute group decision-making issues, decision makers and attributes have various priority levels. Therefore, to overcome this shortcoming, Yu (Citation2013) developed IF prioritized operators. Moreover, Kefeng and Bin (Citation2017) utilized the Einstein t-norm and t-conorm Klement, Mesiar, and Pap (Citation2004) and developed some IF Einstein prioritized operators. Yu (Citation2014) developed some Einstein weighted aggregation operators such as hesitant fuzzy Einstein weighted averaging (HFEWA) operator and hesitant fuzzy Einstein weighted geometric (HFEWG) operator. Wei (Citation2012) established certain prioritized aggregation operators for collecting hesitant fuzzy data and afterward utilized them to develop models for hesitant fuzzy MADM problems with different priority levels because of the possibility of prioritized aggregation operators. Yu et al. (Citation2016) developed some hesitant fuzzy Einstein aggregation operators, such as the hesitant fuzzy prioritized Einstein averaging (HFPEA) operator and hesitant fuzzy prioritized Einstein geometric (HFPEG) operator. Zhou and Li (Citation2014) developed some generalized hesitant fuzzy prioritized Einstein averaging in order to deal with MCDM problems under HFS environment. Further, Yu et al. (Citation2016), developed dual hesitant fuzzy (DHF) aggregation operators, namely the DHF weighted average (DHFWA) operator and the DHF weighted geometric (DHFWG) operator and discussed some of their properties. Moreover, Zhao, Xu, and Liu (Citation2017), developed the concept of DHF t-norm and t-conorm based operators for aggregating DHF elements. Extending the notion of DHF aggregation operators, Zhao and Xu (Citation2018) developed prioritized dual hesitant fuzzy aggregation operators and applied the concept to multiple criteria decision making (MCDM) problems. Based on Einstein t-norm and t-conorm, Biswas and Sarkar Biswas and Sarkar (Citation2018) proposed the idea of DHF prioritized operators to deal with MCDM problems. Garg and Rani (Citation2021, Citation2019) developed some aggregation operators to aggregate the CIF information. Furthermore, Talafha et al. (Citation2021) developed some aggregation operators under CHFS environment and applied the concept to MCDM problems. Ali et al. (Citation2021) developed some Einstein aggregaton operators to deal with Green Supplier Chain Management under complex interval valued Pythagorean fuzzy set environment. The weighted aggregation operators play a crucial role in order to aggregate the preference information. But cannot deal with the prioritization among the experts or decision criteria.

Gap, Motivation, and Contribution

Although many decision-making methods such as TOPSIS, VIKOR, COPRAS, WASPAS, EDAS, and MULTIMOORA have been proposed and applied to real-world problems. However, the aggregation operators not only aggregate the opinion of the experts but also deal with the prioritized relation among the decision makers and decision criteria. In aggregating the experts’ information, aggregation operators play an important role. The advantage of the prioritized operators is that they deal with the prioritized relationship among the experts or criteria, while all other operators assume the criteria are of the same priority level. For example, if Ci and Cj are two attributes with the weight Wi and Wj, respectively. Based on the above aggregation operator, we can compensate for a decrease in α satisfaction to attribute Ci by gaining Wj/Wiα in satisfaction to attribute Cj. But in many real decision-making problems, this kind of compensation between attributes is impossible.

Consider a scenario in which a mother decides based on the cost and safety of powdered milk for her child. She should not permit a benefit related to the price of powdered milk to compensate for a safety hazard. This is a typical form of attribute prioritization, in which safety has a greater priority than cost. As previously explained, the DHFS theory only evaluates one dimension simultaneously, resulting in occasional information loss. To define membership and non-membership grades, a second dimension must be included because, in the actual world, we encounter natural occurrences with several dimensions. By adding this second dimension of information, the entire data collection can be projected in one set. We present an illustration to illustrate the importance of phase phrases. Suppose an organization installs biometric-based attendance devices (BBADs) at each regional office. To accomplish this, the company consults an expert for information regarding (a) BBAD models and (b) BBAD production dates. The organization desires to concurrently select the optimal BBAD model and manufacturing date. The two aspects of this dilemma are the BBADs’ model and date of manufacture. This problem cannot be adequately modeled using standard DHFS theory, as DHFS theory cannot simultaneously address two dimensions. The CDHFS hypothesis is the most effective method for communicating the expert’s knowledge. The phase terms in CDHFS can represent the company’s view on the production date of BBADs, while the amplitude terms can be used to express the company’s view on the model of BBADs. In this research, we design the prioritized aggregation technique for CDHFVs, prompted by the CDHFS and bearing in mind the benefits of the priority relationship among the criteria. Our efforts can be summed up as follows:

  • To define the score function for the comparison of CDHFVs.

  • Propose operational laws and Einstein operational laws for the CDHFVs.

  • To develop complex dual hesitant fuzzy prioritized average (CDHFPA) operator and complex dual hesitant fuzzy prioritized geometric (CDHFPG), complex dual hesitant fuzzy prioritized Einstein averaging (CDHFPEA) operator, and complex dual hesitant fuzzy prioritized Einstein geometric (CDHFPEG) operator.

  • To investigate properties of the developed operators.

  • Develop an MCDM method based on the developed operators.

  • A numerical illustration of the hotel selection problem is provided to illustrate the applicability and utility of the established method.

To do this, the remainder of the paper is organized as follows. In Section 2, some basic concepts are presented and preliminary operations are discussed. Section 3 dealt with some algebraic and Einstein operational laws and investigated some of the properties of the proposed operational properties. In Section 4, using the operational laws, we develop complex dual hesitant fuzzy prioritized operators such as complex dual hesitant fuzzy prioritized averaging (CDHFPA) operator, complex dual hesitant fuzzy prioritized geometric (CDHFPG) operator, and complex dual hesitant fuzzy prioritized Einstein averaging (CDHFPEA) operator, complex dual hesitant fuzzy prioritized Einstein geometric (CDHFPEG) operator. Some properties of the developed operators are also discussed. Section 5 develops an MCDM approach based on the proposed operators. Section 6 deals with a numerical example related to the faculty selection problem for applying the proposed method. In Section 7, a comparative study is also conducted for the effectiveness and legitimacy of the proposed method. Concluding remark is in section 8.

Preliminaries

In this section, we review some basic definitions and operational laws of complex hesitant fuzzy set (CHFS) and complex dual hesitant fuzzy set (CDHFS), which can be applied in our next sections.

Complex Hesitant Fuzzy Set

The theory of CHFS was first initiated by Garg et al. (Citation2021) as an extension of a complex fuzzy set (Ramot et al. Citation2002). CHFS is characterized by a membership degree of some possible values that contains amplitude and phase term belonging to [0,1] and [0,2π], respectively. It can be defined as:

Definition 1.

(Garg and Rani Citation2021) Let U be a universe of discourse. Than CHFS X is of the form:

(1) X={(x,μX(x)/xU)}(1)

where μX(x)={aXj(x).ei2π(bXj(x)),j=1,2,,n}, represent the complex-valued of membership which the subset of the unit disc in complex plane with a condition aXj(x),bXj(x)0,1. Furthermore, δ={x,aδ(x).ei2π(bδ(x))} is called a complex hesitant fuzzy number (CHFN).

Definition 2.

(Garg and Rani Citation2021) Let δk=(aδk.ei2π(bδk))(k=1,2) be two CHFNs.Then their complement,union and intersection are define as follows:

(1) δ1c=1aδ1.ei2π1bδ1

(2) δ1δ2=maxaδ1,aδ2.ei2πmaxbδ1,bδ2

(3) δ1δ2=minaδ1,aδ2.ei2πminbδ1,bδ2.

Complex Dual Hesitant Fuzzy Set

The theory of complex dual hesitant fuzzy set was first initiated by Mahmood et al. [34] as an extension of complex hesitant fuzzy set.

Definition 3.

(Talafha et al. Citation2021) Let U be a universe of discourse. A CDHFS D is of the form

(2) D={(x,(μD(x),υD(x)))/xU},(2)

where μD(x)={(x,aDj(x).ei2π(bDj(x))),j=1,2,3,,m} and υD(x)={(x,cDk(x).ei2π(dDk(x))),k=1,2,3,,n} represented the complex-valued membership grade and non-membership grade,which are subsets of a unit disc in the complex plane with conditions aDj(x),bDj(x),cDk(x),dDk(x)0,1,

0aX+(x)+cX+(x)1

and

0bX+(x)+dX+(x)1,

where

aD+(x)=UaDjμD(x)max{aDj(x)},bD+(x)=UbDjμD(x)max{bDj(x)},
cD+(x)=UCDkυD(x)max{cDk(x)},dD+(x)=UdDkυD(x)max{dDk(x)},

for j=1,2,3,,n and k=1,2,3,,m. The pair (x,(Λ(x).e2πi(Ω)(x),Γ(x).e2πi(Ψ(x)))) is called complex dual hesitant fuzzy element (CDHFE).

Definition 4.

(Talafha et al. Citation2021) Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2) be two CDHFEs. Then their complement,union and intersection are define as follows:

(3) DE1c=(Γ1e2πi(Ψ1),Λ1e2πi(Ω1))(3)
(4) DE1DE2={(max(Λ1,Λ2).ei2π(max(Ω1,Ω2))),min(Γ1,Γ2).ei2π(min(Ψ1,Ψ2))}(4)
(5) δη={(min(Λ1,Λ2).ei2π(min(Ω1,Ω2))),max(Γ1,Γ2).ei2π(max(Ψ1,Ψ2))}.(5)

Complex Dual Hesitant Fuzzy Operational Laws

In this section, first we define score and accuracy functions in order to compare CDHFEs. We also develop operational laws for CDHEs.

Definition 5.

Let DEk=(Λ.e2πi(Ω),Γ.e2πi(Ψ)) be two CDHFEs. Then

(6) S(DEk)=14[1+aΛal(Λ)cΓcl(Γ)]+[1+bΩbl(Ω)cΓdl(Ψ)](6)

is said to be the score function of DEk and

(7) G(DEk)=14[1+aΛal(Λ)+cΓcl(Γ)]+[1+bΩbl(Ω)+cΓdl(Ψ)](7)

shows the accuracy function of DEk. Here l(Λ),l(Γ),l(Ω) and l(Ψ) shows the number of elements in Λ,Γ,Ω and Ψ.

In the following, we define operational laws for CDHFEs.

Definition 6.

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2) be two CDHFEs. Then their addition,multiplication and complement are define as follows:

  1. DE1DE2=a1Λ1,b1Ω1,a2Λ2,b2Ω2a1+a2a1a2ei2π(b1+b2b1b2),c1Γ1,d1Ψ1,c2Γ2,d2Ψ2c1c2ei2π(d1d2)

  2. DE1DE2=a1Λ1,b1Ω1,a2Λ2,b2Ω2a1a2ei2π(b1b2),c1Γ1,d1Ψ1,c2Γ2,d2Ψ2c1+c2c1c2ei2π(d1+d2d1d2)

  3. λDE1=a1Λ,b1Ω1(1a1)λei2π(1(1b1)λ),c1Γ,d1Ψc1λei2π((d1)λ),λ0

  4. DE1λ=a1Λ,b1Ωa1λei2π((b1)λ),c1Γ,d1Ψ1(1c1)λei2π(1(1d1)λ),λ0.

In what follows, we review the complex t-conorm and t-norm respectively (Mahmood et al. Citation2020):

Sε(x,y)=x+y1+xy,Tε(x,y)=xy1+(1x)(1y)

Based on the above Einstein t-conorm and t-norm, we can define the Einstein sum and Einstein product of CDHFEs as below:

Definition 7.

ForanytwoCDHFEsDEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2),\breakλ>0

  1. DE1εDE2=α1Λ1,a2Λ2,b1Ω1,b2Ω2α1+α21+α1α2ei2πb1+b21+b1b2,c1Γ1,c2Γ2,d1Ψ1,d2Ψ2c1c21+(1c1)(1c2)ei2πd1d21+1d11d2,

  2. DE1εDE2=α1Λ1,a2Λ2,b1Ω1,b2Ω2α1α21+(1α1)(1α2)ei2πb1b21+(1b1)(1b2),c1Γ1,c2Γ2,d1Ψ1,d2Ψ2c1+c21+c1c2ei2πd1+d21+d1d2,

  3. λεDE=αΛ,bΩ(1+α)λ(1α)λ(1+α)λ+(1α)λei2π(1+b)λ(1b)λ(1+b)λ+(1b)λ,cΓ,dΨ2cλ(2c)λ+cλei2π2dλ(2d)λ+dλ,

  4. DE\^ελ=αΛ,bΩ2αλ(2α)λ+αλei2π2bλ(2b)λ+bλ,cΓ,dΨ(1+c)λ(1c)λ(1+c)λ+(1c)λei2π(1+d)λ(1d)λ(1+d)λ+(1d)λ.

Complex Dual Hesitant Fuzzy Prioritized Operators

In this section, we define some aggregation operators based on Definition 6 and Definition 7. By using the operational laws presented in Definition 6, in the following we define some prioritized operators under CDHFS environment.

Definition 8.

Let DEk=(Λke2iπ(Ωk),Γke2iπ(Ψk))(k=1,2,,m), be CDHFEs, and χk=Tkk=1mTk, where

Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1,

and S(DEk) is the score of CDHFE DEk. Then a mapping CDHFPA:DEmDE defined by:

(8) CDHFPA(DE1,DE2,,DEm)=χ1DE1χ2DE2,,χmDEm(8)

is called a complex dual hesitant fuzzy prioritized averaging (CDHFPA) operator.

Theorem 1.

Let DEk=Λke2iπ(Ωk),Γke2iπ(Ψk)k=1,2,,m be a collection of CDHFEs and χk=Tkk=1mTk, where

Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1,

and S(DEk) is the score of CDHFE DEk. Then, the aggregated value by using CDHFPA operator is also a CDHFE and

(9) CDHFPA(DE1,DE2,,DEm)= k=1mχkDEk=a1Λ1,a2Λ2,..,amΛm,b1Ω1,b2Ω2,,bmΩm1Πk=1m(1ak)χke i2π1Πk=1m(1bk)χk,c1Γ1,c2Γ2,..,cmΓm,d1Ψ1,b2Ψ2,,dmΨmΠk=1m(ck)χkei2πΠk=1m(dk)χk.(9)

Proof:

To prove the theorem, we shall use mathematical induction. First, we prove that the statement is true for k=2. Therefore,

χ1DE1=a1Λ1,b1Ω1,c1Γ1,d1Ψ11(1a1)χ1e i2π1(1b1)χ1,(c1)χ1ei2π(d1)χ1
χ2DE2=a2Λ2,b2Ω2,c2Γ2,d2Ψ21(1a2)χ2e i2π1(1b2)χ2,(c2)χ2ei2π(d2)χ2.

Then,

CDHFPA(DE1,DE2)=χ1DE1χ2DE2
=a1Λ1,a2Λ2,b1Ω1,b2Ω22(1a1) χ1(1a2) χ2)(1(1a1)χ1)(1(1a2)χ2ei2π2(1a1)χ1(1a2) χ2(1(1a1)χ1)(1(1a2)χ2,c1Γ1,c2Γ2,d1Ψ1,d2Ψ2c1χ1c2χ2ei2πd1χ1d22
=a1Λ1,a2Λ2,b1Ω1,b2Ω21Πk=12(1ak)  χkei2π1Πk=12(1bk)  χk,c1Γ1,c2Γ2,d1Ψ1,d2Ψ2Πk=12ckχkei2πΠk=12ckχk.

We suppose that the theorem is true for k=p. We have to show that the theorem is true for k=p+1. To do this, we have

CDHFPA(DE1,DE2,,DEp)
=a1Λ1,a2Λ2,b1Ω1,b2Ω21Πk=1p(1ak)χke i2π1Πk=1p(1bk)χk,c1Γ1,c2Γ2,d1Ψ1,d2Ψ2Πk=1p(ck)χkei2πΠk=1p(dk)χk.

Now, when k=p+1,

CDHFPA(DE1,DE2,,DEp,DEp+1)=χ1DE1χ2DE2,,χpDEpχp+1DEp+1
CDHFPA(DE1,DE2,,DEp+1)
=(DE1DE2,,DEp)ap+1Λp+1,bp+1Ωp+11(1ap+1)χp+1e i2π1(1bp+1)χp+1,cp+1Γp+1,dp+1Ψp+1(cp+1)χp+1ei2π(dp+1)χp+1
=a1Λ1,a2Λ2,..,amΛm,b1Ω1,b2Ω2,,bmΩm1Πk=1p(1ak)χpe i2π1Πk=1p(1bk)χp,c1Γ1,c2Γ2,..,cmΓm,d1Ψ1,b2Ψ2,,dmΨmΠk=1p(ck)χpei2πΠk=1p(dk)χpap+1Λp+1,bp+1Ωp+11(1ap+1)χp+1e i2π1(1bp+1)χp+1,cp+1Γp+1,dp+1Ψp+1(cp+1)χp+1ei2π(dp+1)χp+1
=a1Λ1,a2Λ2,..,ap+1Λp+1,b1Ω1,b2Ω2,,bp+1Ωp+1(1Πk=1p(1ak)χp+1)+(1(1ap+1)χp+1)(1Πk=1p(1ak)χp+1)(1(1ap+1)χp+1)ei2π(1Πk=1p(1bk)χp+1)+(1(1bp+1)χp+1)(1Πk=1p(1bk)χp+1)(1(1bp+1)χp+1),c1Γ1,c2Γ2,..,cp+1Γp+1,d1Ψ1,b2Ψ2,,dp+1Ψp+1Πk=1p+1(ck)χp+1ei2πΠk=1p+1(dk)χp+1
=a1Λ1,a2Λ2,..,ap+1Λp+1,b1Ω1,b2Ω2,,bp+1Ωp+11Πk=1p+1(1ak)χp+1e i2π1Πk=1p+1(1bk)χp+1,c1Γ1,c2Γ2,..,cp+1Γp+1,d1Ψ1,b2Ψ2,,dp+1Ψp+1Πk=1p+1(ck)χp+1ei2πΠk=1p+1(dk)χp+1
=k=1p+1χp+1DEk=CDHFPA(DE1,DE2,,DEp+1).

So the Theorem is true for p+1 and thus the statement is true for all k.

Theorem 2. (Idempotency) Let DEk=(Λkei2π(Ωk),Γkei2π(Ψk))(k=1,2,,m) be a groups of CDHFEs and χk=Tkk=1mTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. If all DEkk=1,2,,m are equal, i.e., DEk=DE for all k, wherever DE=Λei2πΩ,Γei2π(Ψ) then

(10) CDHFPADE1,DE2,,DEm=DE.(10)

Proof: We have

CDHFPA(DE1,DE2,,DEm)=k=1mχkDEk
= akΛk,bkΩk1Πk=1m(1ak)χke i2π1Πk=1m(1bk)χk,ckΓkdkΨkΠk=1m(ck)χkei2πΠk=1m(dk)χk
= aΛ,bΩ1Πk=1m(1a)χke i2π1Πk=1m(1b)χk,cΓ,dΨΠk=1m(c)χkei2πΠk=1m(d)χk
=aΛ,bΩ1Πk=1m(1a)χ1+χ2++χme i2π1Πk=1m(1b)χ1+χ1++χ1,cΓ,dΨΠk=1m(c)χ1+χ2++χmei2πΠk=1m(d)χ1+χ2++\chim
=Λei2πΩ,Γei2π(Ψ)=DE.

Theorem 3.

(Additivity) Let DEk=(Λkei2π(Ωk),Γkei2π(Ψk))(k=1,2,,m) be a collections of CDHFEs, and DE=Λei2πΩ,Γei2π(Ψ) be another CDHFE, and χk=Tkk=1mTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. Then

(11) CDHFPA(DE1DE,DE2DE,,DEmDE)=CDHFPA(DE1,DE2,,DEm)DE.(11)

Proof:

By using operational laws of CDHFEs, we have

DEkDE=akΛk,aΛ,bkΩk,bΩak+aakaei2π(bk+bbkb),ckΓk,cΓ,dkΨk,dΨckcei2π(dkd)
=akΛk,aΛ,bkΩk,bΩ1(1ak)(1a)ei2π(1(1bk)(1b)),ckΓk,cΓ,dkΨk,dΨckcei2π(dkd)

Thus, by using Theorem 1, we have

CDHFPA(DE1DE,DE2DE,,DEmDE)
=akΛk,aΛ,bkΩk,bΩ1Πk=1m((1ak)(1a))χkei2π1Πk=1m((1bk)(1b))χk,ckΓk,cΓ,dkΨk,dΨΠk=1mckcχkei2πΠk=1m(dkd)χk
=akΛk,aΛ,bkΩk,bΩ1(1a)χ1+χ2++χmΠk=1m(1ak)χkei2π(1(1b)χ1+χ2++χmΠk=1m(1bk)χk),ckΓk,cΓ,dkΨk,dΨcχ1+χ2++χmΠk=1m(ck)χkei2π(dχ1+χ2++χmΠk=1m(dk)χk)
=akΛk,aΛ,bkΩk,bΩ1(1a)Πk=1m(1ak)χkei2π(1(1b)Πk=1m(1bk)χk),ckΓk,cΓ,dkΨk,dΨcΠk=1m(ck)χkei2π(dΠk=1m(dk)χk).

By using operational laws of CDHFEs, we have

CDHFPA(DE1,DE2,,DEm)DE
=aΛ,bΩ1Πk=1m(1ak)χke i2π1Πk=1m(1bk)χk,cΓ,dΨΠk=1m(ck)χkei2πΠk=1m(dk)χkaΛ,bΩ(a)ei2πb,cΓ,dΨ(c)e i2πd
=akΛk,aΛ,bkΩk,bΩ1(1a)1(1Πk=1m(1ak)χkei2π(1(1b)1(1Πk=1m(1bk)χk,ckΓk,cΓ,dkΨk,dΨcΠk=1m(ck)χkei2πdΠk=1m(dk)χk
=akΛk,aΛ,bkΩk,bΩ1(1a)Πk=1m(1ak)χkei2π(1(1b)1(1Πk=1m(1bk)χk,ckΓk,cΓ,dkΨk,dΨcΠk=1m(ck)χkei2πdΠk=1m(dk)χk.

Hence, CDHFPA(DE1DE,DE2DE,,DEmDE)=CDHFPA(DE1,\breakDE2,,DEm)DE.

Definition 9.

Let DEk=(Λkei2π(Ωk),Γkei2π(Ψk))(k=1,2,,m), be the CDHFEs, and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,),T1=1, and s(DEk) is the score of CDHFE DEk. Then a mapping CDHFPG:DEmDE defined by:

(12) CDHFPG(DE1,DE2,,DEm)=χ1DE1χ2DE2,,χmDEm(12)

is called a complex dual hesitant fuzzy prioritized geometric (CDHFPG) operator.

Theorem 4.

Let DEk=(Λkei2π(Ωk),Γkei2π(Ψk))(k=1,2,,m) be a collection of CDHFEs, and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,),T1=1, and s(DEk) is the score of CDHFE DEk. Then the aggregated value by using CDHFPG operator is also a CDHFE and

(13) CDHFPG(DE1,DE2,,DEm)= k=1mχkDEk=a1Λ1,a2Λ2,..,amΛm,b1Ω1,b2Ω2,,bmΩm1Πk=1m(1ak)χke i2π1Πk=1m(1bk)χk,c1Γ1,c2Γ2,..,cmΓm,d1Ψ1,b2Ψ2,,dmΨmΠk=1m(ck)χkei2πΠk=1m(dk)χk.(13)

Proof:

Proof of the Theorem is same as Theorem 1.

Theorem 5.

(Idempotency) Let DEk=(Λkei2π(Ωk),Γkei2π(Ψk))(k=1,2,,m) be a collections of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,),T1=1, and s(DEk) is the score of CDHFE DEk. If all DEkk=1,2,,m are equal, i.e., DEk=DE for all k, where DE=Λei2πΩ,Γe2πi(Ψ), then

(14) CDHFPGDE1,DE2,,DEm=DE.(14)

Proof:

Proof of the Theorem is same as Theorem 2.

Theorem 6.

(Additivity) Let DEk=(Λkei2π(Ωk),Γkei2π(Ψk))(k=1,2,,m) be a collections of CDHFEs, and DE=Λei2πΩ,Γei2π(Ψ) be another CDHFE, and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,),T1=1, and s(DEk) is the score of CDHFE DEk. Then

(15) CDHFPG(DE1DE,DE2DE,,DEmDE)=CDHFPG(DE1,DE2,,DEm)DE.(15)

Proof:

Proof of the Theorem is same as Theorem 3

The above aggregation operators are based on the operational laws defined in Definition 6. In the following we develop complex dual hesitant fuzzy Einstein Prioritized (CDHFWP) operators based on operational laws defined in Definition 7.

Definition 10.

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m), T1=1, and s(DEk) is the score of CDHFE DEk. Then, a mapping CDHFPEA:DEmDE defined by:

(16) CDHFPEA(DE1,DE2,,DEm)=χ1DE1εχ2DE2ε,,εχmDEm(16)

is called a complex dual hesitant fuzzy prioritized Einstein averaging (CDHFPEA) operator.

Theorem 7.

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),\breakT1=1, and s(DEk) is the score of CDHFE DEk. Then the aggregated value by using CDHFPEA operator is also a CDHFE and

(17) CDHFPEA(DE1,DE2,,DEm)=εk=1mχkDEk=a1Λ1,a2Λ2,..,amΛmb1Ω1,b2Ω2,,bmΩmΠk=1m(1+ak)χkΠk=1m(1ak)χkΠk=1m(1+ak)χk+Πk=1m(1ak)χke i2πΠk=1m(1+bk)χkΠk=1m(1bk)χkΠk=1m(1+bk)χk+Πk=1m(1bk)χk,c1Γ1,c2Γ2,..,cmΓmd1Ψ1,b2Ψ2,,dmΨm2Πk=nmckχkΠk=1m(2ck)χk+Πk=1n(ck)χkei2π2Πk=1mdkχkΠk=1m(2dk)χk+Πk=1m(dk)χk.(17)

Proof:

Using the mathematical induction method,the theorem will be proved. The theorem is obvious for k=1. We suppose that the theorem is valid for k=p. We will to show that the theorem is valid for k=p+1. We have

CDHFPEA(DE1,DE2,,DEp)=εk=1pχkDEk
=a1Λ1,a2Λ2,..,apΛpb1Ω1,b2Ω2,,bpΩpΠk=1p(1+ak)χkΠk=1p(1ak)χkΠk=1p(1+ak)χk+Πk=1p(1ak)χkei2πΠk=1p(1+bk)χkΠk=1p(1bk)χkΠk=1p(1+bk)χk+Πk=1p(1bk)χk,c1Γ1,c2Γ2,..,cpΓpd1Ψ1,b2Ψ2,,dpΨp2Πk=1pckχkΠk=1p(2ck)χk+Πk=1p(ck)χkei2π2Πk=1pdkχkΠk=1p(2dk)χk+Πk=1p(dk)χk.

Now when k=p+1,

CDHFPEA(DE1,DE2,,DEP+1)=CDHFPEA(DE1,DE2,,DEP)εχp+1DEp+1
=CDHFPEADE1,DE2,,DEPε
ap+1Λp+1,bp+1Ωp+11+ap+1χp+1(1ap+1)χp+1(1+ap+1)χp+1+(1ap+1)χp+1ei2π1+bp+1χp+1(1bp+1)χp+1(1+bp+1)χp+1+(1bp+1)χp+1,cp+1Γp+1,dp+1Ψp+12cp+1χp+1(2cp+1)χp+1+cp+1χp+1ei2π2dp+1χp+1(2dp+1)χp+1+dp+1χp+1
=a1Λ1,a2Λ2,..,apΛpb1Ω1,b2Ω2,,bpΩpΠk=1p(1+ak)χkΠk=1p(1ak)χkΠk=1p(1+ak)χk+Πk=1p(1ak)χkei2πΠk=1p(1+bk)χkΠk=1p(1bk)χkΠk=1p(1+bk)χk+Πk=1p(1bk)χk,c1Γ1,c2Γ2,..,cpΓpd1Ψ1,b2Ψ2,,dpΨp2Πk=1pckχkΠk=1p(2ck)χk+Πk=1p(ck)χkei2π2Πk=1pdkχkΠk=1p(2dk)χk+Πk=1p(dk)χk
ap+1Λp+1,bp+1Ωp+11+ap+1χp+1(1ap+1)χp+1(1+ap+1)χp+1+(1ap+1)χp+1ei2π1+bp+1χp+1(1bp+1)χp+1(1+bp+1)χp+1+(1bp+1)χp+1,cp+1Γp+1,dp+1Ψp+12cp+1χp+1(2cp+1)χp+1+cp+1χp+1ei2π2dp+1χp+1(2dp+1)χp+1+dp+1χp+1

=a1Λ1,a2Λ2,..,ap+1Λp+1b1Ω1,b2Ω2,,bp+1Ωp+1Πk=1p(1+ak)χkΠk=1p(1ak)χkΠk=1p(1+ak)χk+Πk=1p(1ak)χk+1+ap+1χp+1(1ap+1)χp+1(1+ap+1)χp+1+(1ap+1)χp+11+Πk=1p(1+ak)χkΠk=1p(1ak)χkΠk=1p(1+ak)χk+Πk=1p(1ak)χk1+ap+1χp+1(1ap+1)χp+1(1+ap+1)χp+1+(1ap+1)χp+1ei2πΠk=1p(1+bk)χkΠk=1p(1bk)χkΠk=1p(1+bk)χk+Πk=1p(1bk)χk+1+bp+1χp+1(1bp+1)χp+1(1+bp+1)χp+1+(1bp+1)χp+11+Πk=1p(1+bk)χkΠk=1p(1bk)χkΠk=1p(1+bk)χk+Πk=1p(1bk)χk1+bp+1χp+1(1bp+1)χp+1(1+bp+1)χp+1+(1bp+1)χp+1,c1Γ1,c2Γ2,..,cp+1Γp+1d1Ψ1,b2Ψ2,,dp+1Ψp+12Πk=npckχkΠk=1p(2ck)χk+Πk=1p(ck)χk2cp+1χp+1(2cp+1)χp+1+(cp+1)χp+11+12Πk=npckχkΠk=1p(2ck) χk+Πk=1p(ck) χk12cp+1χp+1(2cp+1) χp+1+(cp+1) χp+1ei2π2Πk=npdk χkΠk=1p(2dk) χk+Πk=1p(dk) χk2dp+1 χp+1(2dp+1) χp+1+(dp+1) χp+11+12Πk=npdp+1 χkΠk=1p(2dk) χk+Πk=1p(dk) χk12dp+1 χp+1(2dp+1) χp+1+(dp+1) χp+1
=a1Λ1,a2Λ2,..,ap+1Λp+1b1Ω1,b2Ω2,,bp+1Ωp+1Πk=1p+11+ak χkΠk=1p+1(1ak) χkΠk=1p+1(1+ak)χk+Πk=1p+1(1ak)χkei2πΠk=1p+11+bkχkΠk=1p+1(1bk)χkΠk=1p+1(1+bk)χk+Πk=1p+1(1bk)χk, c1Γ1,c2Γ2,..,cp+1Γp+1d1Ψ1,b2Ψ2,,dp+1Ψp+12Πk=1p+1ckχkΠk=1p+1(2ck)χk+Πk=1p+1(ck)χkei2π2Πk=1p+1dkχkΠk=1p+1(2dk)χk+Πk=1p+1(dk)χk
=εk=1p+1χkDEk=CDHFPEADE1,DE2,,DEp+1.

Hence, the Theorem is true for p+1 and thus is true for all m.

Theorem 8.

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)\break(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. Then the aggregated value by using CDHFPEG operator is also a CDHFE and

CDHFPEG(DE1,DE2,,DEm)=εk=1mχkDEk
(18) =a1Λ1,a2Λ2,..,amΛmb1Ω1,b2Ω2,,bmΩm2Πk=nmakχkΠk=1m(2ak)χk+Πk=1n(ak)χkei2π2Πk=1mbkχkΠk=1m(2bk)χk+Πk=1m(bk)χk,c1Γ1,c2Γ2,..,cmΓmd1Ψ1,b2Ψ2,,dmΨmΠk=1m(1+ck)χkΠk=1m(1ck)χkΠk=1m(1+ck)χk+Πk=1m(1ck)χkei2πΠk=1m(1+dk)χkΠk=1m(1dk)χkΠk=1m(1+dk)χk+Πk=1m(1dk)χk.(18)

Proof:

The proof of this Theorem is similar to the proof of Theorem 7.

Theorem 9.

(Idempotency) Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,\break,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. If all DEkk=1,2,,m are equal, i.e., DEk=DE for all i,where DE=Λei2πΩ,Γe2πi(Ψ), then

(19) CDHFPEADE1,DE2,,DEm=DE.(19)

Proof: We have

CDHFPEADE1,DE2,,DEm
=εk=1mχkDEk
=aΛ,bΩΠk=1m(1+a)χkΠk=1m(1a)χkΠk=1m(1+a)χk+Πk=1m(1a)χkei2πΠk=1m(1+b)χkΠk=1m(1b)χkΠk=1m(1+b)χk+Πk=1m(1b)χkcΓ,dΨ2Πk=nm(c)χkΠk=1m(2c)χk+Πk=1m(c)χkei2π2Πk=1m(d)χkΠk=1m(2d)χk+Πk=1m(d)χk
=aΛ,bΩ(1+a)χ1+χ2++χk(1a)χ1+χ2++χk(1+a)χ1+χ2++χk+(1a)χ1+χ2++χkei2π(1+b)χ1+χ2++χk(1b)χ1+χ2++χk(1+b)χ1+χ2++χk+(1b)χ1+χ2++χk,cΓ,dΨ2(c)χ1+χ2++χk(2c)χ1+χ2++χk+(c)χ1+χ2++χkei2π2(d)χ1+χ2++χk(2d)χ1+χ2++χk+(d)χ1+χ2++χk
=Λei2πΩ,Γei2πΨ=DE.

Hence, the theorem is proved.

Theorem 10.

(Idempotency)LetDEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,\breakm) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)\break(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. If all DEk(k=1,2,,m) are equal, i.e., DEk=DE for all i, where DE=(Λe2πi(Ω),Γe2πi(Ψ)) then

(20) CDHFPEGDE1,DE2,,DEm=DE.(20)

Proof:

The proof of this theorem is similar to the proof of Theorem 9.

Theorem 11. (Boundary)

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. Let

a=min{aΛk|k=1,2,,m},a=max{aΛk|k=1,2,,m},
c=min{ckΓk|k=1,2,,m},c=max{cΓk|k=1,2,,m},

where, DE=(a,c) DE+=(a,c). Then

(21) DECDHFPEA(DE1,DE2,,DEm)DE+.(21)

Proof: We have,

CDHFPEA(DE1,DE2,,DEm)
=εk=1mχkDEk
=a1Λ1,a2Λ2,..,amΛmb1Ω1,b2Ω2,,bmΩmΠk=1m(1+ak)χkΠk=1m(1ak)χkΠk=1m(1+ak) χk+Πk=1m(1ak)χkei2πΠk=1m(1+bk)χkΠk=1m(1bk)χkΠk=1m(1+bk) χk+Πk=1m(1bk)χk,c1Γ1,c2Γ2,..,cmΓmd1Ψ1,b2Ψ2,,dmΨm2Πk=1mckχkΠk=1m(2ck)χk+Πk=1m(ck)χkei2π2Πk=nmdkχkΠk=1m(2dk)χk+Πk=1m(dk)χk

From definition of a,a,c,c,aaka, for all k, we get

1a1+aei2π1b1+b1ak1+akei2π1bk1+bk1a1+aei2π1b1+b

for all k. That is

Πk=1m1a1+aχkei2πΠk=1m1b1+bχkΠk=1m1ak1+akχkei2πΠk=1m1bk1+bkχk
Πk=1m1a1+aχkei2πΠk=1m1b1+bχk

i.e.,

1a1+aei2π1b1+bΠk=1m1ak1+akχkei2π1bk1+bkχk1a1+aei2π1b1+b

i.e.,

21+aei2π21+b1+Πk=1m1ak1+akχkei2π1bk1+bkχk21+aei2π21+b

i.e.,

aei2πb21+Πk=1m1ak1+akχkei2π21+Πk=1m1bk1+bkχk1a

i.e.,

(22) aei2πλΠk=1m(1+ak)χkΠk=1m(1ak)χkΠk=1m(1+ak)χk+Πk=1m(1ak)χkei2πΠk=1m(1+bk)χkΠk=1m(1bk)χkΠk=1m(1+bk)χk+Πk=1m(1bk)χka.(22)

Similarly, since

cei2πdckei2πdkcei2πd

and

2cei2π2d2ckei2π2dk2cei2π2d

then

Πk=1m2ccχkei2πΠk=1m2ddχkΠk=1m2ckckχkei2πΠk=1m2dkdkχk
Πk=1m2ccχkei2πΠk=1m2ddχk

i.e.,

2cei2π2dΠk=1m2ckckχkei2πΠk=1m2dkdkχk+12cei2π2d

i.e.,

cei2πd2Πk=1m2ckckχk+1ei2π2Πk=1m2dkdkχk+1cei2πd
(23) cei2πd2Πk=1mckχkΠk=1n2ckχk+Πk=1nckχkei2π2Πk=1mdkχkΠk=1m2dkχk+Πk=1mdkχkcei2πd.(23)

Then, from inequities (19), (20), and Definition 5, we obtained

SDESCDHFPEA(DE1,DE2,,DEm)S(DE+).

Therefore, from the comparative laws of CDHFE, it is obvious that

DECDHFPEA(DE1,DE2,,DEm)DE+.

Theorem 12. (Boundary)

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. Let a=min{aΛk|k=1,2,,m}, a=max{aΛk|k=1,2,,m}, c=min{ckΓk|k=1,2,,m}, c=max{cΓk|k=1,2,,m}, DE=(a,c) DE+=(a,c). Then

(24) DECDHFPEG(DE1,DE2,,DEm)DE+.(24)

Proof:

The proof of the theorem is obvious.

Theorem 13. (Additivity)

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. If DE=(Λe2πi(Ω),Γe2πi(Ψ)) is another CDHFE, then

(25) CDHFPEADE1εDE,DE2εDE,,DEnεDE=CDHFPEADE1,DE2,,DEmεDE(25)

Proof:

Based on the operational laws of CDHFEs, we have

DEkεDE=akΛk,aΛ,bkΩk,bΩak+a1+akaei2πbk+b1+bkb,ckΓk,cΓ,dkΨk,dΨckc1+1ck1cei2πdkd1+1dk1d.

According to theorem 1, we have,

CDHFPEADE1εDE,DE2εDE,,DEmεDE
=akΛk,a2Λ2,,amΛm,aΛb1Ω1,b2Ω2,,bmΩm,bΩΠk=1m1+ak+a1+aka χkΠk=1m1ak+a1+aka χkΠk=1m1+ak+a1+aka χk+Πk=1m1ak+a1+aka χkei2πΠk=1m1+bk+b1+bkb χkΠk=1m1bk+b1+bkb χkΠk=1m1+bk+b1+bkb χk+Πk=1m1bk+b1+bkb χk,c1Γ1,c2Γ2,,cmΓm,cΓd1Ψ1,d2Ψ2,,dmΨm,dΨ2Πk=1mckc1+1ck1c  χkΠk=1m2ckc1+1ck1cχk+Πk=1mckc1+1ck1c χkei2π2Πk=1mdkd1+1dk1d  χkΠk=1m2dkd1+1dk1dχk+Πk=1mdkd1+1dk1d χk
=a1Λ1,a2Λ2,,amΛm,aΛb1Ω1,b2Ω2,,bmΩm,bΩΠk=1m(1+ak)χk1+akχkΠk=1m1akχk1akχkΠk=1m(1+ak)χk1+λkχk+Πk=1m1akχk1aχkei2πΠk=1m(1+bk)χk1+bkχkΠk=1m1bkχk1bkχkΠk=1m(1+bk)χk1+bkχk+Πk=1n1bkχk1bχk,c1Γ1,c2Γ2,,cmΓm,cΓd1Ψ1,d2Ψ2,,dmΨm,dΨ2Πk=1mckχkcχkΠk=1m2ckχk2cχk+Πk=nmckχkcχkei2π2Πk=1ndkχkdχkΠk=1m2dkχk2dχk+Πk=nndkχkdχk
=a1Λ1,a2Λ2,,amΛm,aΛb1Ω1,b2Ω2,,bmΩm,bΩ1+aΠk=1m1+akχk1aΠk=1m1akχk1+aΠk=1n1+akχk+1aΠk=1n1akχkei2π1+bΠk=1m1+bkχk1bΠk=1m1bkχk1+bΠk=1m1+kχk+1bΠk=1m1bkχk,c1Γ1,c2Γ2,,cmΓm,cΓd1Ψ1,d2Ψ2,,dmΨm,dΨc2Πk=1mckχk2cΠk=1m2ckχk+cΠk=1mck χkei2πd2Πk=1mdkχk2dΠk=1m2dkχk+dΠk=1ndk χk

Again, from the operational laws of CDHFE.

CDHFPEADE1,DE2,,DEmεDE
=akΛk,a2Λ2,,amΛmb1Ω1,b2Ω2,,bmΩmΠk=1m1+akχkΠk=1m1akχkΠk=1m1+akχk+Πk=1m1akχkei2πΠk=1m1+bkχkΠk=1m1bkχkΠk=1m1+bkχk+Πk=1m1bkχk,c1Γ1,c2Γ2,,cmΓmd1Ψ1,d2Ψ2,,dmΨm2Πk=1mckχkΠk=1m2ckχk+Πk=1mckχkei2π2Πk=1mdkχkΠk=1m2dkχk+Πk=1mdkχkεaΛ,bΩ(a)ei2πb,cΓ,dΨ(c)e i2πd
=a1Λ 1,a2Λ2,,amΛm,aΛb1Ω1,b2Ω2,,bmΩm,bΩ1+aΠk=1m1+akχk1aΠk=1m1akχk1+aΠk=1m1+akχk+1aΠk=1m1akχkei2π1+bΠk=1m1+bkχk1bΠk=1m1bkχk1+bΠk=1m1+bkχk+1bΠk=1n1bkχk,c1Γ1,c2Γ2,,cmΓm,cΓd1Ψ1,d2Ψ2,,dmΨm,dΨc2Πk=1mckχk2cΠk=1m2ckχk+cΠk=1nckχkei2πd2Πk=1mdkχk2dΠk=1m2dkχk+dΠk=1mdkχk

Thus, CDHFPEADE1εDE,DE2εDE,,DEmεDE=CDHFPEA\breakDE1,DE2,,DEmεDE.

Theorem 14. (Additivity)

Let DEk=(Λke2πi(Ωk),Γke2πi(Ψk))(k=1,2,,m) be a collection of CDHFEs and χk=Tkk=1nTk, where Tk=Πk=1k1s(DEk)(k=1,2,,m),T1=1, and s(DEk) is the score of CDHFE DEk. If DE=(Λe2πi(Ω),Γe2πi(Ψ)) be another CDHFE, then

(26) CDHFPEGDE1εDE,DE2εDE,,DEnεDE=CDHFPEGDE1,DE2,,DEm.(26)

Proof:

The proof of this theorem is similar to the proof of theorem 11.

Decision Making Method Based on CDHFP Operators

Suppose L={x1,x2,,xm} be the set of alternative and let c={c1,c2,,cm} be the collection of criteria and there priority is given as c1c2,,cn in such a manner that criteria cj has a higher priority than ck, if jk. Now D={e1,e2,,ep} represents a set of decision makers and the linear ordering e1e2e3,,ep represent prioritization between the decision makers in such a manner that decision maker eτ has a higher priority than decision maker eξ if τξ. Suppose that the decision matrix Rs=rkjsei2πtkjsm×ns=1,2,,p is in the format of CDHF matrix. The element of this matrix are represented by CDHFEs as DEkjs=Λkjsei2πΩkj,Γkjsei2πΨkj which designates the value of the alternative xkX on the criteria cjC provided by the decision maker es,where the Λkjsei2πΩkj, assigns the degree of membership functions of the alternative xk satisfies the criteria cj shown by the decision maker es; while Γkjsei2πΨkj shows the degree of non-membership function of the same alternative relating to the same criteria.

By using the CDHFPEA and CDHFPEG operators to propose an approach in multi-criteria group decision making under CDHF enviroment, the main steps are described as follows:

Step 1. Construct the complex dual hesitant fuzzy decision matrix.

Step 2. Calculate the value of Tkj as follows:

(27) χkj=Tkk=1nTk,(27)

where,

(28) Tkj=Πk=1j1Srkj,(k=1,2,,m)(j=1,2,,n)(28)
(29) Tk1=1,k=1,2,,m,(29)

S(rkj) is the score of CDHFEs rkj.

Step 3: Calculate the CDHFEs rkj for each alternative xk using the CDHFPEA or CDHFPEG operators as follows:

rk=CDHFPEA rk1ek2πtk1,rk2ek2πtk2,,rknek2πtkn

(30) =akjΛkj,bkjΩkjΠj=1n1+akjχkjΠj=1n1akjχkjΠ=1n1+akjχkj+Πj=1n1akjχkjei2πΠj=1n1+bkjχkj_Πj=1n1bkjχkjΠ=1n1+bkjχkj+Πj=1n1bkjχkj,ckjΓkj,dkjΨkj2Πs=1nckjχkjΠs=1n2ckjTkjj=1nTkj+Πj=1nckjχkjek2π2Πs=1ndkjχkjΠs=1n2dkjχkj+Πj=1ndkjχkj.(30)

Step 4. Ranking of all the alternatives by the developed score function Srk explained in Definition 5, the highest value of Srk, the larger the overall rk, and thus the best alternative xk,is determined.

Step 5. Ranking the alternatives based on score values.

Hotel Selection in Murree (Case Study)

In this part, a case study of the hotel selection problem in Murree, Pakistan, is done to show how the proposed method can be used. This case study’s evaluation values are based on what past visitors said about the criteria considered. Thus, hotel selection resembles decision making based on ratings (reviews) provided by visitors (experts). There are 137 hotels in Murree, Pakistan, of which 10 are five-star. Given the computation required, we selected the top 5 hotels out of all the five-star hotels in Murree as our research objective to illustrate the applicability of the suggested approach. The names of five hotels are A1: Himala Guest House, A2: Arcadian Blue Pines, A3: Shangrila Resort Hotel Murree, A4: Khattak Lodge Murree, and A5: Hotel One Mall Road Murree. Visitors (experts) rate the five hotels based on four criteria: G1: cleanliness, G2: value, G3: sleeping quality, G4: location. The criteria take over the prioritization as G2G1G4G3. The four decision makers figure out the candidates Ak=k=1,2,3,4,5 concerning the criteria Gl=l=1,2,3,4, and the evaluation values are presented in the form of CDHFEs. The complex dual hesitant fuzzy decision-making matrix MS=mks5×4(s=1,2,3,4) is given in .

Table 1. Complex dual hesitant fuzzy decision matrix.

Step 2.To fined the value of Tkj use the EquationEquations (25) and (Equation29)

Tkj=10.43750.24060.125310.58750.32310.158910.52500.22960.114910.55000.32310.145410.57500.31870.1195

Utilizing CDHFPEA Operators

Step 3. Utilize CDHFPEA operator to aggregate all CDHFEs rkj(k = 1,2,3,4,5; j = 1,2,3,4) for each alternative xk to reduce it in CDHFE rk (k = 1,2,3,4,5). We have added calculation of only five values for amplitude term of complex valued membership degree.

1+0.20.5545×1+0.40.2426×1+0.30.1334×1+0.30.069510.20.5545×10.40.2426×10.30.1334×10.30.06951+0.20.5545×1+0.40.2426×1+0.30.1334×1+0.30.0695+10.20.5545×10.40.2426×10.30.1334×10.30.0695,
1+0.20.5545×1+0.40.2426×1+0.30.1334×1+0.50.069510.20.5545×10.40.2426×10.30.1334×10.50.06951+0.20.5545×1+0.40.2426×1+0.30.1334×1+0.50.0695+10.20.5545×10.40.2426×10.30.1334×10.50.0695,
1+0.20.5545×1+0.40.2426×1+0.40.1334×1+0.30.069510.20.5545×10.40.2426×10.40.1334×10.30.06951+0.20.5545×1+0.40.2426×1+0.40.1334×1+0.30.0695+10.20.5545×10.40.2426×10.40.1334×10.30.0695,
1+0.20.5545×1+0.40.2426×1+0.40.1334×1+0.50.069510.20.5545×10.40.2426×10.40.1334×10.50.06951+0.20.5545×1+0.40.2426×1+0.40.1334×1+0.50.0695+10.20.5545×10.40.2426×10.40.1334×10.50.0695,
1+0.20.5545×1+0.40.2426×1+0.60.1334×1+0.30.069510.20.5545×10.40.2426×10.60.1334×10.30.06951+0.20.5545×1+0.40.2426×1+0.60.1334×1+0.30.0695+10.20.5545×10.40.2426×10.60.1334×10.30.0695,

For convenience we write here the value of r1

r1=.2710ei2π(.2736),.2864ei2π(.2802),.2851ei2π(.2867),.3003ei2π(.2932),.3178ei2π(.3006),.3327ei2π(.3071),.2991ei2π(.2990),.3142ei2π(.3055),.3129ei2π(.3119),.3278ei2π(.3183),.3449ei2π(.3260),.3595ei2π(.3359),.3804ei2π(.3311),.3945ei2π(.3374),.3933ei2π(.3437),.4073ei2π(.3500),.4233ei2π(.3570),.4369ei2π(.3632),.4061ei2π(.3555),.4200ei2π(.3617),.4188ei2π(.3679),.4324ei2π(.3740),.4480ei2π(.3810),.4612ei2π(.3813),.3049ei2π(.3288),.3112ei2π(.3343),.3212ei2π(.3528),.3278ei2π(.3586),.3485ei2π(.3853),.3555ei2π(.3916),.3666ei2π(.4124),.3739ei2π(.4190),.3904ei2π(.4374),.3981ei2π(.4443),.4102ei2π(.4671),.4181ei2π(.4743),.

Step 4. By Definition 5, calculate the score values S(rk)(k=1,2,3,4,5) of the alternative xk. The values are as follows:

S(r1)=0.4838,S(r2)=0.5661,S(r3)=0.5027,S(r4)=0.5455,\breakS(r5)=0.5420.

Step 5. The ranking of alternatives is A2A4A5A3A1. Our best alternatives is A2.

Utilizing CDHFPEG Operator

Step 3 . Utilize CDHFPEG operator to aggregate all CDHFEs rkj(k=1,2,3,4,5;j=1,2,3,4) for each alternative Ak to reduce in CDFE rk=(k=1,2,3,4,5). For the convenience, we write here only the value of r1

r1=.2587ei2π(.2646),.2688ei2π(.2768),.2694ei2π(.2791),.2798ei2π(.2918),.2866ei2π(.2905),.2976ei2π(.3036),.2749ei2π(.2846),.2855ei2π(.2976),.2861ei2π(.3003),.2971ei2π(.3135),.3041ei2π(.3121),.3157ei2π(.3260),.3779ei2π(.3122),.3916ei2π(.3261),.3923ei2π(.3288),.4064ei2π(.3433),.4155ei2π(.3418),.4302ei2π(.3568),.3997ei2π(.3351),.4140ei2π(.3499),.4147ei2π(.3527),.4295ei2π(.3680),.4389ei2π(.3664),.4543ei2π(.3822),.3049ei2π(.3288),.3112ei2π(.3343),.3212ei2π(.3528),.3278ei2π(.3586),.3485ei2π(.3853),.3555ei2π(.3916),.3666ei2π(.4124),.3739ei2π(.4190),.3904ei2π(.4374),.3981ei2π(.4442),.4102ei2π(.4671),.4181ei2π(.4743).

Step 4 . By using to calculate the score values S(rk)(k=1,2,3,4,5) of the alternative xk. The score value are found as

S(r1)=0.4681,S(r2)=0.5514,S(r3)=0.4902,S(r4)=0.5367,\breakS(r5)=0.5226.

Step 5 . The ranking of alternatives is A2A4A5A3A1. Here the best alternative is A2.

Comparative Analysis with Existing Approaches

In this section the proposed method is compared with (Zhu, Xu, and Xia Citation2012), CHFEs (Garg and Rani Citation2019), HFEs (Torra and Narukawa Citation2009), CIFEs (Liu, Mahmood, and Ali Citation2019), and IFEs (Atanassov Citation1986).

Comparison with DHFNs

This section comprises a comparative study with DHFEs (Zhu, Xu, and Xia Citation2012). We compare the proposed method with DHFPEA operator (Zhao and Xu Citation2018), DHFPEG operator (Zhao and Xu Citation2018), DHFEWA operator (Biswas and Sarkar Citation2018), DHFEWG operator (Biswas and Sarkar Citation2018), DHFPA operators (Yu et al. Citation2016), DHFPG operator (Yu et al. Citation2016), DHFWA operator (Zhao, Xu, and Liu Citation2017), and DHFWG operator (Zhao, Xu, and Liu Citation2017). The comparative result of the proposed approach and existing methods is presented in .

Table 2. Ranking of alternatives of the proposed method and existing dual hesitant fuzzy approaches.

From , we see that the ranking of alternatives by using the proposed CDHFPEA operator and CDHFPEG operator are A2A4A5A3A1. The best alternatives by using both the operators are the same. Also, by utilizing DHFPEA operator,the ranking of alternatives is A2A4A3A5A1 and the best alternative is A2. By using DHFPEG operator, the ranking of alternatives is A4A2A3A5A1. For this operator the best alternative is A4. The best alternative by using both the operators are not same, while in our approach, the best alternative is same. Also, in our approach A2A4,A4A5,A5A3, and A3A1. While using DHFPEA operator it is A2A4,A4A3,A3A5, and A5A1. The proposed operators are most suitable as compared to DHFPEA operator and DHFPEG operator (because it involves CDHFPEA operator and CDHFPEG operator t-norm and t-conorm) as it involves Einstein t-norm and t-conorm which is the generalization of the existing operators. Also to compare the proposed operators with DHFPWA operator and DHFPWG operator. The ranking of alternatives by using the DHFPWA operator is A2A4A3A5A1 and for DHFPWG operator is A4A2A3A5A1. The discussed operators have two different best alternatives which are A2 and A4. However, in ranking order A2 and A4 are different from each other. Also, in our approach A2A4,A4A5,A5A3, and A3A1. While using DHFPWA operator it is A2A4,A4A3,A3A5, and A5A1. Due to this reason our proposed operators is the most suitable then DHFPWA operator and DHFPWG operator. Furthermore we are going to compare our proposed operators with DHFPA operator and DHFPG operator. The ranking of alternatives for DHFPA operator is A2A4A3A5A1 and for DHFPG operator is A4A2A3A5A1. The discussed operators have not the same best alternatives. Since there are two best alternatives but we want only one. Also, in first ranking order, the first alternative is A2, and in second ranking order, first alternative is A4 which are different from each other. Also, in our approach A2A4,A4A5,A5A3, and A3A1. While using DHFPA operator, it is A2A4,A4A3,A3A5, and A5A1. That’s why our proposed operators are more authentic then DHFPA operator and DHFPG operator. Now the last comparison is between our proposed operators and DHFWA operators, DHFWG operator. The ranking of alternatives for DHFWA operator is A2A4A3A5A1 and for DHFWG operator is A4A2A3A5A1. The discussed operators have two different best alternatives which are A2 and A4. The best alternative by using both the operators are not same, while in our approach, the best alternative is same. However, in ranking order A2 and A4 are different from each other. Due to this reason our proposed operators are more suitable then DHFWA operator, and DHFWG operator. Concluding that our proposed environment CDHFPENs is more informative than DHFPENs. So, our proposed environment is the best.

Comparison with CHFSs

This section composed a comparative study with CHFEs (Garg and Rani Citation2019). We compare the proposed method with CHFWA operator, CHFWG operator developed by (Garg and Rani Citation2019).

From , we see that the ranking of alternatives by using the operators developed in this paper is different from the operators defined by (Talafha et al. Citation2021). The operators developed by (Talafha et al. Citation2021) only deals with CHFNs and cannot deal with the CDHFVs. Also, the MCDM method proposed by (Talafha et al. Citation2021) cannot deal with the prioritized relationship among the criteria, while the developed operators capture the prioritized relationship among criteria. Therefore, the method developed in this paper is more effective than the existing ones.

Table 3. Ranking of alternatives of the proposed method and existing complex hesitant fuzzy approaches.

Comparison with HFNs

This section composed a comparative study with HFEs (Torra and Narukawa Citation2009). We compare the proposed method with HFPEA operator (Yu et al. Citation2016), HFPEG operator (Yu et al. Citation2016), HFEWA operator (Zhou and Li Citation2014), HFEWG operator (Zhou and Li Citation2014), HFPA operator (Xia and Xu Citation2011), HFPG operator (Xia and Xu Citation2011), HFWA operator (Torra Citation2010), and HFWG operator (Torra Citation2010).

In , we see that the ranking of alternatives by using the proposed CDHFPEA operator is A2A4A5A3A1 and CDHFPEG operator is A2A4A3A5A1. The best alternatives by using both the operators are the same. However, the ranking order of A5 and A3 are different from each other. Also, by utilizing HFPEA operator, the ranking of alternatives is A4A2A5A3A1. For HFPEG operator, the ranking of alternatives is A4A5A3A1A2. The best alternatives by using both the operators are the same but the ranking order of alternatives is different from our proposed operators. since we use CDHFPEEs. So, our proposed operators result is more accurate than HFPEA operator and HFPEG operator. Also to compare the proposed operators with HFPWA operator and HFPWG operator. The ranking of alternatives by using the HFPWA operator, is A2A4A5A3A1 and for HFPWG operator, is A2A5A4A3A1. For both the operators the best alternative is same but the ranking order is different from our developed operators. So, our proposed operators result is best than HFPWA operator and HFPWG operator. Also to compare the proposed operators with HFPA operator and HFPG operator. The ranking of alternatives by using the HFPA operator, is A2A5A4A3A1. For HFPG operator, the ranking of alternatives is A4A5A3A1A2. The discussed operators have two different best alternatives which are A2 and A4. The best alternative by using both the operators are not same, while in our approach, the best alternative is same. However, in ranking order A2 and A4 are different from each other. Due to this reason our proposed operators are more suitable then HFPA operator, and HFPG operator. Now the last comparison is between our proposed operators and HFWA operators, HFWG operator. For HFWA operator, the ranking of alternatives is A2A4A5A3A1. For HFWG operator, the ranking of alternatives is A2A4A5A3A1. For both the operators the best alternative is same but the ranking order is different from our developed operators. Our developed operators is more suitable than HFWA operator and HFWG operator because our developed environment CDHFEs is more informative than CHFEs.

Table 4. Ranking of alternatives of the proposed method and existing hesitant fuzzy approaches.

Comparison with CIFNs

In this section we compare the developed approach to CIFEs (Alkouri and Salleh Citation2012). we compare the proposed method with CIFEWA operator (Garg and Rani Citation2019), CIFEWG operator (Garg and Rani Citation2019), CIFPA operator (Garg and Rani Citation2021), CIFPG operator (Garg and Rani Citation2021), CIFWA operator (Alkouri and Salleh Citation2012), CIFWG operator (Alkouri and Salleh Citation2012).

In , we see that the ranking of alternatives by using the proposed CDHFPEA operator is A2A4A5A3A1 and for CDHFPEG operator is A2A4A3A5A1. The best alternatives by using both the operators are the same. However, the ranking order of A3 and A5 are different from each other. Also, by utilizing CIFPEA operator, the ranking of alternatives is A2A4A5A3A1. For CIFPEG operator, the ranking of alternatives is A2A4A5A3A1. The ranking order is differ from our proposed operators. As we use CDHFEs environment which is more informative than CIFEs. So, our proposed operators is more accurate then CIFPEA operator and CIFPEG operator. Also to compare the proposed operators with CIFEWA operator and CIFEWG operator. The ranking of alternatives by using the CIFEWA operator, is A2A5A4A3A1 and for CIFEWG operator, is A5A4A2A3A1. However, the ranking order of A2 and A4 are different from each other.For both the operators the best alternative is differ from each other. So, our proposed operators result is more accurate than CIFEWA operator and CIFEWG operator. Furthermore, to compare CIFPA operator and CIFPG operator with our proposed operators. The ranking of alternatives by using the CIFPA operator, is A2A4A5A3A1 and for CIFPG operator, is A2A4A5A3A1. For both the operators, the best alternative is same but the ranking order is different from our proposed operators. So, our proposed operators result is best than CIFPA operator and CIFPG operator. Now the last comparison is between our proposed operators and CIFWA operators, CIFWG operator. For CIFWA operator, the ranking of alternatives is A2A5A4A3A1. For CIFWG operator, the ranking of alternatives is A5A4A1A2A3. For both the operators the best alternative is different from each other. Also the ranking order of CIFWA operator and CIFWG operator is different from our developed operators. Our developed operators is more suitable than CIFWA operator and CIFWG operator.

Table 5. Ranking of alternatives of the proposed method and existing complex intuitionistic fuzzy approaches.

Comparison with IFNs

In this section we compare the developed approach to IFEs (Atanassov Citation1986). We compare the proposed method with IFPEA operator (Xu Citation2007), IFPEG operator (Xu Citation2007), IFEWA operator (Xu Citation2007), IFEWG operator (Xu Citation2007), IFPA operator (Yu Citation2013), IFPG operator (Yu Citation2013), IFWA operator (Kefeng and Bin Citation2017), IFWG operator (Kefeng and Bin Citation2017).

In , we see that the ranking of alternatives by using the proposed CDHFPEA operator is A2A4A5A3A1 and for CDHFPEG operator is A2A4A3A5A1. The best alternatives (A2) by using both the operators are the same. However, the ranking order of A3 and A5 are different from each other. Also, by utilizing IFPEA operator,the ranking of alternatives is A4A2A3A5A1. For IFPEG operator, the ranking of alternatives is A4A2A3A5A1. The best alternative and ranking order is different from our proposed operators. As we use CDHFEs environment which is more informative than IFEs. So our proposed operators result is more suitable then IFPEA operator and IFPEG operator. Also to compare the proposed operators with IFEWA operator and IFEWG operator. The ranking of alternatives by using the IFEWA operator, is A2A4A3A5A1 and for IFEWG operator, is A2A4A3A5A1. In this two rankings to find the score values of the alternatives A2 and A4, we use accuracy function. For both the operators the best alternative is same but the ranking order is different from our proposed operators. As we use CDHFEs environment which have more infomation then IFEs. Due to this reasons our proposed operators result is more accurate than IFEWA operator and IFEWG operator. Furthermore to compare the proposed operators with IFPA operator and IFPG operator. The ranking of alternatives by using the IFPA operator, is A4A2A3A5A1 and for IFPG operator, is A4A2A3A5A1. For both the operators the best alternative is same but the ranking order is different from our proposed operators. So our proposed operators result is more suitable then IFPA operator and IFPG operator. Now the last comparison is between our proposed operators and IFWA operators, IFWG operator. For IFWA operator, the ranking of alternatives is A4A2A3A5A1. For IFWG operator, the ranking of alternatives is A2A4A3A5A1. In this ranking to find the score values of the alternatives A2 and A4 we use accuracy function. For both the operators the best alternative is different from each other. Also the ranking order of IFWA operator and IFWG operator is different from our developed operators. Due to this reason our proposed operators result is more suitable than IFWA operator and IFWG operator.

Table 6. Ranking of alternatives of the proposed method and existing intuitionistic fuzzy approaches.

Conclusion

CDHFS is a useful tool for dealing with complex two-phase information. It is made up of complex hesitant fuzzy membership degrees and complex hesitant fuzzy non-membership degrees. Also, to deal with the relationship between prioritization and criteria, the notion of prioritized operators plays a key role in aggregating the evaluation values. Because no such operators for aggregating CDHF information are defined in the literature, in this paper, we propose some complex dual hesitant fuzzy prioritized operators: the CDHFPA operator, the CDHFPG operator, the CDHFEPA operator, and the CDHFEPG operator. Some desirable properties of the proposed operators are also investigated. Further, an MCDM method is developed based on the proposed operators. Also, a numerical example of a hotel selection problem is given to show how the developed method can be used and how well it works. Finally, we compared the proposed method with the existing method. The comparison study showed that the new method is more reliable than the old one. The main benefit of the operators made in this paper is that the criteria are ranked in order of importance, and the information from the CDHF can be put together. We will extend the proposed method to complex Pythagorean fuzzy sets, complex q-rung orthopair fuzzy sets, and complex interval-valued Pythagorean fuzzy sets, moreover, integrating the proposed method with recent improved MCDM models (Moslem Citation2024; Kakati et al. Citation2024).

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This article was partially funded by the European Commission through the SENATOR project (H2020MG-2018-2020, RIA, project no. 861,540).

References

  • Ali, Z., and T. Mahmood. 2020a. Complex neutrosophic generalised dice similarity measures and their application to decision making. CAAI Transactions on Intelligence Technology 5 (2):78–39. doi:10.1049/trit.2019.0084.
  • Ali, Z., and T. Mahmood. 2020b. Maclaurin symmetric mean operators and their applications in the environment of complex q-rung orthopair fuzzy sets. Computational and Applied Mathematics 39 (3):1–27. doi:10.1007/s40314-020-01145-3.
  • Ali, Z., T. Mahmood, K. Ullah, and Q. Khan. 2021. Einstein geometric aggregation operators using a novel complex interval-valued pythagorean fuzzy setting with application in green supplier chain management. Reports in Mechanical Engineering 2 (1):105–134. doi:10.31181/rme2001020105t.
  • Alkouri, A. M. D. J. S., and A. R. Salleh, 2012. Complex intuitionistic fuzzy sets. In AIP conference proceedings, September, American Institute of Physics, 1482, 464–70. 10.1063/1.4757515.
  • Atanassov, K. T. 1986. Intuitionistic fuzzy set. Fuzzy Sets and Systems 20 (1):87–96. doi:10.1016/S0165-0114(86)80034-3.
  • Beg, I., and T. Rashid. 2014. Multi-criteria trapezoidal valued intuitionistic fuzzy decision making with Choquet integral based TOPSIS. Opsearch 51 (1):98–129. doi:10.1007/s12597-013-0134-5.
  • Biswas, A., and A. Sarkar. 2018. Development of dual hesitant fuzzy prioritized operators based on Einstein operations with their application to multi-criteria group decision making. Archives of Control Sciences 28 (4):527–49.
  • Boran, F. E., S. Genç, M. Kurt, and D. Akay. 2009. A multi-criteria intuitionistic fuzzy group decision making for supplier selection with TOPSIS method. Expert Systems with Applications 36 (8):11363–11368. doi:10.1016/j.eswa.2009.03.039.
  • Das, A. K., and C. Granados. 2022. FP-intuitionistic multi fuzzy N-soft set and its induced FP-Hesitant N soft set in decision-making. Decision making. Decision Making: Applications in Management and Engineering 5 (1):67–89. doi:10.31181/dmame181221045d.
  • De, S. K., R. Biswas, and A. R. Roy. 2001. An application of intuitionistic fuzzy sets in medical diagnosis. Fuzzy Sets and Systems 117 (2):209–213. doi:10.1016/S0165-0114(98)00235-8.
  • Garg, H., T. Mahmood, U. U. Rehman, and Z. Ali. 2021. CHFS: Complex hesitant fuzzy sets-their applications to decision making with different and innovative distance measures. CAAI Transactions on Intelligence Technology 6 (1):93–122. doi:10.1049/cit2.12016.
  • Garg, H., and D. Rani. 2019. Some generalized complex intuitionistic fuzzy aggregation operators and their application to multicriteria decision-making process. Arabian Journal for Science and Engineering 44 (3):2679–2698. doi:10.1007/s13369-018-3413-x.
  • Garg, H., and D. Rani. 2021. New prioritized aggregation operators with priority degrees among priority orders for complex intuitionistic fuzzy information. Journal of Ambient Intelligence and Humanized Computing 14 (3):1373–99. doi:10.1007/s12652-021-03164-2.
  • Kakati, P., T. Senapati, S. Moslem, and F. Pilla. 2024. Fermatean fuzzy Archimedean Heronian Mean-Based Model for estimating sustainable urban transport solutions. Engineering Applications of Artificial Intelligence 127:107349. doi:10.1016/j.engappai.2023.107349.
  • Kefeng, L., and C. Bin, 2017, July. Intuitionistic fuzzy prioritized information aggregation operators based on einstein operations and their applications to MCDM. In 2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) (pp. 1479–84). IEEE. doi:10.1109/FSKD.2017.8392983.
  • Klement, E. P., R. Mesiar, and E. Pap. 2004. Triangular norms. Position paper I: Basic analytical and algebraic properties. Fuzzy Sets and Systems 143 (1):5–26. doi:10.1016/j.fss.2003.06.007.
  • Li, D. F. 2005. Multiattribute decision making models and methods using intuitionistic fuzzy sets. Journal of Computer and System Sciences 70 (1):73–85. doi:10.1016/j.jcss.2004.06.002.
  • Limboo, B., and P. Dutta. 2022. A q-rung orthopair basic probability assignment and its application in medical diagnosis. Decision Making: Applications in Management and Engineering 5 (1):290–308. doi:10.31181/dmame191221060l.
  • Liu, P., T. Mahmood, and Z. Ali. 2019. Complex q-rung orthopair fuzzy aggregation operators and their applications in multi-attribute group decision making. Information 11 (1):5. doi:10.3390/info11010005.
  • Mahmood, T., K. Ullah, Q. Khan, and N. Jan. 2019. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Computing and Applications 31 (11):7041–7053. doi:10.1007/s00521-018-3521-2.
  • Mahmood, T., U. Ur Rehman, Z. Ali, R. Chinram, and C. Zhang. 2020. Jaccard and dice similarity measures based on novel complex dual hesitant fuzzy sets and their applications. Mathematical Problems in Engineering 2020:1–25. doi:10.1155/2020/5920432.
  • Moslem, S. 2024. A novel parsimonious spherical fuzzy analytic hierarchy process for sustainable urban transport solutions. Engineering Applications of Artificial Intelligence 128:107447. doi:10.1016/j.engappai.2023.107447.
  • Munir, M., H. Kalsoom, K. Ullah, T. Mahmood, and Y. M. Chu. 2020. T-spherical fuzzy Einstein hybrid aggregation operators and their applications in multi-attribute decision making problems. Symmetry 12 (3):365. doi:10.3390/sym12030365.
  • Ramot, D., R. Milo, M. Friedman, and A. Kandel. 2002. Complex fuzzy sets. IEEE Transactions on Fuzzy Systems 10 (2):171–186. doi:10.1109/91.995119.
  • Riaz, M., and H. A. Farid. 2022. Picture fuzzy aggregation approach with application to third-party logistic provider selection process. Reports in Mechanical Engineering 3 (1):318–27. doi:10.31181/rme20023062022r.
  • Talafha, M., A. U. Alkouri, S. Alqaraleh, H. Zureigat, and A. Aljarrah. 2021. Complex hesitant fuzzy sets and its applications in multiple attributes decision-making problems. Journal of Intelligent & Fuzzy Systems 41 (6):7299–7327. doi:10.3233/JIFS-211156.
  • Torra, V. 2010. Hesitant fuzzy sets. International Journal of Intelligent Systems 25 (6):529–539. doi:10.1002/int.20418.
  • Torra, V., and Y. Narukawa, 2009. On hesitant fuzzy sets and decision. InThe 18th IEEE International Conference on Fuzzy Systems (pp. 1378–82). Jeju Island, Korea. doi:10.1109/FUZZY.2009.5276884.
  • Ullah, K., T. Mahmood, and H. Garg. 2020. Evaluation of the performance of search and rescue robots using T-spherical fuzzy Hamacher aggregation operators. International Journal of Fuzzy Systems 22 (2):570–582. doi:10.1007/s40815-020-00803-2.
  • Wei, G. 2012. Hesitant fuzzy prioritized operators and their application to multiple attribute decision making. Knowledge-Based Systems 31:176–182. doi:10.1016/j.knosys.2012.03.011.
  • Xiao, F., and W. Ding. 2019. Divergence measure of Pythagorean fuzzy sets and its application in medical diagnosis. Applied Soft Computing 79:254–267. doi:10.1016/j.asoc.2019.03.043.
  • Xia, M., and Z. Xu. 2011. Hesitant fuzzy information aggregation in decision making. International Journal of Approximate Reasoning 52 (3):395–407. doi:10.1016/j.ijar.2010.09.002.
  • Xu, Z. 2007. Intuitionistic fuzzy aggregation operators. IEEE Transactions on Fuzzy Systems 15 (6):1179–1187. doi:10.1109/TFUZZ.2006.890678.
  • Yager, R. R. 1977. Multiple objective decision-making using fuzzy sets. International Journal of Man-Machine Studies 9 (4):375–382. doi:10.1016/S0020-7373(77)80008-4.
  • Yu, D. 2013. Intuitionistic fuzzy prioritized operators and their application in multi-criteria group decision making. Technological and Economic Development of Economy 19 (1):1–21. doi:10.3846/20294913.2012.762951.
  • Yu, D. 2014. Some hesitant fuzzy information aggregation operators based on Einstein operational laws. International Journal of Intelligent Systems 29 (4):320–340. doi:10.1002/int.21636.
  • Yu, Q., F. Hou, Y. Zhai, and Y. Du. 2016. Some hesitant fuzzy Einstein aggregation operators and their application to multiple attribute group decision making. International Journal of Intelligent Systems 31 (7):722–746. doi:10.1002/int.21803.
  • Zadeh, L. A. 1965. Fuzzy sets. Information & Control 8 (3):338–353. doi:10.1016/S0019-9958(65)90241-X.
  • Zhao, N., and Z. Xu. 2018. Prioritized dual hesitant fuzzy aggregation operators based on t-norms and t-conorms with their applications in decision making. Informatica 29 (3):581–607. doi:10.15388/Informatica.2018.183.
  • Zhao, H., Z. Xu, and S. Liu. 2017. Dual hesitant fuzzy information aggregation with Einstein t-conorm and t-norm. Journal of Systems Science and Systems Engineering 26 (2):240–264. doi:10.1007/s11518-015-5289-6.
  • Zhou, X., and Q. Li. 2014. Generalized hesitant fuzzy prioritized Einstein aggregation operators and their application in group decision making. International Journal of Fuzzy Systems 16 (3):303–316.
  • Zhu, B., Z. Xu, and M. Xia. 2012. Dual hesitant fuzzy sets. Journal of Applied Mathematics 2012:1–13. Article ID 879629. doi:10.1155/2012/879629.