1.
Introduction
In real-life situation, decision-making (DM) plays a vital role, for the selection of logical choice among several objects we use the process of MD. The foundation of a fuzzy set (FS) was laid by Zadeh [1] in 1965, characterized by member function belong to [0, 1]. This concept was further extended by Zadeh [2] in 1975, and proposed an interval-valued fuzzy (IVF)set characterized by a lower fuzzy set and an upper fuzzy set. In the DM problem parameterized fuzzy operators were introduced by Song et al. [3]. In 1986, Atanassov [29] generalized the theory of FS and initiated intuitionistic fuzzy (IF)set by the affix of non-MF with the restriction (MF)+(NMF)≤1. Some aggregation operators like generalized AOs by Zhao et al. [4] and generalized geometric AOs by Tan et al. [5,6] under the environment of IFS. In IFS we study the MD and NMD, here we ignore the neutral degree, so to cover these gaps in 2014 Cuong [7] proposed the generalized structure of IFS and FS called picture fuzzy set, which is characterized by three membership degree positive, neutral and negative member degree with the restriction that the sum of this three-membership degree is less and equal than 1. In 1998, Smarandache [25] proposed a neutrosophic set, which is characterized by truth, indeterminacy, and falsehood membership degree, with the condition that the sum of truth, indeterminacy, and falsehood membership degree is less and equal to 3. In a neutrosophic set it is difficult to handle the voting problems when the expert's judgment is of a type like yes, abstinence, no, and rejection, as the sum of the three membership degrees is greater than 1, beside this it cannot be provided the information of voting of non-candidates of the above voting. In the other words, we say that picture fuzzy set is a special case of a neutrosophic set, because every picture fuzzy set can be neutrosophic set but the converse is not true. Some aggregation operators under the environment of picture fuzzy set are aggregation operators for PF set by Garg [8], PFAOs and their application in MADM by Wei [9], PF Einstein AOs by Khan et al. [10], and PF Dombi AOs by Jana et al. [11]. However, during the research, experts faced some issues when they have taken the value of MD is 0.8 and NMD is 0.6, then 0.8+0.6≰1, so here the condition of IFS failed. So, to cover this limitation in 2013 Yager [12] proposed the generalized structure of IFS, which is called the Pythagorean fuzzy set. A Pythagorean fuzzy set is characterized by MD and NMD, with the condition that (MD)2+(NMD)2≤1. Several aggregation operators under the environment of a Pythagorean fuzzy set such as PYFWA, PYFWG, PYFWPA and PYFWPG operators proposed by Yager [13,14]. In 2021, Akrma et al. [38], handle MCGDM problem under the environment of complex Pythagorean fuzzy set by using CPF-VIKOR method. In 2021, Akram et al. [39], proposed two novel modified techniques, namely Pythagorean fuzzy hybrid order of preference by Similarity to an Ideal Solution (PFH-TOPSIS) method and Pythagorean fuzzy hybrid Elimination and Choice Translating Reality I (PPFH-ELECTRE I) method, in order to measure risk ranking in failure modes and effects analysis (FMEA). In 2021, Akram et al. [40], also proposed a novel multi-criteria optimization technique, namely, the complex Pythagorean fuzzy N-soft VIKOR (CPFNS-VIKOR) method that is highly proficient to express a great deal of linguistic imprecision and vagueness inherent in human assessments. In 2022, Akram et al. [41] proposed a new hybrid model with application under the environment of Complex fermatean fuzzy N-soft set to handle uncertainties. In 2016, Yager [20] made a new generalization of IFS and PFS, called q-rung orthopair fuzzy set. q-ROFS is described by MD and NMD with the restriction that (MD)q+(NMD)q≤1(q≻1). Different aggregation operators under the environment of q-ROFS are q-ROFWA operators by Liu and Wang [15], q-ROF Bonferroni mean weighted operator by y Liu and Liu [16], q-ROF power Maclaurin averaging operators by Liu et al. [17], q-ROF Dombi AOs by Jana et al. [18], q-ROF Neutrality AOs by Garg and Chen [19], MAGD with q-rung orthopair picture fuzzy information by Akram et al. [37]. In 2018, Joshi et al. [30] introduced the theory of interval-valued q-rung orthopair fuzzy soft set, which deals with the situation, of hesitation of assessment in the intervals. In such type of situation experts provide their grades in the closed subinterval of [0, 1]. The concept of interval-valued q-rung orthopair fuzzy soft set was further modified in various structures see Hayat et al. [31], Yang et al. [32], and Hayat et al. [33]. In 1999, Molodtsov [21] proposed a new structure called soft set which deals with the attribute. The theory of soft set was further merged with different structures and developed a generalized concept like Maji [22,23,34,35,36]. In 2020, Hussain et al. [24] combined the structure of soft set and q-ROF set and proposed a new concept called q-rung orthopair fuzzy soft set, which is characterized by membership degree and non-membership degree with attributes, but here no information about the neutral degree, so to cover this gap we present a hybrid of picture fuzzy set and q-rung orthopair fuzzy soft set to get a generalized structure called q-rung orthopair picture fuzzy soft set, which deal the uncertainty problem with positive, neutral and negative membership degree by affix a parameterization tool.
The rest of this manuscript is as follows: Section 2, discusses some basic preliminaries. Section 3, presents a hybrid of picture fuzzy set and q-ROF soft set and develop a novel structure q-ROPF soft set, and also discuss their basic operations. In Section 4, we study some aggregation operators like q-ROPF soft weighted averaging operator and q-ROPF soft order weighted averaging operator and their related fundamental properties. In Section 5, we develop a step-wise algorithm for MADM problem. In Subsection 5.1, for application we consider a biological example of common disease "obstructive goiter". In Section 6, we present a comparison analysis of the proposed model with the existing model to show the superiority. In Section 7, provide a conclusion.
2.
Preliminary
Definition 2.1. [29] An IFS ˜N on a universe Η is expressed by the two-mapping given as
Where L˜N(μ):H→[0,1] and G˜N(μ):H→[0,1] represent the MD and NMD, with the condition that 0≤(L˜N(μ))+(G˜N(μ))≤1.
And the score S (˜N) and accuracy A (˜N) function is represented as
Definition 2.2. [12] By PYFS ˜N on a universe of discourse Η is defined as
Where L˜N(μ):H→[0,1] and G˜N(μ):H→[0,1] represent the MD and NMD, with the condition that
and the score and accuracy function of Pythagorean fuzzy set is represented as
Definition 2.3. [20] A q-ROFS ˜N on a universe of discourse Η is defined as
Where L˜N(μ):H→[0,1] and G˜N(μ):H→[0,1] represent the MD and NMD, with the condition that
and the score and accuracy function of q-ROFS is represented as
Definition 2.4. [21]Let an Η be a fixed set and € represent the set of parameters and ₵⊆€. Then the pair (₣,₵) is said to be soft set over H, where ₣isafunctiondefineas₣:₵→P(H). P(H) represent the power set of H.
Definition 2.5. [28] Let (H,₵) be a soft universe and ₵⊆€. By Pythagorean fuzzy soft set we mean a pair (˜N,₵) over H, where ˜N is a function given by ˜N:₵→PFS(H) is defined as
Where Lj(μi) represent the MD and Gj(μi) represent the NMD μiϵH to a set ˜N¨ej(μi), with the condition that
which is simply denoted by ˜N¨ej(μi) = ⟨μi,Lj(μi),Gj(μi)⟩.
Definition 2.6. [24] Let (H,₵) be a soft universe and ₵⊆€. By q-rung orthopair fuzzy soft set we mean a pair (˜N,₵) over H, where ˜N is a function given by ˜N:₵→q−ROFS(H) is defined as
Where Lj(μi) represent the MD and Gj(μi) represent the NMD μiϵH to a set ˜N¨ej(μi), with the condition that
which is simply denoted by ˜N¨ej(μi) = ⟨μi,Lj(μi),Gj(μi)⟩ and the degree of indeterminacy of q−ROPFSfN is defined as π˜N¨eij = q√1−((Lj(μi))q+(Gj(μi))q).
Definition 2.7. [7] A picture fuzzy set ˜N on a fixed set Η is displayed as
Where L˜N(μ),G˜N(μ),Ł˜N(μ):H→[0,1] represent the positive MD, neutral MD and negative MD, with the condition that, with the condition that
3.
q-Rung orthopair picture fuzzy soft (q-ROPFSfS) set
Definition 3.1. Let (H,₵) be a soft universe and ₵⊆€. By q-rung orthopair picture fuzzy soft set we mean a pair (˜N,₵) over H, where ˜N is a function given by ˜N:₵→q−ROPFS(H) is defined as
where Lj(μi) represent the positive MD and Gj(μi) represent the neutral MD and Łj(μi) denoted negative MD of μiϵH to a set ˜N¨ej(μi), with the condition that
which is simply denoted by ˜N¨ej(μi) = ⟨μi,Lj(μi),Gj(μi),Łj(μi)⟩q and the degree of indeterminacy of q-ROPFSfN is defined as
Basic operations on q-ROPF soft set
Let ˜N=(L,G,Ł) be any tree q-ROPFSfNs and ˜N¨e1j = (L1j,G1j,Ł1j) (j = 1, 2) and λ, λ₁, λ₂≻0. Then the operations of q-ROPFSfNs are define as
(1)˜N¨e11∪˜N¨e11 = (max(L11,L12),min(G11,G12),min(Ł11,Ł12));
(2)˜N¨e11∩˜N¨e11 = (min(L11,L12),min(G11,G12),max(Ł11,Ł12));
(3)˜NC = (Ł,G,L);
(4)˜N¨e11≤˜N¨e11 if and only if (L11≤L12,G11≤G12,Ł11≥Ł12);
(5)˜N¨e11⊕˜N¨e11 = (q√(L11)q+(L12)q−(L11)q(L12)q,G11G12,Ł11Ł12);
(6)˜N¨e11⊗˜N¨e11 = (L11L12,q√(G11)q+(G12)q−(G11)q(G12)q,q√(Ł11)q+(Ł12)q−(Ł11)q(Ł12)q);
(7)λ˜N = (q√1−(1−Lq)λ,Gλ,Łλ);
(8)˜Nλ = (Lλ,q√1−(1−Gq)λ,q√1−(1−Łq)λ).
Definition 3.2. A score function of q−ROPFSfN˜N¨eij = (Lij,Gij,Łij) can be define as
where q ≥ 1 and S (˜N¨eij)∈ [−1, 1].
Example 3.1. Assume that a person wants to select a car out of five possible alternatives in a market that is −U = {t₁, t₂, t₃, t₄, t₅} with the parameters ? = {e1, e2, e3,e4}.
e1= Price
e2 = Comfort
e3= Fuel Efficiency
e4= Looks.
Let ˜N¨e11 = (L11,G11,Ł11) and ˜N¨e12 = (L12,G12,Ł12) be two q−ROPFSfNs. Then
(ⅰ) S (˜N¨e11) > S (˜N¨e12), ˜N¨e11≥˜N¨e12
(ⅱ) S (˜N¨e11) < S (˜N¨e12), ˜N¨e11≤˜N¨e12
(ⅲ) S (˜N¨e11) = S (˜N¨e12), then
(a) π˜N¨e11 > π˜N¨e11,then ˜N¨e11 < ˜N¨e12
(b) πq˜N¨e11 > πq˜N¨e12, then ˜N¨e11 = ˜N¨e12.
From "Table 1" we show the result in the form of q−ROPFSfNs, by evaluated the alternative with rating values.
Theorem 3.1. Let ˜N¨eij = (Lij,Gij,Łij) and ˜N=(L,G,Ł) be any two q−ROPFSfNs and λ, λ1, λ2≻0, having the properties.
(ⅰ) ˜N¨e11⊕˜N¨e12 = ˜N¨e12⊕˜N¨e11
(ⅱ) ˜N¨e11⊗˜N¨e12 = ˜N¨e12⊗˜N¨e11
(ⅲ) λ(˜N¨e11⊕˜N¨e12) = λ˜N¨e11⊕λ˜N¨e12
(iv) (λ1⊕λ2)˜N = λ1˜N⊕λ2˜N
(ⅴ) ˜N(λ1⊕λ2)=λ1⊗˜Nλ2
(ⅵ) ˜Nλ¨e11⊗˜Nλ¨e12 = (˜N¨e11⊕˜N¨e12)λ.
Proof. Straightforward.
4.
Average aggregation operator under the environment of q-ROPF soft set
In this section, we discuss some aggregation operators like q−ROPFSfWA and q−ROPFSfOWA operators and their related results.
4.1. q-ROPF soft weighted average (q−ROPFSfWA) operators
Definition 4.1. Assume that ˜N¨eij = (Lij,Gij,Łij) for (i=1,2,…nandj=1,2,….m) be collection of q=ROPFSfNs and weight vector ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively. The mapping q−ROPFSfWA: Đn→ Đ is said to be q−ROPFSfWA operator. (Đ is the collection of q−ROPFSfNs).
Theorem 4.1. Consider the collection of q−ROPFSfNs ˜N¨eij = (Lij,Gij,Łij) then the aggregation result for q−ROPFSfWA operator is expressed:
Ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively.
Proof. To solve this result we use the mathematical induction. We have,
for λ ≥ 1. For n = 2 and m = 2, Eq (10) is true.
Next, we will check for n = κ1 and m = κ2.
And further for n = κ1+1 and m = κ2+1.
Hence by the induction process we prove that Eq (10) is true for all m, n≥1 and also Eq (10) is true for n = κ1+1 and m = κ2+1. Moreover, to obtained the aggregated result from q−ROPFSfWA operator is again q−ROPFSfNs. For, any ˜N¨eij = (Lij,Gij,Łij) be collection of q−ROPFSfNs and weight vector ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively. So,
Now, for 0 ≤Gij≤1 ⇒0 ≤ Πni=1Gωiij≤1 ⇒ 0 ≤Πmj=1(Πni=1Gωiij)υi≤1 and
As, 0≤Lqij+Gqij+Łqij≤1 ⇒ Gqij+Łqij≤1−Lqij
Now, we have
By Eq (11), 0≤ 1−∏mj=1(∏ni=1(1−Lqij)ωi)υi+Πmj=1(Πni=1Gωiij)υi+Πmj=1(Πni=1Łωiij)υi=1.
Therefore,
Hence, we proved the required result.
Example 4.1. Assume that a person wants to purchase a new laptop in the domain set
−U = {t₁, t₂, t₃, t₄, t₅}
t₁ = HP Pavilion,
t₂ = Dell Inspiron,
t₃ = Apple iBook,
t₄ = Toshiba,
t₅ = Lenovo
and with the parameters € = {e1, e2, e3,e4}
e₁ = Battery life,
e₂ = Memory and storage,
e₃ = Carrying weight,
e₄ = Warranty.
Suppose that the weight vectors ω = {0.15, 0.16, 0.20, 0.25, 0.24} and υ = {0.5, 0.17, 0.13, 0.20} for the expert xi and parameters ej, respectively. From "Table 2" we decision maker show the result in the form of q−ROPFSfNs, by evaluated each laptop to their corresponding parameters.
By Eq (10) we have
Theorem 4.2. Assume that ˜N¨eij = (Lij,Gij,Łij) be the collection of q−ROPFSfNs and weight vector ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively. Then the q−ROPFSfWA operator hold the following properties:
(1)Idempotency: If ˜N¨eij = R¨e, where R¨e=(∁,Ə,Ⅎ) and for all (i=1,2,…,nandj=1,2,….,m), then q−ROPFSfWA(˜N¨e11,˜N¨e12,….,˜N¨enm) = R¨e.
(2) Boundedness: If
and
then
(3) Monotonicity: If R¨eij = (∁ij,Əij,Ⅎij) be the collection of q−ROPFSfNs such that Lij≤∁ij,Gij≤Əij, Łij≥Ⅎij then
(4)Shift Invariance: If R¨e=(∁ij,Əij,Ⅎij) is q−ROPFSfNs, then
(5)Homogeneity: If λ ≥ 0, then
Proof. We know that ˜N¨e11=R¨e=(∁,Ə,Ⅎ), then we have
Hence, q−ROPFSfWA(˜N¨e11,˜N¨e12,….,˜N¨enm) = R¨e.
(2) Boundedness: We know that
and
To show that,
Next, we have
and
Therefore, from Eqs (12)–(14), we have
Let δ = q−ROPFSfWA(˜N¨e11,˜N¨e12,….,˜N¨enm)=(Lδ,Gδ,Łδ), then by score function
and
Now we have the following cases:
(i) If S (δ)≤ S (˜N+¨eij) and S (δ)≥S (˜N−¨eij), by the comparison of these two q−ROPFSfNs, we get
(ii) If S (δ) = S (˜N+¨eij), then
then by above inequalities, we get
Hence
(3)Monotonicity: Since Lij≤∁ij,Gij≤ƏijandŁij≥Ⅎij, then
⇒Lij≤∁ij ⇒1−∁ij ≤ 1−Lij ⇒ 1−∁qij ≤ 1−Lqij
⇒ Πmj=1(Πni=1(1−∁qij)ωi)υi≤Πmj=1(Πni=1(1−Lqij)ωi)υi
⇒ 1−Πmj=1(Πni=1(1−Lqij)ωi)υi≤1−Πmj=1(Πni=1(1−∁qij)ωi)υi
⇒ q√1−Πmj=1(Πni=1(1−Lqij)ωi)υi≤q√1−Πmj=1(Πni=1(1−∁qij)ωi)υi
next Gij≤Əij
⇒ Πni=1(Gij)ωi≤Πni=1(Əij)ωi
⇒ Πmj=1(Πni=1(Gij)ωi)υi≤Πmj=1(Πni=1(Əij)ωi)υi
and Łij≥Ⅎij
⇒ Πni=1(Łij)ωi≥Πni=1(Ⅎij)ωi
⇒ Πmj=1(Πni=1(Łij)ωi)υi≤Πmj=1(Πni=1(Ⅎij)ωi)υi.
Suppose that δ˜N = q−ROPFSfWA(˜N¨e11,˜N¨e12,….,˜N¨enm) = (Lδ˜N,Gδ˜N,Łδ˜N) and
Now, from the above equation, we have
then by the score function we have S (δ˜N)≤ S (δR).
Now, we have the following cases:
(Ⅰ) By the comparison of two q-ROPF soft numbers, if S (δ˜N)< S (δR), then
(Ⅱ) If S (δ˜N)= S (δR), where
We have, Lδ˜N=∁δR,Gδ˜N=ƏδRandŁδ˜N=ℲδR. Hence
⇒ πqδ˜N = πqδR
⇒ (Lδ˜N,Gδ˜N,Łδ˜N) = (∁δR,ƏδR,ℲδR).
Proved that q−ROPFSfWA(˜N¨e11,˜N¨e12,….,˜N¨enm)<q−ROPFSfWA(R¨e11,R¨e12,….,R¨enm).
(4)Shift Invariance: Since R¨e=(∁,Ə,Ⅎ) and ˜N¨eij = (L¨eij,G¨eij,ٍeij) are the q-ROPF soft numbers, so ˜N¨eij⊕ R¨e=(q√(1−Lqij)(1−∁q),GqijƏ,ŁqijℲ). Therefore,
(5)Homogeneity: Let ˜N¨eij = (L¨eij,G¨eij,ٍeij) be a q−ROPFSfNs and λ ≥0, be any real number, then
Hence, the property proved.
4.2. q-ROPF soft ordered weighted average (q−ROPFSfOWA) operator
Definition 4.2. Assume that ˜N¨eij = (Lij,Gij,Łij) for (i=1,2,…nandj=1,2,….m) be collection of q=ROPFSfNs and weight vector ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively. The mapping q−ROPFSfOWA:Đn→ Đ is said to be q−ROPFSfOWA operator. (Đ is the collection of q−ROPFSfNs).
Theorem 4.3. Consider the collection of q−ROPFSfNs ˜N¨eij = (Lij,Gij,Łij) then the aggregation result for q−ROPFSfOWA operator is expressed:
ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively.
Proof. Proof is similar to the theory of "q−ROPFSfWA" operator.
Example 4.2. From "Table 2" of Example 4.1, we take the collections q−ROPFSfNs˜N¨eij = (Lij,Gij,Łij)) by using the score function, the we obtain the tabular representation of ˜N¨eij = (Lσij,Gσij,Łσij) is presented in "Table 3".
By Eq (16) we have
Theorem 4.4. Consider the collection of q−ROPFSfNs ˜N¨eij = (Lij,Gij,Łij) of weight vector ω = {ω1, ω2, ...., ωn} with the condition ∑ni=1ωi=1 and υ = {υ1, υ2, ......, υm} with the condition that ∑ni=1υi=1 for alternatives xi and parameters ej, respectively. Then the q−ROPFSfOWA operator hold the following properties:
(1)Idempotency: If ˜N¨eij = {\mathfrak{R}}_{\ddot{{{{\mathrm{e}}}}}} , where {\mathfrak{R}}_{\ddot{{{{\mathrm{e}}}}}} = \left(\complement, Ə, Ⅎ\right) and for all \left({{{\mathrm{i}}}} = {{{\mathrm{1, 2}}}}, \dots, {{{\mathrm{n}}}}\; {{{\mathrm{a}}}}{{{\mathrm{n}}}}{{{\mathrm{d}}}}\; {{{\mathrm{j}}}} = {{{\mathrm{1, 2}}}}, \dots., {{{\mathrm{m}}}}\right) , then q - ROPF{S_f}OWA \left({\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{11}}, {\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{12}}, \dots., {\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{n}}}}{{{\mathrm{m}}}}}}\right) = {\mathfrak{R}}_{\ddot{{{{\mathrm{e}}}}}} .
(2) Boundedness: If
and
then
(3) Monotonicity: If {\mathfrak{R}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}} = \left({\complement }_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {Ə}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {Ⅎ}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\right) be the collection of q - ROPF{S_f}Ns such that {\mathcal{L}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\le {\complement }_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {{{{\mathrm{G}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\le {Ə}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}} , {{{{\mathrm{Ł}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\ge {Ⅎ}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}} then
(4) Shift Invariance: If {\mathfrak{R}}_{\ddot{{{{\mathrm{e}}}}}} = \left({\complement }_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {Ə}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {Ⅎ}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\right) is q - ROPF{S_f}Ns, then
(5) Homogeneity: If {{{\mathrm{\lambda }}}} ≥ 0, then
Proof. Straight forward.
5.
MADM under q-ROPF soft information
In real life situation DM play very important role, and it is a pre-plan process of selecting the best choice out of many alternatives. Let Ą = {ą₁, ą₂, ......ąl} be the set of alternative and corresponding set parameter Ĉ = {c₁, c₂…..., cm}. The team of n senior expert Đ₁, Đ₂, ......., Đn} evaluate to each alternative ąs to their corresponding parameters cj. The group of senior experts provide their evaluation in terms of {\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}} = \left({\mathcal{L}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {{{{\mathrm{G}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {{{{\mathrm{Ł}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\right) with the weight vector ω = {\left({{{\mathrm{\omega }}}}₁, {{{\mathrm{\omega }}}}2, ....., {{{\mathrm{\omega }}}}n\right)}^{{{{\mathrm{T}}}}} with the condition \sum _{i = 1}^{n}{\omega }_{i} = 1 and υ = {\left({{{\mathrm{\upsilon }}}}1, \; {{{\mathrm{\upsilon }}}}2, \; ......, \; {{{\mathrm{\upsilon }}}}m\right)}^{{{{\mathrm{T}}}}} with the condition that \sum _{i = 1}^{n}{\upsilon }_{i} = 1 for alternatives xi and parameters ej, respectively. Where the collective information of senior expert are described by the decision matrix M = {\left[{\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}\right]}_{{{{\mathrm{m}}}}\times {{{\mathrm{n}}}}} and the aggregated q-ROPF soft number ℧S for alternative (S = 1, 2, …., l) is given as ℧S = \left({\mathcal{L}}_{{{{\mathrm{S}}}}}, {{{{\mathrm{G}}}}}_{{{{\mathrm{S}}}}}, {{{{\mathrm{Ł}}}}}_{{{{\mathrm{S}}}}}\right) . Finally, we apply the score function on each aggregated q-ROPF soft number ℧S = \left({\mathcal{L}}_{{{{\mathrm{S}}}}}, {{{{\mathrm{G}}}}}_{{{{\mathrm{S}}}}}, {{{{\mathrm{Ł}}}}}_{{{{\mathrm{S}}}}}\right) for the alternative and rank them in a specific ordered to get the best option. Steps involve in algorithm for solving MADM applications.
Algorithm:
Step 1. Construct a decision matrix M = {\left[{\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}\right]}_{{{{\mathrm{m}}}}\times {{{\mathrm{n}}}}} :
Step 2. Normalization of q-ROPF soft decision matrix M = {\left[{\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}\right]}_{{{{\mathrm{m}}}}\times {{{\mathrm{n}}}}}
where {\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}^{C} } reprsent the complement of {\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}} .
Step 3. To aggregate the -ROPF soft number {\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}} = \left({\mathcal{L}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {{{{\mathrm{G}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}, {{{{\mathrm{Ł}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}\right) for each alternative.
Step 4. To calculate the score value.
Step 5. At the end arrange the score value to choose the best option.
5.1. Application of the proposed model to MCDM
For a decision-making problem, we consider a numerical example. Let consider a Đ₁, Đ₂, Đ₃, Đ₄, Đ₅ which represents the set of senior expert doctors having ω = {\left({{{\mathrm{0.16, 0.26, 0.15, 0.20, 0.23}}}}\right)}^{{{{\mathrm{T}}}}} represent the weight-vector which evaluate a common disease "obstructive goiter" of four different patients (alternatives) z₁, z₂, z₃ and z₄ based on the following signs and symptoms may include:
which represent the set of parameters having weight vectors υ = {\left({{{\mathrm{0.28, 0.20, 0.1, 0.15, 0.27}}}}\right)}^{{{{\mathrm{T}}}}} . To diagnose the illness patients, we construct a step-wise algorithm.
By q-ROPF soft weight averaging operator:
Step 1. Construct a decision matrix M = {\left[{\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}\right]}_{{{{\mathrm{m}}}}\times {{{\mathrm{n}}}}} expressed in q-ROPF soft numbers, which are given in Tables 4–7, respectively
Step 2. Normalization is not necessary because all the parameters are similar.
Step 3. To aggregate the q - ROPF{S_f}WA operator for each alternative, so we get
Step 4. To calculate the score value.
Step 5. At the end arrange the score value to choose the best option.
Figure 1 shows the ranking order of alternatives of q - ROPF{S_f}WA operator.
So, from the above analysis, it is observed that patient z₁ is more illness.
By q-ROPF soft ordered weight averaging operator:
Step 1. Construct a decision matrix M = {\left[{\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}\right]}_{{{{\mathrm{m}}}}\times {{{\mathrm{n}}}}} expressed in q-ROPF soft numbers, which are given in Table 8–11, respectively.
Step 2. Normalization is not necessary because all the parameters are similar.
Step 3. To aggregate the q - ROPF{S_f}OWA operator for each alternative, so we get
Step 4. To calculate the score value.
Step 5. At the end arrange the score value to choose the best option.
Figure 2 shows the ranking order of alternatives of q - ROPF{S_f}OWA operator.
So, from the above analysis, it is observed that patient z₁ is more illness.
6.
Comparative analysis
In this section we compare the result of our proposed model with the existing methods based on different operators, to show superiority and influence. In the existing method of various operators (see [15,24,26,27,28]) we handle the DM problem with the help of membership and non-membership degree with attributes, but it cannot handle the situation when the expert's judgment is of a type like yes, abstinence, no and rejection, because there is no information about the neutral degree. So, the logic behind our proposed model is that they have the capability to handle the situations with more generality than the existing concepts, with positive, neutral, and negative degrees (0≤ {\left({{{\mathrm{\mu }}}}\right)}^{q}+{\left({{{\mathrm{\eta }}}}\right)}^{q}+{\left({{{\mathrm{\nu }}}}\right)}^{q}\le 1) with parameterization tools, which is more generalized than the previous concept. Based on q-ROPF soft weighted averaging operator and q-ROPF soft order weighted averaging operator we construct a decision matrix M = {\left[{\widetilde{{{{\mathrm{N}}}}}}_{{\ddot{{{{\mathrm{e}}}}}}_{{{{\mathrm{i}}}}{{{\mathrm{j}}}}}}\right]}_{{{{\mathrm{m}}}}\times {{{\mathrm{n}}}}} expressed in q-ROPF soft numbers, which are given in Table 4–11 than aggregated this decision matrix with weight vector ω = {\left({{{\mathrm{0.16, 0.26, 0.15, 0.20, 0.23}}}}\right)}^{{{{\mathrm{T}}}}} and their corresponding results for each candidate are given in Table 12 and also Figure 3 shows the graphical representation of proposed operators with existing operators.
7.
Conclusions
In this article we present the hybrid of picture fuzzy set and q-rung orthopair fuzzy soft set, to get the generalized structure of q-rung orthopair fuzzy soft set called q-rung orthopair picture fuzzy soft set q - ROPF{S_f}S, which is characterized by positive, neutral and negative membership degree by affixing a parameterization tool to solve the uncertainties. The notion of q - ROPF{S_f}S S covers the gap of neutral degree, in the existing concept of q-rung orthopair fuzzy soft set. The main contribution of this article is to investigate the basic operations and aggregation operators like q-ROPF soft weighted averaging operator and q-ROPF soft ordered weighted averaging operator under the environment of q-rung orthopair picture fuzzy soft set. Moreover, some fundamental properties like idempotency, boundedness, monotonicity, shift invariance, and homogeneity based on these operators are studied. Under the environment of q-ROPF soft set, we consider a biological problem (medical problem) and construct a stepwise algorithm for decision-making problem. Finally, we make a comparison analysis to compare the result of our proposed model with the existing methods, for show superiority and influence. The advantage of our proposed model is that they can handle the situations with more generality than an existing concept (q-rung orthopair fuzzy soft set), i.e., the existing concept, we deal the real-life problems with membership degree and non-membership degree (0≤ {\left({{{\mathrm{\mu }}}}\right)}^{q}+{\left({{{\mathrm{\eta }}}}\right)}^{q} ≤1) with attributes but in the proposed method we handle the situations with positive, neutral and negative degree (0≤ {\left({{{\mathrm{\mu }}}}\right)}^{q}+{\left({{{\mathrm{\eta }}}}\right)}^{q}+{\left({{{\mathrm{\nu }}}}\right)}^{q}\le 1) with parameterization tools, which is more generalized than the previous concept. This proposed work will be extended in various directions such as q-rung orthopair interval-valued picture fuzzy soft set, q-rung orthopair bi-polar picture fuzzy soft set, q-rung orthopair m-polar picture fuzzy soft set, q-rung orthopair cubic picture fuzzy soft set and q-rung orthopair neutrosophic fuzzy soft set, etc.
Acknowledgements
The authors A. ALoqaily and N. Mlaiki would like to thank Prince Sultan University for paying the APC and for the support through the TAS research lab.
Conflict of interest
The authors disclose no conflict of interests in publishing this paper.