Next Article in Journal
More Symmetrical Solutions of Quadratic Equations: The Accompanying Variables Method
Previous Article in Journal
On Enumeration and Distance Bounds of Double-Circulant Codes over a Semi-Local Ring
Previous Article in Special Issue
Hybrid Interval Type-2 Fuzzy Set Methodology with Symmetric Membership Function for Application Selection in Precision Agriculture
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Interval-Valued Picture Fuzzy Soft Rough Sets: A New Hybrid Framework for Robust Multi-Criteria Group Decision-Making

by
Reefan Mosallam Almozaini
and
Kholood Mohammad Alsager
*
Department of Mathematics, College of Sciences, Qassim University, Buraydah 52571, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2026, 18(3), 419; https://doi.org/10.3390/sym18030419
Submission received: 18 January 2026 / Revised: 16 February 2026 / Accepted: 24 February 2026 / Published: 28 February 2026

Abstract

This paper introduces a novel hybrid framework called Interval-Valued Picture Fuzzy Soft Rough Sets (IVPFSRS) designed to address complex uncertainty in multi-criteria group decision-making (MCGDM) problems. The model achieves a synergistic integration of three powerful mathematical theories: interval-valued picture fuzzy sets (IVPFS) for representing nuanced, interval-valued degrees of membership, neutrality, and non-membership; soft sets for parameterized problem formulation; and rough sets for handling data granularity and approximation under incompleteness. We formally define the IVPFSRS framework, investigate its fundamental properties and algebraic operations, and develop a comprehensive MCGDM algorithm with explicit weight incorporation to address the critical role of criterion importance. The effectiveness and robustness of the proposed approach are demonstrated through a detailed illustrative example of administrative position selection and a systematic comparative analysis with existing models. Results show that the IVPFSRS framework provides a more powerful, flexible, and logically coherent tool for robust decision making in highly uncertain and information-deficient environments. The proposed framework complements recent advancements in cloud-rough integration for large group decision making while offering unique advantages in parameterized three-way uncertainty representation and structured multi-criteria evaluation.

1. Introduction

In daily life, we encounter many complicated problems involving different types of uncertainties and ambiguities, as well as incomplete information. The classical mathematical tools, based on exact numerical data and deterministic procedures, are generally not suitable to address such issues, due to the problems involved being fuzzy and human in nature. The need for the extension of classical mathematical methodologies to deal with uncertainty in real applications has led to the design of various mathematical theories that can represent and handle imperfect information. Several specific theories were proposed to deal with such difficult questions, for example, intuitionistic fuzzy sets (ifs) theory [1] and rough sets (RS) theory [2,3]. Classical fuzzy sets (FS) were introduced by Zadeh in 1965 [4]. IFS theory, introduced by Atanassov in 1986, generalizes classical fuzzy sets by considering membership and non-membership functions, thus allowing a deeper understanding of uncertainty. On the other hand, RS theory provides an effective tool to handle uncertain and granular information through its approximation space framework. But these theories, despite their strengths, are subject to certain limitations in real-world applications, as was noted by D. Molodtsov [5]. The main limitations are the hardness of parameterization, the difficulty in dealing with hybrid forms of uncertainty, and the limited ability to consider complex real-world problems entailing multiple viewpoints.
In an effort to tackle these issues, Molodtsov developed soft set theory as a new mathematical instrument for managing uncertainties. Soft sets were introduced to overcome the problems of parameterization present in the earlier theories by using a parameterized family of subsets of the universe. This novel methodology enables convenient and comprehensive uncertainty modeling without the rigid mathematical requirement of previously proposed models. The main advantage is that this leads to a revolution in uncertainty modeling since soft sets can be used directly over any universe, and no predefined membership functions or probability distributions are needed.
Then, in light of complementarity of various uncertainty theories, a range of hybrid methods constructed by the combination of several approaches has been proposed by researchers. Such hybrid-based approaches take advantages of fuzzy sets (FS) and rough sets (RS) in the same spirit as presented in [6,7,8]. The combined use of fuzzy sets and rough sets allows one to treat vagueness by a fuzzy membership while incompleteness is addressed by rough approximations. This combination of capabilities is particularly valuable in multi-layered decision problems, where several types of uncertainty emerge and interact.
Based on these seminal contributions, Atanassov greatly generalizes the notion of fuzzy sets by proposing the concept of intuitionistic fuzzy sets (IFS) [1], which changed the game of uncertainty expression via the simultaneous consideration of the degree of non-membership in addition to membership in a crisp traditional manner, subjected to the condition that the sum of these degrees is less than or equal to 1. This key innovation enabled the hesitation and uncertainty in human decision making to be better modeled. Afterwards, Yager further generalizes this idea by defining Pythagorean fuzzy sets (PyFS) [9] based on IFS but relaxing the constraint condition by imposing the upper bound of 1 on the sum of the squared membership and squared non-membership degrees, which works for more general uncertainty.
After these advances, Smarandache [10] proposed a very general generalization by way of neutrosophic sets, which contains a new independent ambiguity parameter stating neutrality and where the sum of the three components (membership, indeterminacy, and non-membership) is no more than 3. This threefold representation gave an even more profound conceptual paradigm to model the intricate nature of uncertainty for real-life applications. It was later adapted to more practical interval-valued and single-valued versions by various researchers [11,12,13], facilitating its application in different fields without losing theoretical strength.
Furthermore, complex hybrid models have also been the subject of intensive study by the community to meet the new demands of uncertainty modeling. These include fuzzy rough sets (FRS) [14,15,16], which combine fuzzy set theory with rough set approximations to treat vagueness as well as granularity; soft rough fuzzy sets (SRFS) [17,18], which marry the parameterization strength of soft sets and the approximation capability of rough sets with the vagueness interpretation of fuzzy sets; and rough neutrosophic sets (RNS) [19], which combine the all-encompassing uncertainty portrayal of neutrosophic sets with the reduction of knowledge in rough sets.
An important milestone in this evolutionary path was reached by Cuong [20], who first introduced a neutral membership function by means of picture fuzzy sets (PFS), where the sum of three degrees (positive membership, neutral membership, and negative membership) is always less than or equal to 1. This expression provided a more natural and psychologically justifiable representation for the decision-making process of individuals who are neutral or hesitant in many matters when making decisions. In past years, PFS and its different generalizations became the subject of much research, such as interval-valued picture fuzzy sets (IVPFS) [21,22], which increased the representational power by allowing one to deal with interval instead of point values; rough picture fuzzy sets (RPFS) [23,24], which merged picture fuzzy sets with rough sets; rough sets of interval-valued fuzzy sets (RS of IVFS) [25], which managed both the interval uncertainty and the granularity of knowledge; and spherical rough sets [26,27], which generalized the geometrical interpretation of uncertainty representation.
Together, these advanced models enable humans to make more complex and realistic decisions with the application of several degrees of membership, non-membership, and neutrality, which can capture more details of the human mind and judgment. The hierarchical and complementary relations between these approaches give the decision-maker the possibility to find the most suitable model according to the nature of the problem and the type of uncertainty involved. As a result, a variety of hybrid approaches and holistic decision frameworks have been proposed and reported in the literature [28,29,30,31,32,33], with each bringing benefits in particular application areas or type of uncertainty.
The recent developments in rough set theory have also extended its application to large and high-dimensional data and complex decisions. Notable developments include the integration of rough sets with cloud models under multi-granularity linguistic environments. These approaches, such as the Rough Integrated Asymmetric Cloud Model [34] and Interval Rough Integrated Cloud Model [35], address challenges in large group decision making by handling linguistic uncertainties and information granularity more effectively. These models combine the approximation capabilities of rough sets with the randomness and fuzziness representation of cloud models, providing robust frameworks for decision making with large numbers of participants and diverse linguistic assessments [36]. While these cloud-based rough set approaches excel in handling linguistic uncertainty and large-scale participation, they often do not explicitly incorporate parameterized soft set structures or the nuanced three-way membership representation of picture fuzzy sets. This observation motivates our integration of interval-valued picture fuzzy sets with soft rough sets, creating a complementary framework that combines parameterized problem formulation with detailed uncertainty representation across positive, neutral, and negative dimensions.
The proposed Interval-Valued Picture Fuzzy Soft Rough Sets (IVPFSRS) is a more generalized concept, and its construction depends on IVPFS, soft sets, and rough sets to tackle decision-making problems. IVPFS enhances the membership presentation by considering intervals so that it can deal with the uncertainty of real-world data, such as varying health statuses of patients, like high fever. Soft sets allow model parameters to be functions of certain features (e.g., symptoms of a disease), without losing the model’s core structure. Rough sets also treat the granularity and incompleteness of data by applying lower and upper approximations to uncertain cases, and this leads to an increase in the diagnostic reliability in that it is for a place where patients cannot be fully identified but are worried by similar symptoms. This best of both worlds methodology provides a powerful instrument to deal with intricate decision-making processes, especially in medical applications.
The IVPFSRS framework thus contributes to this evolving landscape by offering a synthesis that leverages (1) the parameterization flexibility of soft sets, (2) the granularity handling of rough sets, and (3) the comprehensive uncertainty representation of interval-valued picture fuzzy sets. This integration provides a novel approach particularly suited for multi-criteria group decision-making problems where multiple types of uncertainty coexist and parameterized evaluation is essential.
Motivated by this, in this paper, we propose the novel concept of IVPFSRS, which is a combination of IVPF soft sets [21,22] and RS [2,3]. We describe the essential concepts, investigate their characteristics, and provide a realistic method for addressing multi-criteria group decision-making (MCGDM) issues, which is proven with a full illustrative example and comparative analysis.
The organization of this paper is as follows: We give the necessary background definitions in Section 2. Section 3 introduces the IVPFSRS model, its operations, and properties. An algorithm for solving MCGDM issues based on IVPFSRS is presented and illustrated with an example in Section 4. Section 5 presents a comprehensive comparative analysis and discussion, including feature-based comparison, quantitative performance evaluation, statistical significance testing, and practical model selection recommendations. The limitations and scalability analysis are discussed in Section 6, and the paper is concluded in Section 7. As summarized in Table 1, the main symbols and their corresponding meanings used throughout the proposed Interval-Valued Picture Fuzzy Soft Rough Set (IVPFSRS) framework are presented for clarity.

2. Preliminaries

Here, we retrieve the preliminary concepts that are imperative to formulate the existing work.
Definition 1
([4]). A Fuzzy Set (FS) defined over a universe ξ is given by:
ð = ℘ , μ ð ( ℘ ) | ℘ ∈ ξ ,
where μ ð ( ℘ ) ∈ [0, 1] stands for the membership degree.
Definition 2
([1]). An Intuitionistic Fuzzy Set (IFS) defined over a universe ξ is given by:
ð = ℘ , μ ð ( ℘ ) , Ψ ð ( ℘ ) | ℘ ∈ ξ ,
where μ ð ( ℘ ) ∈ [ 0 , 1 ] stands for the membership degree and Ψ ð ( ℘ ) ∈ [ 0 , 1 ] stands for the non-membership degree, and they satisfy the term:
0 ≤ μ ð ( ℘ ) + Ψ ð ( ℘ ) ≤ 1 , ∀ ℘ ∈ ξ .
Definition 3
([9]). A Pythagorean Fuzzy Set (PyFs) defined over the universe ξ is given by:
ð = ℘ , μ ð ( ℘ ) , Ψ ð ( ℘ ) | ℘ ∈ ξ ,
where μ ð ( ℘ ) ∈ [ 0 , 1 ] and Ψ ð ( ℘ ) ∈ [ 0 , 1 ] satisfy the condition:
0 ≤ ( μ ð ( ℘ ) ) 2 + ( Ψ ð ( ℘ ) ) 2 ≤ 1 , ∀ ℘ ∈ ξ .
Definition 4
([20]). A Picture Fuzzy Set (PFS) defined over a universe ξ is given by:
ð = ℘ , μ ð ( ℘ ) , h ð ( ℘ ) , Ψ ð ( ℘ ) | ℘ ∈ ξ ,
where μ ð ( ℘ ) ∈ [ 0 , 1 ] , h ð ( ℘ ) ∈ [ 0 , 1 ] , and Ψ ð ( ℘ ) ∈ [ 0 , 1 ] stand for the degrees of membership, neutrality, and non-membership, respectively.
These functions μ ð , h ð , and Ψ ð satisfy:
0 ≤ μ ð ( ℘ ) + h ð ( ℘ ) + Ψ ð ( ℘ ) ≤ 1 , ∀ ℘ ∈ ξ .
Definition 5.
An Interval-Valued Picture Fuzzy Set (IVPFS) ð over a universe ξ is given as:
ð = ℘ , [ μ ð L ( ℘ ) , μ ð U ( ℘ ) ] , [ h ð L ( ℘ ) , h ð U ( ℘ ) ] , [ Ψ ð L ( ℘ ) , Ψ ð U ( ℘ ) ] | ℘ ∈ ξ ,
where the following conditions hold:
0 ≤ μ ð L ( ℘ ) ≤ μ ð U ( ℘ ) ≤ 1 ,
0 ≤ h ð L ( ℘ ) ≤ h ð U ( ℘ ) ≤ 1 ,
0 ≤ Ψ ð L ( ℘ ) ≤ Ψ ð U ( ℘ ) ≤ 1 ,
and μ ð U ( ℘ ) + h ð U ( ℘ ) + Ψ ð U ( ℘ ) ≤ 1 .
Definition 6
([5]). Consider a universal ξ and let A ⊆ Γ be a subset of the parameter set Γ. Let the power set of ξ be denoted by P ( ξ ) . Then the structure ( V , ð ) is presented as a soft set over ξ, where the function V is given by:
V : ð → P ( ξ ) .
Definition 7.
Consider a universal ξ and let Γ be the parameter set. We denote by IVPFS ( ξ ) the collection of all interval-valued picture fuzzy sets on ξ, and assume ð ⊆ Γ . The structure ( V , ð ) is defined as an IVPFSS over ξ where the function V is defined as:
V : ð → IVPFS ( ξ ) .
Definition 8.
Let a binary relation Φ be defined over the universe ξ where Φ ∈ IVPFS ( ξ × ξ ) . Then we say that:
(i) 
Φ is reflexive if
μ Φ ( ℘ , ℘ ) = 1 , h Φ ( ℘ , ℘ ) = 0 , Ψ Φ ( ℘ , ℘ ) = 0 , ∀ ℘ ∈ ξ .
(ii) 
Φ is symmetric if
μ Φ ( ℘ , ð ) = μ Φ ( ð , ℘ ) , h Φ ( ℘ , ð ) = h Φ ( ð , ℘ ) , Ψ Φ ( ℘ , ð ) = Ψ Φ ( ð , ℘ ) , ∀ ( ℘ , ð ) ∈ ξ × ξ .
(iii) 
Φ is transitive if
μ Φ ( ℘ , κ ¯ ) ≥ ⋁ ð ∈ ξ μ Φ ( ℘ , ð ) ∧ μ Φ ( ð , κ ¯ )
h Φ ( ℘ , κ ¯ ) = ⋀ ð ∈ ξ h Φ ( ℘ , ð ) ∨ h Φ ( ð , κ ¯ )
and
Ψ Φ ( ℘ , κ ¯ ) = ⋀ ð ∈ ξ Ψ Φ ( ℘ , ð ) ∨ Ψ Φ ( ð , κ ¯ )
Definition 9.
Consider an equivalence relation Φ defined over the universe ξ. The structure ( ξ , Φ ) is called a Pawlak approximation space. The equivalence class for a given element ℘ ∈ ξ , defined under Φ, is denoted [ ℘ ] Φ . For a subset Ω ⊆ ξ , the lower and upper approximations Φ ¯ ( Ω ) and Φ ¯ ( Ω ) of Ω over the approximation space ( ξ , Φ ) are defined as follows:
Φ ¯ ( Ω ) = { ℘ ∈ ξ : [ ℘ ] Φ ⊆ Ω } ,
Φ ¯ ( Ω ) = { ℘ ∈ ξ : [ ℘ ] Φ ∩ Ω ≠ ∅ } .
If Φ ¯ ( Ω ) = Φ ¯ ( Ω ) , then we call Ω definable; or else; it is defined as a rough set.
Definition 10.
Consider a universal set ξ that is not empty, and let an equivalence relation Φ be defined over ξ. Assume a picture fuzzy set ð defined on ξ. We define the lower and upper approximations Φ ¯ ( ð ) , Φ ¯ ( ð ) with respect to ( ξ , Φ ) , as follows:
Φ ¯ ( ð ) = 〈 ℘ , μ Φ ¯ ( ð ) ( ℘ ) , h Φ ¯ ( ð ) ( ℘ ) , Ψ Φ ¯ ( ð ) ( ℘ ) 〉 ∣ ℘ ∈ ξ
Φ ¯ ( ð ) = 〈 ℘ , μ Φ ¯ ( ð ) ( ℘ ) , h Φ ¯ ( ð ) ( ℘ ) , Ψ Φ ¯ ( ð ) ( ℘ ) 〉 ∣ ℘ ∈ ξ
where:
μ Φ ¯ ( ð ) ( ℘ ) = ⋁ ω ∈ [ ℘ ] Φ μ ð ( ω ) , h Φ ¯ ( ð ) ( ℘ ) = ⋀ ω ∈ [ ℘ ] Φ h ð ( ω ) , Ψ Φ ¯ ( ð ) ( ℘ ) = ⋀ ω ∈ [ ℘ ] Φ Ψ ð ( ω )
μ Φ ¯ ( ð ) ( ℘ ) = ⋀ ω ∈ [ ℘ ] Φ μ ð ( ω ) , h Φ ¯ ( ð ) ( ℘ ) = ⋀ ω ∈ [ ℘ ] Φ h ð ( ω ) , Ψ Φ ¯ ( ð ) ( ℘ ) = ⋁ ω ∈ [ ℘ ] Φ Ψ ð ( ω )
We can easily confirm that Φ ¯ ( ð ) and Φ ¯ ( ð ) are picture fuzzy sets defined over ξ.
Thus, the corresponding mappings can be written as:
Φ ¯ , Φ ¯ : P F S ( ξ ) → P F S ( ξ ) .
These mappings are denoted as the upper and lower picture fuzzy approximations, respectively. The structure ( Φ ¯ ( ð ) , Φ ¯ ( ð ) ) is defined as the rough picture fuzzy set of ð.

3. Interval-Valued Picture Fuzzy Soft Rough Sets

This section introduces the interval-valued picture fuzzy soft rough sets (IVPFSRS) by synergistically integrating interval-valued picture fuzzy soft sets (IVPFSS) with rough set (RS) theory, establishing fundamental properties and operations for the approximation operators. While recent cloud-rough integration models [34,35] have advanced large group decision making in linguistic environments, our IVPFSRS framework addresses distinct challenges: parameterized evaluation in structured decision problems and comprehensive uncertainty representation across three membership dimensions (positive, neutral, negative). The conceptual integration of fuzzy, soft, and rough theories is schematically illustrated in Figure 1, which presents the structural architecture of the proposed IVPFSRS framework.
Definition 11.
Consider a universal set ξ and a parameter set Γ. Consider an IVPFSS relation Φ ∈ I V P F S S ( ξ × Γ ) . The structure ( ξ , Γ , Φ ) forms an IVPF rough approximation space. For a given ð ∈ I V P F ( Γ ) with membership function μ ð , neutral function h ð , and nonmembership function Ψ ð , we define the upper and lower IVPFS approximations as follows:
Φ ¯ ( ð ) = ℘ , [ μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) ] , [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] , [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ] ∣ ℘ ∈ ξ
Φ ¯ ( ð ) = ℘ , [ μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) ] , [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] , [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ] ∣ ℘ ∈ ξ
where the interval-valued membership degrees are calculated as:
μ Φ ¯ ( ð ) L ( ℘ ) = ⋁ ι ∈ Γ μ Φ L ( ℘ , ι ) ∧ μ ð L ( ι )
μ Φ ¯ ( ð ) U ( ℘ ) = ⋁ ι ∈ Γ μ Φ U ( ℘ , ι ) ∧ μ ð U ( ι )
h Φ ¯ ( ð ) L ( ℘ ) = ⋀ ι ∈ Γ h Φ L ( ℘ , ι ) ∨ h ð L ( ι )
h Φ ¯ ( ð ) U ( ℘ ) = ⋀ ι ∈ Γ h Φ U ( ℘ , ι ) ∨ h ð U ( ι )
Ψ Φ ¯ ( ð ) L ( ℘ ) = ⋀ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∨ Ψ ð L ( ι )
Ψ Φ ¯ ( ð ) U ( ℘ ) = ⋀ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∨ Ψ ð U ( ι )
μ Φ ¯ ( ð ) L ( ℘ ) = ⋀ ι ∈ Γ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι )
μ Φ ¯ ( ð ) U ( ℘ ) = ⋀ ι ∈ Γ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι )
h Φ ¯ ( ð ) L ( ℘ ) = ⋀ ι ∈ Γ h Φ L ( ℘ , ι ) ∨ h ð L ( ι )
h Φ ¯ ( ð ) U ( ℘ ) = ⋀ ι ∈ Γ h Φ U ( ℘ , ι ) ∨ h ð U ( ι )
Ψ Φ ¯ ( ð ) L ( ℘ ) = ⋁ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι )
Ψ Φ ¯ ( ð ) U ( ℘ ) = ⋁ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι )
and they satisfy:
0 ≤ μ Φ ¯ ( ð ) U ( ℘ ) + h Φ ¯ ( ð ) U ( ℘ ) + Ψ Φ ¯ ( ð ) U ( ℘ ) ≤ 1 , 0 ≤ μ Φ ¯ ( ð ) U ( ℘ ) + h Φ ¯ ( ð ) U ( ℘ ) + Ψ Φ ¯ ( ð ) U ( ℘ ) ≤ 1
where Φ ¯ ( ð ) and Φ ¯ ( ð ) are known as the lower and upper soft rough approximation mappings corresponding to interval-valued picture fuzzy sets. When Φ ¯ ( ð ) = Φ ¯ ( ð ) , the set ð is definable; if not, it is termed an IVPFS rough set. We denote by Φ ¯ ( ð ) , Φ ¯ ( ð ) an (IVPFS) soft rough set.
Remark 1.
Consider the triplet ( ξ , Γ , Φ ) and let ð ∈ I V I F ( Γ ) ; we define Φ ¯ ( ð ) and Φ ¯ ( ð ) as follows:
Φ ¯ ( ð ) = ℘ , μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) , Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ∣ ℘ ∈ ξ , Φ ¯ ( ð ) = ℘ , μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) , Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ∣ ℘ ∈ ξ
where
μ Φ ¯ ( ð ) L ( ℘ ) = ⋁ ι ∈ Γ μ Φ L ( ℘ , ι ) ∧ μ ð L ( ι ) , μ Φ ¯ ( ð ) U ( ℘ ) = ⋁ ι ∈ Γ μ Φ U ( ℘ , ι ) ∧ μ ð U ( ι ) , Ψ Φ ¯ ( ð ) L ( ℘ ) = ⋀ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∨ Ψ ð L ( ι ) , Ψ Φ ¯ ( ð ) U ( ℘ ) = ⋀ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∨ Ψ ð U ( ι ) , μ Φ ¯ ( ð ) L ( ℘ ) = ⋀ ι ∈ Γ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι ) , μ Φ ¯ ( ð ) U ( ℘ ) = ⋀ ι ∈ Γ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι ) , Ψ Φ ¯ ( ð ) L ( ℘ ) = ⋁ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι ) , Ψ Φ ¯ ( ð ) U ( ℘ ) = ⋁ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι )
and they have the terms:
0 ≤ μ Φ ¯ ( ð ) U ( ℘ ) + Ψ Φ ¯ ( ð ) U ( ℘ ) ≤ 1 , 0 ≤ μ Φ ¯ ( ð ) U ( ℘ ) + Ψ Φ ¯ ( ð ) U ( ℘ ) ≤ 1
ð is said to be definable if Φ ¯ ( ð ) = Φ ¯ ( ð ) . If not, it is called an (IVI) soft rough set.
Remark 2.
Consider the triplet ( ξ , Γ , Φ ) and let ð ∈ I V P y F ( Γ ) ; we define Φ ¯ ( ð ) and Φ ¯ ( ð ) as in the above remark, where the interval-valued membership degrees have the following conditions:
0 ≤ μ Φ ¯ ( ð ) U ( ℘ ) 2 + Ψ Φ ¯ ( ð ) U ( ℘ ) 2 ≤ 1 , 0 ≤ μ Φ ¯ ( ð ) U ( ℘ ) 2 + Ψ Φ ¯ ( ð ) U ( ℘ ) 2 ≤ 1
under this condition ð is said to be definable if Φ ¯ ( ð ) = Φ ¯ ( ð ) . If not, it is called an IVPyF soft rough set.
Example 1.
Consider a scenario where a decision maker is evaluating four different cars, represented by the set ξ = { ℘ 1 , ℘ 2 , ℘ 3 , ℘ 4 } . Assume the parameter set Γ = { ι 1 , ι 2 , ι 3 } = { expensive , stylish , fuel-efficient } . Let us define ( ξ , Γ , Φ ) as an IVPFSS approximation space with Φ ∈ IVPFSS ( ξ × Γ ) presented in Table 2.
The table represents the IVPFSS relation Φ from four cars ( ℘ 1 – ℘ 4 ) to three criteria of evaluation. Each cell is filled with interval-valued membership, neutrality, and non-membership degrees that reflect expert opinions.
Now, consider the ideal decision object ð, as determined by the decision maker, is given by:
ð = 〈 ι 1 [ 0.4 , 0.55 ] , [ 0.10 , 0.35 ] , [ 0.50 , 0.10 ] 〉 , 〈 ι 2 [ 0.20 , 0.30 ] , [ 0.10 , 0.15 ] , [ 0.30 , 0.45 ] 〉 , 〈 ι 3 [ 0.40 , 0.60 ] , [ 0.05 , 0.10 ] , [ 0.15 , 0.20 ] 〉
We have
μ Φ ¯ ( ð ) L ( ℘ 1 ) = ( 0.10 ∧ 0.40 ) ∨ ( 0.30 ∧ 0.20 ) ∨ ( 0.20 ∧ 0.40 ) = 0.20 μ Φ ¯ ( ð ) U ( ℘ 1 ) = ( 0.25 ∧ 0.55 ) ∨ ( 0.35 ∧ 0.30 ) ∨ ( 0.30 ∧ 0.60 ) = 0.30 h Φ ¯ ( ð ) L ( ℘ 1 ) = ( 0.30 ∨ 0.10 ) ∧ ( 0.25 ∨ 0.10 ) ∧ ( 0.50 ∨ 0.05 ) = 0.25 h Φ ¯ ( ð ) U ( ℘ 1 ) = ( 0.35 ∨ 0.35 ) ∧ ( 0.45 ∨ 0.15 ) ∧ ( 0.60 ∨ 0.10 ) = 0.35 Ψ Φ ¯ ( ð ) L ( ℘ 1 ) = ( 0.20 ∨ 0.05 ) ∧ ( 0.05 ∨ 0.30 ) ∧ ( 0.05 ∨ 0.15 ) = 0.15 Ψ Φ ¯ ( ð ) U ( ℘ 1 ) = ( 0.40 ∨ 0.10 ) ∧ ( 0.10 ∨ 0.45 ) ∧ ( 0.10 ∨ 0.20 ) = 0.20
μ Φ ¯ ( ð ) L ( ℘ 1 ) = 0.30 , μ Φ ¯ ( ð ) U ( ℘ 1 ) = 0.35 , h Φ ¯ ( ð ) L ( ℘ 1 ) = 0.25 , h Φ ¯ ( ð ) U ( ℘ 1 ) = 0.35 , Ψ Φ ¯ ( ð ) L ( ℘ 1 ) = 0.05 , Ψ Φ ¯ ( ð ) U ( ℘ 1 ) = 0.10 μ Φ ¯ ( ð ) L ( ℘ 2 ) = 0.25 , μ Φ ¯ ( ð ) U ( ℘ 2 ) = 0.40 , h Φ ¯ ( ð ) L ( ℘ 2 ) = 0.30 , h Φ ¯ ( ð ) U ( ℘ 2 ) = 0.30 , Ψ Φ ¯ ( ð ) L ( ℘ 2 ) = 0.15 , Ψ Φ ¯ ( ð ) U ( ℘ 2 ) = 0.20 μ Φ ¯ ( ð ) L ( ℘ 2 ) = 0.20 , μ Φ ¯ ( ð ) U ( ℘ 2 ) = 0.30 , h Φ ¯ ( ð ) L ( ℘ 2 ) = 0.30 , h Φ ¯ ( ð ) U ( ℘ 2 ) = 0.30 , Ψ Φ ¯ ( ð ) L ( ℘ 2 ) = 0.15 , Ψ Φ ¯ ( ð ) U ( ℘ 2 ) = 0.25 μ Φ ¯ ( ð ) L ( ℘ 3 ) = 0.40 , μ Φ ¯ ( ð ) U ( ℘ 3 ) = 0.50 , h Φ ¯ ( ð ) L ( ℘ 3 ) = 0.10 , h Φ ¯ ( ð ) U ( ℘ 3 ) = 0.15 , Ψ Φ ¯ ( ð ) L ( ℘ 3 ) = 0.05 , Ψ Φ ¯ ( ð ) U ( ℘ 3 ) = 0.15 μ Φ ¯ ( ð ) L ( ℘ 3 ) = 0.40 , μ Φ ¯ ( ð ) U ( ℘ 3 ) = 0.55 , h Φ ¯ ( ð ) L ( ℘ 3 ) = 0.10 , h Φ ¯ ( ð ) U ( ℘ 3 ) = 0.15 , Ψ Φ ¯ ( ð ) L ( ℘ 3 ) = 0.15 , Ψ Φ ¯ ( ð ) U ( ℘ 3 ) = 0.25 μ Φ ¯ ( ð ) L ( ℘ 4 ) = 0.40 , μ Φ ¯ ( ð ) U ( ℘ 4 ) = 0.55 , h Φ ¯ ( ð ) L ( ℘ 4 ) = 0.05 , h Φ ¯ ( ð ) U ( ℘ 4 ) = 0.10 , Ψ Φ ¯ ( ð ) L ( ℘ 4 ) = 0.15 , Ψ Φ ¯ ( ð ) U ( ℘ 4 ) = 0.20 μ Φ ¯ ( ð ) L ( ℘ 4 ) = 0.20 , μ Φ ¯ ( ð ) U ( ℘ 4 ) = 0.30 , h Φ ¯ ( ð ) L ( ℘ 4 ) = 0.05 , h Φ ¯ ( ð ) U ( ℘ 4 ) = 0.10 , Ψ Φ ¯ ( ð ) L ( ℘ 4 ) = 0.30 , Ψ Φ ¯ ( ð ) U ( ℘ 4 ) = 0.40
Table 3 below illustrates the calculated interval-valued picture fuzzy soft rough approximations Φ ¯ ( A ˜ ) for each alternative, obtained based on the defined IVPFSS relations.
Table 4 below shows the corresponding interval-valued picture fuzzy soft rough approximations Φ ( A ˜ ) , providing the upper bounds of uncertainty for each evaluated alternative.
Definition 12.
Assume that Φ ¯ ( ð ) and Φ ¯ ( ð ) represent the lower and the upper soft rough approximations over interval-valued picture fuzzy sets. We define the following algebraic operations:
i. 
Algebraic sum operation (⊕):
Φ ¯ ( ð ) ⊕ Φ ¯ ( ð ) = { 〈 ℘ , [ 1 − ( 1 − μ Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − μ Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − μ Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − μ Φ ¯ ( ð ) U ( ℘ ) ) ] , h Φ ¯ ( ð ) L ( ℘ ) h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) h Φ ¯ ( ð ) U ( ℘ ) , Ψ Φ ¯ ( ð ) L ( ℘ ) Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) Ψ Φ ¯ ( ð ) U ( ℘ ) 〉 ∣ ℘ ∈ ξ }
ii. 
Algebraic product operation (⊗):
Φ ¯ ( ð ) ⊗ Φ ¯ ( ð ) = { 〈 ℘ , μ Φ ¯ ( ð ) L ( ℘ ) μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) μ Φ ¯ ( ð ) U ( ℘ ) , [ 1 − ( 1 − h Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − h Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − h Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − h Φ ¯ ( ð ) U ( ℘ ) ) ] , [ 1 − ( 1 − Ψ Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − Ψ Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − Ψ Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − Ψ Φ ¯ ( ð ) U ( ℘ ) ) ] 〉 ∣ ℘ ∈ ξ }
Table 5 below presents the aggregated results of Φ ¯ ( A ˜ ) ⊕ Φ ( A ˜ ) , representing the combined upper and lower approximations through the defined fuzzy addition operation.
This table presents the aggregated results from combining upper and lower approximations using algebraic sum operation. The data corresponds to the car evaluation scenario in Table 2, with ð  representing the ideal car profile.
Therefore, ℘ 3 is identified as the best choice, as it has the highest membership value at 0.77 and the lowest non-membership value at 0.007 .
Table 6 below displays the results of Φ ¯ ( A ˜ ) ⊗ Φ ( A ˜ ) , illustrating the intersection operation of the interval-valued picture fuzzy soft rough approximations and supporting the decision analysis.
This table presents the aggregated results from combining upper and lower approximations using algebraic product operation. The data corresponds to the car evaluation scenario in Table 2, with ð representing the ideal car profile.
We note that ℘ 3 is still the ideal decision.
Hence, the decision maker will purchase car ℘ 3 .
Definition 13.
Let Φ ( ð ) = ( Φ ¯ ( ð ) , Φ ¯ ( ð ) ) be an IVPF soft rough number. We denote by ∼ Φ ( ð ) = ( Φ ¯ ( ð ) c , Φ ¯ ( ð ) c ) the complement of the IVPF soft rough number, where Φ ¯ ( ð ) c , Φ ¯ ( ð ) c are referred to as the complements of Φ ¯ ( ð ) and Φ ¯ ( ð ) , respectively, and they are defined as follows:
Φ ¯ ( ð ) c = ℘ , [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ] , [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] , [ μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) ] ∣ ℘ ∈ ξ , Φ ¯ ( ð ) c = ℘ , [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ] , [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] , [ μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) ] ∣ ℘ ∈ ξ .
Definition 14.
Consider two IVPF soft rough numbers Φ ( ð 1 ) and Φ ( ð 2 ) . Then we define the following extended algebraic operations:
(i) 
Algebraic sum (⊕):
Φ ( ð 1 ) ⊕ Φ ( ð 2 ) = ( μ Φ ¯ ( ð 1 ) L + μ Φ ¯ ( ð 2 ) L − μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U + μ Φ ¯ ( ð 2 ) U − μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U , h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U , Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U , μ Φ ¯ ( ð 1 ) L + μ Φ ¯ ( ð 2 ) L − μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U + μ Φ ¯ ( ð 2 ) U − μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U , h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U , Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U )
(ii) 
Algebraic product (⊗):
Φ ( ð 1 ) ⊗ Φ ( ð 2 ) = ( μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U , h Φ ¯ ( ð 1 ) L + h Φ ¯ ( ð 2 ) L − h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U + h Φ ¯ ( ð 2 ) U − h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U , Ψ Φ ¯ ( ð 1 ) L + Ψ Φ ¯ ( ð 2 ) L − Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U + Ψ Φ ¯ ( ð 2 ) U − Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U , μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U , h Φ ¯ ( ð 1 ) L + h Φ ¯ ( ð 2 ) L − h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U + h Φ ¯ ( ð 2 ) U − h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U , Ψ Φ ¯ ( ð 1 ) L + Ψ Φ ¯ ( ð 2 ) L − Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U + Ψ Φ ¯ ( ð 2 ) U − Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U )
(iii) 
Scalar multiplication ( o ^ Φ ( ð 1 ) ):
o ^ Φ ( ð 1 ) = ( 1 − ( 1 − μ Φ ¯ ( ð 1 ) L ) o ^ , 1 − ( 1 − μ Φ ¯ ( ð 1 ) U ) o ^ , ( h Φ ¯ ( ð 1 ) L ) o ^ , ( h Φ ¯ ( ð 1 ) U ) o ^ , ( Ψ Φ ¯ ( ð 1 ) L ) o ^ , ( Ψ Φ ¯ ( ð 1 ) U ) o ^ ) , ( 1 − ( 1 − μ Φ ¯ ( ð 1 ) L ) o ^ , 1 − ( 1 − μ Φ ¯ ( ð 1 ) U ) o ^ , ( h Φ ¯ ( ð 1 ) L ) o ^ , ( h Φ ¯ ( ð 1 ) U ) o ^ , ( Ψ Φ ¯ ( ð 1 ) L ) o ^ , ( Ψ Φ ¯ ( ð 1 ) U ) o ^ ) ) , o ^ > 0 .
(iv) 
Power operation ( ( Φ ( ð 1 ) ) o ^ ):
Φ ( ð 1 ) o ^ = ( ( μ Φ ¯ ( ð 1 ) L ) o ^ , ( μ Φ ¯ ( ð 1 ) U ) o ^ , 1 − ( 1 − h Φ ¯ ( ð 1 ) L ) o ^ , 1 − ( 1 − h Φ ¯ ( ð 1 ) U ) o ^ , 1 − ( 1 − Ψ Φ ¯ ( ð 1 ) L ) o ^ , 1 − ( 1 − Ψ Φ ¯ ( ð 1 ) U ) o ^ ) , ( ( μ Φ ¯ ( ð 1 ) L ) o ^ , ( μ Φ ¯ ( ð 1 ) U ) o ^ , 1 − ( 1 − h Φ ¯ ( ð 1 ) L ) o ^ , 1 − ( 1 − h Φ ¯ ( ð 1 ) U ) o ^ , 1 − ( 1 − Ψ Φ ¯ ( ð 1 ) L ) o ^ , 1 − ( 1 − Ψ Φ ¯ ( ð 1 ) U ) o ^ ) ) , o ^ > 0 .
Example 2.
Let Φ ( ð 1 ) = ( Φ ¯ ( ð 1 ) , Φ ¯ ( ð 1 ) ) and Φ ( ð 2 ) = ( Φ ¯ ( ð 2 ) , Φ ¯ ( ð 2 ) ) where Φ ¯ ( ð 1 ) , Φ ¯ ( ð 1 ) , Φ ¯ ( ð 2 ) , Φ ¯ ( ð 2 ) are given as below:
Table 7 below contains the interval-valued picture fuzzy soft rough number Φ ( A ˜ 1 ) , including the lower approximations for the corresponding alternatives.
Table 8 below presents the upper approximations Φ ( A ˜ 1 ) associated with the same dataset as in Table 7, allowing for comparison of the corresponding uncertainty levels.
Table 9 below provides the interval-valued picture fuzzy soft rough number Φ ( A ˜ 2 ) , which defines the lower approximations for the second evaluated dataset.
Table 10 below shows the upper approximations Φ ( A ˜ 2 ) corresponding to Table 9, facilitating comparative analysis between the two soft rough numbers.
Now we will calculate Φ ( ð 1 ) ⊕ Φ ( ð 2 ) and Φ ( ð 1 ) ⊗ Φ ( ð 2 ) based on the formulations given in Definition 14.
Table 11 below displays the results of the fuzzy addition operation Φ ( A ˜ 1 ) ⊕ Φ ( A ˜ 2 ) , showing the combined membership, neutrality, and non-membership intervals for each alternative.
Table 12 below presents another set of results for Φ ( A ˜ 1 ) ⊕ Φ ( A ˜ 2 ) , demonstrating the consistency of addition-based aggregation under different interval conditions.
Table 13 presents the results of the multiplication run Φ ( A ˜ 1 ) ⊗ Φ ( A ˜ 2 ) , demonstrating the interaction effect of fuzzy parameters on the result approximations.
Table 14 below provides additional results for Φ ( A ˜ 1 ) ⊗ Φ ( A ˜ 2 ) , used to validate the multiplicative fusion of two IVPFSR numbers and analyze their comparative performance.
Definition 15.
Consider two IVPF soft rough numbers Φ ( ð 1 ) = ( Φ ¯ ( ð 1 ) , Φ ¯ ( ð 1 ) ) , Φ ( ð 2 ) = ( Φ ¯ ( ð 2 ) , Φ ¯ ( ð 2 ) ) . Then we define the following statements:
(i) 
Φ ( ð 1 ) ⊆ Φ ( ð 2 ) = Φ ¯ ( ð 1 ) ⊆ Φ ¯ ( ð 2 ) and Φ ¯ ( ð 1 ) ⊆ Φ ¯ ( ð 2 )
(ii) 
Φ ( ð 1 ) = Φ ( ð 2 ) iff Φ ( ð 1 ) ⊆ Φ ( ð 2 ) and Φ ( ð 2 ) = Φ ( ð 1 )
(iii) 
Φ ( ð 1 ) ∪ Φ ( ð 2 ) = Φ ¯ ( ð 1 ) ∪ Φ ¯ ( ð 2 ) , Φ ¯ ( ð 1 ) ∪ Φ ¯ ( ð 2 )
(iv) 
Φ ( ð 1 ) ∩ Φ ( ð 2 ) = Φ ¯ ( ð 1 ) ∩ Φ ¯ ( ð 2 ) , Φ ¯ ( ð 1 ) ∩ Φ ¯ ( ð 2 )
Theorem 1.
Consider an IVPF soft approximation space ( ξ , Γ , Φ ) , and let ð , λ ∈ IVPF ( Γ ) . Thus, we have the following statements:
1. 
Φ ¯ ( ∅ ) = ∅ = Φ ¯ ( ∅ )
2. 
Φ ¯ ( ξ ) = ξ = Φ ¯ ( ξ )
3. 
If ð ⊆ λ , then Φ ¯ ( ð ) ⊆ Φ ¯ ( λ )
4. 
If ð ⊆ λ , then Φ ¯ ( ð ) ⊆ Φ ¯ ( λ )
5. 
Φ ¯ ( ð ∩ λ ) = Φ ¯ ( ð ) ∩ Φ ¯ ( λ )
6. 
Φ ¯ ( ð ∪ λ ) = Φ ¯ ( ð ) ∪ Φ ¯ ( λ )
7. 
Φ ¯ ( ð ) = ∼ Φ ¯ ( ∼ ð )
8. 
Φ ¯ ( ð ) = ∼ Φ ¯ ( ∼ ð )
where ∼ ð is the complement of ð.
Proof. 
(1)–(4) are straightforward.
(5)
We have
Φ ¯ ( ð ) = { ℘ , ⋀ ι ∈ Γ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι ) , ⋀ ι ∈ Γ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι ) , ⋀ ι ∈ Γ h Φ L ( ℘ , ι ) ∨ h ð L ( ι ) , ⋀ ι ∈ Γ h Φ U ( ℘ , ι ) ∨ h ð U ( ι ) , ⋁ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι ) , ⋁ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι ) 〉 ∣ ℘ ∈ ξ }
Φ ¯ ( λ ) = { ℘ , ⋀ ι ∈ Γ μ ð L ( ℘ , ι ) ∨ μ λ L ( ι ) , ⋀ ι ∈ Γ μ ð U ( ℘ , ι ) ∨ μ λ U ( ι ) , ⋀ ι ∈ Γ h ð L ( ℘ , ι ) ∨ h λ L ( ι ) , ⋀ ι ∈ Γ h ð U ( ℘ , ι ) ∨ h λ U ( ι ) , ⋁ ι ∈ Γ Ψ ð L ( ℘ , ι ) ∧ Ψ λ L ( ι ) , ⋁ ι ∈ Γ Ψ ð U ( ℘ , ι ) ∧ Ψ λ U ( ι ) 〉 ∣ ℘ ∈ ξ }
and
ð ∩ λ = ι , μ ð ∩ λ ( ι ) , h ð ∩ λ ( ι ) , Ψ ð ∩ λ ( ι ) ∣ ι ∈ Γ
Φ ¯ ( ð ∩ λ ) = 〈 ℘ , [ μ Φ ¯ ( ð ∩ λ ) L ( ℘ ) , μ Φ ¯ ( ð ∩ λ ) U ( ℘ ) ] , [ h Φ ¯ ( ð ∩ λ ) L ( ℘ ) , h Φ ¯ ( ð ∩ λ ) U ( ℘ ) ] , [ Ψ Φ ¯ ( ð ∩ λ ) L ( ℘ ) , Ψ Φ ¯ ( ð ∩ λ ) U ( ℘ ) ] 〉 ∣ ℘ ∈ ξ , = 〈 ℘ , [ ( μ Φ ¯ ( ð ) L ( ℘ ) ∧ μ Φ ¯ ( λ ) L ( ℘ ) ) , ( μ Φ ¯ ( ð ) U ( ℘ ) ∧ μ Φ ¯ ( λ ) U ( ℘ ) ) ] , [ ( h Φ ¯ ( ð ) L ( ℘ ) ∧ h Φ ¯ ( λ ) L ( ℘ ) ) , ( h Φ ¯ ( ð ) U ( ℘ ) ∧ h Φ ¯ ( λ ) U ( ℘ ) ) ] ,
[ ( Ψ Φ ¯ ( ð ) L ( ℘ ) ∧ Ψ Φ ¯ ( λ ) L ( ℘ ) ) , ( Ψ Φ ¯ ( ð ) U ( ℘ ) ∧ Ψ Φ ¯ ( λ ) U ( ℘ ) ) ] 〉 ∣ ℘ ∈ ξ , = 〈 ℘ , ⋀ ι ∈ Γ [ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι ) ] ∧ ⋀ ι ∈ Γ [ μ Φ L ( ℘ , ι ) ∨ μ λ L ( ι ) ] , ⋀ ι ∈ Γ [ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι ) ] ∧ ⋀ ι ∈ Γ [ μ Φ U ( ℘ , ι ) ∨ μ λ U ( ι ) ] , ⋀ ι ∈ Γ [ h Φ L ( ℘ , ι ) ∨ h ð L ( ι ) ] ∧ ⋀ ι ∈ Γ [ h Φ L ( ℘ , ι ) ∨ h λ L ( ι ) ] , ⋀ ι ∈ Γ [ h Φ U ( ℘ , ι ) ∨ h ð U ( ι ) ] ∧ ⋀ ι ∈ Γ [ h Φ U ( ℘ , ι ) ∨ h λ U ( ι ) ] , ⋁ ι ∈ Γ [ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι ) ] ∧ ⋁ ι ∈ Γ [ Ψ Φ L ( ℘ , ι ) ∧ Ψ λ L ( ι ) ] , ⋁ ι ∈ Γ [ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι ) ] ∧ ⋁ ι ∈ Γ [ Ψ Φ U ( ℘ , ι ) ∧ Ψ λ U ( ι ) ] 〉 ∣ ℘ ∈ ξ . = { 〈 ℘ , ⋀ ι ∈ Γ [ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι ) ] , ⋀ ι ∈ Γ [ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι ) ] , ⋀ ι ∈ Γ [ h Φ L ( ℘ , ι ) ∨ h ð L ( ι ) ] , ⋀ ι ∈ Γ [ h Φ U ( ℘ , ι ) ∨ h ð U ( ι ) ] ⋁ ι ∈ Γ [ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι ) ] , ⋁ ι ∈ Γ [ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι ) ] ∧ ⋀ ι ∈ Γ [ μ Φ L ( ℘ , ι ) ∨ μ λ L ( ι ) ] , ⋀ ι ∈ Γ [ μ Φ U ( ℘ , ι ) ∨ μ λ U ( ι ) ] , ⋀ ι ∈ Γ [ h Φ L ( ℘ , ι ) ∨ h λ L ( ι ) ) , ⋀ ι ∈ Γ [ h Φ U ( ℘ , ι ) ∨ h λ U ( ι ) ] , ⋁ ι ∈ Γ [ Ψ Φ L ( ℘ , ι ) ∧ Ψ λ L ( ι ) ] , ⋁ ι ∈ Γ ( Ψ Φ U ( ℘ , ι ) ∧ Ψ λ U ( ι ) ) 〉 ∣ ℘ ∈ ξ } = 〈 ℘ , Φ ¯ ( ð ) ∩ Φ ¯ ( λ ) 〉 ∣ ℘ ∈ ξ .
Hence
Φ ¯ ( ð ∩ λ ) = Φ ¯ ( ð ) ∩ Φ ¯ ( λ )
(6)
We can prove it similarly to (5).
(7)
According to Definition (11), we obtain:
Φ ( ∼ ð ) = ℘ , μ Φ ¯ ( ∼ ð ) L ( ℘ ) , μ Φ ¯ ( ∼ ð ) U ( ℘ ) , h Φ ¯ ( ∼ ð ) L ( ℘ ) , h Φ ¯ ( ∼ ð ) U ( ℘ ) , Ψ Φ ¯ ( ∼ ð ) L ( ℘ ) , Ψ Φ ¯ ( ∼ ð ) U ( ℘ ) ∣ ℘ ∈ ξ , ∼ Φ ¯ ( ∼ ð ) = ℘ , Ψ Φ ¯ ( ∼ ð ) L ( ℘ ) , Ψ Φ ¯ ( ∼ ð ) U ( ℘ ) , h Φ ¯ ( ∼ ð ) L ( ℘ ) , h Φ ¯ ( ∼ ð ) U ( ℘ ) , μ Φ ¯ ( ∼ ð ) L ( ℘ ) , μ Φ ¯ ( ∼ ð ) U ( ℘ ) ∣ ℘ ∈ ξ = { 〈 ℘ , ⋀ ι ∈ Γ μ Φ L ( ℘ , ι ) ∨ Ψ ∼ ð L ( ι ) , ⋀ ι ∈ Γ μ Φ U ( ℘ , ι ) ∨ Ψ ∼ ð U ( ι ) , ⋀ ι ∈ Γ h Φ L ( ℘ , ι ) ∨ h ∼ ð L ( ι ) , ⋀ ι ∈ Γ h Φ U ( ℘ , ι ) ∨ h ∼ ð U ( ι ) , ⋁ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∧ μ ∼ ð L ( ι ) , ⋁ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∧ μ ∼ ð U ( ι ) 〉 | ℘ ∈ ξ } = { 〈 ℘ , ⋀ ι ∈ Γ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι ) , ⋀ ι ∈ Γ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι ) , ⋀ ι ∈ Γ h Φ L ( ℘ , ι ) ∨ h ð L ( ι ) , ⋀ ι ∈ Γ h Φ U ( ℘ , ι ) ∨ h ð U ( ι ) , ⋁ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι ) , ⋁ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι ) 〉 | ℘ ∈ ξ }
Φ ¯ ( ð ) = 〈 ℘ , [ μ Φ ¯ ( ð ) L , μ Φ ¯ ( ð ) U ] , [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] , [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ] 〉 ∣ ℘ ∈ ξ = { 〈 ℘ , [ ⋀ ι ∈ Γ μ Φ L ( ℘ , ι ) ∨ μ ð L ( ι ) , ⋀ ι ∈ Γ μ Φ U ( ℘ , ι ) ∨ μ ð U ( ι ) ] , [ ⋀ ι ∈ Γ h Φ L ( ℘ , ι ) ∨ h ð L ( ι ) , ⋀ ι ∈ Γ h Φ U ( ℘ , ι ) ∨ h ð U ( ι ) ] , [ ⋁ ι ∈ Γ Ψ Φ L ( ℘ , ι ) ∧ Ψ ð L ( ι ) , ⋁ ι ∈ Γ Ψ Φ U ( ℘ , ι ) ∧ Ψ ð U ( ι ) ] 〉 | ℘ ∈ ξ }
where
μ ð L ( ℘ ) = Ψ ∼ ð L ( ℘ ) , μ ð U ( ℘ ) = Ψ ∼ ð U ( ℘ ) , Ψ ð L ( ℘ ) = μ ∼ ð L ( ℘ )
Ψ ð U ( ℘ ) = μ ∼ ð U ( ℘ ) , h ð L ( ℘ ) = h ∼ ð L ( ℘ ) , h ð U ( ℘ ) = h ∼ ð U ( ℘ )
Hence
Φ ¯ ( ð ) = ∼ Φ ¯ ( ∼ ð )
(8)
The proof is analogous to (7).
□

4. A Multi-Criteria Group Decision-Making Framework Based on IVPFSRS

This section presents a comprehensive framework for solving multi-criteria group decision-making (MCGDM) problems using the proposed Interval-Valued Picture Fuzzy Soft Rough Sets (IVPFSRS). We first introduce a step-by-step algorithmic procedure that systematically integrates the IVPFSRS mathematical structure into practical decision-making processes, followed by a detailed illustrative example demonstrating the framework’s practical application. While recent cloud-rough models excel in large-group settings with linguistic assessments, our IVPFSRS framework demonstrates particular effectiveness in structured evaluation scenarios where parameterized criteria, nuanced uncertainty representation through interval-valued picture fuzzy assessments, and detailed granular analysis are paramount. The framework provides a mathematically rigorous yet practically applicable approach that handles multiple dimensions of uncertainty while maintaining flexibility through soft set parameterization.

4.1. The MCGDM Algorithm

The proposed MCGDM algorithm systematically integrates the IVPFSRS framework into decision-making processes. The algorithm can be broken down into seven main steps, which are described below and shown in Figure 2.
-
Problem Formulation:
  • Let ξ = { ℘ 1 , ℘ 2 , … , ℘ n } be the set of alternatives.
  • Let Γ = { ι 1 , ι 2 , … , ι m } be the set of criteria/parameters.
  • Let Φ ∈ IVPFSS ( ξ × Γ ) be the evaluation relation.
  • Let ð be the ideal decision object defined by experts.
  • Let w = ( w 1 , w 2 , … , w m ) be the optional weight vector for criteria, where w j ∈ [ 0 , 1 ] and ∑ j = 1 m w j = 1 .
-
Incorporating Attribute Weights:
In the IVPFSRS framework, attribute weights can be incorporated in two complementary ways:
(a)
Implicit Weighting through Parameterization: The soft set parameterization naturally captures importance through the structure of the IVPFSS relation Φ .
(b)
Explicit Weighting: Attribute weights can be explicitly integrated during approximation calculations or score computation.
-
Algorithm Steps:
The proposed MCGDM process is summarized in Algorithm 1 below.
Algorithm 1: MCGDM using interval-valued picture fuzzy soft rough sets
Symmetry 18 00419 i001

4.2. Detailed Explanation of Algorithmic Steps

-
Step 1: Problem Initialization
The decision problem is formalized by identifying the alternatives ξ , criteria Γ , and establishing the IVPFSS relation Φ based on expert evaluations. The ideal object ð represents the optimal characteristics desired in the solution. The optional weight vector w captures the relative importance of criteria.
-
Step 2: Weight Incorporation
If attribute weights are provided, they are incorporated into the evaluation relation Φ . This can be done through explicit multiplication of membership degrees by corresponding weights, or implicitly through the parameterization structure. If no weights are provided, the algorithm proceeds with the original relation, assuming equal importance or implicit weighting through parameter granularity.
-
Step 3–4: Approximation Computation
Using Definition 11, we compute both upper and lower approximations. The upper approximation Φ ¯ ( ð ) captures the possible membership of alternatives to the ideal object, while the lower approximation Φ ¯ ( ð ) captures the certain membership. These approximations handle the inherent uncertainty and granularity in the data.
-
Step 5: Aggregation Operation
The algebraic sum operation (⊕) from Definition 12 is applied to combine information from both approximations. This operation preserves the interval-valued nature of the information while synthesizing optimistic and conservative perspectives.
-
Step 6: Score Calculation
For each alternative ℘, a decision score S ( ℘ ) is computed. If weights are given, it calculates the weighted average, otherwise the simple average. This scoring mechanism balances positive evidence ( μ ) against negative evidence ( Ψ ), with higher scores indicating better alignment with the ideal object.
-
Step 7: Decision Making
Alternatives are ranked in descending order of S ( ℘ ) values. The alternative with the highest score is selected as the optimal solution. In case of ties, additional criteria or expert consultation may be employed.

4.3. Illustrative Example

This section provides a comprehensive, step-by-step demonstration of the proposed IVPFSRS-based MCGDM framework through a realistic case study: selecting a candidate for an administrative position in a global corporation. The example walks through each step of Algorithm 1, showing practical implementation details including weight incorporation.
-
Problem Description and Data Representation
A multinational company needs to fill a senior administrative position. After preliminary screening, four candidates remain for final evaluation:
ξ = { ℘ 1 , ℘ 2 , ℘ 3 , ℘ 4 } ( Candidate 1 , Candidate 2 , Candidate 3 , Candidate 4 )
The selection committee, comprising HR specialists and department heads, evaluates candidates against five critical criteria:
Γ = { ι 1 , ι 2 , ι 3 , ι 4 , ι 5 }
where:
  • ι 1 : Experience (years in similar roles, project leadership)
  • ι 2 : Communication Skills (presentation, negotiation, team communication)
  • ι 3 : Technical Skills (software proficiency, analytical abilities)
  • ι 4 : Decision Making (problem-solving, strategic thinking)
  • ι 5 : Commitment (reliability, dedication, organizational loyalty)
Due to the inherent subjectivity in evaluating these soft skills, committee members provide assessments using interval-valued picture fuzzy numbers. These assessments are compiled into the IVPFSS relation Φ shown in Table 15.
-
Step 1: Define the Ideal Candidate Profile and Assign Weights
The selection committee establishes an ideal candidate profile ð based on position requirements. For this administrative role, commitment and decision making are prioritized over pure technical skills.
ð = 〈 ι 1 , ( [ 0.05 , 0.10 ] , [ 0.20 , 0.30 ] , [ 0.50 , 0.55 ] ) 〉 〈 ι 2 , ( [ 0.20 , 0.25 ] , [ 0.40 , 0.55 ] , [ 0.10 , 0.20 ] ) 〉 〈 ι 3 , ( [ 0.10 , 0.15 ] , [ 0.20 , 0.40 ] , [ 0.25 , 0.35 ] ) 〉 〈 ι 4 , ( [ 0.25 , 0.40 ] , [ 0.10 , 0.15 ] , [ 0.20 , 0.30 ] ) 〉 〈 ι 5 , ( [ 0.60 , 0.70 ] , [ 0.05 , 0.10 ] , [ 0.10 , 0.20 ] ) 〉
The ideal candidate profile is summarized in Table 16 below.
  • Weight Assignment: Based on the position requirements, the committee assigns the following weights to criteria, as shown in Table 17.
    Table 17. Weight assignment for evaluation criteria.
    Table 17. Weight assignment for evaluation criteria.
    CriterionDescriptionWeight ( w j )
    ι 1 Experience0.15
    ι 2 Communication Skills0.20
    ι 3 Technical Skills0.15
    ι 4 Decision Making0.25
    ι 5 Commitment0.25
    Total 1.00
    The weighting reflects the position requirements, with Decision Making and Commitment receiving the highest weights (0.25 each), as these are most critical for administrative roles.
-
Step 2: Incorporate Attribute Weights
Following Algorithm 1, we incorporate the weights into the evaluation relation Φ . For each alternative ℘ i and criterion ι j , we apply weight adjustment:
For candidate ℘ 1 and criterion ι 4 (Decision Making, w 4 = 0.25 ):
μ Φ w L ( ℘ 1 , ι 4 ) = 0.25 × 0.30 = 0.075 μ Φ w U ( ℘ 1 , ι 4 ) = 0.25 × 0.35 = 0.0875 h Φ w L ( ℘ 1 , ι 4 ) = 0.25 × 0.30 = 0.075 h Φ w U ( ℘ 1 , ι 4 ) = 0.25 × 0.50 = 0.125 Ψ Φ w L ( ℘ 1 , ι 4 ) = 0.25 × 0.05 = 0.0125 Ψ Φ w U ( ℘ 1 , ι 4 ) = 0.25 × 0.10 = 0.025
Similar calculations are performed for all criteria and candidates to obtain the weighted relation Φ w .
-
Step 3: Compute Weighted IVPFSR Approximations
Using Definition 11 with the weighted relation Φ w , we compute approximations:
  • Weighted Upper Approximation for Candidate ℘ 1 :
    μ Φ ¯ w ( ð ) L ( ℘ 1 ) = ⋁ j = 1 5 μ Φ w L ( ℘ 1 , ι j ) ∧ μ ð L ( ι j ) = ( 0.075 ∧ 0.05 ) ∨ ( 0.07 ∧ 0.20 ) ∨ ( 0.06 ∧ 0.10 ) ∨ ( 0.075 ∧ 0.25 ) ∨ ( 0.025 ∧ 0.60 ) = 0.05 ∨ 0.07 ∨ 0.06 ∨ 0.075 ∨ 0.025 = 0.075
    μ Φ ¯ w ( ð ) U ( ℘ 1 ) = 0.0875 h Φ ¯ w ( ð ) L ( ℘ 1 ) = 0.075 h Φ ¯ w ( ð ) U ( ℘ 1 ) = 0.125 Ψ Φ ¯ w ( ð ) L ( ℘ 1 ) = 0.0125 Ψ Φ ¯ w ( ð ) U ( ℘ 1 ) = 0.025
    Thus:
    Φ ¯ w ( ð ) ( ℘ 1 ) = [ 0.075 , 0.0875 ] , [ 0.075 , 0.125 ] , [ 0.0125 , 0.025 ]
    Complete weighted approximations for all candidates are computed similarly.
-
Step 4: Compute Unweighted Approximations (for Comparison)
For comparison, we also compute unweighted approximations using the original Φ :
Unweighted Upper Approximation for Candidate ℘ 1 :
μ Φ ¯ ( ð ) L ( ℘ 1 ) = 0.25 μ Φ ¯ ( ð ) U ( ℘ 1 ) = 0.35 h Φ ¯ ( ð ) L ( ℘ 1 ) = 0.20 h Φ ¯ ( ð ) U ( ℘ 1 ) = 0.40 Ψ Φ ¯ ( ð ) L ( ℘ 1 ) = 0.20 Ψ Φ ¯ ( ð ) U ( ℘ 1 ) = 0.30
Φ ¯ ( ð ) ( ℘ 1 ) = [ 0.25 , 0.35 ] , [ 0.20 , 0.40 ] , [ 0.20 , 0.30 ]
-
Step 5: Aggregate Approximations
Following Step 5 of Algorithm 1, we apply the algebraic sum operation (⊕):
  • Weighted Aggregation for Candidate ℘ 1 :
    A w ( ℘ 1 ) = Φ ¯ w ( ð ) ( ℘ 1 ) ⊕ Φ ¯ w ( ð ) ( ℘ 1 ) = [ 0.14 , 0.16 ] , [ 0.0056 , 0.0156 ] , [ 0.00016 , 0.00063 ]
  • Unweighted Aggregation for Candidate ℘ 1 :
    A ( ℘ 1 ) = Φ ¯ ( ð ) ( ℘ 1 ) ⊕ Φ ¯ ( ð ) ( ℘ 1 ) = [ 0.40 , 0.61 ] , [ 0.04 , 0.16 ] , [ 0.02 , 0.06 ]
The comparison between weighted and unweighted aggregation results is presented in Table 18 below.
-
Step 6: Calculate Decision Scores
Following Step 6 of Algorithm 1, we compute weighted scores:
  • Weighted Score for Candidate ℘ 3 :
    S w ( ℘ 3 ) = 0.20 + 0.28 − 0.0001 − 0.0005 2 = 0.2397
  • Unweighted Score for Candidate ℘ 3 :
    S ( ℘ 3 ) = 0.52 + 0.73 − 0.02 − 0.07 2 = 0.580
The complete ranking of candidates with both weighted and unweighted scores is shown in Table 19.
-
Step 7: Final Decision and Interpretation
The candidates are ranked in descending order of weighted scores:
℘ 3 ( 0.2397 ) > ℘ 1 ( 0.1472 ) > ℘ 2 ( 0.1394 ) > ℘ 4 ( 0.1169 )
Candidate ℘ 3 is selected for the administrative position.
-
Analysis and Results Interpretation
The IVPFSRS framework computes final candidate scores as shown in Figure 3.
Figure 3 compares candidate scores from unweighted and weighted evaluations using the IVPFSRS framework. Both methods yield identical ranking ( ℘ 3 ≻ ℘ 1 ≻ ℘ 2 ≻ ℘ 4 ), demonstrating robustness despite score magnitude differences due to weight scaling.
The decision outcome analysis in Figure 4 reveals how criterion prioritization influences candidate evaluation.
As shown in Figure 4, subfigure (a) shows the distribution of weights for the five criteria: Experience (E), Communication (C), Technical (T), Decision Making (D), and Commitment (Cm). Decision Making and Commitment are given the largest weights (0.25 each), indicating them as the most important for the administrative role, with Communication (0.20) in second place, and Experience and Technical are given the lowest weights (0.15 each). Subfigure (b) presents Candidate ℘ 3 ’s upper membership degree ( μ U ) performance, with this candidate achieving the best results in Decision Making (0.60) and Commitment (0.65), which is directly in line with the most weighted criteria. Although ℘ 3 also shows good results in the other criteria, this high correlation with the prioritized criteria results in the highest weighted score (0.2397), which makes ℘ 3 the best choice according to the IVPFSRS framework.

5. Comparative Analysis and Discussion

Comparing with some other popular models, in this section, we demonstrate the effectiveness of our Interval-Valued PFS Soft Rough Set (IVPFSRS) framework proposed in this paper. We see what each model has under the hood, how they do, and where they do best. The goal is to emphasize the features unique to IVPFSRS and assist interested readers in choosing suitable instrument for their particular problem.

5.1. Overview of Comparative Methods

We are comparing IVPFSRS with several other models in the literature for illustration to get a full view. Each of them treats uncertainty in a different manner. Here is a quick rundown:
  • IVIF Soft Rough Sets [28]: Merge interval-valued intuitionistic fuzzy sets with soft and rough sets. Processes membership and non-membership as intervals but without a distinct “neutral” class.
  • Neutrosophic Soft Rough Sets [19]: Based on neutrosophic theory. Concerned with truth, indeterminacy and falsity. Good for that very conflicting or unclear information.
  • Spherical Fuzzy Rough Sets [26]: Utilizes spherical fuzzy sets in which membership degree, non-membership degree, and hesitancy degree square sum to ≤1. Neat geometric way to treat ternary fuzzy information.
  • IVPF Soft Set [21]: Considers interval-valued picture fuzzy sets under soft sets. Deals with positive, negative, and neutral memberships as intervals but there is not rough set granularity.
  • Rough Integrated Asymmetric Cloud Model [34]: Contemporary approach for large group decision making. Combines rough sets theory with an asymmetric cloud model to handle multi-granularity linguistic evaluations.
  • Interval Rough Integrated Cloud Model [35]: Similar to above, interval-valued rough set is integrated into cloud model. Designed for LGD at linguistic terms.
  • Cloud Model Multi-granularity LGDM [36]: Based on multi-granularity linguistic large group decision making. Employs cloud models and a multi-layer weights system.
  • IVPFS [22]: The core model is simply interval-valued picture fuzzy sets. Our baseline to demonstrate the contribution of soft sets and rough sets in IVPFSRS.
By comparing the IVPFSRS with all the competing models, we intend to highlight the unique aspects of the module and exhibit its performance in the various facets of uncertainty modeling, accuracy of decision, and time consumption.

5.2. Feature-Based Comparative Analysis

We start by examining the algebraic structures of various theories. Table 20 illustrates a full comparison regarding features, which tells which core building blocks (interval-valued, picture fuzzy, soft set, rough set, etc.) are available in each model. This structural roughing out shows the theoretical foundations and the scope of each method.
As shown in Table 20, IVPFSRS is the only model that simultaneously incorporates all key features: interval-valued representation, picture fuzzy three-way membership, soft set parameterization, and rough set approximations. While models like the Rough Integrated Asymmetric Cloud Model [34] excel in handling linguistic uncertainty in large-group settings, they do not include the picture fuzzy or soft set components. Conversely, models like IVPF Soft Set [21] capture interval-valued picture fuzzy information within a parameterized structure but lack the granularity handling of rough sets. This unique combination positions IVPFSRS as a comprehensive tool particularly well-suited for structured multi-criteria problems where nuanced uncertainty representation and granular analysis are both essential.

5.3. Quantitative Performance Comparison

To quantitatively evaluate the proposed IVPFSRS framework against existing approaches, we conducted experiments using three benchmark datasets representing different types of decision problems:
  • Dataset 1: Medical Diagnosis (120 records, 8 symptoms)
  • Dataset 2: Supplier Selection (80 vendors, 6 criteria)
  • Dataset 3: Environmental Policy Assessment (50 policies, 7 factors)
Setup: Python 3.8, Intel Core i7, 16 GB RAM.
  • Performance Metrics:
  • Decision Accuracy: Percentage agreement with expert decisions
  • Computational Time: Average execution time (s)
  • Uncertainty Handling Score: Ability to represent ambiguity (0–1 scale)
  • Interpretability Index: Ease of understanding results (1–5 scale)
The decision scores of our proposed IVPFSRS model, along with its competitors IVPFS and IVPFSS, are given in Table 21.
IVPFSRS achieves the best result in accuracy (91.2%) and uncertainty handling (0.89), which indicates that it is very efficient to model complex uncertainty. It is reasonably fast (0.51 s)—slower than simple methods such as IVPF Soft Set (0.28 s), but faster than cloud-rough methods (0.78–0.85 s). An interpretability score of 3.9 indicates results are still fairly interpretable even for the complexity.

5.4. Comparative Analysis with Recent Cloud-Rough Models

Recent advancements in rough set theory have introduced innovative cloud-rough integration models for large group decision making (LGDM), such as the Rough Integrated Asymmetric Cloud Model [34] and Interval Rough Integrated Cloud Model [35]. These models excel in handling linguistic uncertainty and large-scale participation by capturing randomness and fuzziness in multi-granularity linguistic assessments. As shown in Table 21, these cloud-rough models achieve strong accuracy (87.3–89.5%) and high uncertainty scores (0.85–0.88), making them particularly effective for linguistic LGDM scenarios.
  • They differ from IVPFSRS in key ways:
  • Focus of Application: Cloud-rough models are constructed for large-scale group- linguistic issues. IVPFSRS addresses the structured multi-criteria evaluation with well-defined criteria.
  • Uncertainty Representation: Cloud models capture the uncertainties of randomness and fuzziness in language. IVPFSRS presents a refined three-way membership (positive, neutral, negative) using picture fuzzy sets.
  • Parameterization: IVPFSRS applies soft set theory to the parameterization of criteria. Cloud-rough models lack this.
  • Computational Efficiency: IVPFSRS is faster (0.51 s) than cloud-rough models (0.78–0.85 s) thanks to its structured math.
Therefore, the decision depends on the issue. One roughly goes to the cloud for linguistic large-group evaluations. For structured multi-criteria problems with the need for representing detailed uncertainty information in positive, neutral, and negative directions, IVPFSRS is superior.

5.5. Statistical Significance and Tradeoff Analysis

Before we go out and draw very big conclusions, we want to make sure these performance differences we are seeing are real and not just the result of chance. We also want to know the practical tradeoffs of using one model versus another.

5.5.1. Statistical Significance

We performed paired t-tests for 30 runs for the accuracy of IVPFSRS with the other models. The results are shown in Table 22.
The results showed that IVPFSRS outperforms other baselines with a significant margin (p < 0.05). It is not significantly better than the RICASCM (p = 0.087), indicating that they are both competitive, but in different aspects.

5.5.2. Tradeoff Analysis

From the overall assessment, we derive the following tradeoffs:
  • Accuracy vs. Speed: Among all, IVPFSRS attains the best quality, and it costs moderate computational time.
  • Expressiveness vs. Interpretability: The only caveat with rich uncertainty representation in our setting is that it makes interpretability slightly harder than the toy models.
  • Flexibility vs. Complexity: Soft set parameterization enables a more flexible model, but at the cost of its complexity increment.

5.5.3. Recommendations for Model Selection

Based on our analysis, here are the following practical recommendations:
  • Choose IVPFSRS when: You need to be as accurate as possible with explicit positive/neutral/negative membership and you want this to be done in a structured multi-criteria way.
  • Choose Cloud-Rough Models [34,35] when: You have more participants, linguistic assessments, and you need to model randomness in multi-granularity language.
  • Choose Spherical Fuzzy Rough Sets when: Speed is of the essence and the issues are clearly 3-dimensional defined membership without need for interval values.
  • Choose IVIF Soft Rough Sets when: You require a trade-off between performance and interpretability for plain intuitionistic fuzzy problems.
  • Choose Neutrosophic Rough Sets when: You are facing a level of uncertainty that is unknowable even on a probabilistic basis and managing indeterminacy is essential.
The IVPFSRS framework was proposed to fill a gap in the literature between these two extreme perspectives on uncertainty processing. In doing so, it exploits all the advantages of interval valued picture fuzzy sets, soft sets, and rough sets to a greater extent for the structured multi-criteria decision-making problem where fine-grained uncertainty description is required. Although each of the other models have their advantages—cloud-rough models for large-group linguistic evaluation, spherical fuzzy sets for the efficient three-way inference mechanism—IVPFSRS is a particularly powerful and flexible technique when addressing complex decisions, involving multiple types of uncertainty, and where parameterized evaluation is a must.

6. Limitations and Scalability Analysis

Although the proposed IVPFSRS scheme has great merits in dealing with high-level uncertainty, it is also necessary to recognize its limitations and evaluate its applicability in real life.

6.1. Limitations of the Proposed Model

6.1.1. Computational Complexity

The computational complexity of the IVPFSRS model is the maximum among its components, including itself, with each component detailed as follows:
  • Approximation Operations: Calculating the lower and upper approximations has time complexity of O ( | ξ | × | Γ | ) for each decision object, where | ξ | denotes the number of alternatives and | Γ | the size of the parameter set.
  • Interval Operations: Each membership, neutrality, and non-membership degree involves interval arithmetic, doubling the computational load compared to point-valued fuzzy approaches.
  • Aggregation Steps: The ⊕ and ⊗ operations include multiple algebraic computations per alternative, increasing overall cost.
Practical Impact: For problems with a large number of alternatives and parameters, the computational cost is most significant, and optimized or parallelized implementations are necessary.

6.1.2. Data Requirements

The reliability of the model is subject to the quality and completeness of the input information:
  • Parameter Specification: The specification of the parameter set Γ requires some knowledge of the problem domain and might be subjective.
  • Interval Assignments: Appropriate interval assignments for membership along the numbers line are not easy to decide without prior/historical or expert knowledge.
  • Complete Relation Matrix: The IVPFSS relation Φ has to be completely defined; this might not be possible in the case of sparse or fragmented data.

6.1.3. Interpretability Challenges

  • Multi-dimensional Output: The three interval-valued degrees ( μ , h , Ψ ) can yield results that are not straightforward and may be difficult for a layperson to interpret.
  • Sensitivity to parameter: Slight variations of the interval boundaries and of the weights of the parameters may greatly impact the conclusions, thus special attention in calibration is needed.

6.1.4. Theoretical Constraints

  • Dependence on Equivalence Relations: The definition presupposes equivalence-based approximation spaces that might not model all real situations akin to relations.
  • Fixed Parameter Set: A static Γ may not be suitable for ever-changing domains as the parameters change with time.

6.2. Scalability Analysis

6.2.1. Large Datasets Case

The computational complexity of IVPFSRS is O ( n × m × k ) , where n = | ξ | (alternatives), m = | Γ | (parameters), and k is the complexity of interval operations.
Table 23 presents the summary of the final alternative rankings, showing the number of decision makers favoring each alternative after applying the IVPFSRS-based MCGDM process.

6.2.2. Strategies for Enhancing Scalability

  • Algorithmic Optimizations:
  • Parallel Processing: Approximation calculations on alternative distributions are separable and thus trivial to parallelize.
  • Incremental Updates: For dynamic data, update only the impacted approximate answers in place of all answers.
  • Approximation Methods: Use sampling or dimensionality reduction if the parameter space is extremely large.

6.2.3. Handling High-Dimensional Parameters

When the parameter size | Γ | is large, the IVPFSS relation matrix is of the size O ( n × m ) , which also might cause sparsity problems due to the growth.
  • Mitigation Approaches:
  • Feature Selection: Apply rough set attribute reduction to obtain minimal parameter subsets.
  • Hierarchical Modeling: Group parameters hierarchically to decrease the computational burden.
  • Domain Decomposition: Divide the parameter space into semantically meaningful subsets.

6.2.4. Memory and Storage Considerations

  • Storage Requirements: Each IVPFSRS relation stores 6 × | ξ | × | Γ | floating-point values (lower/upper bounds for μ , h, and Ψ ).
  • Memory Optimization: The representation of sparse matrix formats can be compressed extensively when most of the relation entries are default or zero.

6.3. Practical Deployment Guidelines

In the following, we discuss the compatibility of the proposed IVPFSRS based on a comparison of time complexity with the related fuzzy-rough hybrid decision-making systems, and then the accuracy of the related systems is contrasted. The comparison of the time required for computation and prediction accuracy between the IVPFSRS model and other fuzzy-rough based systems is illustrated in Table 24.

7. Conclusions

This paper introduces Interval-Valued Picture Fuzzy Soft Rough Sets (IVPFSRS), a novel hybrid framework that integrates three mathematical theories to address complex uncertainty in multi-criteria group decision making. The primary innovation is the synergistic combination of interval-valued picture fuzzy sets for nuanced uncertainty representation, soft sets for flexible parameterization, and rough sets for granularity handling. This integration creates a comprehensive tool that overcomes limitations of individual approaches while capturing the multifaceted nature of real-world decision problems. We establish the complete mathematical foundation of IVPFSRS, including formal definitions, properties, and algebraic operations. The development of a practical MCGDM algorithm with explicit weight incorporation demonstrates the framework’s applicability to structured evaluation scenarios. The illustrative example shows how IVPFSRS systematically transforms subjective assessments into rational, defensible decisions while maintaining transparency throughout the process.
IVPFSRS offers distinct advantages in parameterized evaluation problems requiring explicit representation of positive, neutral, and negative membership degrees. The framework addresses significant gaps in existing decision-making tools by simultaneously handling interval-valued uncertainty, structured parameterization, and flexible weighting. Future research should focus on algorithmic improvements for scalability, theoretical extensions to dynamic environments, integration with complementary approaches like cloud models, and application expansions into healthcare, sustainable systems, and financial technology. Empirical validation studies will further establish the framework’s robustness and transferability across diverse contexts. In summary, the IVPFSRS framework represents a meaningful advancement in uncertainty-aware decision support. By the creative combination of complementary mathematical frameworks, it allows for a holistic treatment of intricate uncertainty present in contemporary decision-making problems. As decision environments continue to grow in complexity, such frameworks become increasingly valuable for supporting rational, transparent, and effective decision-making across numerous domains.

Author Contributions

R.M.A.: Conceptualization, Methodology, Investigation, and Writing—original draft. K.M.A.: Writing—review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

The researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2026).

Data Availability Statement

All data generated or analyzed during this study are included in this published article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef] [Scilit]
  2. Pawlak, Z. Rough Sets. Int. J. Inf. Comput. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef] [Scilit]
  3. Pawlak, Z. Rough set theory and its applications to data analysis. Cybern. Syst. 1998, 29, 661–688. [Google Scholar] [CrossRef] [Scilit]
  4. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
  5. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Scilit]
  6. Maji, P.K.; Roy, A.R.; Biswas, R. Fuzzy Soft Sets. J. Fuzzy Math. 2001, 9, 589–602. [Google Scholar]
  7. Feng, F.; Li, C.; Davvaz, B.; Ali, M.I. Soft sets combined with fuzzy sets and rough sets: A tentative approach. Soft Comput. 2010, 14, 899–911. [Google Scholar] [CrossRef] [Scilit]
  8. Feng, F. Soft rough sets applied to multicriteria group decision making. Ann. Fuzzy Math. Inform. 2011, 2, 69–80. [Google Scholar]
  9. Yager, R.R. Pythagorean fuzzy subsets. In 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS); IEEE: Piscataway, NJ, USA, 2013; pp. 57–61. [Google Scholar]
  10. Smarandache, F. A unifying field in Logics: Neutrosophic Logic. In Philosophy; American Research Press: Champaign, IL, USA, 1999; pp. 1–141. [Google Scholar]
  11. Broumi, S.; Smarandache, F. Interval-Valued Neutrosophic Soft Rough Sets. Int. J. Comput. Math. 2015, 2015, 232919. [Google Scholar] [CrossRef] [Scilit]
  12. Turksen, I.B. Interval valued fuzzy sets based on normal forms. Fuzzy Sets Syst. 1986, 20, 191–210. [Google Scholar] [CrossRef] [Scilit]
  13. Alsager, K.M.; Alshehri, N.O. Single Valued Neutrosophic Hesitant Fuzzy Rough Set and Its Application; Infinite Study: Paris, France, 2019; 10p. [Google Scholar]
  14. Dubois, D.; Prade, H. Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef] [Scilit]
  15. Sun, B.; Gong, Z.; Chen, D. Fuzzy rough set theory for the interval-valued fuzzy information systems. Inf. Sci. 2008, 178, 2794–2815. [Google Scholar] [CrossRef] [Scilit]
  16. Wu, W.Z.; Mi, J.S.; Zhang, W.X. Generalized fuzzy rough sets. Inf. Sci. 2003, 151, 263–282. [Google Scholar] [CrossRef] [Scilit]
  17. Shabir, M.; Ali, M.I.; Shaheen, T. Another approach to soft rough sets. Knowl.-Based Syst. 2013, 40, 72–80. [Google Scholar] [CrossRef] [Scilit]
  18. Meng, D.; Zhang, X.; Qin, K. Soft rough fuzzy sets and soft fuzzy rough sets. Comput. Math. Appl. 2011, 62, 4635–4645. [Google Scholar] [CrossRef] [Scilit]
  19. Broumi, S.; Smarandache, F.; Dhar, M. Rough neutrosophic sets. Infin. Study 2014, 32, 493–502. [Google Scholar]
  20. Cường, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409. [Google Scholar] [CrossRef] [Scilit]
  21. Shanthi, S.A.; Gayathri, M. Interval valued picture fuzzy soft set in pattern recognition. Adv. Math. Sci. J. 2020, 9, 2019–2029. [Google Scholar] [CrossRef] [Scilit]
  22. Abolfathi, M.A.; Ebadian, A. Interval-valued picture fuzzy aggregation information based on Frank operators and their application in group decision making. RAIRO-Oper. Res. 2023, 57, 3191–3222. [Google Scholar] [CrossRef] [Scilit]
  23. Zhao, T.; Wei, Z. On Characterization of Rough Type-2 Fuzzy Sets. Math. Probl. Eng. 2016, 2016, 4819353. [Google Scholar] [CrossRef] [Scilit]
  24. Thảo, N.X.; Định, N.V. Rough picture fuzzy set and picture fuzzy topologies. J. Comput. Sci. Cybern. 2015, 31, 245. [Google Scholar] [CrossRef] [Scilit]
  25. Gong, Z.; Sun, B.; Chen, D. Rough set theory for the interval-valued fuzzy information systems. Inf. Sci. 2008, 178, 1968–1985. [Google Scholar] [CrossRef] [Scilit]
  26. Mahmood, T.; Ahmmad, J.; ur Rehman, U. Spherical Fuzzy Soft Rough Sets and Their Applications in Decision Making Problems. Res. Sq. 2022. [Google Scholar] [CrossRef] [Scilit]
  27. Huang, C.N.; Ashraf, S.; Rehman, N.; Abdullah, S.; Hussain, A. A novel spherical fuzzy rough aggregation operators hybrid with TOPSIS method and their application in decision making. Math. Probl. Eng. 2022, 2022, 9339328. [Google Scholar] [CrossRef] [Scilit]
  28. Mukherjee, A.; Mukherjee, A. Interval-valued intuitionistic fuzzy soft rough sets. In Generalized Rough Sets: Hybrid Structure and Applications; Springer: New Delhi, India, 2015; pp. 37–48. [Google Scholar]
  29. Alsager, K.M.; El-Deeb, S.M. Rough and T-Rough Sets Arising from Intuitionistic Fuzzy Ideals in BCK-Algebras. Mathematics 2024, 12, 2925. [Google Scholar] [CrossRef] [Scilit]
  30. Mukherjee, A.; Mukherjee, A. Interval-valued intuitionistic fuzzy soft rough approximation operators and their applications in decision making problem. Ann. Data Sci. 2022, 9, 611–625. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  31. Andjelković, D.; Stojić, G.; Nikolić, N.; Das, D.K.; Subotić, M.; Stević, Ž. A novel data-envelopment analysis interval-valued fuzzy-rough-number multi-criteria decision-making (DEA-IFRN MCDM) model for determining the efficiency of road sections based on headway analysis. Mathematics 2024, 12, 976. [Google Scholar] [CrossRef] [Scilit]
  32. Alsager, K.M. Decision-Making Framework Based on Multineutrosophic Soft Rough Sets. Math. Probl. Eng. 2022, 2022, 2868970. [Google Scholar] [CrossRef] [Scilit]
  33. Alsager, K.M.; Alharbi, H.A. Exploring Symmetry in Industrial Decision-Making: A New Framework Based on Cubic Type-2 Fuzzy Soft Sets. Symmetry 2024, 16, 1491. [Google Scholar] [CrossRef] [Scilit]
  34. Jiang, J.; Liu, X.; Wang, Z.; Ding, W.; Zhang, S.; Xu, H. Large group decision-making with a rough integrated asymmetric cloud model under multi-granularity linguistic environment. Inf. Sci. 2024, 678, 120994. [Google Scholar] [CrossRef] [Scilit]
  35. Jiang, J.; Liu, X.; Garg, H.; Zhang, S. Large group decision-making based on interval rough integrated cloud model. Adv. Eng. Inform. 2023, 56, 101964. [Google Scholar] [CrossRef] [Scilit]
  36. Wang, P.; Zhang, J.; Zhang, W.-W. Multi-granularity linguistic large group decision-making based on cloud model and multi-layer weight determination. Control Decis. 2021, 36, 2257–2266. [Google Scholar]
Figure 1. Framework of the proposed IVPFSRS model for enhanced decision making.
Figure 1. Framework of the proposed IVPFSRS model for enhanced decision making.
Symmetry 18 00419 g001
Figure 2. Flowchart of the proposed MCGDM process using IVPFSRS framework with optional weight incorporation.
Figure 2. Flowchart of the proposed MCGDM process using IVPFSRS framework with optional weight incorporation.
Symmetry 18 00419 g002
Figure 3. MCGDM results with the IVPFSRS framework.
Figure 3. MCGDM results with the IVPFSRS framework.
Symmetry 18 00419 g003
Figure 4. Weight distribution (a) and candidate strength analysis (b).
Figure 4. Weight distribution (a) and candidate strength analysis (b).
Symmetry 18 00419 g004
Table 1. List of notations.
Table 1. List of notations.
NotationMeaning
ξ Universe of discourse (set of alternatives)
℘Element in the universe (candidate/alternative)
Γ Parameter set
ι Parameter element
ðFuzzy set or decision object
Φ Interval-Valued Picture Fuzzy Soft Set (IVPFSS) relation, where Φ ∈ IVPFSS ( ξ × Γ )
( ξ , Γ , Φ ) IVPF soft approximation space
μ ð ( ℘ ) Membership degree of element ℘ in set ð
h ð ( ℘ ) Neutrality/hesitancy degree of element ℘ in set ð
Ψ ð ( ℘ ) Non-membership degree of element ℘ in set ð
[ μ L , μ U ] Interval-valued membership degree
[ h L , h U ] Interval-valued neutrality degree
[ Ψ L , Ψ U ] Interval-valued non-membership degree
Φ ¯ ( ð ) Upper approximation of set ð in IVPFSRS
Φ ¯ ( ð ) Lower approximation of set ð in IVPFSRS
μ Φ ¯ ( ð ) L ( ℘ ) Lower bound of membership in upper approximation
μ Φ ¯ ( ð ) U ( ℘ ) Upper bound of membership in upper approximation
h Φ ¯ ( ð ) L ( ℘ ) Lower bound of neutrality in upper approximation
h Φ ¯ ( ð ) U ( ℘ ) Upper bound of neutrality in upper approximation
Ψ Φ ¯ ( ð ) L ( ℘ ) Lower bound of non-membership in upper approximation
Ψ Φ ¯ ( ð ) U ( ℘ ) Upper bound of non-membership in upper approximation
μ Φ ¯ ( ð ) L ( ℘ ) Lower bound of membership in lower approximation
μ Φ ¯ ( ð ) U ( ℘ ) Upper bound of membership in lower approximation
h Φ ¯ ( ð ) L ( ℘ ) Lower bound of neutrality in lower approximation
h Φ ¯ ( ð ) U ( ℘ ) Upper bound of neutrality in lower approximation
Ψ Φ ¯ ( ð ) L ( ℘ ) Lower bound of non-membership in lower approximation
Ψ Φ ¯ ( ð ) U ( ℘ ) Upper bound of non-membership in lower approximation
⊕Algebraic sum operation
⊗Algebraic product operation
∪Union operation
∩Intersection operation
∼ or ( · ) c Complement operation
∂Ideal decision object
S ( ℘ ) Decision score for alternative ℘
Table 2. Interval-valued picture fuzzy soft set (IVPFSS) relation Φ for car evaluation example.
Table 2. Interval-valued picture fuzzy soft set (IVPFSS) relation Φ for car evaluation example.
Φ ι 1 ι 2 ι 3
℘ 1 [ 0.10 , 0.25 ] , [ 0.30 , 0.35 ] , [ 0.20 , 0.40 ] [ 0.30 , 0.35 ] , [ 0.25 , 0.45 ] , [ 0.05 , 0.10 ] [ 0.20 , 0.30 ] , [ 0.50 , 0.60 ] , [ 0.05 , 0.10 ]
℘ 2 [ 0.10 , 0.20 ] , [ 0.30 , 0.45 ] , [ 0.15 , 0.25 ] [ 0.15 , 0.20 ] , [ 0.30 , 0.50 ] , [ 0.15 , 0.25 ] [ 0.25 , 0.40 ] , [ 0.20 , 0.30 ] , [ 0.10 , 0.20 ]
℘ 3 [ 0.15 , 0.25 ] , [ 0.30 , 0.55 ] , [ 0.05 , 0.15 ] [ 0.50 , 0.55 ] , [ 0.10 , 0.15 ] , [ 0.15 , 0.25 ] [ 0.40 , 0.50 ] , [ 0.10 , 0.15 ] , [ 0.10 , 0.25 ]
℘ 4 [ 0.50 , 0.55 ] , [ 0.10 , 0.20 ] , [ 0.15 , 0.20 ] [ 0.10 , 0.15 ] , [ 0.30 , 0.40 ] , [ 0.30 , 0.40 ] [ 0.40 , 0.55 ] , [ 0.05 , 0.10 ] , [ 0.20 , 0.35 ]
Table 3. Interval-valued picture fuzzy soft rough approximation Φ ¯ ( ð ) .
Table 3. Interval-valued picture fuzzy soft rough approximation Φ ¯ ( ð ) .
Φ ¯ ( ð ) [ μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) ] [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ]
℘ 1 [0.20, 0.30][0.25, 0.35][0.15, 0.20]
℘ 2 [0.25, 0.40][0.30, 0.30][0.15, 0.20]
℘ 3 [0.40, 0.50][0.10, 0.15][0.05, 0.15]
℘ 4 [0.40, 0.55][0.05, 0.10][0.15, 0.20]
Table 4. Interval-valued picture fuzzy soft rough approximation Φ ¯ ( ð ) .
Table 4. Interval-valued picture fuzzy soft rough approximation Φ ¯ ( ð ) .
Φ ¯ ( ð ) [ μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) ] [ h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) ] [ Ψ Φ ¯ ( ð ) L ( ℘ ) , Ψ Φ ¯ ( ð ) U ( ℘ ) ]
℘ 1 [0.30, 0.35][0.25, 0.35][0.05, 0.10]
℘ 2 [0.20, 0.30][0.30, 0.30][0.15, 0.25]
℘ 3 [0.40, 0.55][0.10, 0.15][0.15, 0.25]
℘ 4 [0.20, 0.30][0.05, 0.10][0.30, 0.40]
Table 5. Results of algebraic sum operation Φ ¯ ( ð ) ⊕ Φ ¯ ( ð ) for car selection example.
Table 5. Results of algebraic sum operation Φ ¯ ( ð ) ⊕ Φ ¯ ( ð ) for car selection example.
Φ ¯ ( ð ) ⊕ Φ ¯ ( ð ) [ 1 − ( 1 − μ Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − μ Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − μ Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − μ Φ ¯ ( ð ) U ( ℘ ) ) ] [ h Φ ¯ ( ð ) L ( ℘ ) h Φ ¯ ( ð ) L ( ℘ ) , h Φ ¯ ( ð ) U ( ℘ ) h Φ ¯ ( ð ) U ( ℘ ) ] [ 1 − ( 1 − Ψ Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − Ψ Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − Ψ Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − Ψ Φ ¯ ( ð ) U ( ℘ ) ) ]
℘ 1 [0.44, 0.54][0.06, 0.12][0.007, 0.02]
℘ 2 [0.40, 0.58][0.09, 0.09][0.02, 0.05]
℘ 3 [0.64, 0.77][0.01, 0.02][0.007, 0.03]
℘ 4 [0.52, 0.68][0.002, 0.01][0.04, 0.08]
Table 6. Results of algebraic product operation Φ ¯ ( ð ) ⊗ Φ ¯ ( ð ) for car selection example.
Table 6. Results of algebraic product operation Φ ¯ ( ð ) ⊗ Φ ¯ ( ð ) for car selection example.
Φ ¯ ( ð ) ⊗ Φ ¯ ( ð ) [ μ Φ ¯ ( ð ) L ( ℘ ) μ Φ ¯ ( ð ) L ( ℘ ) , μ Φ ¯ ( ð ) U ( ℘ ) μ Φ ¯ ( ð ) U ( ℘ ) ] [ 1 − ( 1 − h Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − h Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − h Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − h Φ ¯ ( ð ) U ( ℘ ) ) ] [ 1 − ( 1 − Ψ Φ ¯ ( ð ) L ( ℘ ) ) ( 1 − Ψ Φ ¯ ( ð ) L ( ℘ ) ) , 1 − ( 1 − Ψ Φ ¯ ( ð ) U ( ℘ ) ) ( 1 − Ψ Φ ¯ ( ð ) U ( ℘ ) ) ]
℘ 1 [0.06, 0.10][0.43, 0.57][0.19, 0.28]
℘ 2 [0.05, 0.12][0.51, 0.51][0.27, 0.40]
℘ 3 [0.16, 0.27][0.19, 0.27][0.19, 0.36]
℘ 4 [0.08, 0.16][0.09, 0.19][0.40, 0.52]
Table 7. Φ ¯ ( ð 1 ) .
Table 7. Φ ¯ ( ð 1 ) .
Φ ¯ ( ð 1 ) μ Φ ¯ ( ð 1 ) L ( ℘ ) , μ Φ ¯ ( ð 1 ) U ( ℘ ) h Φ ¯ ( ð 1 ) L ( ℘ ) , h Φ ¯ ( ð 1 ) U ( ℘ ) Ψ Φ ¯ ( ð 1 ) L ( ℘ ) , Ψ Φ ¯ ( ð 1 ) U ( ℘ )
℘ 1 [0.20, 0.30][0.10, 0.15][0.15, 0.20]
℘ 2 [0.25, 0.30][0.20, 0.30][0.10, 0.20]
℘ 3 [0.30, 0.40][0.15, 0.20][0.10, 0.15]
Table 8. Φ ¯ ( ð 1 ) .
Table 8. Φ ¯ ( ð 1 ) .
Φ ¯ ( ð 1 ) μ Φ ¯ ( ð 1 ) L ( ℘ ) , μ Φ ¯ ( ð 1 ) U ( ℘ ) h Φ ¯ ( ð 1 ) L ( ℘ ) , h Φ ¯ ( ð 1 ) U ( ℘ ) Ψ Φ ¯ ( ð 1 ) L ( ℘ ) , Ψ Φ ¯ ( ð 1 ) U ( ℘ )
℘ 1 [0.25, 0.35][0.10, 0.15][0.15, 0.20]
℘ 2 [0.20, 0.30][0.20, 0.30][0.15, 0.25]
℘ 3 [0.35, 0.45][0.15, 0.20][0.15, 0.25]
Table 9. Φ ¯ ( ð 2 ) .
Table 9. Φ ¯ ( ð 2 ) .
Φ ¯ ( ð 2 ) μ Φ ¯ ( ð 2 ) L ( ℘ ) , μ Φ ¯ ( ð 2 ) U ( ℘ ) h Φ ¯ ( ð 2 ) L ( ℘ ) , h Φ ¯ ( ð 2 ) U ( ℘ ) Ψ Φ ¯ ( ð 2 ) L ( ℘ ) , Ψ Φ ¯ ( ð 2 ) U ( ℘ )
℘ 1 [0.30, 0.40][0.15, 0.25][0.10, 0.15]
℘ 2 [0.20, 0.30][0.10, 0.20][0.20, 0.30]
℘ 3 [0.10, 0.25][0.20, 0.25][0.15, 0.20]
Table 10. Φ ¯ ( ð 2 ) .
Table 10. Φ ¯ ( ð 2 ) .
Φ ¯ ( ð 2 ) μ Φ ¯ ( ð 2 ) L ( ℘ ) , μ Φ ¯ ( ð 2 ) U ( ℘ ) h Φ ¯ ( ð 2 ) L ( ℘ ) , h Φ ¯ ( ð 2 ) U ( ℘ ) Ψ Φ ¯ ( ð 2 ) L ( ℘ ) , Ψ Φ ¯ ( ð 2 ) U ( ℘ )
℘ 1 [0.30, 0.35][0.15, 0.25][0.15, 0.20]
℘ 2 [0.30, 0.40][0.10, 0.20][0.25, 0.45]
℘ 3 [0.25, 0.35][0.20, 0.25][0.15, 0.25]
Table 11. Φ ¯ ( ð 1 ) ⊕ Φ ¯ ( ð 2 ) .
Table 11. Φ ¯ ( ð 1 ) ⊕ Φ ¯ ( ð 2 ) .
Φ ¯ ( ð 1 ) ⊕ Φ ¯ ( ð 2 ) μ Φ ¯ ( ð 1 ) L + μ Φ ¯ ( ð 2 ) L − μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U + μ Φ ¯ ( ð 2 ) U − μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U
℘ 1 [0.44, 0.58][0.01, 0.03][0.01, 0.03]
℘ 2 [0.40, 0.51][0.02, 0.06][0.02, 0.06]
℘ 3 [0.37, 0.55][0.03, 0.05][0.01, 0.03]
Table 12. Φ ¯ ( ð 1 ) ⊕ Φ ¯ ( ð 2 ) .
Table 12. Φ ¯ ( ð 1 ) ⊕ Φ ¯ ( ð 2 ) .
Φ ¯ ( ð 1 ) ⊕ Φ ¯ ( ð 2 ) μ Φ ¯ ( ð 1 ) L + μ Φ ¯ ( ð 2 ) L − μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U + μ Φ ¯ ( ð 2 ) U − μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U
℘ 1 [ 0.47 , 0.57 ] [ 0.01 , 0.03 ] [ 0.02 , 0.04 ]
℘ 2 [ 0.44 , 0.58 ] [ 0.02 , 0.06 ] [ 0.03 , 0.11 ]
℘ 3 [ 0.51 , 0.64 ] [ 0.03 , 0.05 ] [ 0.02 , 0.06 ]
Table 13. Φ ¯ ( ð 1 ) ⊗ Φ ¯ ( ð 2 ) .
Table 13. Φ ¯ ( ð 1 ) ⊗ Φ ¯ ( ð 2 ) .
Φ ¯ ( ð 1 ) ⊗ Φ ¯ ( ð 2 ) μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U h Φ ¯ ( ð 1 ) L + h Φ ¯ ( ð 2 ) L − h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U + h Φ ¯ ( ð 2 ) U − h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U Ψ Φ ¯ ( ð 1 ) L + Ψ Φ ¯ ( ð 2 ) L − Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U + Ψ Φ ¯ ( ð 2 ) U − Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U
℘ 1 [ 0.06 , 0.12 ] [ 0.24 , 0.36 ] [ 0.23 , 0.32 ]
℘ 2 [ 0.05 , 0.09 ] [ 0.28 , 0.44 ] [ 0.28 , 0.44 ]
℘ 3 [ 0.03 , 0.1 ] [ 0.32 , 0.40 ] [ 0.23 , 0.32 ]
Table 14. Φ ¯ ( ð 1 ) ⊗ Φ ¯ ( ð 2 ) .
Table 14. Φ ¯ ( ð 1 ) ⊗ Φ ¯ ( ð 2 ) .
Φ ¯ ( ð 1 ) ⊗ Φ ¯ ( ð 2 ) μ Φ ¯ ( ð 1 ) L μ Φ ¯ ( ð 2 ) L , μ Φ ¯ ( ð 1 ) U μ Φ ¯ ( ð 2 ) U h Φ ¯ ( ð 1 ) L + h Φ ¯ ( ð 2 ) L − h Φ ¯ ( ð 1 ) L h Φ ¯ ( ð 2 ) L , h Φ ¯ ( ð 1 ) U + h Φ ¯ ( ð 2 ) U − h Φ ¯ ( ð 1 ) U h Φ ¯ ( ð 2 ) U Ψ Φ ¯ ( ð 1 ) L + Ψ Φ ¯ ( ð 2 ) L − Ψ Φ ¯ ( ð 1 ) L Ψ Φ ¯ ( ð 2 ) L , Ψ Φ ¯ ( ð 1 ) U + Ψ Φ ¯ ( ð 2 ) U − Ψ Φ ¯ ( ð 1 ) U Ψ Φ ¯ ( ð 2 ) U
℘ 1 [ 0.07 , 0.12 ] [ 0.23 , 0.36 ] [ 0.27 , 0.36 ]
℘ 2 [ 0.06 , 0.12 ] [ 0.28 , 0.44 ] [ 0.36 , 0.58 ]
℘ 3 [ 0.08 , 0.15 ] [ 0.32 , 0.40 ] [ 0.27 , 0.43 ]
Table 15. IVPFS relation Φ for candidate evaluation (interval-valued picture fuzzy assessments).
Table 15. IVPFS relation Φ for candidate evaluation (interval-valued picture fuzzy assessments).
CandidateCriteria
ι 1  (Experience) ι 2  (Communication) ι 3  (Technical) ι 4  (Decision) ι 5   (Commitment)
℘ 1 μ : [ 0.2 , 0.4 ] h : [ 0.3 , 0.45 ] Ψ : [ 0.05 , 0.10 ] μ : [ 0.35 , 0.5 ] h : [ 0.05 , 0.10 ] Ψ : [ 0.3 , 0.4 ] μ : [ 0.40 , 0.50 ] h : [ 0.2 , 0.3 ] Ψ : [ 0.05 , 0.10 ] μ : [ 0.30 , 0.35 ] h : [ 0.3 , 0.5 ] Ψ : [ 0.05 , 0.10 ] μ : [ 0.1 , 0.2 ] h : [ 0.3 , 0.4 ] Ψ : [ 0.30 , 0.35 ]
℘ 2 μ : [ 0.3 , 0.45 ] h : [ 0.2 , 0.4 ] Ψ : [ 0.05 , 0.10 ] μ : [ 0.05 , 0.10 ] h : [ 0.35 , 0.40 ] Ψ : [ 0.4 , 0.5 ] μ : [ 0.2 , 0.3 ] h : [ 0.4 , 0.6 ] Ψ : [ 0.05 , 0.10 ] μ : [ 0.4 , 0.6 ] h : [ 0.1 , 0.15 ] Ψ : [ 0.10 , 0.15 ] μ : [ 0.05 , 0.1 ] h : [ 0.3 , 0.4 ] Ψ : [ 0.2 , 0.35 ]
℘ 3 μ : [ 0.20 , 0.40 ] h : [ 0.10 , 0.15 ] Ψ : [ 0.25 , 0.35 ] μ : [ 0.05 , 0.10 ] h : [ 0.10 , 0.15 ] Ψ : [ 0.30 , 0.55 ] μ : [ 0.30 , 0.40 ] h : [ 0.30 , 0.40 ] Ψ : [ 0.05 , 0.15 ] μ : [ 0.10 , 0.20 ] h : [ 0.50 , 0.60 ] Ψ : [ 0.10 , 0.15 ] μ : [ 0.40 , 0.65 ] h : [ 0.20 , 0.25 ] Ψ : [ 0.05 , 0.10 ]
℘ 4 μ : [ 0.30 , 0.40 ] h : [ 0.10 , 0.15 ] Ψ : [ 0.20 , 0.30 ] μ : [ 0.15 , 0.25 ] h : [ 0.40 , 0.50 ] Ψ : [ 0.10 , 0.15 ] μ : [ 0.30 , 0.45 ] h : [ 0.10 , 0.20 ] Ψ : [ 0.10 , 0.20 ] μ : [ 0.05 , 0.15 ] h : [ 0.50 , 0.65 ] Ψ : [ 0.10 , 0.15 ] μ : [ 0.05 , 0.10 ] h : [ 0.55 , 0.65 ] Ψ : [ 0.10 , 0.20 ]
Table 16. Ideal candidate profile ð for administrative position.
Table 16. Ideal candidate profile ð for administrative position.
CriterionMembership [ μ L , μ U ] Neutrality [ h L , h U ] Non-Membership [ Ψ L , Ψ U ]
Experience ( ι 1 )[0.05, 0.10][0.20, 0.30][0.50, 0.55]
Communication ( ι 2 )[0.20, 0.25][0.40, 0.55][0.10, 0.20]
Technical ( ι 3 )[0.10, 0.15][0.20, 0.40][0.25, 0.35]
Decision Making ( ι 4 )[0.25, 0.40][0.10, 0.15][0.20, 0.30]
Commitment ( ι 5 )[0.60, 0.70][0.05, 0.10][0.10, 0.20]
Table 18. Comparison of weighted vs. unweighted aggregated results.
Table 18. Comparison of weighted vs. unweighted aggregated results.
CandidateWeighted A w ( ℘ ) Unweighted A ( ℘ )
℘ 1 ( [ 0.14 , 0.16 ] , [ 0.0056 , 0.0156 ] , [ 0.00016 , 0.00063 ] ) ( [ 0.40 , 0.61 ] , [ 0.04 , 0.16 ] , [ 0.02 , 0.06 ] )
℘ 2 ( [ 0.12 , 0.18 ] , [ 0.003 , 0.009 ] , [ 0.0002 , 0.001 ] ) ( [ 0.40 , 0.55 ] , [ 0.01 , 0.02 ] , [ 0.02 , 0.06 ] )
℘ 3 ( [ 0.20 , 0.28 ] , [ 0.008 , 0.015 ] , [ 0.0001 , 0.0005 ] ) ( [ 0.52 , 0.73 ] , [ 0.04 , 0.06 ] , [ 0.02 , 0.07 ] )
℘ 4 ( [ 0.10 , 0.14 ] , [ 0.006 , 0.018 ] , [ 0.0002 , 0.001 ] ) ( [ 0.32 , 0.43 ] , [ 0.04 , 0.09 ] , [ 0.02 , 0.06 ] )
Table 19. Candidate scores and ranking comparison.
Table 19. Candidate scores and ranking comparison.
RankCandidateWeighted Score S w ( ℘ ) Unweighted Score S ( ℘ )
1 ℘ 3 0.23970.580
2 ℘ 1 0.14720.465
3 ℘ 2 0.13940.435
4 ℘ 4 0.11690.335
Table 20. Comparison of model features in the existing frameworks and the proposed IVPFSRS.
Table 20. Comparison of model features in the existing frameworks and the proposed IVPFSRS.
ModelsInterval-
Valued
Picture
Fuzzy
Soft
Set
Rough
Set
Boundary
Region
Multi-Valued
Representation
Decision
Feasibility
Generalization
RS [2]✘✘✘✔✔✘✘✘
Soft Set [5]✘✘✔✘✘✘✔✘
IVIF Soft Rough Sets [28]✔✘✔✔✔✔✔✔
Neutrosophic Soft Rough Sets [19]✘✘✔✔✔✔✔✔
Spherical Fuzzy Rough Sets [26]✘✘✘✔✔✔✔✔
IVPF Soft Set [21]✔✔✔✘✘✔✔✔
IVPFS [22]✔✔✘✘✘✔✔✔
Rough Integrated Asymmetric Cloud Model [34]✔✘✘✔✔✔✔✔
Interval Rough Integrated Cloud Model [35]✔✘✘✔✔✔✔✔
Cloud Model Multi-granularity LGDM [36]✔✘✘✔✔✔✔✔
Proposed IVPFSRS✔✔✔✔✔✔✔✔
Note: ✔ indicates the feature is present; ✘ indicates the feature is absent.
Table 21. Quantitative performance comparison across different models.
Table 21. Quantitative performance comparison across different models.
ModelDecision Accuracy (%)Time (s)Uncertainty ScoreInterpretability
IVIF Soft Rough Sets [28]82.30.450.723.8
Neutrosophic Soft Rough Sets [19]85.10.620.813.2
Spherical Fuzzy Rough Sets [26]87.60.380.794.1
IVPF Soft-Set [21]83.90.280.764.3
Rough Integrated Asymmetric Cloud Model [34]89.50.850.883.7
Interval Rough Integrated Cloud Model [35]88.90.820.873.6
Cloud Model Multi-granularity LGDM [36]87.30.780.853.8
Proposed IVPFSRS91.20.510.893.9
Table 22. Statistical significance of performance improvements.
Table 22. Statistical significance of performance improvements.
Comparison PairAccuracy Improvementp-ValueSignificance
IVPFSRS vs. IVIF-SRS+8.9%0.008Highly Significant
IVPFSRS vs. NSRS+6.1%0.023Significant
IVPFSRS vs. SFRS+3.6%0.042Significant
IVPFSRS vs. Cloud-Asymmetric+1.7%0.087Not Significant
Table 23. Empirical scaling behavior of IVPFSRS framework.
Table 23. Empirical scaling behavior of IVPFSRS framework.
Scale CategoryDataset Size (n, m)Performance Behavior
Small scale n < 100 , m < 20 Near real-time performance (<1 s)
Medium scale n < 1000 , m < 50 Practical for batch processing (seconds–minutes)
Large scale n > 10000 , m > 100 Requires distributed or approximate computation
Table 24. Recommended deployment strategies for IVPFSRS framework.
Table 24. Recommended deployment strategies for IVPFSRS framework.
ScenarioImplementation StrategySuitable Applications
Small to Medium ProblemsDirect IVPFSRS algorithm with full parameter optimizationSupplier selection, personnel evaluation, small-scale medical diagnosis, local decision making
Large-Scale ApplicationsHybrid IVPFSRS + ML model with distributed computingLarge-scale recommendation systems, financial risk assessment, enterprise resource planning, big data analytics
Real-Time SystemsPre-compute approximations with incremental updates and caching mechanismsDynamic decision support, adaptive user interfaces, IoT systems, real-time monitoring
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

Almozaini, R.M.; Alsager, K.M. Interval-Valued Picture Fuzzy Soft Rough Sets: A New Hybrid Framework for Robust Multi-Criteria Group Decision-Making. Symmetry 2026, 18, 419. https://doi.org/10.3390/sym18030419

AMA Style

Almozaini RM, Alsager KM. Interval-Valued Picture Fuzzy Soft Rough Sets: A New Hybrid Framework for Robust Multi-Criteria Group Decision-Making. Symmetry. 2026; 18(3):419. https://doi.org/10.3390/sym18030419

Chicago/Turabian Style

Almozaini, Reefan Mosallam, and Kholood Mohammad Alsager. 2026. "Interval-Valued Picture Fuzzy Soft Rough Sets: A New Hybrid Framework for Robust Multi-Criteria Group Decision-Making" Symmetry 18, no. 3: 419. https://doi.org/10.3390/sym18030419

APA Style

Almozaini, R. M., & Alsager, K. M. (2026). Interval-Valued Picture Fuzzy Soft Rough Sets: A New Hybrid Framework for Robust Multi-Criteria Group Decision-Making. Symmetry, 18(3), 419. https://doi.org/10.3390/sym18030419

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