Next Article in Journal
Design of MIMO Antenna with Double L-Shaped Structure for 5G NR
Next Article in Special Issue
Prioritization of Thermal Energy Storage Techniques Using TOPSIS Method Based on Correlation Coefficient for Interval-Valued Intuitionistic Fuzzy Hypersoft Set
Previous Article in Journal
Prediction Model of a Generative Adversarial Network Using the Concept of Complex Picture Fuzzy Soft Information
Previous Article in Special Issue
Some Results on Submodules Using (μ,ν,ω)-Single-Valued Neutrosophic Environment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Optimization Strategy for MADM Framework with Confidence Level Aggregation Operators under Probabilistic Neutrosophic Hesitant Fuzzy Rough Environment

by
Muhammad Kamran
1,
Rashad Ismail
2,3,*,
Esmail Hassan Abdullatif Al-Sabri
2,3,*,
Nadeem Salamat
1,*,
Muhammad Farman
1,4 and
Shahzaib Ashraf
1
1
Institute of Mathematics, Khwaja Fareed University of Engineering & Information Technology, Rahim Yar Khan 64200, Punjab, Pakistan
2
Department of Mathematics, Faculty of Science and Arts, King Khalid University, Muhayl Assir 61913, Saudi Arabia
3
Department of Mathematics and Computer, Faculty of Science, Ibb University, Ibb 70270, Yemen
4
Department of Mathematics, Faculty of Arts and Sciences, Near East University, Near East Boulevard, Nicosia, 99138 Mersin, Turkey
*
Authors to whom correspondence should be addressed.
Symmetry 2023, 15(3), 578; https://doi.org/10.3390/sym15030578
Submission received: 26 January 2023 / Revised: 6 February 2023 / Accepted: 16 February 2023 / Published: 22 February 2023
(This article belongs to the Special Issue Recent Advances in Fuzzy Optimization Methods and Models)

Abstract

:
In this research, we first offer unique notions of averaging and geometric aggregation operators with confidence level by employing a probabilistic neutrosophic hesitant fuzzy rough framework. Then, we look into other descriptions of the suggested operators, such as idempotency, boundedness, and monotonicity. Additionally, for the derived operators, we establish the score and accuracy functions. We also provide a novel approach to assessing the selection procedure for smart medical devices (SMDs). The selection criteria for SMDs are quite complex, which is the most noteworthy feature of this investigation. It is suggested that these processes be simulated using a method utilizing a hesitant fuzzy set, a rough set, and a probabilistic single-valued neutrosophics set. The proposed approach is employed in the decision-making process, while taking into consideration the decision-makers’ (DMs’) level of confidence in the data they have obtained in order to deal with ambiguity, incomplete data, and uncertainty in lower and upper approximations. The major goal was to outline the issue’s complexities in order to pique interest among experts in the health care sector and encourage them to evaluate SMDs using various evaluation standards. The analysis of the technique’s outcomes demonstrated that the rankings and the results themselves were adequate and trustworthy. The effectiveness of our suggested improvements is also demonstrated through a symmetrical analysis. The symmetry behavior shows that the current techniques address more complex and advanced data.

1. Introduction

It is critical to remain vigilant for any unexpected changes in our bodies. This could manifest as a recurrent cough or even weight gain. Syndromes are typically nothing to worry about, but, on occasion, more testing may be necessary. The process of determining an illness’s nature and differentiating it from similar potential ailments is known as diagnosis. The English word “diagnosis” derives from the Greek word “gnosis,” which means knowledge. The early stages of the disease feature hazy symptoms. It is very challenging to make a correct diagnosis in this circumstance. For a judgement to be accurate, the medical background and risk factors for a certain condition must be taken into account.
The techniques described in [1,2] have been critical in managing information in practical situations. The frameworks in [3,4] only describe objects using membership degree (MD) and non-membership degree (NMD). Due to the occurrence of different forms of abstention and refusal circumstances, such as when voting or expressing one’s opinion, the information in many real-life difficulties cannot, however, be sufficiently characterized by merely MD and NMD. As a result, these intuitionistic fuzzy sets (IFSs) [5], Pythagorean fuzzy sets (PyFSs) [6], and q rung orthopair fuzzy sets (qROFSs) [7], either cannot entertain these types of phenomena or do so while suffering from significant information loss.
Cuong took four degrees, a MD, an abstention degree (AD), an NMD, and a refusal degree, to formalize picture FSs (PFSs) in order to describe a phenomenon with more accuracy and less information loss (RD) [8]. Even though PFSs could detect more information loss, MD, AD, and NMD still had limits, and, thus, decision-makers were unable to freely express their opinions [9]. In order to overcome these restrictions, Mahmood et al. extended the idea of PFSs into spherical FSs (SFSs) and, later, T-spherical FSs (TSFSs) [10,11]. This gave decision-makers the freedom to assign these MD, AD, and NMD according to their own preferences, without being constrained.
According to Zadeh [12], fuzzy sets (FSs) are an effective method that generalizes classical set theory (CST) [13], in which elements have an MD that belongs to [0, 1]. For FSs, operations and relations can be described similarly to CST [14]. Since their debut in 1965, FSs have been applied in a variety of contexts and fields. Artificial intelligence [15], medicine [16], statistics [17], medical diagnosis [18,19], and clustering [20,21] are a few fields in which FSs are used. Some researchers proposed aggregation operators (AOs), such as Fahmi et al. [22], who suggested cubic fuzzy Einstein AOs and their use in DM issues. Atanassov [5] designed an intuitionistic fuzzy set (IFS) with the structure of MD and NMD. The restriction that the sum (MD, NMD) belongs to [0, 1] is used by IFS. It has been noted that IFS is a very useful structure, that can offer a two-dimensional scenario in problem-solving situations. Many researchers created IFS methods and applications in various disciplines based on this idea [23,24,25]. Despite the fact that there are numerous theories for coping with unclear information and knowledge, they are only partially effective in resolving complex real-world challenges [26,27]. Smarandache [28] achieved that goal by fusing non-standard analysis and a tri-component set, which led to the development of neutrosophic set (NS) theory. A NS is composed of three membership functions: MD, indeterminacy membership degree (IMD), and NMD. Each function’s output is either a real standard subset or a non-standard subset of the nonstandard unit interval 0 , 1 + . Applications using NSs have been successful in the fields of cluster analysis and image processing [29,30].
Single-valued NS (SVNS) was proposed by Wang et al. [28] by condensing NSs. Alternatively, SVNSs can be considered an extension of intuitionistic fuzzy sets with three membership functions that are unrelated to one another and function values that are included in the unit closed interval [5]. A fresh, popular research issue is brought on by SVNSs [31,32,33].
The neutrosophic notion was applied to logics in [34], which are a generalization of fuzzy logics, and examined several essential aspects. Neutrosophic rough sets (NRSs) [35] are a new hybrid mathematical structure that handles incomplete and ambiguous information and studies specific operations and their properties through combined rough set (RS) theory [36]. Numerous forms of rough set models, including arbitrary binary relation-based rough sets, covering-based rough sets, and rough fuzzy sets, were produced using the constructive technique. The principle of probabilistic single-valued neutrosophic hesitant fuzzy set (PSV–NHFS), which is a generalization of SVN–HFSs, was defined by Shao et al. [37]. Li and Wang [38] developed an outclassing method based on hesitant probabilistic fuzzy sets (HPFS). Peng et al. [39] initiated probability multi-valued neutrosophic sets (PMVNSs) by taking into account multi-valued neutrosophic sets and probability distribution PSV–NHFSs, represented by multiple concurrently feasible values of MD, IMD, and NMD.
Rough sets, HPFS, and SVNSs are three alternate methods for handling false information. A hybrid model of SVNSs and rough sets is required to concurrently utilize the benefits of both. Numerous studies have concentrated on the approximate representation of each SVNS in the system, as well as the knowledge extension and reduction of the single-valued neutrosophic information system. To this end, we analyzed a general framework for the study of single-valued neutrosophic rough sets in the current research and proposed single-valued neutrosophic rough sets by fusing rough sets and HPFS. With axiomatic and proactive methods, we formally investigated the hybrid model.
Motivation and Novelty: Multiple criteria decision making (MCDM) is a crucial tool for solving more complex issues in the real world, as is well known [40,41,42]. There are numerous MCDM techniques that have been developed, based on various issues or beliefs. For instance, in [43,44], the difficulties posed by the MCDM problem’s numerous criteria and the decision-makers’ diverse risk preferences were discussed. A framework for choosing appropriate MCDA approaches for a certain decision circumstance was proposed in [45,46]. Numerous academics have recently used rough set models to study decision-making (DM) difficulties. For instance, Zhan et al. [47] used DM issues to apply a kind of soft rough model. An approach for DM problems using a certain kind of SVNRS model was presented in [48]. The majority of decision-making processes in real life are influenced by uncertainty. Therefore, a decision-making process is more reliable the more information it has. Despite the popularity of the aforementioned work, none of the aforementioned studies examined the confidence level of the qualities. In other words, every researcher who has looked into a study has done so under the presumption that the decision-makers were assumed to be familiar with the examined objects. However, these kinds of prerequisites are only partially met in real-world situations. Due to their experience with the evaluation, the decision-makers may choose to evaluate the alternative in terms of PSV–NHFRSs and their accompanying confidence levels. In order to evaluate the alternative using PSV–NHFRSs, the present study used the concept of confidence levels in the aggregation process. For this reason, we supplemented each valued neutrosophic hesitant fuzzy rough element with probability information. To put it more plainly, we analyzed confidence level, probability, and neutrosophy theories together. When faced with practical decision-making challenges, evaluation specialists are typically asked for two types of information: the performance of the assessment objects and knowledge of the evaluation areas (called confidence levels). All currently used methods only consider positive data and lack faith in the experts’ judgement. As a result, we built the encompassing CL–PSV–NHFRS decision information systems in accordance with the DM challenge characterizations. Then, under one of the PSV–NHFS covering rough set models, we provided a novel approach to DM problems. The proposed approach of decision-making was also compared with other approaches, which are shown in a comparison table. This work presents the theory of confidence level among the PSV–NHFS, keeping the benefits of this hybrid concept and highlighting the significance of aggregation operators. Additional geometric aggregation and averaging operators, based on PSV–NHFS confidence levels, are offered to combine different types of data. Some basic elements are still being discussed. These operators can describe the issues in the real world more precisely. We describe the basic properties of these operators in detail. We also define a CL–PSV–NHFS-based multi-criteria decision-making (MCDM) method. The usefulness and efficacy of the approach are illustrated using an example. Sadly, there are some flaws in these theories that affect how true or false they can be judged to be. The theory of PSV–NHFS uncertain rough sets with the addition of CL is significantly more flexible than the previous shortcomings, which can be used to overcome these restrictions. As a result, the decision-maker is free to select the grades without being constrained by the constraints of the current approaches. By modifying the physical meaning of reference parameters, this structure also classifies the issue. We recommend many new aggregation operators (AOs), including confidence level probabilistic SV–neutrosophic hesitant fuzzy rough (CL–PSV–NHFR) geometric (CL–PSV–NHFRG) and confidence level (CL) PSV–NHFR average (CL–PSV–NHFRA), for the following reasons:
1
The integrated concept of SVNS, HPFS, and RS allows PSV–NHFRS to give decision-makers additional latitude.
2
In contrast to SVNRS, PSV–NHFRS take advantage of upper and lower approximation spaces.
3
SV–NWA and SV–NWG aggregation operators lack the ability to incorporate experts’ levels of familiarity with examined items for initial assessment, but CL–PSV-=NHFRA and CL–PSV–NHFRG AOs can do so.
4
Due to the simplicity of the CL–PSV–NHFRA and CL–PSV–NHFRG operators, and the fact that they cover the decision-making technique, this article aimed to address more complex and advanced data.
5
The performance of the assessment objects and knowledge of the evaluation fields are two forms of information that are frequently requested from evaluation specialists in practical decision-making difficulties (called confidence levels). All existing techniques rely solely on positive information and the experts’ lack of confidence in their judgments.
6
The suggested work addresses all existing flaws.
Consequently, the outcomes of this research are as follows:
1
To undertake the development of new AOs like CL–PSV–NHFRA and CL–PSV–NHFRG.
2
To present traits for the recommended aggregating operations.
3
To create a method called multi-criteria decision-making (MCDM) to deal with the increasingly complex data.
4
A PSV–NHFRS-based cardiac imaging modality, based on machine learning, has also been demonstrated, and a real-world application of the algorithm is given.
This article follows the format listed below. The core concepts underlying FS, NS, RS, SVNRS, and a few basic operational laws are examined in Section 2. In Section 3, we present novel aggregation operators, such as CL–PSV–NHFRWA and CL–PSV–NHFROWA. In Section 4, we present brand-new aggregation operators like CL–PSV–NHFRWG and CL–PSV–NHFROWG. A decision-making strategy based on the suggested AOs is constructed in Section 5 along with a solution to a numerical problem and numerical illustrations. In Section 6, we contrast some of the present practises with the recommended ones. In Section 7, we come to a conclusion.

2. Preliminaries

The fundamental concepts for NSs, SVNSs, SV–NRSs, scoring functions (SF), and accuracy functions (AF) are covered in this section.
Definition 1.
Addressing a certain set δ. A FS [12] Z in δ is presented as
Z = , Γ Z | δ ,
for each δ , the MD Γ Z : δ δ specifies the degree to which the element Z , where Γ Z 0 , 1 .
Definition 2.
Addressing a certain set δ. An IFS [5] A in δ is presented as
A = , Γ , | δ ,
for each δ , Γ is the MD and ∇ is the NMD to the IFS A , respectively, where ( Γ , ) 0 , 1 be the unit interval. Moreover, it is required that 0 ( Γ + ) 1 , for each δ .
Definition 3.
Addressing a certain set δ and Υ δ . A NS [28]♭ in δ is denoted as MD Γ ( Υ ) , an IMD ( Υ ) and a NMD ( Υ ) . Γ ( Υ ) , ( Υ ) and ( Υ ) are real standard and non-standard subset of 0 , 1 + and
Γ ( Υ ) , ( Υ ) , ( Υ ) : δ 0 , 1 +
The representation of neutrosophic set (NS)is mathematically defined as:
= { Υ , Γ ( Υ ) , ( Υ ) , ( Υ ) ) | Υ δ } ,
where
0 < Γ ( Υ ) + ( Υ ) + ( Υ ) 3 + .
The real standard or non-standard 0 , 1 + subsets are assumed to have value in the neutrosophic set from a logical perspective. For technological applications, one must, therefore, employ the interval [ 0 , 1 ] , rather than 0 , 1 + , because 0 , 1 + is challenging to apply in operating systems, due to engineering and scientific difficulties. The idea of a single-valued neutrosipic set that lies in the range [ 0 , 1 ] is then discussed.
Definition 4.
(See [49]). Addressing a certain set δ and Υ δ . A SV-NS ♭ in δ is defined as MD Γ ( Υ ) , an IMD ( Υ ) and a NMD ( Υ ) .
Γ ( Υ ) , ( Υ ) and ( Υ ) are real standard and non-standard subset of 0 , 1 , and
Γ ( Υ ) , ( Υ ) , ( Υ ) : δ 0 , 1 .
The representation of SVNS ♭ is mathematically defined as:
= { Υ , Γ ( Υ ) , ( Υ ) , ( Υ ) ) | Υ δ } ,
where
0 < Γ ( Υ ) + ( Υ ) + ( Υ ) 3 .
Definition 5.
([50]). Let F is a fixed set. The mathematically representation Probabilistic HF set (PHFS) Γ is defined as:
= , Γ ( ) / Λ ( ) | F
where Γ ( ) is a subset of [ 0 , 1 ] , and Γ ( ) / Λ shows a MD of the element F to the set Γ. And Λ shows the possibilities with the property that = 1 s Λ = 1 .
Definition 6.
([51]). For a fixed set Y , the S V N H F S F is mathematically represented as follows:
F = { , Γ F ( ) , F ( ) , F ( ) | Y } ,
where Γ F ( ) , F ( ) and F ( ) are sets of some values in 0 , 1 , called the MD, IMD and NMD sequentially that must be satisfied the following properties:
Y , μ F ( ) Γ F ( ) , λ F ( ) Γ F ( ) ,
and
ν F ( ) F ( ) with max Γ F ( ) + min F ( ) + min F ( ) 3 ,
and
min Γ F ( ) + min F ( ) + max F ( ) 3 .
For simplicity, we use a pair F = ( Γ F , F , F ) to mean S V N H F S .
Definition 7.
Let F be a fixed set, the mathematical representation of SV–neutrosophic PHFS (SV–NPHFS) [52], N is as,
N = { , Γ N ( ) / ( ) , N ( ) / Λ ( ) , N ( ) / Ξ ( ) | F } ,
where
Γ N ( ) / ( ) , N ( ) / Λ ( ) , N ( ) / Ξ ( ) [ 0 , 1 ] ,
and Γ N ( ) / ( ) , N ( ) / Λ ( ) , N ( ) / Ξ ( ) shows a MD, IMD and NMD respectively of the element F to the set N . And ( ) , Λ ( ) , Ξ ( ) shows the possibilities with the property that
= 1 s = 1 , = 1 s Λ = 1 and = 1 s Ξ = 1 .
Definition 8.
(See [53]). Assume η is a universal set and ℏ is relation on η . A set valued mapping is defined as
* : η M ( η ) by * ( ρ ) = { a η | ( ρ , a ) } ,
for ρ η where * ( ρ ) is referred to as the element’s ρ successor neighborhood in connection to relation . The pair η , is called (crisp) space of resemblance. Now for any set κ η , the lower approximation (LA) and upper approximation (UA) of κ with respect to space of resemblance η , is defined as:
̲ ( κ ) = { ρ η | * ( ρ ) κ } ; ¯ ( κ ) = { ρ η | * ( ρ ) κ ϕ } .
The pair ̲ ( κ ) , ¯ ( κ ) is called fuzzy RS where both ̲ ( κ ) , ¯ ( κ ) : M ( η ) M ( η ) are upper and lower approximation operators.
Definition 9.
(See [54]). Assume universal set U ¨ and let ϱ S V N H F R S ( U ¨ × U ¨ ) be S V N F relation. Then
(i) ϱ is reflexive if
Γ ϱ ( , ) = 1 , ϱ ( , ) = 1 and ϱ ( , ) = 1 , U ¨ ;
(ii) ϱ is symmetric if
( , Γ ) ( U ¨ × U ¨ ) , Γ ϱ ( , Γ ) = Γ ϱ ( Γ , ) , ϱ ( , Γ ) = ϱ ( Γ , ) and ϱ ( , Γ ) = ϱ ( Γ , ) ;
(iii) ϱ is transitive if ( , t ) ( U ¨ × U ¨ ) ,
Γ ϱ ( Γ , t ) U ¨ [ Γ ϱ ( Γ , ) Γ ϱ ( , t ) ] , ϱ ( Γ , t ) = U ¨ [ ϱ ( Γ , ) ϱ ( , t ) ] ,
and
ϱ ( Γ , t ) = U ¨ [ ϱ ( Γ , ) ϱ ( , t ) ] .
Definition 10.
Assume universal set U ¨ and let ϱ S V N H F R S ( U ¨ × U ¨ ) is a S V N F relation. the pair ( U ¨ , ϱ ) represent a S V N F space of resemblance. Assume ℓ is any subset of S V N S ( U ¨ ) i.e S V N S ( U ¨ ) . Then on the bases of S V N F approximation space ( U ¨ , ϱ ) , then the lower and upper approximations of ℓ are represented as ϱ ¯ ( ) and ϱ ̲ ( ) given as following:
ϱ ¯ ( ) = { , Γ ϱ ¯ ( ) ( ) , ϱ ¯ ( ) ( ) , ϱ ¯ ( ) ( ) | U ¨ } ,
ϱ ̲ ( ) = { , Γ ϱ ̲ ( ) ( ) , ϱ ̲ ( ) ( ) , ϱ ̲ ( ) ( ) | U ¨ } ,
where
Γ ϱ ¯ ( ) ( ) = t U ¨ [ Γ ϱ ( , t ) Γ ϱ ( t ) ] , ϱ ¯ ( ) ( ) = t U ¨ [ ϱ ( , t ) ϱ ( t ) ] , ϱ ¯ ( ) ( ) = t U ¨ [ ϱ ( , t ) ϱ ( t ) ] , Γ ϱ ̲ ( ) ( ) = t U ¨ [ Γ ϱ ( , t ) Γ ϱ ( t ) ] , ϱ ̲ ( ) ( ) = t U ¨ [ ϱ ( , t ) ϱ ( t ) ] , ϱ ̲ ( ) ( ) = t U ¨ [ ϱ ( , t ) ϱ ( t ) ] .
such that
0 < Γ ϱ ¯ ( ) ( ) + ϱ ¯ ( ) ( ) + ϱ ¯ ( ) ( ) 3 ,
and
0 < Γ ϱ ̲ ( ) ( ) + ϱ ̲ ( ) ( ) + ϱ ̲ ( ) ( ) 3 .
As ϱ ̲ ( ) and ϱ ¯ ( ) are S V N F S s , so ϱ ¯ ( ) , ϱ ̲ ( ) : S V N F S ( U ¨ ) S V N F S ( U ¨ ) are LA and UA operators. So the pair
ϱ ( ) = ( ϱ ̲ ( ) , ϱ ¯ ( ) ) = { , ( Γ ϱ ̲ ( ) ( ) , ϱ ̲ ( ) ( ) , ϱ ̲ ( ) ( ) ) , ( Γ ϱ ¯ ( ) ( ) , ϱ ¯ ( ) ( ) , ϱ ¯ ( ) ( ) ) | U ¨ }
is called S V N F rough set. For simplicity it can be denoted as
ϱ ( ) = ( ϱ ̲ ( ) , ϱ ¯ ( ) ) = ( ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) )
are known as S V N F rough number ( S V N F R N ).
Definition 11.
Let F = { ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) } be a PSV-neutrosophic rough number (PSV-NHFRN). Then, SF and AF are describe as:
S c = 1 6 3 + Γ ̲ / Ξ ̲ + Γ ¯ / Ξ ¯ ̲ / Λ ̲ ¯ / Λ ¯ ̲ / ̲ ¯ / ¯ , S [ 0 , 1 ] A c = 1 6 3 + Γ ̲ / Ξ ̲ + Γ ¯ / Ξ ¯ + ̲ / Λ ̲ + ¯ / Λ ¯ ̲ / ̲ + ¯ / ¯ , A [ 0 , 1 ] .
Definition 12.
For two PSV-NHFRNs
= Γ ̲ 1 / Ξ ̲ 1 , ̲ 1 / Λ ̲ 1 / Λ ̲ 1 , ̲ 1 / ̲ 1 , Γ ¯ 1 / Ξ ¯ 1 , ¯ 1 / Λ ¯ 1 , ¯ 1 / ¯ 1
and
Y = Γ ̲ 2 / Ξ ̲ 2 , ̲ 2 / Λ ̲ 2 , ̲ 2 / ̲ 2 , Γ ¯ 2 / Ξ ¯ 2 , ¯ 2 / Λ ¯ 2 , ¯ 2 / ¯ 2 ,
The outcomes are as follows:
1
If S ( ) > S ( Y ) then > Y ,
2
If S ( A ) < S ( B ) then < Y ,
3
If S ( A ) = S ( B ) then,
i
If A ( ) > A ( Y ) then > Y ,
ii
If A ( ) < A ( Y ) then < Y ,
iii
If A ( ) = A ( Y ) then = Y .

3. CL–Probabilistic Single-Valued—Neutrosophic Hesitant Fuzzy Rough (CL–PSV-NHFR) Aggregation Operators

Here, we first talk about CI–PSV–NHFRWA AOs. We also go over the fundamental characteristics of the operators.

CL–PSV–NHFR Weighted Average (CI-PSV-NHFRWA) Aggregation Operators

We first discuss CL–PSVNHFR weighted average (CI–PSVNHFRWA) AO.
Definition 13.
Let α = ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) ) , = 1 , 2 , , n be a collection of PSV–NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 , δ n ) T be the weight vectors for PSV–NHFRNs with the condition = 1 n δ = 1 . Then, the mapping C L P S V N H F R W A : F n F operator is given as C L P S V N H F R W A
( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = = 1 n δ ζ α = δ 1 ζ 1 α 1 δ 2 ζ 2 α 2 δ 3 ζ 3 α 3 δ n ζ n α n .
It is called the CL–PSV–NHFRWA operator.
Theorem 1.
Let α = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ , Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ , = 1 , 2 , , n be a collection of PSV–NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 , δ n ) T be the weight vectors for PSV–NHFRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 . Then C L P S V N H F R W A
( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ , = 1 n ̲ / Λ ̲ ζ δ , = 1 n ̲ / ̲ ζ δ 1 = 1 n 1 Γ ¯ / Ξ ¯ ζ δ , = 1 n ¯ / Λ ¯ ζ δ , = 1 n ¯ / ¯ ζ δ
 Proof. 
For n = 2, we have
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) = δ 1 ζ 1 α 1 δ 2 ζ 2 α 2 .
By using the operational laws for PSV-NHFRNs, we get
ζ 1 α 1 = 1 1 Γ ̲ 1 / Ξ ̲ 1 ζ 1 , ̲ 1 / Λ ̲ 1 ζ 1 , ̲ 1 / ̲ 1 ζ 1 , 1 1 Γ ¯ 1 / Ξ ¯ 1 ζ 1 , ¯ 1 / Λ ¯ 1 ζ 1 , ¯ 1 / ¯ 1 ζ 1 = Υ ̲ 1 , Γ ̲ 1 , Θ ̲ 1 , Υ ¯ 1 , Γ ¯ 1 , Θ ¯ 1 .
Then
δ 1 ζ 1 α 1 = 1 1 Υ ̲ 1 ζ 1 , Γ ̲ 1 ζ 1 , Θ ̲ 1 ζ 1 , 1 1 Υ ¯ 1 ζ 1 , Γ ¯ 1 ζ 1 , Θ ¯ 1 ζ 1 = 1 1 1 1 Γ ̲ 1 / Ξ ̲ 1 ζ 1 δ 1 , ̲ 1 / Λ ̲ 1 ζ 1 δ 1 , ̲ 1 / ̲ 1 ζ 1 δ 1 , 1 1 1 1 Γ ¯ 1 / Ξ ¯ 1 ζ 1 δ 1 , ¯ 1 / Λ ¯ 1 ζ 1 δ 1 , ¯ 1 / ¯ 1 ζ 1 δ 1 = 1 1 Γ ̲ 1 / Ξ ̲ 1 ζ 1 δ 1 , ̲ 1 / Λ ̲ 1 δ 1 ζ 1 , ̲ 1 / ̲ 1 δ 1 ζ 1 , 1 1 Γ ¯ 1 / Ξ ¯ 1 ζ 1 δ 1 , ¯ 1 / Λ ¯ 1 δ 1 ζ 1 , ¯ 1 / ¯ 1 δ 1 ζ 1 .
Similarly, we can see that
ζ 2 α 2 = 1 1 Γ ̲ 2 / Ξ ̲ 2 ζ 2 δ 2 , ̲ 2 / Λ ̲ 2 δ 2 ζ 2 , ̲ 2 / ̲ 2 δ 2 ζ 2 , 1 1 Γ ¯ 2 / Ξ ¯ 2 ζ 2 δ 2 , ¯ 2 / Λ ¯ 2 δ 2 ζ 2 , ¯ 2 / ¯ 2 δ 2 ζ 2 .
Then,
C L P S V N H F R W A = ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) = δ 1 ζ 1 α 1 δ 2 ζ 2 α 2 = 1 1 Γ ̲ 1 / Ξ ̲ 1 ζ 1 δ 1 + 1 1 Γ ̲ 2 / Ξ ̲ 2 ζ 2 δ 2 1 1 Γ ̲ 1 / Ξ ̲ 1 ζ 1 δ 1 1 1 Γ ̲ 2 / Ξ ̲ 2 ζ 2 δ 2 , ̲ 1 / Λ ̲ 1 δ 1 ζ 1 ̲ 2 / Λ ̲ 2 δ 2 ζ 2 , ̲ 1 / ̲ 1 δ 1 ζ 1 ̲ 2 / ̲ 2 δ 2 ζ 2 , 1 1 Γ ¯ 1 / Ξ ¯ 1 ζ 1 δ 1 + 1 1 Γ ¯ 2 / Ξ ¯ 2 ζ 2 δ 2 1 1 Γ ¯ 1 / Ξ ¯ 1 ζ 1 δ 1 1 1 Γ ¯ 2 / Ξ ¯ 2 ζ 2 δ 2 , ¯ 1 / Λ ¯ 1 δ 1 ζ 1 ¯ 2 / Λ ¯ 2 δ 2 ζ 2 , ¯ 1 / ¯ 1 δ 1 ζ 1 ¯ 2 / ¯ 2 δ 2 ζ 2
Thus,
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) = 1 = 1 2 1 Γ ̲ / Ξ ̲ ζ δ , = 1 2 ̲ / Λ ̲ δ ζ ζ δ , = 1 2 ̲ / ̲ δ ζ ζ δ , 1 = 1 2 1 Γ ¯ / Ξ ¯ ζ δ , = 1 2 ¯ / Λ ¯ ζ δ , = 1 2 ¯ / ¯ ζ δ
Suppose that the result is valid for n = , that is
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α , ζ ) = 1 = 1 1 Γ ̲ / Ξ ̲ ζ δ , = 1 ̲ / Λ ̲ δ ζ ζ δ , = 1 ̲ / ̲ δ ζ ζ δ , 1 = 1 1 Γ ¯ / Ξ ¯ ζ δ , = 1 ¯ / Λ ¯ ζ δ , = 1 ¯ / ¯ ζ δ
Then, for n = + 1 , we get
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α , ζ ) , ( α + 1 , ζ + 1 ) = 1 = 1 1 Γ ̲ / Ξ ̲ ζ δ , = 1 ̲ / Λ ̲ ζ δ , = 1 ̲ / Λ ̲ ζ δ , 1 = 1 1 Γ ¯ / Ξ ¯ ζ δ , = 1 ¯ / Λ ¯ ζ δ , = 1 ¯ / Λ ¯ ζ δ 1 1 Γ ̲ + 1 / Ξ ̲ + 1 ζ + 1 δ + 1 , ̲ + 1 / Λ ̲ + 1 δ + 1 ζ + 1 , ̲ / ̲ + 1 δ + 1 ζ + 1 , 1 1 Γ ¯ + 1 / Ξ ¯ + 1 ζ + 1 δ + 1 , ¯ + 1 / Λ ¯ + 1 δ + 1 ζ + 1 , ¯ + 1 / ¯ + 1 δ + 1 ζ + 1 = 1 = 1 1 Γ ̲ / Ξ ̲ ζ δ + 1 1 Γ ̲ / Ξ ̲ ζ + 1 δ + 1 1 = 1 1 Γ ̲ / Ξ ̲ ζ δ 1 1 Γ ̲ / Ξ ̲ ζ + 1 δ + 1 , = 1 ̲ / Λ ̲ ζ δ , ̲ / Λ ̲ + 1 δ + 1 ζ + 1 , = 1 ̲ / ̲ ζ δ , ̲ / ̲ + 1 δ + 1 ζ + 1 , 1 = 1 1 Γ ¯ / Ξ ¯ ζ δ + 1 1 Γ ¯ / Ξ ¯ + 1 ζ + 1 δ + 1 1 = 1 1 Γ ¯ / Ξ ¯ ζ δ 1 1 Γ ¯ / Ξ ¯ + 1 ζ + 1 δ + 1 , = 1 ¯ / Λ ¯ ζ δ , ¯ / Λ ¯ + 1 δ + 1 ζ + 1 , = 1 ¯ / Λ ¯ ζ δ , ¯ / Λ ¯ + 1 δ + 1 ζ + 1 = 1 = 1 + 1 1 Γ ̲ / Ξ ̲ ζ δ , = 1 + 1 ̲ / Λ ̲ ζ δ , = 1 + 1 ̲ / ̲ ζ δ , 1 = 1 + 1 1 Γ ¯ / Ξ ¯ ζ δ , = 1 + 1 ¯ / Λ ¯ ζ δ , = 1 + 1 ¯ / ¯ ζ δ
Hence, the result is valid for n = + 1 . Therefore, the result is valid for any number of PSV–NHFRNs. □
For the collection of PSV–NHFRNs α = ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) ) where = 1 , 2 , , n and ζ is the CL of α with 0 ζ 1 and Ξ , Λ , are the probabilities with condition n Ξ = 1 , n Λ = 1 , n = 1 .
Let δ = ( δ 1 , δ 2 , δ 3 , δ n ) T is the weight vectors for PSV–NHFRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 .
Then CI–PSV–NHFRWA AOs have the following properties:
1. Idempotency
If for all ( α , ζ ) = ( α , ζ ) , i.e., Γ / Ξ = { Γ ̲ / Ξ ̲ , Γ ¯ / Ξ ¯ } ,   / Λ = { ̲ / Λ ̲ , ¯ / Λ ¯ } ,
/ = { ̲ / ̲ , ¯ / ¯ } , ζ = ζ , then
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = ζ α
 Proof. 
If ( α , ζ ) = ( α , ζ ) , then by using Theorem 1, we get
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ , = 1 n ̲ / Λ ̲ ζ δ , = 1 n ̲ / ̲ ζ δ , 1 = 1 n 1 Γ ¯ / Ξ ¯ ζ δ , = 1 n ¯ / Λ ¯ ζ δ , = 1 n ¯ / ¯ ζ δ = 1 1 Γ ̲ / Ξ ̲ ζ = 1 n δ , ̲ / Λ ̲ ζ = 1 n δ , ̲ / ̲ ζ = 1 n δ , 1 1 Γ ¯ / Ξ ¯ ζ = 1 n δ , ¯ / Λ ¯ ζ = 1 n δ , ¯ / Λ ¯ ζ = 1 n δ = 1 1 Γ ̲ / Ξ ̲ ζ , ̲ / Λ ̲ ζ , ̲ / ̲ ζ , 1 1 Γ ¯ / Ξ ¯ ζ , ¯ / Λ ¯ ζ , ¯ / Λ ¯ ζ = ζ α .
2. Boundedness
Let
α = min Γ ̲ / Ξ ̲ , min ̲ / Λ ̲ , min ̲ / ̲ , max Γ ¯ / Ξ ¯ , max ¯ / Λ ¯ , max ¯ / Λ ¯ , and
α + = max Γ ̲ / Ξ ̲ , max ̲ / Λ ̲ , max ̲ / ̲ , min Γ ¯ / Ξ ¯ , min ¯ / Λ ¯ , min ¯ / ¯ .
Then, for all δ , we have
α C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) α + .
For every ,
min ( Γ ̲ / Ξ ̲ ) Γ ̲ / Ξ ̲ max ( Γ ̲ / Ξ ̲ ) 1 max ( Γ ̲ / Ξ ̲ ) 1 Γ ̲ / Ξ ̲ 1 min ( Γ ̲ / Ξ ̲ )
 Proof. 
Now for every δ , we get
= 1 n 1 max Γ ̲ / Ξ ̲ max ζ δ = 1 n 1 Γ ̲ / Ξ ̲ ζ δ = 1 n 1 min Γ ̲ / Ξ ̲ min ζ δ 1 max Γ ̲ / Ξ ̲ max ζ = 1 n δ = 1 n 1 Γ ̲ / Ξ ̲ ζ δ 1 min Γ ̲ / Ξ ̲ min ζ = 1 n δ 1 1 min Γ ̲ / Ξ ̲ min ζ 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ 1 1 max Γ ̲ / Ξ ̲ max ζ δ Γ ̲ / Ξ ̲ 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ Γ ̲ / Ξ ̲ .
Similarly, for every ,
min ( Γ ¯ / Ξ ¯ ) Γ ¯ / Ξ ¯ max ( Γ ¯ / Ξ ¯ ) 1 max ( Γ ¯ / Ξ ¯ ) 1 Γ ¯ / Ξ ¯ 1 min ( Γ ¯ / Ξ ¯ ) .
Now for every δ , we obtain
= 1 n 1 max Γ ¯ / Ξ ¯ max ζ δ = 1 n 1 Γ ¯ / Ξ ¯ ζ δ = 1 n 1 min Γ ¯ / Ξ ¯ min ζ δ 1 max Γ ¯ / Ξ ¯ max ζ = 1 n δ = 1 n 1 Γ ζ δ 1 min Γ ¯ / Ξ ¯ min ζ = 1 n δ 1 1 min Γ min ζ 1 = 1 n 1 Γ ζ δ 1 1 max Γ max ζ δ Γ α ζ min 1 = 1 n 1 Γ ζ δ Γ α ζ max . .
Similarly,
min ( ̲ / Λ ̲ ) ̲ / Λ ̲ max ( ̲ / Λ ̲ ) min ( ̲ / Λ ̲ ) min ζ = 1 n ̲ / Λ ̲ ζ δ max ( ̲ / Λ ̲ ) max ζ ̲ / Λ ̲ min α ζ = 1 n ̲ / Λ ̲ ζ δ ̲ / Λ ̲ max α ζ
and
min ¯ / Λ ¯ ¯ / Λ ¯ max ¯ / Λ ¯ min ( ¯ / Λ ¯ ) min ζ = 1 n ¯ / Λ ¯ ζ δ max ( ¯ / Λ ¯ ) max ζ ¯ / Λ ¯ min α ζ = 1 n ¯ / Λ ¯ ζ δ ¯ / Λ ¯ max α ζ .
Also,
min ( ̲ / ̲ ) ̲ / ̲ max ( ̲ / ̲ ) min ( ̲ / ̲ ) min ζ = 1 n ̲ / ̲ ζ δ max ( ̲ / ̲ ) max ζ ̲ / ̲ min α ζ = 1 n ̲ / ̲ ζ δ ̲ / ̲ max α ζ
and
min ¯ / ¯ ¯ / ¯ max ¯ / ¯ min ( ¯ / ¯ ) min ζ = 1 n ¯ / ¯ ζ δ max ( ¯ / ¯ ) max ζ ¯ / ¯ min α ζ = 1 n ¯ / ¯ ζ δ ¯ / ¯ max α ζ .
If
C L S V N R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = α = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ , Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ,
then from the above analysis, we obtain
Γ ̲ / Ξ ̲ Γ ̲ / Ξ ̲ Γ ̲ / Ξ ̲ , Γ ¯ / Ξ ¯ min α ζ Γ ¯ / Ξ ¯ α ζ Γ ¯ / Ξ ¯ max α ζ , ̲ / Λ ̲ min α ζ ̲ / Λ ̲ α ζ ̲ / Λ ̲ max α ζ , ¯ / Λ ¯ min α ζ ¯ / Λ ¯ α ζ ¯ / Λ ¯ max α ζ , ̲ / ̲ min α ζ ̲ / ̲ α ζ ̲ / ̲ max α ζ , ¯ / ¯ min α ζ ¯ / ¯ α ζ ¯ / ¯ max α ζ .
Then, by using the definition of SF, we can conclude that
α C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) α +
3. Monotonicity
Let
α * = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α * , ̲ / ̲ α * , Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α * , ¯ / ¯ α * = 1 , 2 , 3 , , n
be another collection of PSV–NHFRNs such that
Γ ̲ / Ξ ̲ Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ̲ / Λ ̲ α * , ̲ / ̲ α ̲ / ̲ α * , Γ ¯ / Ξ ¯ α Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α ¯ / Λ ¯ α * , ¯ / ¯ α ¯ / ¯ α *
for all δ . Then
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) C L P S V N H F R W A ( α 1 * , ζ 1 ) , ( α 2 * , ζ 2 ) , , ( α n * , ζ n ) .
 Proof. 
Since
Γ ̲ / Ξ ̲ α Γ ̲ / Ξ ̲ α * , ̲ / Λ ̲ α ̲ / Λ ̲ α * , ̲ / ̲ α ̲ / ̲ α * , Γ ¯ / Ξ ¯ α Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α ¯ / Λ ¯ α * , ¯ / ¯ α ¯ / ¯ α *
for all ,
1 Γ ̲ / Ξ ̲ 1 Γ ̲ / Ξ ̲ = 1 n 1 Γ ̲ / Ξ ̲ ζ δ = 1 n 1 Γ ̲ / Ξ ̲ ζ δ 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ .
similarly,
1 Γ ¯ / Ξ ¯ α * 1 Γ ¯ / Ξ ¯ α = 1 n 1 Γ ¯ / Ξ ¯ α * ζ δ = 1 n 1 Γ ¯ / Ξ ¯ α ζ δ 1 = 1 n 1 Γ ¯ / Ξ ¯ α ζ δ 1 = 1 n 1 Γ ¯ / Ξ ¯ α * ζ δ .
also
= 1 n ̲ / Λ ̲ α ζ δ = 1 n ̲ / Λ ̲ α * ζ δ , = 1 n ¯ / Λ ¯ α ζ δ = 1 n ¯ / Λ ¯ α * ζ δ .
and
= 1 n ̲ / ̲ α ζ δ = 1 n ̲ / ̲ α * ζ δ , = 1 n ¯ / ¯ α ζ δ = 1 n ¯ / ¯ α * ζ δ .
If
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α , ̲ / ̲ α , Γ ¯ / Ξ ¯ α , ¯ / Λ ¯ α , ¯ / ¯ α = α
and
C L P S V N H F R W A ( α 1 * , ζ 1 ) , ( α 2 * , ζ 2 ) , , ( α n * , ζ n ) = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α * , ̲ / ̲ α * , Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α * , ¯ / ¯ α * = α
, then we get S F α S F α * .
We have two cases: □
Case 1:
If S F α < S F α * , applying SF we obtain
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) < C L P S V N H F R W A ( α 1 * , ζ 1 ) , ( α 2 * , ζ 2 ) , , ( α n * , ζ n )
Case 2:
If S F α = S F α * , applying SF we obtain
S F α = 1 6 3 + 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ + 1 = 1 n 1 Γ ¯ / Ξ ¯ α ζ δ = 1 n ̲ / Λ ̲ α ζ δ = 1 n ¯ / Λ ¯ α ζ δ = 1 n ̲ / ̲ α ζ δ = 1 n ¯ / ¯ α ζ δ .
S F α * = 1 6 3 + 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ + 1 = 1 n 1 Γ ¯ / Ξ ¯ α * ζ δ = 1 n ̲ / Λ ̲ α * ζ δ = 1 n ¯ / Λ ¯ α * ζ δ = 1 n ̲ / Λ ̲ α * ζ δ = 1 n ¯ / Λ ¯ α * ζ δ .
Since we have
Γ ̲ / Ξ ̲ Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ̲ / Λ ̲ α * , ̲ / ̲ α ̲ / ̲ α * , Γ ¯ / Ξ ¯ α Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α ¯ / Λ ¯ α * , ¯ / ¯ α ¯ / ¯ α *
for all , we have
1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ = 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ , 1 = 1 n 1 Γ ¯ / Ξ ¯ α ζ δ = 1 = 1 n 1 Γ ¯ / Ξ ¯ α * ζ δ , = 1 n ̲ / Λ ̲ α ζ δ = = 1 n ̲ / Λ ̲ α * ζ δ , = 1 n ¯ / Λ ¯ α ζ δ = = 1 n ¯ / Λ ¯ α * ζ δ , = 1 n ̲ / ̲ α ζ δ = = 1 n ̲ / ̲ α * ζ δ , = 1 n ¯ / ¯ α ζ δ = = 1 n ¯ / ¯ α * ζ δ .
Now applying the definition of AF, we derive
A C α = 1 6 3 + 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ + 1 = 1 n 1 Γ ¯ / Ξ ¯ α ζ δ + = 1 n ̲ / Λ ̲ α ζ δ + = 1 n ¯ / Λ ¯ α ζ δ + = 1 n ̲ / ̲ α ζ δ + = 1 n ¯ / ¯ α ζ δ = 1 6 3 + 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ δ + 1 = 1 n 1 Γ ¯ / Ξ ¯ α * ζ δ + = 1 n ̲ / Λ ̲ α * ζ δ + = 1 n ¯ / Λ ¯ α * ζ δ + = 1 n ̲ / Λ ̲ α * ζ δ + = 1 n ¯ / Λ ¯ α * ζ δ = A C α * .
Thus,
C L P S V N H F R W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) < C L P S V N H F R W A ( α 1 * , ζ 1 ) , ( α 2 * , ζ 2 ) , , ( α n * , ζ n ) .

CL–PSV–NHFR Ordered Weighted Average (CL–PSV–NHFROWA) Aggregation Operators

In this section, we cover a CL–PSV–NHFROWA operator’s fundamental definition. We also go into great detail about the fundamental characteristics of this operator.
Definition 14.
Let α = { ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) } , = 1 , 2 , , n be a family of PSV-NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T be the weight vectors for PSV-NHFRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 . Then, the mapping C L P S V N H F R O W A : F n F operator is given as
C L P S V N H F R O W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = δ 1 ζ ε 1 α ε 1 δ 2 ζ ε 2 α ε 2 δ 3 ζ ε 3 α ε 3 δ n ζ ε n α ε n .
where ( ε 1 , ε 1 ε 2 , ε 3 , , ε n ) is the permutation of ( = 1 , 2 , , n ) such that for all , α ε 1 α ε .
Theorem 2.
Let
α = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ , Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ , = 1 , 2 , , n
be a collection of PSV-NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T be the weight vectors for PSV-NHFRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 .
Then
C L P S V N H F R O W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = 1 = 1 n 1 Γ ̲ / Ξ ̲ ζ ε δ , = 1 n ̲ / Λ ̲ ε ζ ε δ , = 1 n ̲ / ̲ ε ζ ε δ , 1 = 1 n 1 Γ ε ζ ε δ , = 1 n ¯ / Λ ¯ ε ζ ε δ , , = 1 n ¯ / ¯ ε ζ ε δ
 Proof. 
The proof is similar as the proof of Theorem 1. □
Here, we go through the CI–PSV–NHFROWA operator’s characteristics.
1. 
Idempotency
If for all ( α , ζ ) = ( α , ζ ) , i.e., Γ ¯ / Ξ ¯ = Γ ¯ / Ξ ¯ , Γ ̲ / Ξ ̲ = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ = ̲ / Λ ̲ , ¯ / Λ ¯ = ¯ / Λ ¯ , ̲ / ̲ = ̲ / ̲ and ¯ / ¯ = ¯ / ¯ , ζ = ζ , then
C L P S V N H F R O W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = ζ α
2. Boundedness:
Let α = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ζ min , ̲ / ̲ α ζ min , Γ ¯ / Ξ ¯ α ζ max , ¯ / Λ ¯ α ζ max , ¯ / ¯ α ζ max and
α + = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ζ max , ̲ / ̲ α ζ max , Γ ¯ / Ξ ¯ α ζ min , ¯ / Λ ¯ α ζ max , ¯ / ¯ α ζ max .
Then, for all δ ,
α C L P S V N H F R O W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) α + .
3. Monotonicity:
Let α * = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α * , ̲ / ̲ α * , Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α * , ¯ / ¯ α * = 1 , 2 , 3 , , n be another collection of PSV-NHFRNs such that
Γ ̲ / Ξ ̲ Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ̲ / Λ ̲ α * , ̲ / ̲ α ̲ / ̲ α * , Γ ¯ / Ξ ¯ α Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α ¯ / Λ ¯ α * , ¯ / ¯ α ¯ / ¯ α *
for all δ . Then
C L P S V N H F R O W A ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) C L P S V N H F R O W A ( α 1 * , ζ 1 ) , ( α 2 * , ζ 2 ) , , ( α n * , ζ n ) .

4. CL–PSV–NHFR Geometric Aggregation Operators

We discuss CI–SV–NR geometric AOs in this part. We also research the fundamental characteristics of the operators.

CL–PSV–NHFR Weighted Geometric (CL–PSV–NHFRWG) Aggregation Operator

Definition 15.
α = ( ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) ) , = 1 , 2 , , n is a collection of PSV–NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T be the weight vectors for SV–NRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 . Then, the mapping C L P S V N H F R W A : F n F operator is given as CL–SV–NRWG operator,
( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = = 1 n α ζ δ = α 1 ζ 1 δ 1 α 2 ζ 2 δ 2 α 3 ζ 3 δ 3 α n ζ n δ n .
It is called the CL–PSV–NHFRWG operator.
Theorem 3.
Let α = ( ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) ) , = 1 , 2 , , n be a collection of SVNRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T is the weight vectors for PSV–NHFRNs with the condition
n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 . Then C L P S V N H F R W G
C L P S V N H F R W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = = 1 n Γ ̲ / Ξ ̲ ζ δ , 1 = 1 n 1 ̲ / Λ ̲ ζ δ , 1 = 1 n 1 ̲ / ̲ ζ δ = 1 n Γ ¯ / Ξ ¯ ζ δ , 1 = 1 n 1 ¯ / Λ ¯ ζ δ , 1 = 1 n 1 ¯ / ¯ ζ δ
 Proof. 
For n = 2, we have
C L P S V N H F R W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) = α ζ δ 1 α 2 ζ δ 2 .
By using the operational laws for PSV–NHFRNs, we get
α 1 ζ 1 = Γ ̲ / Ξ ̲ , 1 1 ̲ / Λ ̲ 1 ζ 1 , 1 1 ̲ / ̲ 1 ζ 1 , Γ ¯ / Ξ ¯ 1 ζ 1 , 1 1 ¯ / Λ ¯ 1 ζ 1 , 1 1 ¯ / ¯ 1 ζ 1 = Υ ̲ 1 , Γ ̲ 1 , Θ ̲ 1 , Υ ¯ 1 , Γ ¯ 1 , Θ ¯ 1 .
Then
α 1 ζ 1 δ 1 = Υ ̲ 1 ζ 1 , 1 1 Γ ̲ 1 ζ 1 , 1 1 Θ ̲ 1 ζ 1 , Υ ¯ 1 ζ 1 , 1 1 Γ ¯ 1 ζ 1 , 1 1 Θ ¯ 1 ζ 1 = Γ ̲ 1 / Ξ ̲ 1 δ 1 , 1 1 1 1 ̲ 1 / Λ ̲ 1 ζ 1 δ 1 , 1 1 1 1 ̲ 1 / ̲ 1 ζ 1 δ 1 , Γ ¯ 1 / Ξ ¯ 1 ζ 1 δ 1 , 1 1 1 1 ¯ 1 / Λ ¯ 1 ζ 1 δ 1 , 1 1 1 1 ¯ 1 / ¯ 1 ζ 1 δ 1 = Γ ̲ 1 / Ξ ̲ 1 , 1 1 ̲ 1 / Λ ̲ 1 ζ 1 δ 1 , 1 1 ̲ 1 / ̲ 1 ζ 1 δ 1 , Γ ¯ 1 / Ξ ¯ 1 ζ 1 δ 1 , 1 1 ¯ 1 / Λ ¯ 1 ζ 1 δ 1 , 1 1 ¯ 1 / ¯ 1 ζ 1 δ 1 .
Likewise, we can observe that
α 2 ζ 2 δ 2 = Γ ̲ / Ξ ̲ , 1 1 ̲ / Λ ̲ 2 ζ 2 δ 2 , 1 1 ̲ / ̲ 1 ζ 2 δ 2 , Γ ¯ / Ξ ¯ 2 ζ 2 δ 2 , 1 1 ¯ / Λ ¯ 2 ζ 2 δ 2 , 1 1 ¯ / ¯ 1 ζ 2 δ 2
Now,
C L P S V N H F R W G = ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) = α 1 ζ 1 δ 1 α 2 ζ 2 δ 2 = Γ ̲ 1 / Ξ ̲ 1 ζ 1 δ 1 Γ ̲ 2 / Ξ ̲ 2 ζ 2 δ 2 , 1 1 ̲ 1 / Λ ̲ 1 ζ 1 δ 1 1 1 ̲ 2 / Λ ̲ 2 ζ 2 δ 2 , 1 1 ̲ 1 / ̲ 1 ζ 1 δ 1 1 1 ̲ 2 / ̲ 2 ζ 2 δ 2 , Γ ¯ / Ξ ¯ 1 ζ 1 δ 1 Γ ¯ / Ξ ¯ 2 ζ 2 δ 2 , 1 1 ¯ 1 / Λ ¯ 1 ζ 1 δ 1 1 1 ¯ 2 / Λ ¯ 2 ζ 2 δ 2 , 1 1 ¯ 1 / ¯ 1 ζ 1 δ 1 1 1 ¯ 2 / ¯ 2 ζ 2 δ 2
Thus, in light of this,
C L P S V N H F R W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) = = 1 2 Γ ̲ / Ξ ̲ ζ δ , 1 = 1 2 1 ̲ / Λ ̲ ζ δ , 1 = 1 2 1 ̲ / ̲ ζ δ , = 1 2 Γ ¯ / Ξ ¯ ζ δ , 1 = 1 2 1 ¯ / Λ ¯ ζ δ , 1 = 1 2 1 ¯ / ¯ ζ δ
Suppose that the result is valid for n = , that is
C L P S V N H F R W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α , ζ ) = = 1 Γ ̲ / Ξ ̲ ζ δ , 1 = 1 1 ̲ / Λ ̲ ζ δ , 1 = 1 1 ̲ / ̲ ζ δ , = 1 Γ ¯ / Ξ ¯ ζ δ , 1 = 1 1 ¯ / Λ ¯ ζ δ , 1 = 1 1 ¯ / ¯ ζ δ
Then, for n = + 1 , we derive
C L P S V N H F R W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α , ζ ) , ( α + 1 , ζ + 1 ) = = 1 Γ ̲ / Ξ ̲ ζ δ , 1 = 1 1 ̲ / Λ ̲ ζ δ , 1 = 1 1 ̲ / ̲ ζ δ , = 1 Γ ¯ / Ξ ¯ ζ δ , 1 = 1 1 ¯ / Λ ¯ ζ δ , 1 = 1 1 ¯ / ¯ ζ δ Γ ̲ + 1 / Ξ ̲ + 1 ζ + 1 δ + 1 , 1 1 ̲ + 1 / Λ ̲ + 1 ζ + 1 δ + 1 , 1 1 ̲ / ̲ + 1 ζ + 1 δ + 1 , Γ ¯ + 1 / Ξ ¯ + 1 ζ + 1 δ + 1 , 1 1 ¯ + 1 / Λ ¯ + 1 ζ + 1 δ + 1 , 1 1 ¯ + 1 / ¯ + 1 ζ + 1 δ + 1 = = 1 Γ ̲ / Ξ ̲ ζ δ + Γ ̲ + 1 / Ξ ̲ + 1 ζ + 1 δ + 1 = 1 Γ ¯ / Ξ ¯ ζ δ Γ ¯ + 1 / Ξ ¯ + 1 ζ + 1 δ + 1 , 1 = 1 1 ̲ / Λ ̲ ζ δ + 1 1 ̲ + 1 / Λ ̲ + 1 ζ + 1 δ + 1 1 = 1 1 ¯ / Λ ¯ ζ δ + 1 1 ¯ + 1 / Λ ¯ + 1 ζ + 1 δ + 1 , 1 = 1 1 ̲ / ̲ ζ δ + 1 1 ̲ / ̲ + 1 ζ + 1 δ + 1 1 = 1 1 ¯ / ¯ ζ δ + 1 1 ¯ / ¯ + 1 ζ + 1 δ + 1 = = 1 + 1 Γ ̲ / Ξ ̲ ζ δ , 1 = 1 + 1 1 ̲ / Λ ̲ ζ δ , 1 = 1 + 1 1 ̲ / ̲ ζ δ , = 1 + 1 Γ ¯ / Ξ ¯ ζ δ , 1 = 1 + 1 1 ¯ / Λ ¯ ζ δ , 1 = 1 + 1 1 ¯ / ¯ ζ δ
As a result, the statement holds true for n = + 1 . As a result, the outcome is applicable to any quantity of PSV–NHFRNs. □

CL–PSV–NHFR Ordered Weighted Geometric (CL–PSV–NHFROWG) Aggregation Operators

We go over a CL–PSV–NHFROWG operator’s fundamental definition in this section of the article. We also go into great detail about the fundamental characteristics of these operators.
Definition 16.
Let α = { ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) } , = 1 , 2 , , n be a family of PSV–NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T be the weight vectors for PSV–NHFRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 . Then, the mapping C L P S V N H F R O W A : F n F operator is given as
C L P S V N H F R O W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = α ε 1 ζ ε 1 δ 1 α ε 2 ζ ε 2 δ 2 α ε 2 ζ ε 2 ψ 2 α ε n ζ ε n δ n .
where where ( ε 1 , ε 1 ε 2 , ε 3 , , ε n ) is the permutation of ( = 1 , 2 , , n ) , such that for all , α ε 1 α ε .
Definition 17.
Let α = { ( Γ ̲ / Ξ ̲ , ̲ / Λ ̲ , ̲ / ̲ ) , ( Γ ¯ / Ξ ¯ , ¯ / Λ ¯ , ¯ / ¯ ) } , = 1 , 2 , , n be a family of PSV–NHFRNs and ζ be the CL of α with 0 ζ 1 .
Let δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T be the weight vectors for PSV–NHFRNs with the condition n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 . Then,
C L P S V N H F R O W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = = 1 n Γ ̲ / Ξ ̲ ζ ε δ , 1 = 1 n 1 ̲ / Λ ̲ ε ζ ε δ , 1 = 1 n 1 ̲ / ̲ ε ζ ε δ , = 1 n Γ ¯ / Ξ ¯ ε ζ ε δ , 1 = 1 n 1 ¯ / Λ ¯ ε ζ ε δ , 1 = 1 n 1 ¯ / ¯ ε ζ ε δ
 Proof. 
The proof is similar to the proof of Theorem 3. □
We next discuss the properties of the CL–PSV–NHFROWG operator.
1. 
Idempotency If ∀ , ( α , ζ ) = ( α , ζ ) , i.e., Γ ̲ / Ξ ̲ = Γ ̲ / Ξ ̲ , Γ ¯ / Ξ ¯ = Γ ¯ / Ξ ¯ , ̲ / Λ ̲ = ̲ / Λ ̲ , ¯ / Λ ¯ = ¯ / Λ ¯ , ̲ / ̲ = ̲ / ̲ and ¯ / ¯ = ¯ / ¯ , ζ = ζ , then
C L P S V N H F R O W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) = ζ α
2. 
Boundedness Let
α = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ζ min , ̲ / ̲ α ζ min , Γ ¯ / Ξ ¯ α ζ max , ¯ / Λ ¯ α ζ max , ¯ / ¯ α ζ max
and
α + = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ζ max , ̲ / ̲ α ζ max , Γ ¯ / Ξ ¯ α ζ min , ¯ / Λ ¯ α ζ min , ¯ / ¯ α ζ min
Then, for all δ ,
α C L P S V N H F R O W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) α + .
3. 
Monotonicity Let
α * = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α * , ̲ / ̲ α * , Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α * , ¯ / ¯ α * = 1 , 2 , 3 , , n
be another family of PSV–NHFRNs such that
Γ ̲ / Ξ ̲ Γ ̲ / Ξ ̲ , ̲ / Λ ̲ α ̲ / Λ ̲ α * , ̲ / ̲ α ̲ / ̲ α * Γ ¯ / Ξ ¯ α Γ ¯ / Ξ ¯ α * , ¯ / Λ ¯ α ¯ / Λ ¯ α * , ¯ / ¯ α ¯ / ¯ α *
for all δ . Then
C L P S V N H F R O W G ( α 1 , ζ 1 ) , ( α 2 , ζ 2 ) , , ( α n , ζ n ) C L P S V N H F R O W G ( α 1 * , ζ 1 ) , ( α 2 * , ζ 2 ) , , ( α n * , ζ n )

5. Decision-Making Strategy Based on CL–PSV–NHFR AOs

A decision in traditional (normative, statistical) decision theory can be described by a set of decision alternatives (the decision space), a set of natural states (the state space), a relation that links each decision and state pair to a result, and, finally, a utility function that ranks the outcomes in order of desirability. Multiple evaluation techniques have been developed as a result of multi-criteria decision making, including those in the fields of marketing and cost-benefit analysis, as well as the formulation of vector maximum problems in mathematical programming. Using MCDM, the optimal solution that satisfies their needs can be selected successfully. In this section, we look at how the newly added operators are used. We created an MCDM algorithm as a consequence, to show the effectiveness and usefulness of the suggested work.
Suppose that Θ * = Θ 1 , Θ 2 , Θ 3 , , Θ n indicate the assortment of options and C ^ = C ^ 1 , C ^ 2 , C ^ 3 , , C ^ n indicate the group of criteria. Assume that δ = ( δ 1 , δ 2 , δ 3 . , δ n ) T be the PSV–NHFRNs’ weight vectors with the restriction n δ = 1 and n Ξ = 1 , n Λ = 1 , n = 1 .
Assume that professionals provide PSV–NHFRNs with their CLs indicating how they rate each alternative in accordance to each criterion.
α j s m × n = Γ ̲ j / Ξ ̲ j , ̲ / Λ ̲ j s , ̲ / ̲ j s , Γ ¯ j / Ξ ¯ j s , ¯ j / Λ ¯ j s , ¯ / ¯ j s , ζ j s
In order to employ the concept of CL, experts must state that they are familiarized with the assessed alternatives and must assign the CL with the value ζ j ı 0 ζ j ı 1 . We must now take the following actions:
Step 1
Assemble the PSV–NHFRNs and CL data provided by the expert, and then establish the expert’s evaluation presence as
M ı m × n = Γ ̲ / Ξ ̲ , ̲ / Λ ̲ ı , ̲ / ̲ ı , Γ ¯ / Ξ ¯ ı , ¯ / Λ ¯ ı , ¯ / ¯ ı , ζ j ı
Step 2
Utilizing the CL–PSV–NHFRWA or CL–PSV–NHFRWG concept to integrate each expert’s individual matrix into a collective judgement matrix M m × n . That is,
α j = C L P S V N H F R W A ( α j 1 , ζ j 1 ) , ( α j 2 , ζ j 2 ) , , ( α j ı , ζ j ı ) = 1 ı = 1 1 Γ ̲ / Ξ ̲ ζ j ı , ı = 1 ̲ / Λ ̲ j i ζ j ı , ı = 1 ̲ / ̲ j ı ζ j ı , 1 = 1 1 Γ ¯ / Ξ ¯ j i ζ j ı , ı = 1 ¯ / Λ ¯ j i ζ j ı , ı = 1 ¯ / ¯ j ı ζ j ı .
or
α j = C L P S V N H F R W G ( α j 1 , ζ j 1 ) , ( α j 2 , ζ j 2 ) , , ( α j ı , ζ j ı ) = ı = 1 Γ ̲ / Ξ ̲ ζ j ı , 1 ı = 1 1 ̲ / Λ ̲ j ı ζ j ı , 1 ı = 1 1 ̲ / ̲ j i ζ j ı , ı = 1 Γ ¯ / Ξ ¯ j i ζ j ı , 1 = 1 1 ¯ / Λ ¯ j i ζ j ı , 1 = 1 1 ¯ / ¯ j i ζ j ı .
Step 3
Aggregating the matrix’s alternate execution using the PSV–NHFRWA or PSV–NHFRWG operator M m × n as
α = P S V N H F R W A α 1 , α 2 , , α n = 1 j = 1 n 1 Γ ̲ / Ξ ̲ δ j , j = 1 n ̲ / Λ ̲ j i δ j , j = 1 n ̲ / ̲ j ı δ j , 1 j = 1 n 1 Γ ¯ / Ξ ¯ j ı δ j , j = 1 n ¯ / Λ ¯ j ı δ j , j = 1 n ¯ / ¯ j ı δ j .
or
α = P S V N H F R W G α 1 , α 2 , , α n = j = 1 n Γ ̲ / Ξ ̲ δ j , 1 j = 1 n 1 ̲ / Λ ̲ j δ j , 1 j = 1 n 1 ̲ / ̲ j δ j , j = 1 n Γ ¯ / Ξ ¯ j ı δ j , 1 j = 1 n 1 ¯ / Λ ¯ j ı δ j , 1 j = 1 n 1 ¯ / ¯ j ı δ j .
Step 4
Calculate the score values for each choice using SF, and then rank the results.
Then, score function (SF) and accuracy function (AF) are given by
S c = 1 6 3 + Γ ̲ / Ξ ̲ + Γ ¯ / Ξ ¯ ̲ / Λ ̲ ¯ / Λ ¯ ̲ / ̲ ¯ / ¯ , S [ 0 , 1 ] A c = 1 6 3 + Γ ̲ / Ξ ̲ + Γ ¯ / Ξ ¯ + ̲ / Λ ̲ + ¯ / Λ ¯ ̲ / ̲ + ¯ / ¯ , A [ 0 , 1 ] .

Case Study with Numerical Example

Case Study: The theory of “making decisions,” which is crucial to many scientific fields, was primarily created in the context of probability theory. Pattern recognition is one area where probabilistic decision-making methods frequently perform exceptionally well, but there are other situations where they fall short. When the usual probabilistic formalism is insufficient to describe the events under consideration, such as when they are not truly random, the introduction of probabilities as measurements of empirical frequencies in numerous identical experiments may lose some of their significance. The “source” of uncertainty in a decision is frequently partially or entirely deterministic. The decision-makers may decide to analyze the alternative using PSV–NHFRSs and the associated confidence levels, due to their familiarity with the evaluation. The present study used the idea of confidence levels in the aggregation process to evaluate the alternative employing PSV–NHFRSs. For this reason, we added probability information to each valued neutrosophic hesitant fuzzy rough element. To put it more simply, we considered probability, confidence level, and neutrosophy theories all at once. Evaluation professionals are frequently sought for two forms of information when dealing with practical decision-making challenges: the effectiveness of the assessment objects and understanding of the evaluation domains (called confidence levels). All of the methods in use today do not trust the expertise of the experts and only take into account positive facts. We encountered various issues in many areas of life where there was ambiguity, including engineering, economics, modelling, and medical diagnosis, among others. However, how to express and use uncertainty in mathematical modeling is commonly discussed. Researchers from all across the world have offered and suggested a variety of solutions to problems like uncertainty. Multiple attribute decision making (MADM), which enables identification of the most pertinent and distinctive solution, is the most crucial component in decision-making issues. However, in other circumstances, selecting the best course of action can be quite difficult, due to conflicting facts. Zadeh developed the concept of fuzzy sets to address and steer clear of uncertainty and ambiguity problems. Sets containing MD-components are comparable to fuzzy sets. In conventional set theory, the binary form of the bivalent condition, of whether the elements fully belong to the set, is used to analyze the MD of the set’s members. The value of set elements can now be determined using fuzzy set theory. To reflect this, the MD uses the interval [0, 1] as its effective unit interval. The classical set’s indicator function is a particular instance of that set if the fuzzy set’s MD only accepts the values 0 or 1. Thus, the fuzzy set is the classical set’s generalization. In fuzzy set theory, the conventional bivalent set is frequently referred to as the crisp set. Fuzzy set theory is applicable in many fields where information is uncertain or imperfect.
Numerical Example: Health professionals encounter several issues when treating more complex diseases as a result of complications in various diseases. For patients, doctors, and medical theory to survive, precise decision-making in the medical sector is crucial. Due to the complexity of these issues, FS theory participates in this area and has numerous applications. Figure 1 depicts a general overview of the different hesitant factors and probabilities that are effected on heart diseases. Figure 2 shows cardiac disease. The algorithm was designed on the basis of the uncertainty issues in health professions. The weight values were δ = ( 0.24 , 0.34 , 0.26 , 0.16 ) T , and these affected the information. Where appropriate, the information was gathered from the decision modeling’s hesitancies and probabilities. As well as observing all outcomes, both positive and negative, the experts’ levels of confidence were also noted.
There are four major techniques that are used for Cardiac imaging modality given below:
Θ 1 = Cardiac Magnetic Resonance Imaging (MRI): Heart MRIs use radio waves and magnets to produce images of the heart, without the patient seeing or feeling anything entering the body. The components of the heart, including its chambers, valves, and muscles, as well as how effectively they are functioning and how blood is moving, can be seen on a cardiac MRI. The health-care professional can diagnose the issue and determine what is wrong thanks to these finely detailed, high-quality photographs in two or three dimensions.
Θ 2 = Cardiac Catheterization: In order to detect or treat some heart diseases, such as blocked arteries or irregular heartbeats, a thin, flexible tube (catheter) is guided through a blood vessel to the heart during a cardiac catheterization procedure. Doctors learn vital details about the heart’s blood arteries, heart valves, and muscle through cardiac catheterization. Doctors can perform a variety of heart tests, provide treatments, or remove a sample of heart tissue for close study during cardiac catheterization. Cardiac catheterization is used during some heart disease therapies, including coronary angioplasty and coronary stinting. In most cases, the patient is awake throughout the cardiac catheterization, but is provided with sedatives. A cardiac catheterization has a short recovery period and a low risk of complications.
Θ 3 = Electron-Beam Computed Tomography (EBCT): In the specific type of computed tomography (CT) known as electron beam computed tomography (EBCT), the X-ray tube is not manually spun in order to rotate the X-ray photon source. This new design was specifically created to better represent heart structures that are constantly in motion and to perform a full cycle of movement with each beat. The X-ray source-point moves in a circle in space around the object to be scanned, just like in traditional CT technology. However, in EBT, the image circle is only partially surrounded by the huge, stationary X-ray tube. The X-ray source point and electron-beam focus point are electronically moved along a tungsten anode in the tube, tracing a huge circular arc on its inner surface, as opposed to moving the tube itself. This motion may occur quite quickly. By the 2020s, multi-detector CT imagery technology had advanced so quickly that electron beam CT was no longer able to keep up.
Θ 4 = Echo cardiography: An echo cardiography creates images of the heart using sound waves. The doctor can watch the heart beating and pumping blood thanks to this typical test. Heart disease can be detected by the doctor using the pictures from an echo cardiography. The patient might undergo one of several different types of echo cardiogram, depending on the information the doctor needs. Most echo cardiography types carry little to no risk.
The different probabilities and hesitations are given in the above diagrams. The data was collected from the cardiac professionals.
Table 1, Table 2, Table 3 and Table 4 provides the information collected from four medical experts. Table 5 is the integrated table. Table 6 provide the information obtained by applying the CL–PSV–NHFRWA operator and the result of the PSV–NHFRWA score function is in Table 7. Table 8 provide the information obtained by applying the novel CL–PSV–NHFRWG operator. Table 9 provide the information obtained by applying the PSV–NHFRWG score function, and, then, the results obtained for current MADM.
Step 1
Table 1. Expert-1 information.
Table 1. Expert-1 information.
C ^ 1 C ^ 2
Θ 1 0.2 0.4 , 0.6 0.6 , 0.3 0.7 , 0.4 0.3 , 0.3 0.2 , 0.4 0.3 , 0.6 0.5 , 0.4 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.3 , 0.5 0.4 , 0.1 0.3 , 0.6 0.1 0.3 , 0.5 0.6 , 0.6 0.1 , 0.8 1.0 , 0.2 0.1 , 0.1 0.6 , 0.9 0.3 , 0.1 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.2 0.4 , 0.9
Θ 2 0.7 0.4 , 0.1 0.6 , 0.5 0.2 , 0.6 0.2 , 0.7 0.3 , 0.4 0.6 , 0.6 0.1 , 0.1 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.8 0.2 , 0.5 0.8 , 0.8 0.3 , 0.1 0.7 , 0.9 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.2 , 0.6 0.1 , 0.7 0.9 , 0.2 0.4 , 0.6 0.6 , 0.2 0.7 , 0.6 0.3 , 0.8
Θ 3 0.4 0.1 , 0.6 0.2 , 0.2 0.7 , 0.8 0.4 , 0.6 0.6 , 0.1 0.6 , 0.2 1.0 , 0.3 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.1 , 0.6 0.5 , 0.7 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.7 , 0.9 1.0 , 0.2 0.4 , 0.6 0.2 , 0.2 0.4 , 0.2 0.7 , 0.7 0.2 , 0.6 0.1 , 0.3
Θ 4 0.2 0.2 , 0.1 0.2 , 0.6 0.6 , 0.2 1.0 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.5 , 0.4 0.8 , 0.6 0.2 , 0.2 0.2 , 0.1 0.5 , 0.6 0.3 , 0.3 0.8 , 0.7 0.2 , 0.5 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.6 0.6 , 0.2 , 0.7 0.2 , 0.6 0.8 , 0.1 0.4 , 0.5 0.1 , 0.6 0.5 , 0.2 1.0 , 0.8
C ^ 3 C ^ 4
Θ 1 0.1 0.7 , 0.4 0.3 , 0.8 1.0 , 0.3 0.7 , 0.4 0.1 , 0.6 0.2 , 0.2 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.3 , 0.5 0.4 , 0.1 0.3 , 0.8 0.2 0.4 , 0.6 0.6 , 0.3 0.7 , 0.4 0.3 , 0.3 0.2 , 0.4 0.3 , 0.6 0.5 , 0.4 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.3 , 0.5 0.4 , 0.1 0.3 , 0.6
Θ 2 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.2 0.7 , 0.5 0.2 , 0.4 0.1 , 0.7 0.4 , 0.6 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.8 0.2 , 0.5 0.8 , 0.8 0.3 , 0.1 0.7 , 0.4 0.7 0.4 , 0.1 0.6 , 0.5 0.2 , 0.6 0.2 , 0.7 0.3 , 0.4 0.6 , 0.6 0.1 , 0.1 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.8 0.2 , 0.5 0.8 , 0.8 0.3 , 0.1 0.7 , 0.9
Θ 3 0.3 0.1 , 0.4 0.2 , 0.2 0.7 , 0.2 1.0 , 0.8 0.4 , 0.6 0.3 , 0.1 0.3 , 0.1 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.5 , 0.6 0.1 , 0.9 0.4 0.1 , 0.6 0.2 , 0.2 0.7 , 0.1 0.4 , 0.9 0.2 , 0.5 0.2 , 0.2 1.0 , 0.1 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.9
Θ 4 0.9 1.0 , 0.3 0.2 , 0.2 0.2 , 0.6 0.6 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.2 , 0.4 0.8 , 0.6 0.2 , 0.2 0.2 , 0.1 0.5 , 0.6 0.3 , 0.3 0.8 , 0.7 0.2 , 0.8 0.2 0.2 , 0.1 0.2 , 0.6 0.6 , 0.2 1.0 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.3 , 0.4 0.8 , 0.6 0.2 , 0.2 0.2 , 0.1 0.5 , 0.6 0.3 , 0.3 0.8 , 0.7 0.2 , 0.7
Table 2. Expert-2 information.
Table 2. Expert-2 information.
C ^ 1 C ^ 2
Θ 1 0.7 1.0 , 0.1 0.2 , 0.5 0.8 , 0.3 0.3 , 0.4 0.1 , 0.9 0.6 , 0.7 , 0.9 1.0 , 0.3 0.1 , 0.5 0.2 , 0.7 0.6 , 0.4 0.1 , 0.5 0.4 , 0.4 0.5 , 0.3 0.1 0.4 , 0.9 0.6 , 0.3 0.7 , 0.4 0.3 , 0.3 0.1 , 0.5 0.3 , 0.6 0.6 , 0.7 , 0.3 0.3 , 0.2 0.1 , 0.9 0.6 , 0.8 1.0 , 0.3 0.7 , 0.5 0.2 , 0.3 0.1 , 0.3
Θ 2 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.2 0.7 , 0.5 0.2 , 0.4 0.1 , 0.7 0.4 , 0.1 , 0.5 0.4 , 0.6 0.4 , 0.2 0.2 , 0.9 0.1 , 0.5 0.9 , 0.8 0.3 , 0.1 0.7 , 0.9 0.7 0.4 , 0.1 0.6 , 0.5 0.2 , 0.6 0.2 , 0.7 0.3 , 0.4 0.6 , 0.6 0.1 , 0.2 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.7 1.0 , 0.8 1.0 , 0.8
Θ 3 0.3 0.1 , 0.4 0.2 , 0.2 0.7 , 0.2 1.0 , 0.8 0.4 , 0.6 0.3 , 0.1 0.3 , 0.5 , 0.2 0.4 , 0.5 0.6 , 0.2 0.3 , 0.5 0.7 , 0.2 0.3 , 0.1 0.6 , 0.6 0.1 , 0.5 0.5 1.0 , 0.1 0.3 , 0.8 0.4 , 0.3 0.3 , 0.2 1.0 , 0.4 , 0.7 0.5 , 0.2 0.5 , 0.2 0.4 , 0.6 0.3 , 0.2 0.3 , 0.2 0.1 , 0.6 0.9 , 0.6
Θ 4 0.9 1.0 , 0.3 0.1 , 0.6 0.7 , 0.7 0.2 , 0.3 0.2 , 0.2 0.2 , 0.6 0.6 , 0.2 , 0.4 0.9 , 0.6 0.1 , 0.2 0.3 , 0.1 0.4 , 0.5 0.3 , 0.3 0.8 , 0.7 0.2 , 0.8 0.2 0.2 , 0.1 0.2 , 0.6 0.6 , 0.2 1.0 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.3 , 0.4 0.8 , 0.6 0.2 , 0.2 0.2 , 0.2 0.7 , 0.6 0.1 , , 0.2 1.0 , 0.7
C ^ 3 C ^ 4
Θ 1 0.2 0.2 , 0.4 0.8 , 0.2 0.7 , 0.5 0.3 , 0.3 0.7 , 0.4 0.1 , 0.6 0.2 , 0.2 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.3 , 0.5 0.4 , 0.1 0.3 , 0.8 0.3 0.4 , 0.6 0.6 , 0.8 1.0 , 0.1 0.2 , 0.4 0.6 , 0.6 0.2 , 0.1 , 0.2 1.0 , 0.2 0.7 , 0.5 0.2 , 0.4 0.1 , 0.4 0.3 , 0.5 0.4 , 0.1 0.3 , 0.9
Θ 2 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.2 0.7 , 0.5 0.2 , 0.4 0.1 , 0.7 0.4 , 0.6 , 0.2 0.4 , 0.4 0.6 , 0.8 0.2 , 0.5 0.8 , 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.4 0.7 1.0 , 0.1 1.0 , 0.7 0.3 , 0.3 0.6 , 0.6 0.1 , 0.3 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.8 0.2 , 0.5 0.8 , 0.8 0.3 , 0.1 0.7 , 0.7
Θ 3 0.3 1.0 , 0.2 1.0 , 0.8 0.4 , 0.6 0.3 , 0.1 0.3 , 0.1 , 0.3 0.2 , 0.2 0.8 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.5 , 0.6 0.1 , 0.9 0.4 0.1 , 0.6 0.2 , 0.2 0.7 , 0.1 0.4 , 0.9 0.2 , 0.5 0.2 , 0.2 1.0 , 0.5 , 0.8 0.2 , 0.6 0.8 , 0.4 1.0 , 0.2 0.4 , 0.6 0.1 , 0.6 0.5 , 0.5
Θ 4 0.9 1.0 , 0.3 0.2 , 0.2 0.2 , 0.6 0.6 , 0.9 1.0 , 0.2 , 0.4 0.8 , 0.6 0.2 , 0.2 0.2 , 0.1 0.5 , 0.6 0.3 , 0.3 0.8 , 0.7 0.2 , 0.8 0.2 0.2 , 0.1 0.2 , 0.6 0.6 , 0.2 1.0 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.4 , 0.4 0.8 , 0.6 0.2 , 0.5 1.0 , 0.3 0.8 , 0.7 0.2 , 0.6
Table 3. Expert-3 information.
Table 3. Expert-3 information.
C ^ 1 C ^ 2
Θ 1 0.4 1.0 , 0.7 1.0 , 0.2 0.9 , 0.4 0.1 , 0.8 , 0.4 1.0 , 0.7 0.3 , 0.2 0.2 , 0.7 0.5 , 0.4 0.3 , 0.5 0.4 , 0.1 0.3 , 0.2 0.2 0.4 , 0.4 0.6 , 0.7 0.7 , 0.4 0.3 , 0.3 0.2 , 0.9 0.3 , 0.6 0.5 , 0.5 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.6 , 0.5 0.4 , 0.5
Θ 2 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.2 0.7 , 0.5 0.2 , 0.4 0.1 , 0.7 0.4 , 0.6 , 0.2 1.0 , 0.8 1.0 , 0.8 0.3 , 0.4 0.7 , 0.4 0.7 0.4 , 0.1 0.6 , 0.5 0.2 , 0.6 0.2 , 0.7 0.3 , 0.4 0.6 , 0.6 0.1 , 0.1 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.8 0.2 , 0.5 0.8 , 0.8 0.3 , 0.1 0.7 , 0.9
Θ 3 0.3 0.1 , 0.4 0.2 , 0.2 0.7 , 0.2 1.0 , 0.8 0.7 , 0.6 0.3 , 0.3 , 0.2 0.4 , 0.5 0.6 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.3 0.4 , 0.6 0.2 , 0.7 0.4 0.8 , 0.6 0.2 , 0.9 0.7 , 0.7 0.3 , 0.2 1.0 , 0.5 , 0.2 0.4 , 0.8 0.6 , 0.1 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.5
Θ 4 0.9 1.0 , 0.3 0.2 , 0.2 0.2 , 0.6 0.6 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.2 , 0.4 1.0 , 0.2 1.0 , 0.3 0.8 , 0.7 0.2 , 0.8 0.2 0.2 , 0.1 0.2 , 0.6 0.6 , 0.2 1.0 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.3 , 0.4 1.0 , 0.2 1.0 , 0.4 0.8 , 0.7 0.2 , 0.7
C ^ 3 C ^ 4
Θ 1 0.1 1.0 , 0.8 1.0 , 0.9 0.7 , 0.4 0.3 , 0.2 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.3 , 0.1 0.7 , 0.8 0.2 1.0 , 0.3 0.6 , 0.4 0.4 , 0.5 0.7 , 0.4 0.3 , 0.5 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.2 0.3 , 0.6 0.4 , 0.1 0.3 , 0.5
Θ 2 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.2 0.7 , 0.4 0.1 , 0.7 0.4 , 0.6 , 0.2 0.5 , 0.7 0.5 , 0.8 1.0 , 0.8 0.3 , 0.2 0.7 , 0.4 0.7 0.4 , 0.1 0.6 , 0.5 0.2 , 0.6 0.2 , 0.7 0.3 , 0.4 0.6 , 0.6 0.1 , 0.1 , 0.7 1.0 , 0.9 1.0 , 0.8 1.0 , 0.9
Θ 3 0.3 0.1 , 0.3 0.9 , 0.2 1.0 , 0.8 0.4 , 0.1 0.6 , 0.1 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.6 , 0.2 0.4 , 0.6 0.5 , 0.9 0.7 0.1 , 0.6 0.9 , 0.1 0.4 , 0.9 0.2 , 0.5 0.2 , 0.2 1.0 , 0.8 , 0.5 0.5 , 0.2 0.5 , 0.8 0.3 , 0.6 0.7 , 0.8 0.4 , 0.6 0.3 , 0.5 0.3 , 0.2
Θ 4 0.9 1.0 , 0.3 0.2 , 0.2 0.2 , 0.6 0.6 , 0.4 0.4 , 0.6 0.6 , 0.7 , 0.4 0.8 , 0.6 0.2 , 0.2 0.2 , 0.1 0.5 , 0.3 0.8 , 0.7 0.2 , 0.3 0.2 0.2 , 0.1 0.2 , 0.6 0.6 , 0.2 1.0 , 0.4 0.1 , 0.6 0.6 , 0.1 0.3 , 0.1 , 0.4 0.6 , 0.2 0.4 , 0.4 0.2 , 0.7 0.1 , 0.6 0.7 , 0.3 0.8 , 0.7 0.2 , 0.9
Table 4. Expert-4 information.
Table 4. Expert-4 information.
C ^ 1 C ^ 2
Θ 1 0.1 0.7 , 0.4 0.3 , 0.8 1.0 , 0.3 0.7 , 0.4 0.1 , 0.6 0.2 , 0.5 , 0.3 1.0 , 0.7 0.3 , 0.7 0.7 , 0.4 0.3 , 0.5 0.7 , 0.5 0.5 0.3 , 0.6 0.7 , 0.6 0.7 , 0.6 0.3 , 0.3 0.7 , 0.4 0.3 , 0.4 , 0.2 1.0 , 0.3 0.3 , 0.6 0.1 , 0.7 0.6 , 0.4 0.3 , 0.1 0.7 , 0.6
Θ 2 0.2 0.3 , 0.6 0.6 , 0.6 0.1 , 0.2 0.7 , 0.5 0.2 , 0.7 0.4 , 0.7 , 0.6 0.4 , 0.4 0.5 , 0.4 0.1 , 0.8 1.0 , 0.3 0.3 , 0.4 0.7 , 0.3 0.7 1.0 , 0.7 0.6 , 0.5 0.4 , 0.7 0.3 , 0.4 0.6 , 0.6 0.1 , 0.2 , 0.2 0.4 , 0.7 0.4 , 0.3 0.2 , 0.9 0.3 , 0.8 0.7 , 0.7 1.0 , 0.8
Θ 3 0.3 0.8 , 0.6 0.2 , 0.2 1.0 , 0.8 0.1 , 0.3 0.8 , 0.1 0.1 , 0.9 , 0.2 0.4 , 0.6 0.6 , 0.2 0.3 , 0.8 0.7 , 0.2 0.4 , 0.6 0.5 , 0.1 0.5 0.8 , 0.6 0.2 , 0.1 0.4 , 0.9 0.4 , 0.5 0.2 , 0.2 1.0 , 0.3 , 0.2 0.4 , 0.6 0.6 , 0.2 1.0 , 0.2 0.4 , 0.6 0.6 , 0.6 0.6 , 0.7
Θ 4 0.9 1.0 , 0.3 0.2 , 0.2 0.2 , 0.6 0.6 , 0.4 0.1 , 0.6 0.6 , 0.2 , 0.4 0.9 , 0.6 0.1 , 0.4 0.5 , 0.3 0.5 , 0.4 1.0 , 0.8 0.3 0.2 , 0.1 0.8 , 0.2 1.0 , 0.4 0.1 , 0.3 0.6 , 0.9 0.3 , 0.4 , 0.4 0.7 , 0.7 0.3 , 0.2 0.2 , 0.4 0.5 , 0.6 0.3 , 0.4 1.0 , 0.6
C ^ 3 C ^ 4
Θ 1 0.7 1.0 , 0.9 1.0 , 0.4 0.5 , 0.4 0.2 , 0.7 0.3 , 0.2 , 0.5 1.0 , 0.3 0.3 , 0.2 0.1 , 0.7 0.6 , 0.5 0.3 , 0.5 0.4 , 0.2 0.3 , 0.8 0.7 0.5 , 0.6 0.5 , 0.8 1.0 , 0.3 0.3 , 0.8 0.3 , 0.6 0.4 , 0.6 , 0.6 1.0 , 0.7 0.3 , 0.8 0.2 , 0.7 0.5 , 0.2 1.0 , 0.4
Θ 2 0.4 0.3 , 0.6 0.6 , 0.6 0.1 , 0.1 0.7 , 0.4 0.3 , 0.7 0.4 , 0.5 , 0.2 0.4 , 0.4 0.6 , 0.5 1.0 , 0.8 0.4 , 0.1 0.6 , 0.5 0.3 1.0 , 0.7 1.0 , 0.1 0.1 , 0.4 0.6 , 0.5 0.3 , 0.8 , 0.2 0.4 , 0.6 0.5 , 0.4 0.1 , 0.8 0.2 , 0.5 0.8 , 0.2 1.0 , 0.2
Θ 3 0.3 0.1 , 0.4 0.2 , 0.2 0.7 , 0.2 1.0 , 0.8 0.4 , 0.6 0.3 , 0.1 0.3 , 0.1 , 0.3 0.6 , 0.4 0.4 , 0.2 0.4 , 0.6 0.6 , 0.2 0.5 , 0.6 0.5 , 0.9 0.2 1.0 , 0.2 0.2 , 0.9 0.2 , 0.3 0.6 , 0.4 0.7 , 0.7 0.3 , 0.1 , 0.5 0.4 , 0.6 0.6 , 0.3 0.8 , 0.4 0.2 , 0.2 1.0 , 0.9
Θ 4 0.8 1.0 , 0.3 0.2 , 0.4 0.3 , 0.6 0.5 , 0.6 1.0 , 0.4 , 0.4 0.8 , 0.6 0.2 , 0.2 0.7 , 0.5 0.3 , 0.3 0.8 , 0.7 0.2 , 0.6 0.2 0.1 , 0.5 0.3 , 0.6 0.6 , 0.7 1.0 , 0.9 1.0 , 0.3 , 0.4 1.0 , 0.8 0.1 , 0.1 0.3 , 0.6 0.6 , 0.6 0.7 , 0.7 0.3 , 0.7
Step 2
Table 5. Integrated matrix of experts evaluations.
Table 5. Integrated matrix of experts evaluations.
C ^ 1 C ^ 2
Θ 1 0.1423 , 0.2345 , 0.1271 , 0.1943 , 0.1739 , 0.2142 0.2391 , 0.2313 , 0.1432 , 0.1876 , 0.2562 , 0.2749
Θ 2 0.2453 , 0.2138 , 0.2763 , 0.2129 , 0.1231 , 0.1689 0.2152 , 0.3248 , 0.2769 , 0.2497 , 0.2296 , 0.2549
Θ 3 0.3163 , 0.2615 , 0.2587 , 0.2559 , 0.2953 , 0.2248 0.2354 , 0.2364 , 0.2968 , 0.2615 , 0.2529 , 0.2246
Θ 4 0.3127 , 0.2655 , 0.1337 , 0.2963 , 0.1917 , 0.1479 0.2409 , 0.2822 , 0.2065 , 0.2607 , 0.2545 , 0.1964
C ^ 3 C ^ 4
Θ 1 0.2198 , 0.2464 , 0.2906 , 0.2431 , 0.2758 , 0.2105 0.2664 , 0.2718 , 0.2684 , 0.2268 , 0.2698 , 0.2064
Θ 2 0.2134 , 0.2365 , 0.2507 , 0.2639 , 0.2756 , 0.2907 0.2170 , 0.2509 , 0.2876 , 0.1494 , 0.1978 , 0.2507
Θ 3 0.2204 , 0.2457 , 0.2316 , 0.2167 , 0.2915 , 0.2807 0.2368 , 0.2134 , 0.2893 , 0.2578 , 0.2722 , 0.2119
Θ 4 0.3104 , 0.2356 , 0.2564 , 0.2458 , 0.2161 , 0.2255 0.3198 , 0.2567 , 0.2718 , 0.2136 , 0.2336 , 0.2748
Step 3a
Table 6. Aggregated values applying CL–PSV–NHFRWA operator.
Table 6. Aggregated values applying CL–PSV–NHFRWA operator.
CL–PSV–NHFRWA Operator ValuesApplying Score Function to Obtain Score Values
Θ 1 0.2528 , 0.7603 , 0.7840 , 0.2505 , 0.8160 , 0.7992 0.0573
Θ 2 0.2358 , 0.7113 , 0.7784 , 0.2402 , 0.7539 , 0.7571 0.0792
Θ 3 0.2331 , 0.7589 , 0.7435 , 0.2440 , 0.7293 , 0.7408 0.0841
Θ 4 0.2513 , 0.7526 , 0.7190 , 0.2076 , 0.7591 , 0.7657 0.0771
Step 4a
Table 7. Ranking of the alternatives by applying PSV–NHFRWA score function.
Table 7. Ranking of the alternatives by applying PSV–NHFRWA score function.
OperatorsScoreBest Alternative
CL-PSV−−NHFRWA S Θ 3 > S Θ 2 > S Θ 4 > S Θ 1 Θ 3
Step 3b
Table 8. Aggregated values applying CL–PSV–NHFRWG operator.
Table 8. Aggregated values applying CL–PSV–NHFRWG operator.
CL–PSV–NHFRWG Operator ValuesApplying Score Function to Obtain Score Values
Θ 1 0.7472 , 0.2397 , 0.2160 , 0.7495 , 0.1840 , 0.2008 0.5803
Θ 2 0.7642 , 0.2887 , 0.2216 , 0.7598 , 0.2461 , 0.2429 0.5774
Θ 3 0.7669 , 0.2411 , 0.2565 , 0.7560 , 0.2707 , 0.2592 0.5926
Θ 4 0.7487 , 0.2474 , 0.2810 , 0.7924 , 0.2409 , 0.2343 0.5896
Step 4b
Table 9. Ranking of the alternatives by applying PSV–NHFRWG score function.
Table 9. Ranking of the alternatives by applying PSV–NHFRWG score function.
OperatorsScoreBest Alternative
CL-PSV−−NHFRWG S Θ 3 > S Θ 4 > S Θ 1 > S Θ 2 Θ 3

6. Symmetric Analysis and Comparison of the Discussions

In this section, we discuss the viability of the suggested process, the flexibility of its aggregation to handle certain inputs and outputs, the impact of score functions, sensitivity analysis, supremacy, and, ultimately, the comparison of the suggested methodology with existing approaches.
The suggested method was precise and suitable for all kinds of input data. The created framework was effective in handling uncertainties. It contained the PHS, RS, and NS spaces using CL. By changing the practical significance of some factors, we could effectively use our model in a variety of scenarios by widening the space between the pleasure and dissatisfaction classes. In several MADM challenges, we encountered a number of elements and input parameters in accordance with the proper circumstances. The recommended CL–PSV–NHFRS was simple, quick to understand, and easily adaptable to many alternatives and qualities.
The suggested methods were reliable and practical to apply to a variety of input and output scenarios. There was no differentiation in the classification of the suggested algorithms because of the various scoring functions. This methodology was more reliable than others, since comparison parameters changed depending on the MADM system conditions and raised grade space.
The single valued neutrosophic hesitant fuzzy set theory is used in a variety of industries and disciplines, including engineering, medicine, and business. The majority of real-world issues require that expert opinions be modeled for any decision-making process. For instance, in certain circumstances, decision-makers are uncertain about each neutrosophic component. Thus, by fusing hesitant and neutrosophic fuzzy theories, a single valued neutrosophic fuzzy set theory is defined. This theory, however, falls short of adequately simulating the scenario in which the probability value of every single valued neutrosophic hesitant component has to be accounted for. This led to the introduction of the probabilistic single-valued neutrosophic hesitant fuzzy set theory; however, it still needs work. After making the necessary changes, we reinvented the idea of a probabilistic single valued neutrosophic hesitant fuzzy rough set. In addition, we presented new algebraic features of the suggested operators, as well as a novel aggregation operator with a confidence level. We used the extended MADM technique based on the CL–PSV–NHFR information suggested in this paper and the method described in [55,56,57], respectively, to demonstrate the applicability and reliability of the theory. Only the strategies we proposed could could handle the type of data currently being collected. We observed that each of our proposed aggregation operators produced identical results, which reflected precision and potency. The purpose of this section of the essay was to demonstrate the superiority and dependability of our original research by comparing it to some existing methodologies. In this section, we contrast our work with that of operators from the SV–NWA [55], SV–NWG [55], SV–NWA Dombi (SV–NDWA) [56], SV–NWG Dombi (SV–NDWG) [56], SV–NRWA [57], and SV–NRWG [57] AOs. Table 10 and Figure 3 provide the overall analysis of the comparitive study.

Advantages

The advantages of the proposed work over the existing work are explained in this section. The advantages of our work are as follows:
i
PSV–NHFRSs utilized SV–NSs, PHFSs and RSs together to address the issue of MCDM information representation. PSV–NHFRSs were, therefore, crucial in explaining ambiguous and partial MCDM data.
ii
Probability with rough sets (PRSs) exhibited fault tolerance, starting from the probability theory and Bayesian processes, to solve the difficulty of MCDM information analysis. As a result, PRSs are crucial for coping with inaccurate and noisy data and could be considered a helpful tool for robust MCDM information analysis.
iii
When faced with practical decision-making challenges, evaluation specialists are typically asked for two types of information: the performance of the assessment objects and knowledge of the evaluation areas (called confidence levels). All currently used methods only consider positive data and lack faith in the experts’ judgement. However, our proposed method, CL–PSV–NHFR AOs, was effective and overcame the difficulties.
iv
As an example of how different CLs were taken into account when making the best decision, it was claimed and shown that PSV–NHFRS were preferable to all existing models.
v
Compared to IFS, PyFS, and SV-NS Einstein, Dombi aggregation operators, CL–PSV–NHFRS AOs were more flexible.
vi
The proposed operators could address every issue discussed in the literature, but when the information was presented in PSV–NHFRSs, current operators were unable to address the issues.
vii
PSV–NHFRSs served as a practical and useful tool for representing different uncertainties in common MCDM scenarios. Indeterminate and incomplete MCDM information could be precisely defined by segmenting the notion of CL into three different sections.
viii
The computational efficiency of information fusion could be greatly improved in MCDM information fusion methods with the use of CL. Additionally, decision risks associated with information fusion procedures could be effectively modeled.

7. Conclusions

Every day, we work with sophisticated and complex data. We created methods and tools for this kind of data in order to operate more effectively and to compute comprehensive information. In order to limit the amount of data to a single value, aggregation incurs fundamental costs. The PSV–NHFRS was designed as a powerful fusion of an SVNRS and PHFS for circumstances where each item has a range of potential values determined by MD, indeterminacy, and non-MD. We suggested operators for CL–PSV–NHFRWA, CL–PSV–NHFRWG, CL–PSV–NHFROWG, and CL–PSV-NHFROWA. A novel MADM strategy was also suggested based on the CL–PSV–NHFRWA and CL–PSV–NHFRWG operators. The benefits of these methods are discussed in more detail below.
1
First, the significant aspects of the CL–PSV–NHFRWG and CL–PSV–NHFRWA operators’ idempotency, commutativity, boundedness, and monotonicity are discussed.
2
Second, it was demonstrated that our suggested operators are more flexible than the earlier operators and we evaluated the flexibility of the suggested AOs to the earlier AOs.
3
Third, the results generated by the CL–PSV–NHFRWA and CL–PSV–NHFRWG operators are accurate and dependable when compared to other existing strategies for MADM problems in a PSV–NHF context, demonstrating their utility in practical situations.
4
The MADM techniques suggested in this paper are further able to recognise more correlation between attributes and alternatives, showing that they have a higher accuracy and a larger setpoint than the methodologies currently in use, which are unable to take into account the inter-relationships of attributes in practical uses. This suggests that even more linkages between traits can be found when applying the MADM techniques described in this study.
5
In order to choose a practical cardiac disease diagnosis technique, the proposed aggregation operators are also used in practise to look at symmetrical analysis.
6
The proposed AOs could be used in future research on personalized individual consistency control consensus problems, consensus reaching with non-cooperative behavior management decision-making problems, and two-sided matching decision-making with multi-granular and incomplete criteria weight information. The levels of participation, abstention, and non-membership are irrelevant to this analysis of the limitations imposed by suggested AOs. A new hybrid structure of prioritized, interactive AOs is being implemented on this side of the planned AOs.
7
In upcoming work, we will investigate the theoretical foundation of CL–PSV–NHFSs for Einstein operations utilizing cutting-edge decision-making techniques, including TOPSIS, VIKOR, TODAM, GRA, and EDAS. We will also discuss how these methods are applied in a variety of fields, such as soft computing, robotics, horticulture, intelligent systems, social sciences, finance, and management of human resources.

Author Contributions

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

Funding

This research was funded by King Khalid University under grant number (R.G.P.1/383/43).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The manuscript includes all the data that were used to support this study.

Acknowledgments

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Small Groups Project under grant number ( R . G . P . 1 / 383 / 43 ) .

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Goguen, J.A.; Zadeh, L.A. Fuzzy sets. Information and control, vol. 8 (1965), 338–353.-LA Zadeh. Similarity relations and fuzzy orderings. Information sciences, vol. 3 (1971), 177–200. J. Symb. Log. 1973, 38, 656–657. [Google Scholar] [CrossRef]
  2. Chang, S.T.; Lu, K.P.; Yang, M.S. Fuzzy change-point algorithms for regression models. IEEE Trans. Fuzzy Syst. 2015, 23, 2343–2357. [Google Scholar] [CrossRef]
  3. Krishankumar, R.; Premaladha, J.; Ravichandran, K.S.; Sekar, K.R.; Manikandan, R.; Gao, X.Z. A novel extension to VIKOR method under intuitionistic fuzzy context for solving personnel selection problem. Soft Comput. 2020, 24, 1063–1081. [Google Scholar] [CrossRef]
  4. Zhou, Q.; Mo, H.; Deng, Y. A new divergence measure of pythagorean fuzzy sets based on belief function and its application in medical diagnosis. Mathematics 2020, 8, 142. [Google Scholar] [CrossRef] [Green Version]
  5. Singh, S.; Garg, H. Distance measures between type-2 intuitionistic fuzzy sets and their application to multicriteria decision-making process. Appl. Intell. 2017, 46, 788–799. [Google Scholar] [CrossRef]
  6. Han, Q.; Li, W.; Lu, Y.; Zheng, M.; Quan, W.; Song, Y. TOPSIS method based on novel entropy and distance measure for linguistic Pythagorean fuzzy sets with their application in multiple attribute decision making. IEEE Access 2019, 8, 14401–14412. [Google Scholar] [CrossRef]
  7. Ali, M.I. Another view on q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 2018, 33, 2139–2153. [Google Scholar] [CrossRef]
  8. Khan, M.J.; Kumam, P.; Deebani, W.; Kumam, W.; Shah, Z. Bi-parametric distance and similarity measures of picture fuzzy sets and their applications in medical diagnosis. Egypt. Inform. J. 2021, 22, 201–212. [Google Scholar] [CrossRef]
  9. Ashraf, S.; Abdullah, S.; Mahmood, T.; Aslam, M. Cleaner production evaluation in gold mines using novel distance measure method with cubic picture fuzzy numbers. Int. J. Fuzzy Syst. 2019, 21, 2448–2461. [Google Scholar] [CrossRef]
  10. Ullah, K.; Garg, H.; Mahmood, T.; Jan, N.; Ali, Z. Correlation coefficients for T-spherical fuzzy sets and their applications in clustering and multi-attribute decision making. Soft Comput. 2020, 24, 1647–1659. [Google Scholar] [CrossRef]
  11. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  12. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  13. Kechris, A. Classical Descriptive Set Theory; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2012; Volume 156. [Google Scholar]
  14. Smarandache, F. Neutrosophic set is a generalization of intuitionistic fuzzy set, inconsistent intuitionistic fuzzy set (picture fuzzy set, ternary fuzzy set), pythagorean fuzzy set, spherical fuzzy set, and q-rung orthopair fuzzy set, while neutrosophication is a generalization of regret theory, grey system theory, and three-ways decision (revisited). J. New Theory 2019, 29, 1–31. [Google Scholar]
  15. Shahbazi, Z.; Byun, Y.C. A procedure for tracing supply chains for perishable food based on blockchain, machine learning and fuzzy logic. Electronics 2020, 10, 41. [Google Scholar] [CrossRef]
  16. Si, A.; Das, S.; Kar, S. Picture fuzzy set-based decision-making approach using Dempster–Shafer theory of evidence and grey relation analysis and its application in COVID-19 medicine selection. Soft Comput. 2021, 5, 1–15. [Google Scholar] [CrossRef] [PubMed]
  17. Costache, R.; Popa, M.C.; Bui, D.T.; Diaconu, D.C.; Ciubotaru, N.; Minea, G.; Pham, Q.B. Spatial predicting of flood potential areas using novel hybridizations of fuzzy decision-making, bivariate statistics, and machine learning. J. Hydrol. 2020, 585, 124808. [Google Scholar] [CrossRef]
  18. Riaz, M.; Saba, M.; Khokhar, M.A.; Aslam, M. Medical diagnosis of nephrotic syndrome using m-polar spherical fuzzy sets. Int. J. Biomath. 2022, 15, 2150094. [Google Scholar] [CrossRef]
  19. Zulqarnain, R.M.; Saeed, M.; Ahamad, M.I.; Abdal, S.; Zafar, Z.; Aslam, M. Application of intuitionistic fuzzy soft matrices for disease diagnosis. Int. J. Discret. Math. 2020, 5, 4–9. [Google Scholar] [CrossRef]
  20. Wu, M.Q.; Chen, T.Y.; Fan, J.P. Similarity measures of T-spherical fuzzy sets based on the cosine function and their applications in pattern recognition. IEEE Access. 2020, 8, 98181–98192. [Google Scholar] [CrossRef]
  21. D’Urso, P.; Leski, J.M. Fuzzy clustering of fuzzy data based on robust loss functions and ordered weighted averaging. FuzzySets Syst. 2020, 389, 1–28. [Google Scholar] [CrossRef]
  22. Fahmi, A.; Abdullah, S.; Amin, F.; Khan, M. Trapezoidal cubic fuzzy number Einstein hybrid weighted averaging operators and its application to decision making. Soft Comput. 2019, 23, 5753–5783. [Google Scholar] [CrossRef]
  23. Alsboui, T.; Hill, R.; Al-Aqrabi, H.; Farid, H.M.A.; Riaz, M.; Iram, S.; Shakeel, H.M.; Hussain, M. A Dynamic Multi-Mobile Agent Itinerary Planning Approach in Wireless Sensor Networks via Intuitionistic Fuzzy Set. Sensors 2022, 22, 8037. [Google Scholar] [CrossRef]
  24. Zulqarnain, R.M.; Xin, X.L.; Siddique, I.; Asghar Khan, W.; Yousif, M.A. TOPSIS method based on correlation coefficient under pythagorean fuzzy soft environment and its application towards green supply chain management. Sustainability 2021, 13, 1642. [Google Scholar] [CrossRef]
  25. Khan, M.J.; Kumam, P.; Liu, P.; Kumam, W.; Ashraf, S. A novel approach to generalized intuitionistic fuzzy soft sets and its application in decision support system. Mathematics 2019, 7, 742. [Google Scholar] [CrossRef] [Green Version]
  26. Zeng, S.; Hussain, A.; Mahmood, T.; Irfan Ali, M.; Ashraf, S.; Munir, M. Covering-based spherical fuzzy rough set model hybrid with TOPSIS for multi-attribute decision-making. Symmetry 2019, 11, 547. [Google Scholar] [CrossRef] [Green Version]
  27. Al-shami, T.M.; Alcantud, J.C.R.; Mhemdi, A. New generalization of fuzzy soft sets:(a, b)-Fuzzy soft sets. AIMS Math. 2023, 8, 2995–3025. [Google Scholar] [CrossRef]
  28. Huang, H.L. New distance measure of single-valued neutrosophic sets and its application. Int. J. Intell. Syst. 2016, 31, 1021–1032. [Google Scholar] [CrossRef] [Green Version]
  29. Şahin, R.; Karabacak, M. A novel similarity measure for single-valued neutrosophic sets and their applications in medical diagnosis, taxonomy, and clustering analysis. In Optimization Theory Based on Neutrosophic and Plithogenic Sets; Academic Press: Cambridge, MA, USA, 2020; pp. 315–341. [Google Scholar]
  30. Guo, Y.; Ashour, A.S. Neutrosophic sets in dermoscopic medical image segmentation. In Neutrosophic Set in Medical Image Analysis; Academic Press: Cambridge, MA, USA, 2019; pp. 229–243. [Google Scholar]
  31. Farid, H.M.A.; Riaz, M. Single-valued neutrosophic Einstein interactive aggregation operators with applications for material selection in engineering design: Case study of cryogenic storage tank. Complex Intell. Syst. 2022, 8, 2131–2149. [Google Scholar] [CrossRef]
  32. Kamran, M.; Nadeem, S.; Ashraf, S.; Alam, A.; Cangul, I.N. Novel Decision Modeling for Manufacturing Sustainability under Single-Valued Neutrosophic Hesitant Fuzzy Rough Aggregation Information. Comput. Intell. Neurosci. 2022, 2022, 7924094. [Google Scholar] [CrossRef]
  33. Kamran, M.; Ashraf, S.; Salamat, N.; Naeem, M.; Botmart, T. Cyber security control selection based decision support algorithm under single valued neutrosophic hesitant fuzzy Einstein aggregation information. AIMS Math. 2023, 8, 5551–5573. [Google Scholar] [CrossRef]
  34. Yang, H.L.; Zhang, C.L.; Guo, Z.L.; Liu, Y.L.; Liao, X. A hybrid model of single valued neutrosophic sets and rough sets: Single valued neutrosophic rough set model. Soft Comput. 2017, 21, 6253–6267. [Google Scholar] [CrossRef]
  35. Liu, Y.L.; Yang, H.L. Further research of single valued neutrosophic rough sets. J. Intell. Fuzzy Syst. 2017, 33, 1467–1478. [Google Scholar] [CrossRef]
  36. Hu, Q.; Zhang, L.; An, S.; Zhang, D.; Yu, D. On robust fuzzy rough set models. IEEE Trans. Fuzzy Syst. 2011, 20, 636–651. [Google Scholar] [CrossRef]
  37. Shao, S.; Zhang, X.; Li, Y.; Bo, C. Probabilistic single-valued (interval) neutrosophic hesitant fuzzy set and its application in multi-attribute decision making. Symmetry 2018, 10, 419. [Google Scholar] [CrossRef] [Green Version]
  38. Li, J.; Wang, J.Q. Multi-criteria outranking methods with hesitant probabilistic fuzzy sets. Cogn. Comput. 2017, 9, 611–625. [Google Scholar] [CrossRef]
  39. Peng, X.; Dai, J. Approaches to single-valued neutrosophic MADM based on MABAC, TOPSIS and new similarity measure with score function. Neural Comput. Appl. 2018, 29, 939–954. [Google Scholar] [CrossRef]
  40. Dubois, D.; Prade, H. Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef]
  41. Zhang, C.; Li, D.; Kang, X.; Liang, Y.; Broumi, S.; Sangaiah, A.K. Multi-attribute group decision making based on multigranulation probabilistic models with interval-valued neutrosophic information. Mathematics 2020, 8, 223. [Google Scholar] [CrossRef] [Green Version]
  42. Al-shami, T.M. (2,1)-Fuzzy sets: Properties, weighted aggregated operators and their applications to multi-criteria decision-making methods. Complex Intell. Syst. 2022, 7, 1–19. [Google Scholar] [CrossRef]
  43. Zhang, C.; Li, D.; Kang, X.; Song, D.; Sangaiah, A.K.; Broumi, S. Neutrosophic fusion of rough set theory: An overview. Comput. Ind. 2020, 115, 103117. [Google Scholar] [CrossRef]
  44. Al-shami, T.M.; Mhemdi, A. Generalized Frame for Orthopair Fuzzy Sets:(m, n)-Fuzzy Sets and Their Applications to Multi-Criteria Decision-Making Methods. Information 2023, 14, 56. [Google Scholar] [CrossRef]
  45. Liu, P.; Ali, Z.; Mahmood, T. Archimedean aggregation operators based on complex Pythagorean fuzzy sets using confidence levels and their application in decision making. Int. J. Fuzzy Syst. 2022, 25, 42–58. [Google Scholar] [CrossRef]
  46. Rahman, K.; Ayub, S.; Abdullah, S. Generalized intuitionistic fuzzy aggregation operators based on confidence levels for group decision making. Granul. Comput. 2021, 6, 867–886. [Google Scholar] [CrossRef]
  47. Zhan, J.; Ali, M.I.; Mehmood, N. On a novel uncertain soft set model: Z-soft fuzzy rough set model and corresponding decision making methods. Appl. Soft Comput. 2017, 56, 446–457. [Google Scholar] [CrossRef]
  48. Wang, J.; Zhang, X. Two types of single valued neutrosophic covering rough sets and an application to decision making. Symmetry 2018, 10, 710. [Google Scholar] [CrossRef] [Green Version]
  49. Saqlain, M.; Jafar, N.; Moin, S.; Saeed, M.; Broumi, S. Single and multi-valued neutrosophic hypersoft set and tangent similarity measure of single valued neutrosophic hypersoft sets. Neutrosophic Sets Syst. 2020, 32, 317–329. [Google Scholar]
  50. Khan, M.A.; Ashraf, S.; Abdullah, S.; Ghani, F. Applications of probabilistic hesitant fuzzy rough set in decision support system. Soft Comput. 2020, 24, 16759–16774. [Google Scholar] [CrossRef]
  51. Şahin, R.; Liu, P. Correlation coefficient of single-valued neutrosophic hesitant fuzzy sets and its applications in decision making. Neural Comput. Appl. 2017, 28, 1387–1395. [Google Scholar] [CrossRef] [Green Version]
  52. Jiao, L.; Yang, H.L.; Li, S.G. Three-way decision based on decision-theoretic rough sets with single-valued neutrosophic information. Int. J. Mach. Learn. Cybern. 2020, 11, 657–665. [Google Scholar] [CrossRef]
  53. Sun, B.; Zhou, X.; Lin, N. Diversified binary relation-based fuzzy multigranulation rough set over two universes and application to multiple attribute group decision making. Inf. Fusion 2020, 55, 91–104. [Google Scholar] [CrossRef]
  54. Wang, C.; Huang, Y.; Ding, W.; Cao, Z. Attribute reduction with fuzzy rough self-information measures. Inf. Sci. 2021, 549, 68–86. [Google Scholar] [CrossRef]
  55. Cui, W.H.; Ye, J.; Xue, J.J.; Hu, K.L. Weighted aggregation operators of single-valued neutrosophic linguistic neutrosophic sets and their decision-making method. Neutrosophic Sets Syst. Int. J. Inf. Sci. Eng. 2022, 51, 21. [Google Scholar]
  56. Saha, A.; Dutta, D.; Broumi, S. Bulbul disaster assessment using single-valued spherical hesitant neutrosophic Dombi weighted aggregation operators. In Neutrosophic Operational Research: Methods and Applications; Springer: Cham, Switzerlans, 2021; pp. 221–243. [Google Scholar]
  57. Rong, Y.; Niu, W.; Garg, H.; Liu, Y.; Yu, L. A hybrid group decision approach based on MARCOS and regret theory for pharmaceutical enterprises assessment under a single-valued neutrosophic scenario. Systems 2022, 10, 106. [Google Scholar] [CrossRef]
Figure 1. Hesitant factors and possibilities that affect the heart.
Figure 1. Hesitant factors and possibilities that affect the heart.
Symmetry 15 00578 g001
Figure 2. Cardiac diseases.
Figure 2. Cardiac diseases.
Symmetry 15 00578 g002
Figure 3. Numerical Comparison.
Figure 3. Numerical Comparison.
Symmetry 15 00578 g003
Table 10. Comparative Analysis.
Table 10. Comparative Analysis.
OperatorsScoreBest Alternative
SV-NWAunable to accessNo result
SV-NWGunable to accessNo result
SV-NDWAunable to accessNo result
SV-NDWGunable to accessNo result
SV-NRWAunable to accessNo result
SV-NRWGunable to accessNo result
CL-PSV-NHFRWA S ( Θ 1 ) = 0.0573
S ( Θ 2 ) = 0.0792
S ( Θ 3 ) = 0.0841
S ( Θ 4 ) = 0.0771
S Θ 3 > S Θ 2 > S Θ 4 > S Θ 1
CL–PSV–NHFRWG S ( Θ 1 ) = 0.5803
S ( Θ 2 ) = 0.5774
S ( Θ 3 ) = 0.5926
S ( Θ 4 ) = 0.5896
S Θ 3 > S Θ 4 > S Θ 1 > S Θ 2
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

Kamran, M.; Ismail, R.; Al-Sabri, E.H.A.; Salamat, N.; Farman, M.; Ashraf, S. An Optimization Strategy for MADM Framework with Confidence Level Aggregation Operators under Probabilistic Neutrosophic Hesitant Fuzzy Rough Environment. Symmetry 2023, 15, 578. https://doi.org/10.3390/sym15030578

AMA Style

Kamran M, Ismail R, Al-Sabri EHA, Salamat N, Farman M, Ashraf S. An Optimization Strategy for MADM Framework with Confidence Level Aggregation Operators under Probabilistic Neutrosophic Hesitant Fuzzy Rough Environment. Symmetry. 2023; 15(3):578. https://doi.org/10.3390/sym15030578

Chicago/Turabian Style

Kamran, Muhammad, Rashad Ismail, Esmail Hassan Abdullatif Al-Sabri, Nadeem Salamat, Muhammad Farman, and Shahzaib Ashraf. 2023. "An Optimization Strategy for MADM Framework with Confidence Level Aggregation Operators under Probabilistic Neutrosophic Hesitant Fuzzy Rough Environment" Symmetry 15, no. 3: 578. https://doi.org/10.3390/sym15030578

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