Next Article in Journal
On Generalized Fibospinomials: Generalized Fibonacci Polynomial Spinors
Previous Article in Journal
A Novel Constraint-Aware Flexible Model with Ant Colony Optimization for Symmetrical Travel Recommendation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Covering-Based Intuitionistic Hesitant Fuzzy Rough Set Models and Their Application to Decision-Making Problems

1
Department of Mathematics, Islamia College Peshawar, Peshawar 25120, Khyber Pakhtunkhwa, Pakistan
2
Department of Mathematics, Khushal Khan Khattak University, Karak 27200, Khyber Pakhtunkhwa, Pakistan
3
Department of Mathematics and Sciences, Prince Sultan University, Riyadh 11586, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Symmetry 2024, 16(6), 693; https://doi.org/10.3390/sym16060693
Submission received: 28 April 2024 / Revised: 29 May 2024 / Accepted: 31 May 2024 / Published: 4 June 2024
(This article belongs to the Special Issue Fuzzy Covering Rough Set and Its Applications)

Abstract

:
In this paper, we present four categories of covering-based intuitionistic hesitant fuzzy rough set (CIHFRS) models using intuitionistic hesitant fuzzy β -neighborhoods (IHF β -neighborhoods) and intuitionistic hesitant fuzzy complementary β -neighborhoods (IHFC β -neighborhoods. Through theoretical analysis of covering-based IHFRS models, we propose the intuitionistic hesitant fuzzy TOPSIS (IHF-TOPSIS) technique for order of preference by similarity to an ideal solution, addressing multicriteria decision-making (MCDM) challenges concerning the assessment of IHF data. A compelling example aptly showcases the suggested approach. Furthermore, we address MCDM problems regarding the assessment of IHF information based on CIHFRS models. Through comparison and analysis, it is evident that addressing MCDM problems by assessing IHF data using CIHFRS models proves more effective than utilizing intuitionistic fuzzy data with CIFRS models or hesitant fuzzy information with CHFRS models. IHFS emerges as a unique and superior tool for addressing real-world challenges. Additionally, covering-based rough sets (CRSs) have been successfully applied to decision problems due to their robust capability in handling unclear data. In this study, by combining CRSs with IHFS, four classes of CIFRS versions are established using IHF β -neighborhoods and IHFC β -neighborhoods. A corresponding approximation axiomatic system is developed for each. The roughness and precision degrees of CBIHFRS models are specifically talked about. The relationship among these four types of IHFRS versions and existing related versions is presented based on theoretical investigations. A method for MCDM problems through IHF information, namely, IHF-TOPSIS, is introduced to further demonstrate its effectiveness and applicability. By conducting a comparative study, the effectiveness of the suggested approach is evaluated.

1. Introduction

Fuzzy set theory (FST) [1] has emerged as a significant method for dealing with uncertainty and has undergone diverse advancements [2,3]. Formally speaking, FST is among the theories initially conceived to extend classical set theory. Furthermore, the relaxation can go beyond just fuzzy relations to any binary relation. This generalization allows for the use of other types of relations, such as tolerance or similarity relations, which do not essentially partition the universe into disjoint classes but still provide a way to approximate sets. These binary relations can capture more nuanced relationships between elements, offering greater flexibility in various applications. Atanassov [4] proposed the idea of an intuitionistic fuzzy set (IFS) to improve the idea of an FS, which expands upon the traditional notion of a set. Within an IFS, the elements possess not only degrees of membership ( m ˘ ) but also degrees of nonmembership ( n ˘ m ˘ ) . The theory of IFSs has found application in diverse domains, including logic programming [5,6], DM problems [7], medical diagnosis [8], and more. It has demonstrated its effectiveness as a valuable tool for addressing the complexities associated with determining the level of m ˘ of an element within a set, particularly in scenarios involving vagueness. Torra [9] expanded upon the concept of an FS by introducing the idea of an HFS. HFS theory is designed to address scenarios in which there is uncertainty in specifying the inclusion of an element within a set, enabling a range of possible values. In conjunction with the aggregation operators presented in [10,11,12,13,14], The HFS is employed to tackle group decision-making challenges. Ref. [15] suggests the introduction of IHFSs; these arise from the amalgamation of IFSs and HFSs. This concept proves beneficial in addressing situations characterized by uncertainty, where specific values may simultaneously represent both m ˘ and n ˘ m ˘ for a given element. In rough set (RS) theory, symmetry can also influence the approximations.
In classical rough set models, symmetry consideration can lead to different approximations and classifications of objects based on their relationship within the data. Pawlak [16,17] introduced the RS, which has proven to be a valuable tool for handling uncertainty. However, its primary focus is on partitioning the universe to create approximation operators. Recognizing this limitation, many researchers have dedicated their efforts to modifying the stringent conditions of Pawlak’s RS. For instance, they have relaxed the equivalence relation to a fuzzy relation and introduced a relation covering the universe. Several studies have explored the extension of Pawlak’s RS, including the introduction of the FRS and RFS by Dubois and Prade [18], as well as contributions from others in the field [19,20,21,22,23]. Rough set analysis in a fuzzy setting offers important benefits and insights that classical settings are unable to fully achieve. Classical rough sets approach sets using lower and upper boundaries, which helps them deal with ambiguity and insufficient information. They do, however, make the clear distinction between membership and nonmembership. Conversely, FSs support partial membership, which better captures the ambiguity and vagueness present in many real-world issues. An FRS extends the concept of an RS by approximating an FS within a crisp approximation space. This occurs in scenarios where the values of conditional attributes are exact but the values of decision attributes exhibit fuzziness. FRSs aim to establish the lower approximation (LA) and upper approximation (UA) of a set. This becomes essential when the universe of the FS undergoes roughness, either through an equivalence relation or by converting the equivalence relation into a corresponding fuzzy relation. The amalgamation of FRSs and IFSs led Chinram et al. [24] to introduce the IFRS. Additionally, the introduction of the HFRS allows for the application of RS techniques in a hesitant fuzzy environment, focusing on establishing LA and UA within such a domain. Additionally, the concept of an IHFS is included in the IHFRST, which builds upon RST.
In order to successfully handle ambiguity, hesitation, and uncertainty in activities like data processing, decision making (DM), and knowledge representation, IHFRST combines the concepts of the RS, IHFS, and HFRS. According to the text, DM in a fuzzy environment involves ranking alternatives based on decision information, and this is a common practice in the actual world. MCDM emerges as an invaluable instrument for solving complex problems in this context. Hwang and Yoon [25] were the pioneers in investigating this approach. In the context of multicriteria group DM, total possible alternatives are assessed based on conflicting and interactive criteria. The text also delves into the utilization of the TOPSIS method for group DM in the IHF case. Upon reviewing prior research, it appears that there has been limited exploration of the application of the CIHFRS in evaluating IHF information within MCDM problems. This research gap motivated the present study, which focuses on developing CIHFRS models using the intuitionistic hesitant fuzzy β -neighborhood (IHF β -neighborhood) and intuitionistic hesitant fuzzy complementary β -neighborhood (IHFC β -neighborhood). Furthermore, this paper investigates the practical applications of these models to MCDM problems related to the assessment of IHF information. The advanced features of intuitionistic hesitant fuzzy rough sets (IHFRSs) addressed the limitations of traditional fuzzy sets theory extensions such as the FS, IFS, and several others. The IHFRS builds on traditional models that utilize the value of lower and upper approximations with membership and nonmembership from the unit interval to represent the uncertainty of real-world challenges. The IHFRS extends the space for information about DM problems. The abovementioned constraints motivated us to develop similarity measures based on the IHFRS, which is a modified version of the IFRS that befits the structure of IFRSs. The development of similarity measures for IHFRSs is of crucial academic significance. Lin et al. [26] presented better fuzzy preference relation rough sets into a multigranulation case. In an instant, exploring rough sets from a multigranulation perspective can better deal with the ambiguous information in complex data, and it has rich research content and value. Due to the uncertainty of IHF information, it is impossible to directly make decisions, so we consider combining multigranulation RSs and IHFSs, which is helpful for DM in IHF environments. Covering-based intuitionistic hesitant fuzzy rough sets (CIHFRSs) offer a more effective approach to handling ambiguities. This is especially helpful when there is uncertainty about numerous choices and the information is not merely incomplete. In decision-making processes, CIHFRSs provide a complete framework that covers the hesitancy and dual nature of intuitionistic fuzzy logic, especially in fields related to risk assessment, financial analysis, and medical diagnosis. Decision making becomes more reliable and accurate as a result. Further, a comprehensive framework for handling complicated and uncertain information can be obtained by the study of covering-based intuitionistic hesitant fuzzy rough sets, which improves the tools available for analysis, modeling, and decision making in a variety of contexts.
The rest of this paper is organized as follows: Section 2 recalls some basic concepts of the CIFS, CHFS, and IHFS. In Section 3, we introduce the four types of CIHFRS models via IHF β -neighborhoods and IHFC β -neighborhoods. The corresponding axiomatic systems are investigated. In particular, the rough and precision degrees of CIHFRS models are discussed. In Section 4, based on the theoretical analysis of CIHFRS models, we put forward the IHF-TOPSIS methodology for the MCDM problem with the evaluation of IHF information. An effective example is given to illustrate the proposed methodology. Finally, by comparative analysis, we find that it is more effective to deal with the MCDM problem with the evaluation of IHF information based on CIHFRS models than with the evaluation of intuitionistic fuzzy information based on CIFRS models and the evaluation of hesitant fuzzy information based on CHFRS models in Section 5. In Section 6, we conclude this paper, summarizing our findings and providing plans for further research.

2. Preliminaries

The notion of the IFS was first introduced by Atanassov [4] as a generalization of the FS [1]. Further, in order to deal with a set of uncertain information, Torra [9] extended the concept of the FS. Furthermore, these concepts are generalized by Chinram et al. [24], and Zhou and Li [27] developed IFRSs, covering-based HFR sets. In the following subsections, some basic definitions, operational laws, and extended forms of the IFS and HFS are discussed.

2.1. Covering-Based Intuitionistic Fuzzy Rough Set

In this subsection, the notion of the IFS, operational laws of the IFS, and the covering-based IFRS are presented. Moreover, score and accuracy functions are also given. The IFS can be defined as follows:
Definition 1 
([4,28]). Assume that X ˙ ϕ is a universe of discourse; then an IFS i ^ in X ˙ is defined by
i ^ = { z , τ i ^ ( z ) , ϱ i ^ ( z ) z X ˙ }
where the functions τ i ^ ( z ) : X ˙ [ 0 , 1 ] and ϱ i ^ ( z ) : X ˙ [ 0 , 1 ] , denoting the degree of membership and degree of nonmembership of z to i ^ , respectively, and z X ˙ , τ i ^ ( z ) , ϱ i ^ ( z ) fulfill 0 ≤ τ i ^ ( z ) + ϱ i ^ ( z ) 1 . An intuitionistic fuzzy number (IFN) is denoted by m . = τ m . , η m . .
Definition 2 
([29]). For an IFN, m . = τ m . , η m . , and the score and accuracy functions are defined, respectively, by
S ^ ( m . ) = τ m . η m .
and
a ( m . ) = τ m . + η m .
where 1 S ^ ( m . ) 1 , 0 a ( m . ) 1 .
Further, for IFNs m . 1 , m . 2 , the properties of score and accuracy functions are defined as follows [29]:
(1) 
If S ^ ( m 1 . ) S ^ ( m 2 . ) , then m . 1 m . 2 .
(2) 
If S ^ ( m 1 . ) S ^ ( m 2 . ) , then m . 1 m . 2 .
(3) 
If S ^ ( m 1 . ) = S ^ ( m 2 . ) , then
(i) 
a ( m 1 . ) a ( m 2 . ) implies m . 1 m . 2 .
(ii) 
a ( m 1 . ) a ( m 2 . ) implies m . 1 m . 2 .
(iii) 
a ( m 1 . ) = a ( m 2 . ) implies m . 1 m . 2 .
Definition 3 
([30]). Assume that X ϕ is a universe of discourse and G = { G 1 , G 2 , , G n } , where G i ( i = 1 , 2 , 3 , , n ) I F ( X ) . For any IFN, β = ( β 1 , β 2 ) . Then G is called an IF β-covering of X if i = 1 n G i ( ϰ ) β , ϰ X . In this context, the pair (X,G) is represented as an IF covering approximation space (IFCAS).
Definition 4. 
Assume that X , G is an IFCAS and G = { G 1 , G 2 , , G n } is an IF-β covering of X for some β = ( β 1 , β 2 ) ; then,
N G ( ϰ ) β = { G i G | G i ( ϰ ) β , i = 1 , 2 , , n }
is referred to as an IF β-neighborhood of ϰ in X.
Definition 5 
([30]). Assume that X , G is an IFCAS, G = { G 1 , G 2 , , G m } is an IF β-covering of X for some IFN β = ( β 1 , β 2 ) , and X = { ϰ 1 , ϰ 2 , , ϰ n } . Suppose that N G ( ϰ i ) β = N G ( ϰ i ) β | ϰ i X is an IF β-neighborhood system induced by G, where N G ( ϰ i ) β = { ϰ j , τ N G ( ϰ i ) β ( ϰ i , ϰ j ) , η N G ( ϰ i ) β ( ϰ i , ϰ j ) | j = 1 , 2 , n } i = 1 , 2 , , n . For any A I F ( X ) , the lower approximation (LA) and upper approximation (UA) spaces of A with respect to N G β represented as N G β ̲ ( A ) and N G β ¯ ( A ) , respectively, are two IFSs on X defined by
N G β ̲ ( A ) = ϰ i , τ N ̲ G β ( A ) ( ϰ i ) , η N ̲ G β ( A ) ( ϰ i ) | i = 1 , 2 , n
and
N G β ¯ ( A ) = ϰ i , τ N ¯ G β ( A ) ( ϰ i ) , η N ¯ G β ( A ) ( ϰ i ) | i = 1 , 2 , n
where
τ N G β ̲ ( A ) ( ϰ ) = j = 1 n { η N G ( ϰ i ) β ( ϰ i , ϰ j ) τ A ( ϰ j ) }
η N G β ̲ ( A ) ( ϰ ) = j = 1 n { τ N G ( ϰ i ) β ( ϰ i , ϰ j ) η A ( ϰ j ) }
and
τ N G β ¯ ( A ) ( x i ) = j = 1 n { τ N G ( x i ) β ( x i , x j ) τ A ( x j ) }
η N G β ¯ ( A ) ( ϰ ) = j = 1 n { η N G ( ϰ i ) β ( ϰ i , ϰ j ) η A ( ϰ j ) }
N G β ̲ ( A ) , N G β ¯ ( A ) : I F ( X ) I F ( X ) are called the lower and upper IF rough approximation operators (IFRAOs) with respect to N G β , respectively. The pair ( N G β ̲ ( A ) , N G β ¯ ( A ) ) refers to a covering-based IF rough set (CIFRS).

2.2. Covering-Based Hesitant Fuzzy Rough Set

In this subsection, we examine the HFS, score function, and accuracy function of a hesitant fuzzy element (HFE) and a hesitant fuzzy rough set (HFRS). The HFS can be defined as follows:
Definition 6 
([9,31]). Assume that X ϕ universe of discourse; then an HFS denoted as H ^ in the set X can be defined as
H ^ = { z , Ω H ^ ( z ) z X }
where Ω H ^ ( z ) is a collection of possible values belonging to the interval [0, 1] representing the degree of membership of z X to H ^ . If X is a singleton set, then h ( z ) ^ is a hesitant fuzzy element.
Definition 7 
([32]). Assuming that h ^ is an HF element, the score function of  h ^ is defined as follows:
s ( h ^ ) = 1 l ( h ^ ) s = 1 l ( h ) h ^ σ ( s ) .
Furthermore [32], for any two hesitant elements, say, h ˙ 1 , h ˙ 2 , see as follows:
(i) 
If s ( h ^ 1 ) s ( h ^ 2 ) , then h ^ 1 h ^ 2 .
(ii) 
If s ( h ^ 1 ) = s ( h ^ 2 ) , then h ^ 1 h ^ 2 .
Definition 8 
([27]). Assume that X ϕ is a universe of discourse, G = { G 1 , G 2 , , G n } where G i ( i = 1 , 2 , , n ) H F ( X ) , and β = ( β 1 , β 2 ) can be any HFE, then G is called an HF β-covering of X if h i = 1 n G i ( z ) β , z X . The pair X , G is called an HF β-covering approximation space (HFCAS).
Definition 9 
([27]). Assume that X , G is an HFCAS and G = { G 1 , G 2 , , G n } is an HF-β covering of X for some β = ( β 1 , β 2 ) ; then N 1 , z β , G = { G i G | h G i ( z ) β , i = 1 , 2 , , n } and N 2 , z β , G = { y , h N 2 , z β , G ( y ) | y X } are called an HF β-neighborhood and HF complementary β-neighborhood of z on X, respectively. Here, h N 2 , z β , G ( y ) = h N 1 , y β , G ( z ) .
Definition 10. 
Assume that X , G is an HFCAS and G = { G 1 , G 2 , , G m } is an HF β-covering of X for some HF elements β. For any h ^ H F ( X ) , the LA and UA spaces of h ^ with respect to N G β represented as N G β ̲ ( h ^ ) and N G β ¯ ( h ^ ) , respectively, are two HFSs on X defined by N G β ̲ ( h ^ ) = z , h ^ N ̲ G β ( h ^ ) ( z ) and N G β ¯ ( A ) = z , h ^ N ¯ G β ( A ) ( z ) , where h ^ N G β ̲ ( A ) ( z ) = y X { h ^ ( N G β ) c ( y ) h ^ A ( y ) } and h ^ N G β ¯ ( A ) ( z ) = y X { h ^ N G β ( y ) h ^ A ( y ) } . N G β ̲ ( A ) , N G β ¯ ( A ) : H F ( X ) H F ( X ) are called the lower and upper hesitant fuzzy rough approximation operators (HFRAOs) with respect to N G β , respectively. The pair ( N G β ̲ ( A ) , N G β ¯ ( A ˜ ) ) refers to a covering-based hesitant fuzzy rough set (CHFRS).

2.3. Intuitionistic Hesitant Fuzzy Set

The concept of the IHFS was first introduced by Peng et al. [15] and is characterized by a hesitant fuzzy membership degree and a hesitant fuzzy nonmembership degree. In this subsection, a definition of the IHFS is presented, and some operational laws and comparisons of the IHFNS are also discussed. The IHFS can be defined as follows:
Definition 11 
([15]). Assume that X ϕ universe of discourse; then an IHFS Λ I H F S on X denoted by Λ I H F S can be defined as
Λ I H F S = { ϰ , Φ Λ I H F S ( ϰ ) , Ψ Λ I H F S ( ϰ ) ϰ X } ,
where Φ Λ I H F S ( ϰ ) and Ψ Λ I H F S ( ϰ ) are mappings from X to the interval [ 0 , 1 ] representing the hesitant fuzzy MD and hesitant fuzzy NMD, respectively, and are the set of possible values belonging to [ 0 , 1 ] such that for h Λ I H F S ( ϰ ) Φ Λ I H F S ( ϰ ) h ^ Λ I H F S ( ϰ ) Ψ Λ I H F S ( ϰ ) with h Λ I H F S ( ϰ ) + h ^ Λ I H F S ( ϰ ) 1 and h ^ Λ I H F S ( ϰ ) Ψ Λ I H F S ( ϰ ) h Λ I H F S ( ϰ ) Φ Λ I H F S ( ϰ ) with 0 h Λ I H F S ( ϰ ) + h ^ Λ I H F S ( ϰ ) 1 . Further, IHFS(X) represents the set of all IHFSs. If X can have only one element ϰ , then ϰ , Φ Λ ( ϰ ) , Ψ Λ ( ϰ ) is said to be an IHFN that is represented by e ˙ = Φ e ˙ , Ψ e ˙ for convenience.
Definition 12 
([15]). Assume that e ˙ 1 = Φ e ˙ 1 , Ψ e ˙ 1 , e ˙ 2 = Φ e ˙ 2 , Ψ e ˙ 2 , and e ˙ 3 = Φ e ˙ 3 , Ψ e ˙ 3 are three IHFNs; then
(i) 
ζ e ˙ = h e ˙ Φ e ˙ { 1 ( 1 h e ˙ ) ζ } , h ^ e ˙ Ψ e ˙ { h ^ e ˙ } ζ , ζ 0 .
(ii) 
e ˙ ζ = h e ˙ Φ e ˙ { h e ˙ } ζ , h ^ e ˙ Ψ e ˙ { 1 ( 1 h ^ e ˙ ) ζ } , ζ 0 .
(iii) 
e ˙ 1 + e ˙ 2 = h e ˙ 1 Φ e ˙ 1 , h e ˙ 2 Φ e ˙ 2 { h e ˙ 1 + h e ˙ 2 h e ˙ 1 . h e ˙ 2 } , h ^ e ˙ 1 Ψ e ˙ 1 , h ^ e ˙ 2 Ψ e ˙ 2 { h ^ e ˙ 1 . h ^ e ˙ 2 } .
(iv) 
e ˙ 1 × e ˙ 2 = h e ˙ 1 Φ e ˙ 1 , h e ˙ 2 Φ e ˙ 2 { h e ˙ 1 . h e ˙ 2 } , h ^ e ˙ 1 Ψ e ˙ 1 , h ^ e ˙ 2 Ψ e ˙ 2 { h ^ e ˙ 1 + h ^ e ˙ 2 h ^ e ˙ 1 . h ^ e ˙ 2 } .
Definition 13 
([33]). Assume that X ˙ ϕ is a universe of discourse; then for any B ¯ , C ¯ I H F S ( X ˙ ) . The union B ¯ C ¯ and intersection B ¯ C ¯ of B ¯ and C ¯ are specified as follows:
B ¯ C ¯ = χ , Φ B ¯ ( χ ) Φ C ¯ ( χ ) , Ψ B ¯ ( χ ) Ψ C ¯ ( χ ) χ χ
B ¯ C ¯ = χ , Φ B ¯ ( χ ) Φ C ¯ ( χ ) , Ψ B ¯ ( χ ) Ψ C ¯ ( χ ) χ χ
where
Φ B ¯ ( χ ) Φ C ¯ ( χ ) = ν ( Φ B ¯ ( χ ) Φ C ¯ ( χ ) ) | ν max ( Φ B ¯ ( χ ) , Φ C ¯ ( χ ) )
and
Φ B ¯ ( χ ) Φ C ¯ ( χ ) = ν ( Φ B ¯ ( χ ) Φ C ¯ ( χ ) ) | ν min ( Φ B ¯ + ( χ ) , Φ C ¯ + ( χ ) )
and
Ψ B ¯ ( χ ) Ψ C ¯ ( χ ) = ν ( Ψ B ¯ ( χ ) Ψ C ¯ ( χ ) ) | ν min ( Ψ B ¯ + ( χ ) , Ψ C ¯ + ( χ ) ) ,
Ψ B ¯ ( χ ) Ψ C ¯ ( χ ) = ν ( Ψ B ¯ ( χ ) Ψ C ¯ ( χ ) ) | ν max ( Ψ B ¯ ( χ ) , Ψ C ¯ ( χ ) )
The score and accuracy functions of the IHFS are, respectively, given by the following:
Definition 14 
([15]). Assume that e ˙ = Φ e ˙ , Ψ e ˙ is an IHFN; the score function and accuracy function of e ˙ are defined, respectively, as ( e ˙ ) = Φ e ˙ Ψ e ˙ 2 , where Φ e ˙ = sum of all elements in Φ e ˙ Φ e ˙ , Ψ e ˙ = sum of all elements in Ψ e ˙ Ψ e ˙ , and ( e ˙ ) [ 1 , 1 ] ; and A ̧ ( e ˙ ) = Φ e ˙ Ψ e ˙ 2 , where Φ e ˙ = sum of all elements in Φ e ˙ Φ e ˙ , Ψ e ˙ = sum of all elements in Ψ e ˙ Ψ e ˙ , and A ̧ ( e ˙ ) [ 0 , 1 ] .

3. Covering-Based Intuitionistic Hesitant Fuzzy Rough Set (CIHFRS) Models

In this section, we define the CIHRS as an extension of the IHFS with a covering-based rough set. We define intuitionistic hesitant fuzzy β -covering rough approximation spaces, the intuitionistic hesitant fuzzy β -neighborhood, and the intuitionistic hesitant fuzzy complementary β -neighborhood, and examples of the concepts are also presented. Properties of the developed concepts are investigated in detail.
Definition 15. 
Assume that X is a universe of discourse, G = { G 1 , G 2 , , G m } where G i ( i = 1 , 2 , , m ) I H F ( X ) , and β = ( Φ β , Ψ β ) IHFN; then G is called an IHF β-covering of X if i = 1 m ( x ) β , x X . The pair X , G is called an IHFCAS.
Definition 16. 
Assume that X , G is an IHFCAS, G = { G 1 , G 2 , , G m } is an intuitionistic hesitant fuzzy β-covering of X, and β = ( Φ β , Ψ β ) is an IHFN; then N = { G i G | G i ( x ) β , i = 1 , 2 , , m } is called an IHF β-neighborhood of x X .
Definition 17. 
Assume that X , G is an IHFCAS, G = { G 1 , G 2 , , G m } is an IHF β-covering of X for some IHFN β = ( Φ β , Ψ β ) , and X = { x 1 , x 2 , , x n } . x X ; then the set
Φ M ¯ x β ( y ) , Ψ M ¯ x β ( y ) = Φ N y β ( x ) , Ψ N y β ( x ) . y X
M ¯ x β is called an IHF-complement β-neighborhood of x in X. We represent M ˜ G β = { M x β | x X } as the β-neighborhood system induced by the IHF complement through the IHF β-covering G, where M x β = { y , Φ M x β ( y ) , Ψ M x β ( y ) | y X } .
Example 1. 
Assume that X , G is an IHFCAS, and G = { G 1 , G 2 , G 3 , G 4 , G 5 } is an intuitionistic hesitant fuzzy β-covering of set X. Take β = { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } , where X = { ϰ 1 , ϰ 2 , ϰ 3 , ϰ 4 , ϰ 5 } , as shown in Table 1.
Then N ϰ 1 β = G 1 G 5 , N ϰ 2 β = G 2 G 4 , N ϰ 3 β = G 1 G 4 , N ϰ 4 β = G 2 G 3 , N ϰ 5 β = G 4 G 5 .
Calculating the value of the β-neighborhood, we obtain Table 2.
By using Definition 17, we obtain the IHF-complement β-neighborhood values as presented in Table 3.
Definition 18. 
Assume that X , G is an IHFCAS, G = { G 1 , G 2 , , G m } an intuitionistic hesitant fuzzy β-covering of X for some IHFN β = ( Φ β , Ψ β ) , and X = { x 1 , x 2 , , x n } . For every A ¯ I H F ( X ) , the LA and UA of A ¯ with respect to N G β are represented as N G β ̲ ( A ¯ ) and N G β ¯ ( A ¯ ) , respectively, which are two IHFSs in X, defined as
N G β ̲ ( A ¯ ) = { x , Φ N G β ̲ ( A ¯ ) ( x ) , Ψ N G β ̲ ( A ¯ ) ( x ) }
and
N G β ¯ ( A ¯ ) = { x , Φ N G β ¯ ( A ¯ ) ( x ) , Ψ N G β ¯ ( A ¯ ) ( x ) }
where Φ N G β ̲ ( A ) ( x ) = y X { Φ ( N x β ) c ( y ) Φ A ( y ) } Ψ N G β ̲ ( A ) ( x ) = y X { Ψ ( N x β ) c ( y ) Ψ A ( y ) } and Φ N G β ¯ ( A ) ( x ) = y X { Φ N x β ( y ) Φ A ( y ) } Ψ N G β ¯ ( A ) ( x ) = y X { Ψ N x β ( y ) Ψ A ˜ ( y ) } . N G β ̲ ( A ) , N G β ¯ ( A ) : I H F ( X ) I H F ( X ) are called the first type of LA and UA approximation operators of A ¯ with respect to N G β . The pair ( N G β ̲ ( A ) , N G β ¯ ( A ) ) is said to be the first type of IHFβCRSs (I-IHFβCRSs).
Example 2 
(continued from Example 1). Let
A ¯ = ϰ 1 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } } , ϰ 3 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.4 } } , ϰ 4 , { { 0.4 , 0.5 , 0.6 } , { 0.1 , 0.2 , 0.4 } } , ϰ 5 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } }
By Definition 18, N G β ̲ and N G β ¯ are obtained as follows:
N G β ̲ ( A ) = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } }
and
N G β ¯ ( A ) = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.2 , 0.4 } } , ϰ 3 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } }
Definition 19. 
Assume that X , G is an IHFCAS, G = { G 1 , G 2 , , G m } is an intuitionistic hesitant fuzzy β-covering of X for some IHFN β = ( Φ β , Ψ β ) , and X = { x 1 , x 2 , , x n } . For every A ¯ I H F ( X ) , the LA and UA of A ¯ with respect to M ˜ x β denoted by M G β ̲ and M G β ¯ , respectively, are IHFSs on X and defined as
M G β ̲ ( A ¯ ) = x , Φ M G β ̲ ( A ¯ ) ( x ) , Ψ M G β ̲ ( A ¯ ) ( x ) | x X
and
M G β ¯ ( A ¯ ) = x , Φ M G β ¯ ( A ) ( x ) , Ψ M G β ¯ ( A ) ( x ) | x X
where Φ M G β ̲ ( A ) ( x ) = y X { Ψ ( M x β ¯ ) c ( A ) ( y ) Φ A ( y ) } , Ψ M G β ̲ ( A ) ( x ) = y X { Φ ( M x β ) c ¯ ( A ) ( y ) Ψ A ( y ) } and Φ M G β ¯ ( A ) ( x ) = y X { Φ M x β ¯ ( A ) ( y ) Φ A ( y ) } , Ψ M x β ¯ ( A ) ( x ) = y X { Ψ M G β ¯ ( A ) ( y ) Ψ A ( y ) } . M G β ̲ ( A ) ; M G β ¯ ( A ) : I H F ( X ) I H F ( X ) are said to be the second type of LA and UA operators of A with respect to M ˜ x β . The pair ( M G β ̲ ( A ) , M G β ¯ ( A ) ) is called the second type of IHβCRSs (II-IHβCRSs).
Example 3 
(continued from Example 1). Let
A = ϰ 1 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } } , ϰ 3 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.4 } } , ϰ 4 , { { 0.4 , 0.5 , 0.6 } , { 0.1 , 0.2 , 0.4 } } , ϰ 5 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } }
By Definition 19, M G β ̲ and M G β ¯ are found out as follows:
M G β ̲ ( A ˜ ) = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } }
and
M ¯ G β ( A ˜ ) = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } }
From Examples 2 and 3, we obtain the following: I-CIHFRS models and II-CIHFRS models do not directly relate, though the IHF β -covering induces the IHFC β -covering.
Definition 20. 
Assume that X , G is an IHFCAS, G = { G 1 , G 2 , , G m } is an intuitionistic hesitant fuzzy β-covering of X for some intuitionistic hesitant fuzzy number (IHFN) β = ( Φ β , Ψ β ) , and X = { x 1 , x 2 , , x n } . For every A ¯ I H F ( X ) , the LA and UA of A ¯ with respect to N G β and M ˜ G β represented by K ̲ G β and K ¯ G β , respectively, will be the IHFS on X defined by
K ̲ G β A ¯ = x , Φ K ̲ G β ( A ¯ ) ( x ) , Ψ K ̲ G β ( A ¯ ) ( x ) | x X
and
K ¯ G β A ¯ = x , Φ K ¯ G β ( A ¯ ) ( x ) , Ψ K ¯ G β ( A ¯ ) ( x ) | x X
where Φ K ̲ G β ( A ¯ ) ( x ) = y X Φ ( M ˜ G β ) c ( y ) Φ ( N x β ) c ( y ) Φ A ¯ ( y ) , Ψ K ̲ G β ( A ¯ ) ( x ) = y X Ψ ( M ˜ G β ) c ( y ) Ψ ( N x β ) c ( y ) Ψ A ¯ ( y ) and Φ K ¯ G β ( A ¯ ) ( x ) = y X Φ M ˜ G β ( A ¯ ) ( y ) Φ ( N x β ) ( y ) Φ A ¯ ( y ) , Ψ K ¯ G β ( A ¯ ) ( x ) = y X Ψ M ˜ G β ( A ) ( y ) Ψ ( N x β ) ( y ) Ψ A ¯ ( y ) . K ̲ G β ( A ¯ ) , K ¯ G β ( A ¯ ) : I H F ( X ) I H F ( X ) , the third type of LA and UA operators for set A ¯ with respect to N G β and M ˜ G β . This pair ( K ̲ G β ( A ) , K ¯ G β ( A ) ) is referred to as the IH β C R S s (III-IH β C R S s ) .
Example 4 
(continued from Example 1). Let
A ¯ = ϰ 1 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } } , ϰ 3 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.4 } } , ϰ 4 , { { 0.4 , 0.5 , 0.6 } , { 0.1 , 0.2 , 0.4 } } , ϰ 5 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } }
By Definition 20, K ̲ G β and K ¯ G β are calculated as follows:
K ̲ G β = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } }
and
K ¯ G β = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.2 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } }
Definition 21. 
Assume that X , G is an IHFCAS; let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X for some IHFN β = ( Φ β , Ψ β ) and X = { x 1 , x 2 , , x n } . For every A ˜ I H F ( X ) , the LA and UA of A ˜ with respect to N G β and M ˜ G β represented by F G β ̲ and F G β ¯ , respectively, are the IHFSs on X defined as
F G β ̲ = x , Φ F G β ̲ ( A ¯ ) ( x ) , Ψ F G β ̲ ( A ¯ ) ( x ) | x X
and
F G β ¯ = x , Φ F G β ¯ ( A ¯ ) ( x ) , Ψ F G β ¯ ( A ¯ ) ( x ) | x X
where
Φ F G β ̲ ( A ¯ ) ( x ) = y X Φ ( M ˜ G β ) c ( y ) Φ ( N x β ) c ( y ) Φ A ¯ ( y ) ,
Ψ F ̲ G β ( A ¯ ) ( x ) = y X Ψ ( M ˜ G β ) c ( y ) Ψ ( N x β ) c ( y ) Ψ A ˜ ( y )
and
Φ F ¯ G β ( A ˜ ) ( x ) = y X Φ M ˜ G β ( A ˜ ) ( y ) Φ ( N x β ) ( y ) Φ A ˜ ( y ) ,
Ψ F ¯ G β ( A ˜ ) ( x ) = y X Ψ M ˜ G β ( A ˜ ) ( y ) Ψ ( N x β ) ( y ) Ψ A ˜ ( y ) .
F G β ̲ ( A ˜ ) , F G β ¯ ( A ˜ ) : I H F ( X ) I H F ( X ) . The fourth type of LA and UA operators for set A ¯ with respect to N G β and M ˜ G β are termed ( F G β ̲ ( A ¯ ) , F G β ¯ ( A ˜ ) ). This pair is called the fourth type of IH β C R S s ( I V I H β C R S s ) .
Example 5 
(continued from Example 1). Let
A ¯ = ϰ 1 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } } , ϰ 3 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.4 } } , ϰ 4 , { { 0.4 , 0.5 , 0.6 } , { 0.1 , 0.2 , 0.4 } } , ϰ 5 , { { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.5 } }
By Definition 21, F ̲ G β and F ¯ G β are calculated as follows:
F ̲ G β = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } }
and
F ¯ G β = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } }
Theorem 1. 
For every x in X, the outcomes for the degrees of m ˘ and n ˘ m ˘ in relation to the approximation operators are as follows:
i ) 0 Φ M ̲ x β ( A ˜ ) ( y ) + Ψ M ̲ x β ( A ˜ ) ( y ) 1
i i ) 0 Φ M ¯ x β ( A ˜ ) ( y ) + Ψ M ¯ x β ( A ˜ ) ( y ) 1
Proof. 
First, we prove the inequality (i) by Definition 17. For any x X , it is obvious that 0 Φ M ̲ x β ( A ˜ ) ( y ) + Ψ M ̲ x β ( A ˜ ) ( y ) . On the other side, we obtain
1 Ψ M ̲ x β ( A ˜ ) ( y ) = 1 Φ M x β ( A ˜ ) ( y ) Ψ A ˜ ( y )
= ( 1 Φ M x β ( A ˜ ) ( y ) ) ( 1 Ψ A ˜ ( y ) )
Ψ M x β ( A ˜ ) ( y ) Φ A ˜ ( y )
= Φ M ̲ x β ( A ˜ ) ( y )
This shows that
0 Φ M ̲ x β ( A ˜ ) ( y ) + Ψ M ̲ x β ( A ˜ ) ( y ) 1
Similarly, as by Definition 17, for any x X , it is obvious that 0 Φ M ¯ x β ( A ˜ ) ( y ) + Ψ M ¯ x β ( A ˜ ) ( y ) . On the other side, we obtain
1 Ψ M ¯ x β ( A ˜ ) ( y ) = 1 Φ M x β ( A ˜ ) ( y ) Ψ A ˜ ( y )
= ( 1 Φ M x β ( A ˜ ) ( y ) ) ( 1 Ψ A ˜ ( y ) )
Ψ M x β ( A ˜ ) ( y ) Φ A ˜ ( y )
= Φ M ¯ x β ( A ˜ ) ( y )
This shows that
0 Φ M ¯ x β ( A ˜ ) ( y ) + Ψ M ¯ x β ( A ˜ ) ( y ) 1
Theorem 2. 
Suppose (X, G) constitutes an approximation space known as an IHFCAS.
G = { G 1 , G 2 , , G m }
is an intuitionistic hesitant fuzzy β-covering of X . For some intuitionistic hesitant fuzzy number (IHFN), β = ( Φ β , Ψ β ) . Assume that M ˜ x β = { M x β | x X } is the intuitionistic hesitant fuzzy-complement β-neighborhood system induced by G. For any P , Q I H F ( X ) , t h e n
i ) I f P Q , t h e n M G β ̲ ( P ) M G β ̲ ( Q ) a n d M G β ¯ ( Q ) M G β ¯ ( Q ) .
i i ) M G β ̲ ( P Q ) = M G β ̲ ( P ) M G β ̲ ( Q ) a n d M G β ̲ ( P Q ) M G β ̲ ( P ) M G β ̲ ( Q ) .
i i i ) M G β ¯ ( P Q ) = M G β ¯ ( P ) M G β ( Q ) a n d M G β ¯ ( P Q ) M G β ¯ ( P ) M G β ( Q ) .
i v ) M G β ̲ ( P ) c = M G β ¯ ( P ) c a n d M G β ¯ ( P ) c = M G β ̲ ( P ) c .
Various distances between IFSs were introduced by several authors (Wang and Xin [34]; Xu and Yager [35]; Szmidt and Kacprzyk [36]). Here, we utilize Wang and Xin’s [34] idea of IFS distances for IHFS distance in the following way:
Definition 22. 
Assume that X , G is an IHF-covering approximation space. Suppose that A , B I H F S ( X ) , where A = x , Φ A ( x ) , Ψ A ( x ) | x X , B = x , Φ B ( x ) , Ψ B ( x ) | x X . Define the distance D ( A , B ) for A and B as follows:
D ( A , B ) = 1 | X | | Φ A ( x ) Φ B ( x ) | + | Ψ A ( x ) Ψ B ( x ) | 4 + max | Φ A ( x ) Φ B ( x ) | , | Ψ A ( x ) Ψ B ( x ) | 2
Definition 23. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X . For some IHFN, β = ( Φ β , Ψ β ) . Consider the IHF β-neighborhood system N G β = N G ( ϰ ) β | ϰ X induced by G. For any A I H F ( X ) , N G β ¯ ( A ) and N G β ̲ ( A ) are the UA and LA of A in relation to N G β , respectively. We define the rough and precision degrees of A with respect to N G β , respectively, as follows:
R N G β ( A ) = D N G β ̲ ( A ) , N G β ¯ ( A )
and
P N G β ( A ) = 1 R N G β ( A )
Example 6 
(continued from Example 2).
N G β ̲ ( A ) = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } }
and
N G β ¯ ( A ) = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.2 , 0.4 } } , ϰ 3 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } }
Applying the provided definition, we derive the roughness and precision degrees for set A in relation to N G β , respectively, as follows: R N G β ( A ) = 0.08 and P N G β ( A ) = 0.91 .
Definition 24. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X . For some intuitionistic hesitant fuzzy number (IHFN), β = ( Φ β , Ψ β ) . Assume that M G β = M G ( ϰ ) β | ϰ X is an IHFC β -neighborhood system induced by G. For any A I H F ( X ) , M G β ¯ ( A ) and M G β ̲ ( A ) are the UA and LA of A in relation to N G β , respectively. We define the rough and precision degrees of A with respect to M G β , respectively, as follows:
R M G β ( A ) = D M G β ̲ ( A ) , M G β ¯ ( A )
and
P M G β ( A ) = 1 R M G β ( A )
Example 7 
(continued from Example 2).
M G β ̲ ( A ) = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } }
and
M ¯ G β ( A ) = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } }
Applying the provided definition, we derive the roughness and precision degrees for set A in relation to M G β , respectively, as follows: R M G β ( A ˜ ) = 0.10 and P M G β ( A ˜ ) = 0.90 .
From Examples 6 and 7, we obtain the following:
Any IHFS has distinct rough and precision degrees in relation to M G β and N G β , respectively.
Definition 25. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X . For some intuitionistic hesitant fuzzy number (IHFN), β = ( Φ β , Ψ β ) . Assume that N G β = N G ( ϰ ) β | ϰ X is a β-neighborhood IHF system and M G β = M G ( x ) β | x X is an IHFC β n e i g h b o r h o o d system induced by G, respectively. For any A ˜ I H F ( X ) , K ̲ G β ( A ˜ ) and K ¯ G β ( A ˜ ) are the upper and lower approximations of A ˜ with respect to N G β and M G β , respectively. We define the rough and precision degrees of A ˜ with respect to K G β , respectively, as follows: R K G β ( A ˜ ) = D K G β ̲ ( A ˜ ) , K G β ¯ ( A ˜ ) and P K G β ( A ˜ ) = 1 R K G β ( A ˜ ) .
Example 8 
(continued from Example 4).
K ̲ G β = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } }
and
K ¯ G β = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.2 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } }
Applying the provided definition, we derive the roughness and precision degrees for set A in relation to K G β , respectively, as follows: R K G β ( A ˜ ) = 0.13 and P K G β ( A ˜ ) = 0.86 .
Definition 26. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X. For some intuitionistic hesitant fuzzy number (IHFN), β = ( Φ β , Ψ β ) . Assume that N G β = N G ( ϰ ) β | ϰ X is an IHF β n e i g h b o r h o o d system and M G β = M G ( x ) β | x X is an IHFCβ-neighborhood system induced by G, respectively. For any A I H F ( X ) , F ̲ G β ( A ) and F ¯ G β ( A ) are the upper and lower approximations of A with respect to N G β and M G β , respectively. We define the rough and precision degrees of A with respect to F G β , respectively, as follows: R F G β ( A ) = D F G β ̲ ( A ) , F G β ¯ ( A ) and P F G β ( A ) = 1 R F G β ( A ) .
Example 9 
(continued from Example 5).
F ̲ G β = ϰ 1 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 2 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 4 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 5 , { { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } }
and
F ¯ G β = ϰ 1 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } } , ϰ 2 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } } , ϰ 3 , { { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } } , ϰ 4 , { { 0.3 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } } , ϰ 5 , { { 0.2 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } }
Applying the provided definition, we derive the roughness and precision degrees for set A in relation to F G β , respectively, as follows: R F G β ( A ˜ ) = 0.116 and P F G β ( A ˜ ) = 0.883 .
Theorem 3. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X . For some IHFN β = ( Φ β , Ψ β ) . Consider that N G β = N G ( x ) β | x X and M ˜ G β = M ˜ G ( x ) β | x X are an IHF β n e i g h b o r h o o d system induced by G, respectively. Suppose that A, B I H F S ( X ) , then
i ) A B , t h e n K ̲ G β ( A ) K ̲ G β ( B ) a n d K ¯ G β ( A ) K ¯ G β ( B ) ; i i ) K ̲ G β ( A B ) = K ̲ G β ( A ) K ̲ G β ( B ) and K ̲ G β ( A B ) K ̲ G β ( A ) K ̲ G β ( A ) ; i i i ) K ¯ G β ( A B ) = K ¯ G β ( A ) K ¯ G β ( B ) and K ¯ G β ( A B ) K ¯ G β ( A ) K ¯ G β ( B ) ; i v ) K ̲ G β ( A ) c = K ¯ G β ( A ) c and K ¯ G β ( A ) c = K ̲ G β ( A ) c .
Proof. 
Assume that A = x , Φ A ( x ) , Ψ A ( x ) | x X and B = x , Φ B ( x ) , Ψ B ( x ) | x X , then the following holds:
(i)
If A B , then Φ A ( x ) Φ B ( x ) and Ψ A ( x ) Ψ B ( x ) , and then
Φ K G β ¯ ( A ) ( x ) = Φ M ˜ G ( x ) β ( x ) Φ N G ( x ) β ( x ) Φ A ( x ) Φ M ˜ G ( x ) β ( x ) Φ N G ( x ) β ( x ) Φ B ( x ) = Φ K G β ¯ ( B ) ( x ) Φ K G β ¯ ( A ) ( x ) Φ K G β ¯ ( B ) ( x )
In the same manner, we also show that
Ψ K G β ¯ ( A ) ( x ) Ψ K G β ¯ ( B ) ( x )
holds. This states that
K ¯ G β ( A ) K ¯ G β ( B )
Similar to the way shown above, we prove that
K ̲ G β ( A ) K ̲ G β ( B )
Hence, we have proved (i).
(ii)
Φ K ̲ G β ( A B ) ( x ) = Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ ( A B ) ( x )
= Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ A ( x ) Φ B ( x )
= Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ A ( x ) Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ B ( x )
= Φ K ̲ G β ( A ) ( x ) Φ K ̲ G β ( B ) ( x ) Φ K ̲ G β ( A B ) ( x ) = Φ K ̲ G β ( A ) ( x ) Φ K ̲ G β ( B ) ( x )
In the same manner, we also show that
Ψ K ̲ G β ( A B ) ( x ) = Ψ K ̲ G β ( A ) ( x ) Ψ K ̲ G β ( B ) ( x )
holds. This states that
K ̲ G β ( A B ) = K ̲ G β ( A ) K ̲ G β ( B )
Similar to the way shown above, we prove that
K ̲ G β ( A B ) K ̲ G β ( A ) K ̲ G β ( A )
(iii)
The proof shares similarities with (ii).
(iv)
Φ K ̲ G β ( A c ) ( x ) = Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ A c ( x )
= Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ B ( x )
= Ψ K ̲ G β ( A ) ( x ) .
In the same manner, we also show that
Ψ K ̲ G β ( A c ) ( x ) = Φ K ̲ G β ( A ) ( x )
holds. This states that
K ̲ G β ( A ) c = K ¯ G β ( A ) c
Similar to the way shown above, we prove that
K ¯ G β ( A ) c = K ̲ G β ( A ) c
Theorem 4. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X. For some intuitionistic hesitant fuzzy number (IHFN), β = ( Φ β , Ψ β ) . Consider that N G β = N G ( x ) β | x X and M ˜ G β = M ˜ G ( x ) β | x X are an IHF β n e i g h b o r h o o d system induced by G, respectively. Suppose that A, B I H F S ( X ) , then
i ) A B , t h e n F ̲ G β ( A ) F ̲ G β ( B ) a n d F ¯ G β ( A ) F ¯ G β ( B ) ; i i ) F ̲ G β ( A B ) = F ̲ G β ( A ) F ̲ G β ( B ) and F ̲ G β ( A B ) F ̲ G β ( A ) F ̲ G β ( A ) ; i i i ) F ¯ G β ( A B ) = F ¯ G β ( A ) F ¯ G β ( B ) and F ¯ G β ( A B ) F ¯ G β ( A ) F ¯ G β ( B ) ; i v ) F ̲ G β ( A ) c = F ¯ G β ( A ) c and F ¯ G β ( A ) c = F ̲ G β ( A ) c .
Proof. 
Assume that A = x , Φ A ( x ) , Ψ A ( x ) | x X a n d B = x , Φ B ( x ) , Ψ B ( x ) | x X , then
A = x , Φ A ( x ) , Ψ A ( x ) | x X a n d B = x , Φ B ( x ) , Ψ B ( x ) | x X
(i)
If A B , then Φ A ( x ) Φ B ( x ) and Ψ A ( x ) Ψ B ( x ) , and then
Φ F G β ¯ ( A ) ( x ) = Φ M ˜ G ( x ) β ( x ) Φ N G ( x ) β ( x ) Φ A ( x ) Φ M ˜ G ( x ) β ( x ) Φ N G ( x ) β ( x ) Φ B ( x ) = Φ F G β ¯ ( B ) ( x ) Φ F G β ¯ ( A ) ( x ) Φ F G β ¯ ( B ) ( x )
In the same manner, we also show that
Ψ F G β ¯ ( A ) ( x ) Ψ F G β ¯ ( B ) ( x )
holds. This states that
F ¯ G β ( A ) F ¯ G β ( B )
Similar to the way shown above, we prove that
F ̲ G β ( A ) F ̲ G β ( B )
Hence, we have proved (i).
(ii)
Φ F ̲ G β ( A B ) ( x ) = Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ ( A B ) ( x )
= Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ A ( x ) Φ B ( x )
= Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ A ( x ) Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ B ( x )
= Φ F ̲ G β ( A ) ( x ) Φ F G β ( B ) ( x ) Φ F ̲ G β ( A B ) ( x ) = Φ F ̲ G β ( A ) ( x ) Φ K ̲ G β ( B ) ( x )
In the same manner, we also show that
Ψ F ̲ G β ( A B ) ( x ) = Ψ F ̲ G β ( A ) ( x ) Ψ F ̲ G β ( B ) ( x )
holds. This states that
F ̲ G β ( A B ) = F ̲ G β ( A ) F ̲ G β ( B )
Similar to the way shown above, we prove that
F ̲ G β ( A B ) F ̲ G β ( A ) F ̲ G β ( A )
(iii)
The proof shares similarities with (ii).
(iv)
Φ F ̲ G β ( A c ) ( x ) = Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ A c ( x )
= Ψ M ˜ G ( x ) β ( x ) Ψ N G ( x ) β ( x ) Φ B ( x )
= Ψ F G β ( A ) ( x ) .
In the same manner, we also show that
Ψ F ̲ G β ( A c ) ( x ) = Φ F G β ( A ) ( x )
holds. This states that
F ̲ G β ( A ) c = F ¯ G β ( A ) c
Similar to the way shown above, we prove that
F ¯ G β ( A ) c = F ̲ G β ( A ) c
Theorem 5. 
Assume that X , G is an IHF-covering approximation space (IHFCAS), and let G = { G 1 , G 2 , , G m } be an intuitionistic hesitant fuzzy β-covering of X . For some intuitionistic hesitant fuzzy number (IHFN), β = ( Φ β , Ψ β ) . Consider that N G β = N G ( ϰ ) β | ϰ X and M ˜ G β = M ˜ G ( ϰ ) β | ϰ X are an IHF β n e i g h b o r h o o d system induced by G , respectively. Suppose that A I H F S ( X ) , then
i ) F ̲ G β ( A ) N ̲ G β ( A ) K ̲ G β ( A ) ;
i i ) F ̲ G β ( A ) M ˜ ̲ G β ( A ) K ̲ G β ( A ) ;
i i i ) K ¯ G β ( A ) N ¯ G β ( A ) F ¯ G β ( A ) ;
i v ) K ¯ G β ( A ) M ˜ ¯ G β ( A ) F ¯ G β ( A ) ;
v ) F ̲ G β ( A ) = N ̲ G β ( A ) M ˜ ̲ G β ( A ) ;
v i ) F ¯ G β ( A ) = N ¯ G β ( A ) M ˜ ¯ G β ( A ) ;
v i i ) K ̲ G β ( A ) = N ̲ G β ( A ) M ˜ ̲ G β ( A ) ;
v i i i ) K ¯ G β ( A ) = N ¯ G β ( A ) M ˜ ¯ G β ( A ) .
Proof. 
Statements (i)–(iv) are obviously true from the definitions and now statement (v). For any ϰ X , then
Φ F ̲ G β ( A ) ( ϰ ) = Ψ M ˜ G ( ϰ ) β ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Φ M ˜ G ( ϰ ) β ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ )
= Ψ M ˜ G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Φ M ˜ G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ )
= Φ M ̲ ˜ G β ( A ) ( ϰ ) Φ N ̲ G β ( A ) ( ϰ ) , Ψ M ̲ ˜ G β ( A ) ( ϰ ) Ψ N ̲ G β ( A ) ( ϰ )
and
Ψ F ̲ G β ( A ) ( ϰ ) = Φ M ˜ G ( ϰ ) β ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Ψ M ˜ G ( ϰ ) β ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ )
= Φ M ˜ G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Ψ M ˜ G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ )
= Ψ M ̲ ˜ G β ( A ) ( ϰ ) Ψ N ̲ G β ( A ) ( ϰ ) , Φ M ̲ ˜ G β ( A ) ( ϰ ) Φ N ̲ G β ( A ) ( ϰ )
Hence, we obtain
F ̲ G β ( A ) = ϰ , Φ F ̲ G β ( A ) ( ϰ ) , Ψ F ̲ G β ( A ) ( ϰ )
F ̲ G β ( A ) = ϰ , Φ M ̲ ˜ G β ( A ) ( ϰ ) Φ N ̲ G β ( A ) ( ϰ ) , Ψ M ̲ ˜ G β ( A ) ( ϰ ) Ψ N ̲ G β ( A ) ( ϰ ) , Ψ M ̲ ˜ G β ( A ) ( ϰ ) Ψ N ̲ G β ( A ) ( ϰ ) , Φ M ̲ ˜ G β ( A ) ( ϰ ) Φ N ̲ G β ( A ) ( ϰ )
F ̲ G β ( A ) = ϰ , Φ M ̲ ˜ G β ( A ) ( ϰ ) Ψ M ̲ ˜ G β ( A ) ( ϰ ) , Ψ M ̲ ˜ G β ( A ) ( ϰ ) Φ M ̲ ˜ G β ( A ) ( ϰ )
ϰ , Φ N ̲ G β ( A ) ( ϰ ) Ψ N ̲ G β ( A ) ( ϰ ) , Ψ N ̲ G β ( A ) ( ϰ ) Φ N ̲ G β ( A ) ( ϰ )
= M ˜ ̲ G β ( A ) N ̲ G β ( A )
Hence, this shows that statement (v) holds.
(vi) For any ϰ X , then
Φ F ¯ G β ( A ) ( ϰ ) = Ψ M ˜ G ( ϰ ) β ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Φ M ˜ G ( ϰ ) β ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ )
= Ψ M ˜ G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Φ M ˜ G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ )
= Φ M ˜ ¯ G β ( A ) ( ϰ ) Φ N ¯ G β ( A ) ( ϰ ) , Ψ M ˜ ¯ G β ( A ) ( ϰ ) Ψ N ¯ G β ( A ) ( ϰ )
and
Ψ F ¯ G β ( A ) ( ϰ ) = Φ M ˜ G ( ϰ ) β ( ϰ ) Φ N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Ψ M ˜ G ( ϰ ) β ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ )
= Φ M ˜ G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) h N G ( ϰ ) β ( ϰ ) Ψ A ( ϰ ) Ψ M ˜ G ( ϰ ) β ( ϰ ) Φ A ( ϰ ) Ψ N G ( ϰ ) β ( ϰ ) Φ A ( ϰ )
= Ψ M ˜ ¯ G β ( A ) ( ϰ ) Ψ N ¯ G β ( A ) ( ϰ ) , Φ M ˜ ¯ G β ( A ) ( ϰ ) Φ N ¯ G β ( A ) ( ϰ )
Hence, we obtain
F ¯ G β ( A ) = ϰ , Φ F ¯ G β ( A ) ( ϰ ) , Ψ F ¯ G β ( A ) ( ϰ )
F ¯ G β ( A ) = ϰ , Φ M ˜ ¯ G β ( A ) ( ϰ ) Φ N ¯ G β ( A ) ( ϰ ) , Ψ M ˜ ¯ G β ( A ) ( ϰ ) Ψ N ¯ G β ( A ) ( ϰ ) , Ψ M ˜ ¯ G β ( A ) ( ϰ ) Ψ N ¯ G β ( A ) ( ϰ ) , Φ M ˜ ¯ G β ( A ) ( ϰ ) Φ N ¯ G β ( A ) ( ϰ )
F ¯ G β ( A ) = ϰ , Φ M ˜ ¯ G β ( A ) ( ϰ ) Ψ M ˜ ¯ G β ( A ) ( ϰ ) , Ψ M ˜ ¯ G β ( A ) ( ϰ ) Φ M ˜ ¯ G β ( A ) ( ϰ )
ϰ , Φ N ¯ G β ( A ) ( ϰ ) Ψ N ¯ G β ( A ) ( ϰ ) , Ψ N ¯ G β ( A ) ( ϰ ) Φ N ¯ G β ( A ) ( ϰ )
= M ˜ ¯ G β N ¯ G β ( A ) .
Hence, this shows that statement (vi) holds and that (vii) and (viii) are similar to (v). □

4. The Model and Approach for MCDM Involving the Evolution of IHF Information, Based on CIHFRS

MCDM presents a substantial challenge in DM, aiming to identify the most optimal alternative by evaluating diverse criteria during the selection process. Also referred to as multicriteria decision analysis (MCDA), this methodology is widely recognized for its high accuracy and is considered a groundbreaking advancement in the field of decision making [37,38]. Intuitionistic hesitant fuzzy sets (IHFSs) are acknowledged as an expanded version of IFSs, encompassing both HFSs and IFSs. To showcase the enhanced decision-making capabilities of IHFSs, a comparative analysis is conducted using the CIFRS model and the Yang–CHFRS versions established in Section 2.1 and Section 2.2, respectively. In this context, two distinct models and approaches are developed to tackle MCDM problems. The first approach involves assessing IHF information, considering the nuances provided by IHFS. The second approach addresses MCDM problems utilizing the advantages of both IHFS and conventional IFS/HFS procedures. These customized approaches assess IFS and HFS data independently in order to offer all-inclusive answers for decision-making situations.

4.1. A Method for MCDM with Evaluation of IHF Data Based on CIFRS and CHFRS Models

Using the CIFRS and CHFRS models as a starting point, we want to develop a solid model and approach that are especially suited to solving MCDM challenges. Using the complex subtleties offered by IHF data in DM processes, this model considers the appraisal of IHF information. We develop an organized way for solving MCDM issues by smoothly incorporating the analysis of IHF data. This entails creating an algorithm for generating decisions that fully integrates IHF data and making sure that everything is understood by providing a detailed breakdown of the steps involved in the procedure. Our aim is to deliver a workable and efficient solution that improves decisions in uncertain and complex contexts by utilizing insights of CIFRS and CHFRS models, as well as extending these to deal with IHF information inside MCDM frameworks.

The Problem of MCDM with Assessment of IHF Data-Based DMM

Assume that X = x 1 , x 2 , , x n is an alternative set, and let G ¯ = { G ¯ 1 , G ¯ 2 , , G ¯ m } be the set of criteria. Let ϖ = { ϖ 1 , ϖ 2 , , ϖ m } t be the weighted vectors of G ¯ . Given that 0 ϖ i 1 , i = 1 , 2 , , m and i = 1 m ϖ i = 1 , let decision maker X provide the evaluation values of the objects x i . , where i = 1 , 2 , , m with respect to the attribute set G ¯ j , where j = 1 , 2 , , m by G ¯ j ( x i ) = Φ i j , Ψ i j , which means that the degree to which x i holds G ¯ j is the value Φ i j and the degree to which x i does not hold G ¯ j is the value Ψ i j . If Ψ i j symbolizes the value, the difficulty in solving the DM issue is figuring out how to rank each object according to preference assessments. An innovative answer to various types of DM problems is provided in this section. Here, we provide the groundwork for an approach and method for dealing with MCDM instances, particularly the inclusion of IHF data evaluation. The CIFRS paradigm is utilized in combination with CHFRSs to complete the full strategy. Our objective is to utilize IHF data to handle the complexities of MCDM, which provides an intricate outlook for making decisions. Using the CIFRS and CHFRS models, we guarantee an in-depth review that analyzes the complexity and opposition found in DM scenarios.

4.2. DMM and Procedural Methods

We suggest the CIHFRS model, which involves the assessment of IHF information and extends to the study of the MCDM problem. Three basic stages make up this strategy, which includes the analysis of IHF information while addressing MCDM problems efficiently. Finding the IHF DMÂ item among all of the potential options is the initial step in the CIHFRS paradigm. This first step is critical because it establishes the framework for the model’s latter phases, which provide an organized method of making decisions in the face of ambiguity and hesitancy. Applying the IHF-TOPSIS approach, an IHF-positive information system (IHF- P I S ¯ ) is established:
P ^ + = { G j , max { Ş ( G j ( x i ) ) } | 1 j m }
and the IHF-negative information system (IHF- N I S ̲ ) is
P ^ = { G j , min { Ş ( G j ( x i ) ) } | 1 j m }
We compute D ^ + and D ^ the distances between the alternatives xi and IHF-PIS P+ and IHF- N I S ̲ P. Consequently, a new IHFS D ^ = ( D ^ + , D ^ ) is formed. Thus, we develop the multicriteria IHF DM information system (MCIHFDMIS) (X, G, P ^ , D ^ ). To elaborate further, the IHF set representing the universe is determined based on evaluations provided by the decision maker X, including the optimal calculations. In the second step, we calculate the LA and UA of the IHF decision-making object within the universe. This calculation incorporates a precision parameter denoted as P ¯ ( 0 < β 1 ), where β is the threshold set by decision maker X for consistency consensus within the CIHFRS model in the context of MCDM.
As a result, a new IHFS is created. We therefore create the MCIHFDMIS (X, G, P, and D) multicriteria IHF DM database. To clarify, the decision maker X provides evaluations, including the best and worst optimum evaluations, from which the IHF set representing the universe is derived. In the second phase, we compute the IHF decision-making object’s LA and UA within the universe. After the first phase of finding the IHF DM item in the universe of possible alternatives, the CIHFRS model generates a rating of all the alternatives. The ideal item in the DM issue is finally identified by using a DM principle that was derived from the previous phases. This ranking is based on that principle.
This paper introduces the foundational model and approach for addressing the MCDM problem, specifically incorporating the assessment of interval-valued hesitant fuzzy (IHF) information. The methodology operates within the framework of the CIHFRS model, showcasing a structured and effective way to handle DM scenarios with uncertainty and hesitation. The main strategy, called IHF-TOPSIS, is put forth with the supposition that the best option should be the one that is closest to the IHF-PIS and furthest from the IHF-NIS. This entails applying a score function to identify both the IHF-PIS and the IHF-NIS.
P ^ + = { G j , max { Ş ( G j ( x i ) ) } | j = 1 , 2 , m } ( 1 i n )
= { G 1 , Φ 1 + , Ψ 1 + , G 2 , Φ 2 + , Ψ 2 + , G m , Φ m + , Ψ m + }
and
P ^ = { G j min { Ş ( G j ( x i ) ) } | j = 1 , 2 , m } ( 1 i n )
= { G 1 , Φ 1 , Ψ 1 , G 2 , Φ 2 , Ψ 2 , G m , Φ m , Ψ m }
Next, we calculate the weighted distances D ^ + and D ^ among the available alternatives. x i and IHF- P I S ¯ P ^ + as well as IHF- N I S ̲ P ^ are computed as follows:
D ^ + = i = 1 m ϖ i d ( G j ( x i ) , G j ( P + ) )
= i = 1 m ϖ i | Φ + i j Φ + j | + | Ψ + i j Ψ + j | 4 + max | Φ + i j Φ + j | , | Ψ + i j Ψ + j | 2 ( 1 i n ) and D ^ = i = 1 m ϖ i . d ( G j ( x i ) , G j ( P ^ ) )
= i = 1 m ϖ i | Φ i j Φ j | + | Ψ i j Ψ j | 4 + max | Φ i j Φ j | , | Ψ i j Ψ j | 2 ( 1 i n )
Here, we formulate a novel IHF structure. D ^ = ( Φ D ^ , Ψ D ^ ) = ( D ^ + , D ^ ) . Next, we calculate the LA and UA of the optimal and least favorable IHF DM objects within the framework of the MCIHFDMIS, taking into account the P̅P β ( 0 < β 1 ) , individually:
Φ M G β ̲ ( D ) ( x i ) = n j = 1 { Ψ M G ( x i ) β ( x i , x j ) Φ D ( x j ) }
Ψ M G β ̲ ( D ) ( x i ) = j = 1 n { Φ M G ( x i ) β ( x i , x j ) Ψ D ( x j ) }
and
Φ M G β ¯ ( A ˜ ) ( x i ) = j = 1 n { Φ M G ( x i ) β ( x i , x j ) Φ D ( x j ) }
Ψ M G β ¯ ( D ) ( x i ) = n j = 1 { Ψ M G ( x i ) β ( x i , x j ) Ψ D ( x j ) }
In the final step, we utilize ranking rules to evaluate all alternatives within the universe. This evaluation is based on the LA and UA of the IHF decision-making object. We adhere to the consistency consensus threshold throughout this process, ensuring that the rankings maintain a level of coherence and agreement for β ( 0 < β 1 ) .
Definition 27 
([15]). Assume that X ϕ finite universe and suppose that e ¨ 1 = Φ e ¨ 1 , Ψ e ¨ 1 , e ¨ 2 = Φ e ¨ 2 , Ψ e ¨ 2 are two IHFNs and E = { x , Φ E ( x ) , Ψ E ( x ) | x X } I H F S ( X ) ; then, assume some basic operations as follows:
(i) 
e ¨ 1 + e ¨ 2 = μ e ¨ 1 Φ e ¨ 1 , μ e ¨ 2 Φ e ¨ 2 { μ e ¨ 1 + μ e ¨ 2 μ e ¨ 1 . μ e ¨ 2 } , ν e ¨ 1 Ψ e ¨ 1 , ν e ¨ 2 Ψ e ¨ 2 { ν e ¨ 1 . ν e ¨ 2 } .
(ii) 
e ¨ 1 × e ¨ 2 = μ e ¨ 1 Φ e ¨ 1 , μ e ¨ 2 Φ e ¨ 2 { μ e ¨ 1 . μ e ¨ 2 } , ν e ¨ 1 Ψ e ¨ 1 , ν e ¨ 2 Ψ e ¨ 2 { ν e ¨ 1 + ν e ¨ 2 ν e ¨ 1 . ν e ¨ 2 } .
Utilizing the aforementioned operators, we establish a ranking function applicable to any alternative in the context of the MCDM problem, incorporating the evaluation of IHF information.
Additionally, let us assume that (X, G, P ^ , D ^ ) represents an MCIHFDMIS.
For an IHF DM object, D ^ = ( D ^ + , D ^ ) I H F ( X ) , determined by the preference information of decision maker X.
We refer to δ ( x i ) = Ş M G β ¯ ( D ) ( x i ) + M G β ̲ ( D ) ( x i ) , the ranking function of the alternative x i ( i = 1 , 2 , n ) .

4.3. An Algorithm Designed for MCDM with Assessment of IHF Data

This subsection delineates the stages of MCDM while integrating the assessment of IHF information through the CIHFRS model, as illustrated below:
Input: MCIHFDMIS ( X , G , P , D ) .
Output: The arrangement of sorting for all alternatives.
Step 1: Build IHF- P I S ¯ P+, where P ^ + = { G j , max { Ş ( G j ( x i ) ) } | j = 1 , 2 , m } ( 1 i n ) :
= { G 1 , Φ 1 + , Ψ 1 + , G 2 , Φ 2 + , Ψ 2 + , G m , Φ m + , Ψ m + } and IHF- N I S ̲ P
where
P ^ = { G j min { Ş ( G j ( x i ) ) } | j = 1 , 2 , m } ( 1 i n ) = { G 1 , Φ 1 , Ψ 1 , G 2 , Φ 2 , Ψ 2 , G m , Φ m , Ψ m } .
Step 2: Compute the distance Φ D = D+ and Ψ D = D among the alternatives. x i and IHF- P I S ¯ P + and IHF- N I S ̲ P are computed individually.
Step 3: Compute the lower and upper approximations:
Φ M G β ̲ ( D ) ( x i ) , Ψ M G β ̲ ( D ) ( x i ) and Φ M G β ¯ ( A ˜ ) ( x i ) , Ψ M G β ¯ ( D ) ( x i )
Step 4: Calculate the summation function: M G β ¯ ( D ) ( x i ) and M G β ̲ ( D ) ( x i ) .
Step 5: Calculate the ranking function: δ ( x i ) .
Step 6: Assign a ranking to each value across all alternatives.

4.4. A Demonstrative Example

In this subsection, we apply the MCDM model and approach, integrating the evaluation of interval-valued hesitant fuzzy (IHF) information through CIHFRS models, to tackle the car-selection problem. This application aims to enrich the MCDM problem by incorporating IHF information assessment within its framework. Following this, we elucidate the IHF-TOPSIS principle and provide a detailed explanation of the procedure outlined in this paper. We elucidate each step, using a practical example for illustration purposes, to ensure a clear understanding of the methodology and its application in real-world scenarios. Let X = { ϰ 1 , ϰ 2 , ϰ 3 , ϰ 4 , ϰ 5 } be the five cars that are selected, Mahindra XUV ( ϰ 1 ), Scorpio ( ϰ 2 ), Duster ( ϰ 3 ), Vitara Breeza ( ϰ 4 ), and Fortuner ( ϰ 5 ), and compare this model using four criteria: cost ( G 1 ), seating capacity ( G 2 ), engine power ( G 3 ), and maximum speed ( G 4 ). The model of the car and comparison criteria are described in Table 4.
Here, apply the pessimistic approach for MCDM problems in an IHFS environment. When making decisions in risk-averse environments, where there is a need to rigorously restrict the possibility of negative consequences, the pessimistic approach is often used.
Decision maker X evaluates the five cars based on their specialized knowledge, assigning real values for each alternative concerning each attribute outlined in the table above. Additionally, the weights for the attribute set are designated in the following order, respectively: ϖ 1 = 0.3276836160 , ϖ 2 = 0.2316384179 , ϖ 3 = 0.2090395481 , and ϖ 4 = 0.2316384181 . According to the IHF- P I S ¯ P ^ + and IHF- N I S ̲ P ^ , it follows that
P ^ + = { G 1 , { 0.1 , 0.5 , 0.4 } , { 0.1 , 0.3 , 0.3 } } , { G 2 , { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.3 } } , { G 3 , { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.3 } } , { G 4 , { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } }
P ^ = { G 1 , { 0.3 , 0.2 , 0.4 } , { 0.2 , 0.2 , 0.3 } } , { G 2 , { 0.2 , 0.4 , 0.4 } , { 0.2 , 0.3 , 0.3 } } , { G 3 , { 0.2 , 0.2 , 0.4 } , { 0.1 , 0.2 , 0.3 } } , { G 4 , { 0.3 , 0.2 , 0.5 } , { 0.2 , 0.2 , 0.4 } }
Next, find out the weighted distances Φ D ^ = D ^ + and Ψ D ^ = D ^ among the alternatives x i and IHF- P I S ¯ P ^ + and IHF- N I S P ^ , respectively, as follows:
Φ D + = D + = 0.2500000000 ϰ 1 + 0.1766949153 ϰ 2 + 0.2199152542 ϰ 3 + 0.1868644068 ϰ 4 + 0.2175141243 ϰ 5
and
Ψ D = D = 0.2138418079 ϰ 1 + 0.1984463277 ϰ 2 + 0.3108757062 ϰ 3 + 0.2413841808 ϰ 4 + 0.2468926554 ϰ 5
Assume that the consistency consensus threshold IHFN β = 0.2 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.5 } ; then G is an IHF β -covering of X , and then
N ϰ 1 β = G 1 G 3 , N ϰ 2 β = G 1 G 2 G 3 , N ϰ 3 β = G 2 G 4 , N ϰ 4 β = G 2 G 3 G 4 , N ϰ 5 = G 3 G 4
computing LA and UA Φ M G β ̲ ( D ) ( ϰ i ) , Ψ M G β ̲ ( D ) ( ϰ i ) and Φ M G β ¯ ( A ˜ ) ( ϰ i ) , Ψ M G β ¯ ( D ) ( ϰ i )
Φ M G β ̲ ( D ) ( ϰ i ) = 0.1766949153 ϰ 1 + 0.1766949153 ϰ 2 + 0.1868644068 ϰ 3 + 0.1766949153 ϰ 4 + 0.1766949153 ϰ 5
and
Ψ M G β ̲ ( D ) ( ϰ i ) = 0.5 ϰ 1 + 0.5 ϰ 2 + 0.4 ϰ 3 + 0.4 ϰ 4 + 0.4 ϰ 5
Φ M G β ¯ ( D ) ( ϰ i ) = 0.5 ϰ 1 + 0.5 ϰ 2 + 0.4 ϰ 3 + 0.4 ϰ 4 + 0.4 ϰ 5
and
Ψ M x β ¯ ( D ) ( ϰ i ) = 0.1984463277 ϰ 1 + 0.1984463277 ϰ 2 + 0.2 ϰ 3 + 0.1984463277 ϰ 4 + 0.1984463277 ϰ 5
Now, compute the sum function M G β ¯ ( D ) ( ϰ i ) and M G β ̲ ( D ) ( ϰ i ) . Now, compute the ranking function function δ ( ϰ i ) :
δ = 0.2500000000 ϰ 1 + 0.2500000000 ϰ 2 + 0.2186864407 ϰ 3 + 0.2176694916 ϰ 4 + 0.2176694916 ϰ 5
Ultimately, we reveal the optimal ranking for all cars based on the values of the ranking function δ ( ϰ i ) ( i = 1 , 2 , 3 , 4 , 5 ) as follows:
ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
As a result, we conclude the decision-making process for optimal selection by applying multiple criteria decision making (MCDM) using CIHFRS models and incorporating an assessment of interval-valued hesitant fuzzy (IHF) data. Based on the numerical computations and outcomes, the ultimate optimal decision is to choose both the first and second cars. Furthermore, we leverage the model and methodology of MCDM by incorporating an assessment of IF data based on CIFRS models. This enhancement strengthens the selection process for cars within the MCDM framework, taking into account the assessment of IF data.
The respective weights of the attribute set are provided as follows: w ^ 1 = 0.4563199563 , w ^ 2 = 0.4150969151 , w ^ 3 = 0.2090395481 , and w ^ 4 = 0.06988806989 . In accordance with IF- P I S ¯ P ^ + and IF- N I S ̲ P ^ , as stated below,
P ^ + = { C 1 , 0.40 , 0.20 } , { C 2 , 0.37 , 0.25 } , { C 3 , 0.33 , 0.20 } , { C 4 , 0.40 , 0.23 }
P ^ = { C 1 , 0.23 , 0.33 } , { C 2 , 0.27 , 0.30 } , { C 3 , 0.33 , 0.27 } , { C 4 , 0.27 , 0.33 }
Next, find out the weighted distances τ D ^ = D ^ + and η D ^ = D ^ among the alternatives x i and IF- P I S ¯ P ^ + and IF- N I S ̲ P ^ , which are presented individually as follows:
τ D ^ + = D ^ + = 0.1489854627 ϰ 1 + 0.1393366093 ϰ 2 + 0.1456852307 ϰ 3 + 0.1338049412 ϰ 4 + 0.1323645236 ϰ 5
η D ^ = D ^ = 0.07517267269 ϰ 1 + 0.06637626263 ϰ 2 + 0.06301904178 ϰ 3 + 0.06609370736 ϰ 4 + 0.08660865413 ϰ 5
Suppose the threshold for consistency and consensus is assumed. IFN β = { 0.30 } , { 0.27 } , then G is an IF β covering of X .
N ϰ 1 β = G 1 G 3 , N ϰ 2 β = G 1 G 2 G 3 , N ϰ 3 β = G 2 G 4 , N ϰ 4 β = G 2 G 3 G 4 , N ϰ 5 β = G 1 G 3 G 4
Compute the lower and upper approximations τ M G β ̲ ( D ) ( ϰ i ) , η M G β ̲ ( D ) ( ϰ i ) and τ M G β ¯ ( A ˜ ) ( ϰ i ) , η M G β ¯ ( D ) ( ϰ i ) :
τ M G β ̲ ( D ) ( ϰ ) = 0.23 ϰ 1 + 0.25 ϰ 2 + 0.27 ϰ 3 + 0.20 ϰ 4 + 0.27 ϰ 5
η M G β ̲ ( D ) ( ϰ ) = 0.08660865413 ϰ 1 + 0.08660865413 ϰ 2 + 0.08660865413 ϰ 3 + 0.08660865413 ϰ 4 + 0.08660865413 ϰ 5
τ M G β ¯ ( D ) ( ϰ ) = 0.1323645236 ϰ 1 + 0.1323645236 ϰ 2 + 0.1323645236 ϰ 3 + 0.1323645236 ϰ 4 + 0.1323645236 ϰ 5
η M x β ¯ ( D ) ( ϰ ) = 0.06301904178 ϰ 1 + 0.06301904178 ϰ 2 + 0.06301904178 ϰ 3 + 0.06301904178 ϰ 4 + 0.06301904178 ϰ 5
Now, compute the sum function M G β ¯ ( D ) ( ϰ i ) and M G β ̲ ( D ) ( ϰ i ) :
M G β ̲ ( D ) + M G β ¯ ( D ) = { ϰ 1 , 0.3319206832 , 0.03044384043 } , { ϰ 2 , 0.3492733927 , 0.03309113090 } , { ϰ 3 , 0.3666261022 , 0.03573842137 } , { ϰ 4 , 0.3058916189 , 0.02647290472 } , { ϰ 5 , 0.3666261022 , 0.03573842137 }
Now, compute the ranking function δ ( ϰ i ) :
= 0.3014768428 ϰ 1 + 0.3161822618 ϰ 2 + 0.2701531975 ϰ 3 + 0.2701531975 ϰ 4 + 0.3308876808 ϰ 5
In the end, we unveil the optimal arrangement for categorizing all cars according to the criteria of the ranking function δ ( ϰ i ) ( i = 1 , 2 , 3 , 4 , 5 ) as follows:
ϰ 5 ϰ 2 ϰ 1 ϰ 3 ϰ 4
Therefore, the DM process for optimal selection is finalized by employing CIFRS model-based MCDM, which integrates the assessment of IF data. The quantitative computation outcomes indicate that the ultimate optimal decision identifies the fifth car. Subsequently, in the IHFS, the nonmembership component is terminated. Following this, the model and methodology of MCDM with HF information evaluation based on CHFRS models are applied to address car selection issues. This approach is designed to enhance problem solving within the MCDM framework, particularly in the context of HF information evaluation.
The weights for the attribute set are provided in the following order: W ^ 1 = 0.3191489362 , W ^ 2 = 0.2553191490 , W ^ 3 = 0.2127659574 , and W ^ 4 = 0.2127659574 . As per HF-PIS P+ and HF-NIS P, the following is indicated:
P + = { G 1 , { 0.1 , 0.2 , 0.4 } } , { G 2 , { 0.1 , 0.2 , 0.4 } } , { G 3 , { 0.1 , 0.2 , 0.4 } } , { G 4 , { 0.1 , 0.2 , 0.5 } }
P = { G 1 , { 0.2 , 0.5 , 0.5 } } , { G 2 , { 0.2 , 0.4 , 0.6 } } , { G 3 , { 0.2 , 0.3 , 0.6 } } , { G 4 , { 0.3 , 0.4 , 0.5 } }
Next, find out the weighted distances H ^ D ^ + = D ^ + and H ^ D ^ = D ^ among the alternatives x i and HF- P I S ¯ P ^ + and HF- N I S ̲ P ^ , which are specified as follows, respectively:
H ^ D + = D + = 0.1361702128 ϰ 1 + 0.2361702128 ϰ 2 + 0.1851063830 ϰ 3 + 0.2191489362 ϰ 4 + 0.3659574468 ϰ 5
H ^ D = D = 0.3638297873 ϰ 1 + 0.3638297873 ϰ 2 + 0.3638297873 ϰ 3 + 0.3638297873 ϰ 4 + 0.3638297873 ϰ 5
Assuming the consistency consensus threshold HFN β = { 0.2 , 0.3 , 0.4 } , then G is an HF β -covering of X . N ϰ 1 β = G 2 G 3 , N ϰ 2 β = G 1 G 4 , N ϰ 3 β = G 1 G 2 , N ϰ 4 β = G 2 G 4 , N ϰ 5 β = G 3 G 4 .
Compute the lower and upper approximations H ^ M G β ̲ ( D ) ( ϰ ) and H ^ M G β ¯ ( D ) ( ϰ ) :
H ^ M G β ̲ ( D ) ( ϰ ) = 0.9 ϰ 1 + 0.7 ϰ 2 + 0.9 ϰ 3 + 0.8 ϰ 4 + 0.9 ϰ 5
H ^ M G β ¯ ( D ) ( ϰ ) = 0.3638297873 ϰ 1 + 0.3638297873 ϰ 2 + 0.3638297873 ϰ 3 + 0.3638297873 ϰ 4 + 0.3638297873 ϰ 5
Now, compute the sum function H ^ M G β ̲ ( D ) and H ^ M G β ¯ ( D ) :
H ^ M G β ̲ ( D ) + H ^ M G β ¯ ( D ) = { ϰ 1 , 0.9363829784 , 0.3274468086 } , { ϰ 2 , 0.8091489359 , 0.2546808511 } , { ϰ 3 , 0.9363829784 , 0.3274468086 } , { ϰ 4 , 0.8727659572 , 0.2910638298 } , { ϰ 5 , 0.9363829784 , 0.3274468086 }
Now, compute the ranking function δ ( x i ) :
= 0.6319148935 x 1 + 0.5319148935 x 2 + 0.6319148935 x 3 + 0.5819148935 x 4 + 0.6319148935 x 5
Ultimately, we reveal the ideal classification for all cars based on the values derived from the ranking function δ ( x i ) ( i = 1 , 2 , , 5 ) as follows:
ϰ 1 ϰ 3 ϰ 5 ϰ 4 ϰ 2
Hence, we finalize the decision-making process for optimal selection through the application of CHFRS models in MCDM, incorporating the assessment of HF information. According to the numerical calculations, the ultimate optimal decision is to choose the first, third, and fifth cars.

5. Comparison Analysis

The proposed model offers improved handling of hesitation, improved approximation accuracy, and enhanced representation of uncertainty, which makes it a significant improvement over traditional fuzzy covering rough set models in decision making. Due to these advantages, it is an effective tool for complex decision-making situations where ambiguity and unpredictability are frequent. Also, the proposed model approach proposes a more comprehensive structure to deal with uncertainty and inaccuracy by integrating the advantages of hesitant and intuitionistic fuzzy sets. In order to demonstrate the accuracy and effectiveness of the proposed method, a comparative analysis is carried out using the approaches outlined by Huang et al. in CIFRS [30] and Zhou et al. in CHFRS [39], both of which represent specific cases within CIHFRS.

5.1. An Analysis Comparing the Current MCDM Method with CIFRS

A CIFRS may be seen as a particular instance of a CIHFRS, occurring when there is only one element present in both the m ˘ and n ˘ m ˘ degrees. To facilitate a comparison, transforming a CIHFRS to a CIFRS involves calculating the average values of m ˘ and n ˘ m ˘ degrees. Once converted, the intuitionistic information is presented in Table 5. Subsequently, the broad assessment values can be computed using TOPSIS within an IF environment. The final ranking of alternatives is χ 5 χ 2 χ 1 χ 3 χ 4 , and χ 5 is the desired alternative (in Table 6). Observably, the ranking being derived from the technique recommended by the outcome of the proposed technique contrasts with the CIFRS [30]. The primary objective is to take the average value of m ˘ and n ˘ m ˘ degrees of the IFRS, which may result in information falsification and loss. CIHFRSs prove to be more practical compared to CIFRSs as they account for situations in which decision makers prefer to employ a multitude of potential values for precisely articulating both m ˘ and n ˘ m ˘ degrees (in Table 7).

5.2. An Analytical Comparison between the Current MCDM Method and CHFRS

A CHFRS can also be measured as a specific instance of a CIHFRS when decision makers solely consider m ˘ degrees during assessment. To make a comparison, the CIHFRS can be transformed into a CHFRS by excluding n ˘ m ˘ degrees and taking only the m ˘ degrees. Hesitant information is depicted in Table 8, and the overall assessment values can be calculated using TOPSIS in a hesitant fuzzy environment. The conclusive ranking of alternatives is χ 1 χ 3 χ 5 χ 4 χ 2 , with χ 1 identified as the optimal alternative (in Table 9). Notably, the ranking derived from the approach advocated by the CHFRS [39] aligns with the results of our proposed technique, affirming the validity of our approach. Moreover, the remaining alternatives are not comparative, such as ϰ 2 and ϰ 3 or ϰ 4 and ϰ 5 (in Table 10).
Table 11 provides the ranking values for the preceding discussion. The advantages of our proposed approach, as outlined in the above comparative analysis, can be summarized. The IHFS is well suited for representing uncertain or fuzzy information in MCDM problems due to the availability of two sets of m ˘ and n ˘ m ˘ degrees with various possible values, a feature not achievable by the IFS and HFS. The IHFS can also be employed for processing MCDM and comparison methods based on its inherent capabilities. After minor modification of the IFS and HFS, the IHFS uses the general form of the IFS and HFS. Because it is capable of supporting many degrees of membership and nonmembership simultaneously, the intuitionistic hesitant fuzzy set is seen as superior to the intuitionistic fuzzy set and the hesitant fuzzy set alone. This enables a fuller and more complex representation of uncertainty and hesitancy. This results in enhanced decision-making procedures and more accurate and flexible modeling of complex problems.

6. Conclusions

The notion of the CIHFRS plays a vital role in order to deal with uncertainties in real-world scenarios (in Table 12). In this paper, we initiated the notion some novel CIHFRS models, namely, the IHF β -neighborhoods and the IHF complementary β -neighborhoods. We presented examples of these new notions and investigated some of their properties in detail. Particularly the rough and precision degrees of CIHFRS models were discussed in detail. The relationships among these models were also presented. Further, by means of the developed IHF β -neighborhoods and IHF complementary β -neighborhoods, we constructed four types of CIFRS models, and the relationship among these models was also discussed. Furthermore, we applied the proposed models to the MCDM problem under an IHF environment. The developed CIHFRS models not only enriched granular computing and CIHFRSs but also proposed a novel perspective for MCDM with IHF information. Moreover, we presented a numerical example for the application and effectiveness of the developed approach. Finally for the proposed approach, we compared it with existing studies. From this analysis, we found that the method developed in this paper is more effective to deal with an MCDM problem with IHF information based on CIHFRS models than an MCDM problem with the evaluation of IF and HF information based on CIFRS and CHFRS, respectively. In future, the developed approach will extend to the interval-valued intuitionistic hesitant fuzzy setting, Pythagorean hesitant fuzzy setting, and q-rung orthopair hesitant fuzzy setting.

Author Contributions

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

Funding

This research received no external funding.

Data Availability Statement

No data were used to support this work.

Acknowledgments

The authors A. Aloqaily and N. Mlaiki would like to thank Prince Sultan University for paying the publication fees for this work through TAS LAB.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

List of Symbols
m ˘ Degrees of membership
n ˘ m ˘ Degrees of nonmembership
XFinite universe set
m . Intuitionistic fuzzy numbers
i ^ Intuitionistic fuzzy set
H ^ Hesitant fuzzy set
Λ I H F S Intuitionistic hesitant fuzzy set
e ˙ Intuitionistic hesitant fuzzy numbers
N Neighborhood
ŞScore function
A ¯ Accuracy function
Minimum
Maximum

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Rahim, M.; Amin, F.; Shah, K.; Abdeljawad, T.; Ahmad, S. Some distance measures for pythagorean cubic fuzzy sets: Application selection in optimal treatment for depression and anxiety. MethodsX 2024, 12, 102678. [Google Scholar] [CrossRef] [PubMed]
  3. Saeed, M.; Ahsan, M.; Abdeljawad, T. A development of complex multi-fuzzy hypersoft set with application in MCDM based on entropy and similarity measure. IEEE Access 2021, 9, 60026–60042. [Google Scholar] [CrossRef]
  4. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Atanassov, K.; Gargov, G. Intuitionistic Fuzzy Logic; Springer: Cham, Switzerland, 1990; Volume 43, pp. 9–12. [Google Scholar]
  6. Atanassov, K.; Georgiev, C. Intuitionistic fuzzy prolog. Fuzzy Sets Syst. 1993, 53, 121–128. [Google Scholar] [CrossRef]
  7. Szmidt, E.; Kacprzyk, J. Intuitionistic fuzzy sets in group decision making. Notes IFS 1996, 2, 15–32. [Google Scholar]
  8. De, S.K.; Biswas, R.; Roy, A.R. An application of intuitionistic fuzzy sets in medical diagnosis. Fuzzy Sets Syst. 2001, 117, 209–213. [Google Scholar]
  9. Torra, V. Hesitant fuzzy sets. Int. J. Intel. Syst. 2010, 25, 529–539. [Google Scholar] [CrossRef]
  10. Xia, M.; Xu, Z.; Chen, N. Some hesitant fuzzy aggregation operators with their application in group decision making. Group Decis. Negot. 2013, 22, 259–279. [Google Scholar] [CrossRef]
  11. Xu, Z.; Zhang, X. Hesitant fuzzy multi-attribute decision making based on TOPSIS with incomplete weight information. Knowl.-Based Syst. 2013, 52, 53–64. [Google Scholar] [CrossRef]
  12. Yu, D.; Wu, Y.; Zhou, W. Multi-criteria decision making based on Choquet integral under hesitant fuzzy environment. J. Comput. Inf. Syst. 2011, 7, 4506–4513. [Google Scholar]
  13. Liu, J.; Sun, M. Generalized power average operator of hesitant fuzzy numbers and its application in multiple attribute decision making. J. Comput. Inf. Syst. 2013, 9, 3051–3058. [Google Scholar]
  14. Zhang, Z. Hesitant fuzzy power aggregation operators and their application to multiple attribute group decision making. Inf. Sci. 2013, 234, 150–181. [Google Scholar] [CrossRef]
  15. Peng, J.J.; Wang, J.Q.; Wu, X.H.; Zhang, H.Y.; Chen, X.H. The fuzzy cross-entropy for intuitionistic hesitant fuzzy sets and their application in multi-criteria decision-making. Int. Syst. Sci. 2015, 46, 2335–2350. [Google Scholar] [CrossRef]
  16. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  17. Pawlak, Z. Rough Sets: Theoretical Aspects Data Analysis; Kluwer Academic Publishers: Alphen aan den Rijn, The Netherlands, 1991. [Google Scholar]
  18. Dubois, D.; Prade, H. Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef]
  19. Som, T.; Castillo, O.; Tiwari, A.K.; Shreevastava, S. Fuzzy, Rough and Intuitionistic Fuzzy Set Approaches for Data Handling; Springer: Singapore, 2023. [Google Scholar]
  20. Li, T.J.; Zhang, W.X. Rough fuzzy approximation on two 967 universes of discourse. Inf. Sci. 2008, 178, 892–906. [Google Scholar] [CrossRef]
  21. Lin, G.; Qian, Y.; Li, J. NMGRS: Neighborhood-based multigranulation rough sets. Int. J. Approx. Reason. 2012, 53, 1080–1093. [Google Scholar] [CrossRef]
  22. Zhan, J.; Xu, W. Two types of coverings based multigranulation rough fuzzy sets and applications to decision making. Artif. Intell. Rev. 2020, 53, 167–198. [Google Scholar] [CrossRef]
  23. Liu, C.; Miao, D.; Qian, J. On multi-granulation covering rough sets. Int. J. Approx. Reason. 2014, 55, 1404–1418. [Google Scholar] [CrossRef]
  24. Chinram, R.; Hussain, A.; Mahmood, T.; Ali, M.I. EDAS method for multi-criteria group decision making based on intuitionistic fuzzy rough aggregation operators. IEEE Access 2021, 9, 10199–10216. [Google Scholar] [CrossRef]
  25. Hwang, C.L.; Yoon, K.S. Multiple Attibute Decision Methods and Applications; Springer: Berlin/Heidelberg, Germany, 1981. [Google Scholar]
  26. Lin, G.; Liang, J.; Qian, Y. Multigranulation rough sets: From partition to covering. Inf. Sci. 2013, 241, 101–118. [Google Scholar] [CrossRef]
  27. Zhang, K.; Zhan, J.; Wu, W.; Alcantud, J.C.R. Fuzzy β-covering based (I,T)-fuzzy rough set models and applications to multi-attribute decision-making. Comput. Ind. Eng. 2019, 128, 605–621. [Google Scholar] [CrossRef]
  28. Atanassov, K.T.; Pasi, G.; Yager, R.R. IF interpretations of multi-criteria multi-person and multi-measurement tool decision-making. Int. J. Syst. Sci. 2015, 36, 859–868. [Google Scholar] [CrossRef]
  29. Xu, Z.S. A deviation-based approach to IF multiple attribute group decision-making. Group Decis. Negot. 2010, 19, 57–76. [Google Scholar] [CrossRef]
  30. Huang, B.; Guo, C.X.; Li, H.X.; Feng, G.F.; Zhou, X.Z. An intuitionistic fuzzy graded covering rough set. Knowl.-Based Syst. 2016, 107, 155–178. [Google Scholar] [CrossRef]
  31. Torra, V.; Narukawa, Y. On hesitant fuzzy sets and decision. In Proceedings of the 2009 IEEE International Conference on Fuzzy Systems, Jeju Island, Republic of Korea, 20–24 August 2009; pp. 1378–1382. [Google Scholar]
  32. Xia, M.; Xu, Z. Hesitant fuzzy information aggregation in decision making. Int. J. Approx. 2011, 52, 395–407. [Google Scholar] [CrossRef]
  33. Xue, Z.; Sun, B.; Hou, H.; Pang, W.; Zhang, Y. Three-way decision models based on multi-granulation rough intuitionistic hesitant fuzzy sets. Cogn. Comput. 2022, 14, 1859–1880. [Google Scholar] [CrossRef]
  34. Wang, W.; Xin, X. Distance measure between intuitionistic fuzzy sets. Pattern Recognit. Lett. 2005, 26, 2063–2069. [Google Scholar] [CrossRef]
  35. Xu, Z.S.; Yager, R.R. Dynamic intuitionistic fuzzy multi-atribute decision-making. Int. J. Approx. Reason. 2008, 48, 246–252. [Google Scholar] [CrossRef]
  36. Szmidt, E.; Kacprzyk, J. Distances between intuitionistic fuzzy sets. Fuzzy Sets Syst. 2000, 114, 505–518. [Google Scholar] [CrossRef]
  37. Aruldoss, M.; Lakshmi, M.T.; Venkatesan, V.P. A survey on multi criteria decision making methods and its applications. Am. J. Inf. Syst. 2013, 1, 31–43. [Google Scholar]
  38. Velasquez, M.; Hester, P.T. An analysis of multi-criteria decision making methods. Int. J. Oper. 2013, 10, 56–66. [Google Scholar]
  39. Zhou, J.J.; Li, X.Y. Hesitant fuzzy β covering rough sets and applications in multi-attribute decision making. J. Intell. Fuzzy Syst. 2021, 41, 2387–2402. [Google Scholar] [CrossRef]
Table 1. Intuitionistic hesitant fuzzy β -covering matrix.
Table 1. Intuitionistic hesitant fuzzy β -covering matrix.
X / G G 1 G 2 G 3 G 4 G 5
ϰ 1 { 0.2 , 0.3 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.6 } , { 0.2 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } { 0.1 , 0.2 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.6 } , { 0.2 , 0.3 , 0.4 }
ϰ 2 { 0.1 , 0.3 , 0.5 } , { 0.1 , 0.2 , 0.5 } { 0.2 , 0.3 , 0.6 } , { 0.1 , 0.2 , 0.4 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } { 0.1 , 0.3 , 0.6 } , { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.4 } , { 0.1 , 0.2 , 0.3 }
ϰ 3 { 0.2 , 0.3 , 0.4 } , { 0.1 , 0.3 , 0.5 } { 0.1 , 0.2 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.2 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.5 } { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 }
ϰ 4 { 0.1 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.4 } { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 } { 0.3 , 0.4 , 0.5 } , { 0.3 , 0.4 } { 0.2 , 0.3 , 0.5 } , { 0.1 , 0.3 , 0.5 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 }
ϰ 5 { 0.2 , 0.3 , 0.4 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } { 0.2 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.5 } { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.2 , 0.5 }
Table 2. Intuitionistic hesitant fuzzy β -neighborhood matrix.
Table 2. Intuitionistic hesitant fuzzy β -neighborhood matrix.
N G β ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
ϰ 1 { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 }
ϰ 2 { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.1 , 0.3 , 0.6 } , { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.5 } , { 0.1 , 0.2 , 0.4 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.3 }
ϰ 3 { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.3 } { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.3 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 }
ϰ 4 { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 }
ϰ 5 { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.5 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 }
Table 3. Intuitionistic hesitant fuzzy complementary β -neighborhood matrix.
Table 3. Intuitionistic hesitant fuzzy complementary β -neighborhood matrix.
M ˜ G β ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
ϰ 1 { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.5 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.4 }
ϰ 2 { 0.1 , 0.3 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.6 } , { 0.1 , 0.2 , 0.4 } { . 1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.3 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 }
ϰ 3 { 0.1 , 0.3 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.5 } , { 0.1 , 0.2 , 0.4 } { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.4 }
ϰ 4 { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.3 } { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.4 , 0.4 } { 0.1 , 0.4 , 0.4 } , { 0.1 , 0.3 , 0.5 }
ϰ 5 { 0.1 , 0.4 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.4 , 0.4 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.5 } { 0.1 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 }
Table 4. The IHF β Covering.
Table 4. The IHF β Covering.
X / G G 1 G 2 G 3 G 4
ϰ 1 { 0.1 , 0.2 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.1 , 0.2 , 0.6 } , { 0.2 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.6 } , { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.5 } , { 0.1 , 0.3 , 0.4 }
ϰ 2 { 0.2 , 0.3 , 0.5 } , { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.4 } , { 0.2 , 0.3 } { 0.1 , 0.2 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.1 , 0.3 , 0.5 } , { 0.2 , 0.3 , 0.4 }
ϰ 3 { 0.1 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.5 } { 0.1 , 0.3 , 0.6 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.5 } { 0.1 , 0.2 , 0.5 } , { 0.1 , 0.2 , 0.4 }
ϰ 4 { 0.1 , 0.3 , 0.4 } , { 0.1 , 0.2 , 0.5 } { 0.2 , 0.4 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.4 } , { 0.1 , 0.2 , 0.3 } { 0.2 , 0.3 , 0.5 } , { 0.1 , 0.3 , 0.5 }
ϰ 5 { 0.3 , 0.5 , } , { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.5 } , { 0.1 , 0.3 , 0.4 } { 0.2 , 0.3 , 0.5 } , { 0.1 , 0.2 , 0.3 } { 0.3 , 0.4 , 0.5 } , { 0.2 , 0.3 , 0.5 }
Table 5. The IF β -covering.
Table 5. The IF β -covering.
X / G C 1 C 2 C 3 C 4
ϰ 1 { 0.23 } , { 0.20 } { 0.30 } , { 0.30 } { 0.30 } , { 0.23 } { 0.27 } , { 0.27 }
ϰ 2 { 0.33 } , { 0.23 } { 0.27 } , { 0.25 } { 0.23 } , { 0.20 } { 0.30 } , { 0.30 }
ϰ 3 { 0.33 } , { 0.33 } { 0.33 } , { 0.27 } { 0.27 } , { 0.27 } { 0.27 } , { 0.23 }
ϰ 4 { 0.27 } , { 0.27 } { 0.37 } , { 0.27 } { 0.23 } , { 0.20 } { 0.33 } , { 0.30 }
ϰ 5 { 0.40 } , { 0.27 } { 0.27 } , { 0.27 } { 0.33 } , { 0.20 } { 0.40 } , { 0.33 }
Table 6. The IF β -neighborhood.
Table 6. The IF β -neighborhood.
N G β ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
ϰ 1 { 0.23 } , { 0.23 } { 0.23 } , { 0.30 } { 0.27 } , { 0.30 } { 0.27 } , { 0.30 } { 0.23 } , { 0.27 }
ϰ 2 { 0.23 } , { 0.23 } { 0.23 } , { 0.25 } { 0.27 } , { 0.20 } { 0.23 } , { 0.20 } { 0.23 } , { 0.30 }
ϰ 3 { 0.27 } , { 0.33 } { 0.27 } , { 0.33 } { 0.27 } , { 0.27 } { 0.27 } , { 0.27 } { 0.27 } , { 0.33 }
ϰ 4 { 0.23 } , { 0.27 } { 0.23 } , { 0.27 } { 0.33 } , { 0.30 } { 0.23 } , { 0.30 } { 0.23 } , { 0.30 }
ϰ 5 { 0.33 } , { 0.27 } { 0.27 } , { 0.27 } { 0.27 } , { 0.33 } { 0.27 } , { 0.33 } { 0.33 } , { 0.33 }
Table 7. The IFC β -neighborhood.
Table 7. The IFC β -neighborhood.
M ˜ G β ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
ϰ 1 { 0.23 } , { 0.23 } { 0.23 } , { 0.23 } { 0.27 } , { 0.33 } { 0.23 } , { 0.27 } { 0.33 } , { 0.27 }
ϰ 2 { 0.23 } , { 0.30 } { 0.23 } , { 0.25 } { 0.27 } , { 0.33 } { 0.23 } , { 0.27 } { 0.27 } , { 0.27 }
ϰ 3 { 0.27 } , { 0.30 } { 0.27 } , { 0.20 } { 0.27 } , { 0.27 } { 0.33 } , { 0.30 } { 0.27 } , { 0.33 }
ϰ 4 { 0.27 } , { 0.30 } { 0.23 } , { 0.20 } { 0.27 } , { 0.27 } { 0.23 } , { 0.30 } { 0.27 } , { 0.33 }
ϰ 5 { 0.23 } , { 0.27 } { 0.23 } , { 0.30 } { 0.27 } , { 0.33 } { 0.23 } , { 0.30 } { 0.33 } , { 0.33 }
Table 8. The HF β -covering.
Table 8. The HF β -covering.
X / G G 1 G 2 G 3 G 4
ϰ 1 { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.6 } { 0.1 , 0.2 , 0.6 } { 0.1 , 0.2 , 0.5 }
ϰ 2 { 0.2 , 0.3 , 0.5 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.5 }
ϰ 3 { 0.1 , 0.4 , 0.5 } { 0.1 , 0.3 , 0.6 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.5 }
ϰ 4 { 0.1 , 0.3 , 0.4 } { 0.2 , 0.4 , 0.5 } { 0.1 , 0.2 , 0.4 } { 0.2 , 0.3 , 0.5 }
ϰ 5 { 0.3 , 0.5 } { 0.1 , 0.2 , 0.5 } { 0.2 , 0.3 , 0.5 } { 0.3 , 0.4 , 0.5 }
Table 9. The HF β -neighborhood.
Table 9. The HF β -neighborhood.
N G β ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
ϰ 1 { 0.1 , 0.2 , 0.6 } { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.5 } { 0.1 , 0.2 , 0.5 }
ϰ 2 { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.5 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.4 }
ϰ 3 { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.5 } { 0.1 , 0.3 , 0.5 } { 0.1 , 0.2 , 0.5 } { 0.1 , 0.2 , 0.2 }
ϰ 4 { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.4 } { 0.2 , 0.3 , 0.5 } { 0.1 , 0.2 , 0.4 }
ϰ 5 { 0.1 , 0.2 , 0.5 } { 0.3 , 0.4 , 0.5 } { 0.1 , 0.2 , 0.5 } { 0.1 , 0.2 , 0.5 } { 0.2 , 0.3 , 0.5 }
Table 10. The HFC β -neighborhood.
Table 10. The HFC β -neighborhood.
M ˜ G β ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
ϰ 1 { 0.1 , 0.2 , 0.6 } { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.5 }
ϰ 2 { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.5 } { 0.1 , 0.2 , 0.5 } { 0.1 , 0.3 , 0.4 } { 0.3 , 0.4 , 0.5 }
ϰ 3 { 0.1 , 0.2 , 0.4 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.3 , 0.5 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.5 }
ϰ 4 { 0.1 , 0.2 , 0.5 } { 0.1 , 0.3 , 0.4 } { 0.1 , 0.2 , 0.5 } { 0.2 , 0.3 , 0.5 } { 0.1 , 0.2 , 0.5 }
ϰ 5 { 0.1 , 0.2 , 0.5 } { 0.1 , 0.2 , 0.4 } { 0.1 , 0.2 , 0.2 } { 0.1 , 0.2 , 0.4 } { 0.2 , 0.3 , 0.5 }
Table 11. Analytical comparison with current methodologies.
Table 11. Analytical comparison with current methodologies.
MethodRanking
CIHFRS ϰ 1 ϰ 2 ϰ 3 ϰ 4 ϰ 5
CIFRS [30] ϰ 5 ϰ 2 ϰ 1 ϰ 3 ϰ 4
CHRF [39] ϰ 1 ϰ 3 ϰ 5 ϰ 4 ϰ 2
Table 12. Summary of the current research work on the CIFS, CHFR and CIHFRS.
Table 12. Summary of the current research work on the CIFS, CHFR and CIHFRS.
Research AreaObjectivesMethodologies
CIFS in MCDM
Optimization of flow systemsEvaluate and rank flow system configurationsAHP, TOPSIS, ANP
CFHS in MCDM
Risk assessmentEvaluate risks in controlled flow heat systemsFuzzy MCDM, risk analysis models
CIHFRS in MCDM
Integrated system optimizationOptimize combined heat and flow systemsHybrid MCDM models, integrated assessment
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Khan, M.K.; Kamran; Sajjad Ali Khan, M.; Aloqaily, A.; Mlaiki, N. Covering-Based Intuitionistic Hesitant Fuzzy Rough Set Models and Their Application to Decision-Making Problems. Symmetry 2024, 16, 693. https://doi.org/10.3390/sym16060693

AMA Style

Khan MK, Kamran, Sajjad Ali Khan M, Aloqaily A, Mlaiki N. Covering-Based Intuitionistic Hesitant Fuzzy Rough Set Models and Their Application to Decision-Making Problems. Symmetry. 2024; 16(6):693. https://doi.org/10.3390/sym16060693

Chicago/Turabian Style

Khan, Muhammad Kamraz, Kamran, Muhammad Sajjad Ali Khan, Ahmad Aloqaily, and Nabil Mlaiki. 2024. "Covering-Based Intuitionistic Hesitant Fuzzy Rough Set Models and Their Application to Decision-Making Problems" Symmetry 16, no. 6: 693. https://doi.org/10.3390/sym16060693

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