Decision methods based on Bonferroni mean operators and EDAS for the classifications of circular pythagorean fuzzy Meta-analysis

1.   Introduction

One of the most preferable and valuable techniques is called meta-analysis ^[1], which is a statistical tool used to combine and evaluate the results from various independent studies on a particular topic or research question. The technique of meta-analysis ^[2] is a very suitable procedure for depicting vague and problematic information, but utilizing the technique of meta-analysis under the consideration of the classical set theory is very complex and vague because the range of crisp set is very limited. Further, the decision-making procedure is also used for finding the best optimal among the collection of alternatives, where the MADM technique is an important part of the decision-making process, and is also used for evaluating the required results under the concern criteria ^[3]. During the decision-making process, many experts have lost a lot of information because of limited information, such as zero and one. For this, Zadeh ^[4] proposed the fuzzy sets (FSs) with a truth function, such as ${\mathbb{F}}_{BM}\left(\mathcal{L}j\right)\in \left[\mathrm{0, 1}\right]$, where ${\mathbb{F}}_{BM}:X\to \left[\mathrm{0, 1}\right]$. Moreover, in dealing with uncertain and unreliable information, the technique of truth function is not enough to resolve some complex problems. Further, the falsity function also plays an essential role in many complex problems because of their features. For this, Atanassov ^[5,6] derived the intuitionistic FSs (IFSs), which is a very flexible and reliable theory for managing vague and unreliable information, where the truth function and falsity function are a major part of the IFSs with a condition that the sum of the duplet will be contained in the unit interval. Further, the idea of FSs is a special case of the IFSs, and due to these features, many applications have been designed, such as aggregation operators ^[7,8], hybrid operators ^[9,10], and decision-making problems ^[11,12].

The function of truth grade and the function of falsity grade have a lot of potential to cope with vague and uncertain information with the condition that the sum of the duplet is contained in the unit interval; however, in the presence of the following kinds of pair, $\left(\mathrm{0.6, 0.7}\right)$, the IFSs have not worked feasibly because $0.6+0.7 = 1.3\notin \left[\mathrm{0, 1}\right]$. For this reason, in 2013, Yager ^[13] proposed the Pythagorean FSs (PFSs), where the structure of PFSs is the same as the structure of IFSs, but the condition of both techniques are different such as the sum of the square of the duplet will be contained in unit interval: ${0.6}^{2}+{0.7}^{2} = 0.36+0.49 = 0.85\in \left[\mathrm{0, 1}\right]$. The technique of PFSs is very wide due to their condition, where the IFSs and FSs are the special cases of the PFSs. Further, Deveci et al. ^[14] discussed the survey on recent applications of PFSs. Moreover, Mandel and Ranadive ^[15] exposed the decision-theoretic rough set based on PFSs. Additionally, Perez-Dominguez et al. ^[16] evaluated the CODAS technique for PFSs and their applications. Further, Alkan and Kahraman ^[17] presented the CODAS technique for PFSs with application in supply chain management. Moreover, Sun and Wang ^[18] exposed the distance measures for Pythagorean fuzzy information processing. Additionally, Calik ^[19] presented the AHP and TOPSIS techniques based on PFSs and their application in Industry 4.0.

IFSs contained the truth function and falsity function with a condition that the sum of the duplet will be contained in the unit interval, but it is also possible to involve a new function, called the radius function between truth and falsity grades. Therefore, Atanassov ^[20] presented the technique of circular IFSs (CIFSs) with three different functions with the same range, called the truth function, falsity function, and radius function, with a condition that the sum of the duplet will be contained in the unit interval. Many applications have been proposed by different scholars: example, decision-making problems for CIFSs ^[21], divergence measures for CIFSs ^[22], distance measures for CIFSs ^[23], and similarity/entropy measures for CIFSs ^[24]. Further, Bozyigit et al. ^[25] presented the technique of circular PFSs (CPFSs) by modifying the condition of the CIFSs such as that the sum of the square of the duplet will be contained in the unit interval. Further, the CPFSs contain the technique of truth function, falsity function, and radius function, which is wider and more reliable than the existing techniques, such as FSs, IFSs, PFSs, and CIFSs, which can cope with vague and unreliable information in genuine life problems. Further, Ali and Yang ^[26] derived the technique of Hamacher operators for CPFSs.

Keshavarz Ghorabaee et al. ^[27] proposed a new technique, called the EDAS method, known as evaluation based on the distance from average solution, which is mostly used for evaluating the best optimal among the collection of information. Further, Klement et al. ^[28] proposed the idea of triangular norms, which contained different types of norms and their geometrical representations. Additionally, the Bonferroni mean (BM) operators ^[29] were proposed based on algebraic norms, which are used for aggregating the collection of information into a singleton set. Furthermore, Xu and Yager ^[30] proposed the BM operators for IFSs. Moreover, Xia et al. ^[31] evaluated the BM operators for generalized IFSs. Additionally, Liang et al. ^[32] derived the BM operators for PFSs and their applications. Further, Yang et al. ^[33] exposed the BM operators for PFSs based on triangular norms.

After the overall discussion, we observed that the model of circular Pythagorean fuzzy sets is very reliable and dominant because of the: The model of FSs to the model of CIFSs is the part of the CPF sets. Further, we also noticed that the model of Bonferroni mean operators and weighted Bonferroni mean operators are not proposed yet based on CPFSs, which are used for the aggregation of a finite number of information into a singleton set. The major problem is that up to date no one has derived the BM operators for CPFSs. Further, we also noticed that the EDAS method has not been proposed, which is a very reliable technique for evaluating some complicated and vague information. The major themes of this manuscript are listed below:

1) To propose the technique of the CPFBM, CPFWBM and describes their special cases using two parameters, "s" and "t". Some describable properties are also proposed for the above techniques.

2) To present the technique of the EDAS technique for the CPFSs.

3) To show the flexibility and dominance of the proposed operators by comparing the proposed methods with some techniques.

This manuscript is arranged as follows: In Section 2, we describe the prevailing notion of CPFSs and their operational laws. Moreover, we discuss the technique of the BM operator for any collection of non-negative integers. In Section 3, we propose the CPFBM operator, and CPFWBM operator and describe their special cases using two parameters, "s" and "t". Some describable properties are also proposed for the above techniques. In Section 4, we present the technique of the EDAS technique for the CPFSs. In Section 5, we use some examples to show the flexibility and dominance of the proposed operators. In Section 6, we compare the proposed method with some existing techniques to enhance the worth of the proposed theory. Some remarkable statements are given in Section 7.

In this section, we describe the prevailing notion of CPFSs and their operational laws. Moreover, we discuss the technique of the BM operator for any collection of non-negative integers.

2.   Preliminaries

In this section, we describe the prevailing notion of CPFSs and their operational laws. Moreover, we discuss the technique of the BM operator for any collection of non-negative integers.

Definition 1. ^[25] A CPFS $P$ on fixed set $X$ is explained below:

Here, the representation of the truth grade and falsity grade with radius are follows, such as ${\mathbb{F}}_{BM}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}\left(\mathcal{L}j\right)$, and ${\mathbb{H}}_{BM}\left(\mathcal{L}j\right)$, satisfying $1\le {\mathbb{F}}_{BM}\left(\mathcal{L}j\right)\le 1$, $0\le {\mathbb{G}}_{BM}\left(\mathcal{L}j\right)\le 1$ with ${\left({\mathbb{F}}_{BM}\left(\mathcal{L}j\right)\right)}^{2}+{\left({\mathbb{G}}_{BM}\left(\mathcal{L}j\right)\right)}^{2}\le 1$. Further, for convenience, the simple name of the pair $\left({\mathbb{F}}_{BM}^{P}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{P}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{P}\left(\mathcal{L}j\right)\right)$ is called CPFN, such as ${P}_{\sigma } = \left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), \sigma = \mathrm{1, 2}, \dots, \varphi$.

Definition 2. ^[26] Consider three CPFNs, $P = \left({\mathbb{F}}_{BM}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}\left(\mathcal{L}j\right)\right)$, ${P}_{1} = \left({\mathbb{F}}_{BM}^{1}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{1}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{1}\left(\mathcal{L}j\right)\right)$, and ${P}_{2} = \left({\mathbb{F}}_{BM}^{2}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{2}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{2}\left(\mathcal{L}j\right)\right)$ with $\lambda$, thus

Definition 3. ^[26] Consider a CPFN, such as $P = \left({\mathbb{F}}_{BM}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}\left(\mathcal{L}j\right)\right)$, we have

Called score value and accuracy value with a condition that is if $S\left({P}_{1}\right) > S\left({P}_{1}\right)$, then ${P}_{1} > {P}_{2}$; if $S\left({P}_{1}\right) = S\left({P}_{1}\right)$, then ${P}_{1} = {P}_{2}$, then if $H\left({P}_{1}\right) > H\left({P}_{1}\right)$, then ${P}_{1} > {P}_{2}$.

Definition 4. ^[29] Consider $P, Q\ge 0$ with a collection of non-negative integers ${a}_{\sigma }\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$, thus

Called BM operator.

3.   CPF bonferroni mean operator

In this section, we compute the technique of CPFBM operator and CPFWBM operator. Further, we discuss some basic properties of the above-proposed operators, called idempotency, monotonicity, and boundedness.

Definition 5. Consider $s, t > 0$ with a collection of CPFNs,

Thus,

Called ${CPFBM}^{s, t}$ Operator for t-norm and t-conorm.

Theorem 1. Consider $s, t > 0$ with a collection of CPFNs,

thus, we prove that the aggregated theory of the above operators is again CPFN, such as

Proof. Using mathematical induction, we prove the above theory, such as if

Thus, we combine the above two information with the help of product rules, such as

Further, we use the addition technique, we have

Finally, by mathematical induction, we have, if $\varphi = 2$, such as

The proposed theory holds for $\varphi = 2$, if we have done the above theory for $\varphi = \omega$, such as

Then, we prove it for $\varphi = \omega +1$, such as

Where,

and

Then,

The proposed theory is held for $\varphi = \omega +1$. Then,

Hence,

The proposed theory holds for all values of $\varphi$. Similarly, we evaluate the remaining part using the same procedures, such as

Theorem 2. Consider $s, t > 0$ with a collection of CPFNs ${P}_{\sigma } = \left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$, then

1) Idempotency: If ${P}_{\sigma } = P = \left({\mathbb{F}}_{BM}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}\left(\mathcal{L}j\right)\right)$, then

2) Monotonicity: If ${P}_{\sigma }\le {P}_{\sigma }^{*}$ that is ${\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\le {{\mathbb{F}}^{\mathbb{*}}}_{BM}^{\sigma }\left(\mathcal{L}j\right)$, ${\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\ge {\mathbb{G}}_{BM}^{\sigma *}\left(\mathcal{L}j\right)$, and ${\mathbb{H}}_{BM}\left(\mathcal{L}j\right)\le {\mathbb{H}}_{BM}^{*}\left(\mathcal{L}j\right)$, thus

3) Commutativity: Consider ${{P}_{\sigma }}^{*}\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$ be the permutation of ${P}_{\sigma }\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$, thus

4) Boundedness: Consider ${P}^{-} = \left({m\sigma \varphi }_{\sigma }\left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {max}_{\sigma }\left({\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {m\sigma \varphi }_{\sigma }\left({\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\right)$ and ${P}^{+} = \left({max}_{\sigma }\left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {m\sigma \varphi }_{\sigma }\left({\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {max}_{\sigma }\left({\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\right)$, thus

Further, we simplify the supremacy and validity of the proposed theory by discussing their special cases with the help of parameters.

Case 1: When $t\to 0$, then

Called the generalized CPF averaging (GCPFA) operator.

Case 2: When $s = 1$ and $t\to 0$, thus

This is called the CPF averaging (CPFA) operator.

Case 3: When $s = 2$ and $t\to 0$, thus

Called the CPF square mean (CPFSM) operator.

Definition 6. Consider $s, t > 0$ with a collection of CPFNs,

thus

This is called the ${CPFWBM}^{s, t}$ operator with weight vector ${w}_{\sigma }\in \left[\mathrm{0, 1}\right]$ and ${\sum }_{\sigma = 1}^{\varphi }{w}_{\sigma } = 1$.

Theorem 3. Consider $s, t > 0$ with a collection of CPFNs, ${P}_{\sigma } = \left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$, thus we prove that the aggregated theory of the above operators is again CPFN, such as

Proof. Omitted.

Theorem 4: Consider $s, t > 0$ with a collection of CPFNs ${P}_{\sigma } = \left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$, then

1) Idempotency: If ${P}_{\sigma } = P = \left({\mathbb{F}}_{BM}\left(\mathcal{L}j\right), {\mathbb{G}}_{BM}\left(\mathcal{L}j\right), {\mathbb{H}}_{BM}\left(\mathcal{L}j\right)\right)$, then

2) Monotonicity: If ${P}_{\sigma }\le {P}_{\sigma }^{*}$ that is ${\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\le {{\mathbb{F}}^{\mathbb{*}}}_{BM}^{\sigma }\left(\mathcal{L}j\right)$, ${\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\ge {\mathbb{G}}_{BM}^{\sigma *}\left(\mathcal{L}j\right)$, and ${\mathbb{H}}_{BM}\left(\mathcal{L}j\right)\le {\mathbb{H}}_{BM}^{*}\left(\mathcal{L}j\right)$, thus

3) Commutativity: Consider ${{P}_{\sigma }}^{*}\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$ be the permutation of ${P}_{\sigma }\left(\sigma = \mathrm{1, 2}, \dots, \varphi \right)$, thus

4) Boundedness: Consider ${P}^{-} = \left({m\sigma \varphi }_{\sigma }\left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {max}_{\sigma }\left({\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {m\sigma \varphi }_{\sigma }\left({\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\right)$ and ${P}^{+} = \left({max}_{\sigma }\left({\mathbb{F}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {m\sigma \varphi }_{\sigma }\left({\mathbb{G}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right), {max}_{\sigma }\left({\mathbb{H}}_{BM}^{\sigma }\left(\mathcal{L}j\right)\right)\right)$, thus

Proof. Omitted.

4.   Evaluation based on distance from average solution for proposed theory

The major theme of this section is to expose or construct the technique of the EDAS procedure based on the initiated operators. For this, we compute the following procedure, such as

Step 1: Design the matrix by including the terms of CPFNS by assigning to each attribute ${\theta }^{th}$ in every alternative ${\sigma }^{th}$, such as

The representation of the weight vector is as follows, such as $W = {\left({\mathrm{w}}_{1}, {\mathrm{w}}_{2}, \dots, {\mathrm{w}}_{\mathrm{m}}\right)}^{\mathrm{T}}$ with $\sum _{\theta = 1}^{\varphi }{\mathrm{w}}_{\mathrm{j}} = 1$.

Step 2: Consider the technique of the CPFBM operator, we expose the average solution, such as

Step 3: Compute the value of PDA and the value of NDA in the shape of a matrix, such as

These techniques will be used for truth, falsity, and radius functions.

Step 4: Derive the technique of weighted summation according to the technique of PDA and NDA, such as

Step 5: Compute the normalized values according to the values of ${\mathrm{S}\mathrm{P}}_{\mathrm{i}}$ and ${\mathrm{S}\mathrm{N}}_{\mathrm{i}}$, such as

Step 6: Derive the appraisal values based on the above information, such as

Step 7: Rank all alternatives, to examine the best optimal.

Moreover, we discuss the supremacy of the above technique by evaluating some examples with the help of the above technique. For this, we discuss the problem of the classification of the CPF meta-analysis and its application.

5.   Classification of the Circular Pythagorean fuzzy Meta-analysis and its applications

In this section, we describe one of the most preferable and dominant techniques or applications called meta-analysis, which is a statistical technique used to evaluate or analyze the data from multiple independent studies for a particular topic or research question. In this application, we concentrate on using the initiated operators and methods to evaluate the above problems. For this, we consider the problem of meta-analysis and find the major key steps involved in meta-analysis, such as

1) Data Extraction "A1".

2) Pooling of Effect Sizes "A2".

3) Assessment of Heterogeneity "A3".

4) Publication Bias Assessment "A4".

5) Subgroup Analysis and Sensitive Analysis "A5".

We have some attributes, such as growth analysis, social impact, political impact, environmental impact, and internet resources. For this, we compute the following procedure, such as

Step 1: Design the matrix by including the terms of CPFNS by assigning to each attribute ${\theta }^{th}$ in every alternative ${\sigma }^{th}$, see Table 1.

Step 2: Consider the technique of the CPFBM operator, we expose the average solution, such as

Step 3: Compute the value of PDA and the value of NDA in the shape of a matrix, see Tables 2 and 3.

Step 4: Derive the technique of weighted summation according to the technique of PDA and NDA based on the weight vector $\left(\mathrm{0.2, 0.2, 0.2, 0.2, 0.2}\right)$. Tables 4 and 5.

Step 5: Compute the normalized values according to the values of ${\mathrm{S}\mathrm{P}}_{\mathrm{i}}$ and ${\mathrm{S}\mathrm{N}}_{\mathrm{i}}$, see Table 6.

Step 6: Derive the appraisal values based on the above information, such as

Step 7: Rank all alternatives, to examine the best optimal, such as

The most prominent decision is ${\mathcal{S}\mathcal{V}}_{5}$, according to the technique of the EDAS method, which is represented by the "Subgroup analysis and Sensitive Analysis". Further, we show the flexibility of the proposed theory by using the proposed operators without the EDAS method to evaluate the dominancy and flexibility of the proposed operators. For this, we consider the information in Table 7.

Further, we evaluate the support of any two CPF values based on distance measures. Thus, we have

Thus, by using the above values, we find the following information, such as

Moreover, using the technique of the CPFBM operator, we have the following aggregated values, such as

Thus, we consider the technique of score values, such as

Finally, we have the following ranking values, such as

The most prominent decision is ${\mathcal{S}\mathcal{V}}_{4}$ according to the technique of the CPFBM operator, which is represented by the "Publication Bias Assessment". Further, we compare the proposed theory with some existing techniques for evaluating the supremacy and validity of the proposed theory.

6.   Comparative analysis

The main theme of this article is to evaluate the supremacy and flexibility of the proposed method and proposed operators by comparing their ranking values with the obtained values of existing techniques to enhance the worth of the initiated theory. For this, we consider some existing techniques: Ali and Yang ^[26] derived the technique of Hamacher operators for CPFSs. Furthermore, Xu and Yager ^[30] proposed the theory of BM operators for IFSs. Moreover, Xia et al. ^[31] evaluated the technique of BM operators for generalized IFSs. Additionally, Liang et al. ^[32] derived the technique of BM operators for PFSs and their applications. Further, Yang et al. ^[33] exposed the BM operators for PFSs based on triangular norms. Finally, using the information in Table 7, the comparative analysis is listed in Table 8.

The most prominent decision is ${\mathcal{S}\mathcal{V}}_{4}$, according to the technique of the CPFBM operator, which is represented by the "Publication Bias Assessment". Further, the existing techniques have failed because of ambiguity and limitations, where the proposed theory of Xu and Yager ^[30], Xia et al. ^[31], Liang et al. ^[32], and Yang et al. ^[33] are the special cases of the proposed theory. The limitations of the existing models are described below:

1) Ali and Yang ^[26] derived the technique of Hamacher operators for CPFSs. The models for the Hamacher operators are very flexible and dominant because of their features. According to the theory of Ali and Yang ^[26], the ranking values are listed as follows: $S\left({z}_{4}\right) > S\left({z}_{5}\right) > S\left({z}_{3}\right) > S\left({z}_{2}\right) > S\left({z}_{1}\right)$. Once more, the proposed model is different from the existing technique because it is computed based on the Bonferroni operators.

2) Xu and Yager ^[30] proposed the theory of BM operators for IFSs, which is a special part of the proposed theory. The technique of BM operators for IFSs cannot evaluate the CPF kind of information, because the condition of CPF sets is more general. The three functions are the part of CPFSs, but in the case of IFSs, we have just two functions, which is the special case of the derived theory.

3) Xia et al. ^[31] evaluated the technique of BM operators for generalized IFSs, which is a special part of the proposed theory. The technique of BM operators for IFSs cannot evaluate the CPF kind of information, because the condition of CPF sets is more general, where the three functions are the part of CPFSs, but in the case of IFSs, we have just two functions, which is the special case of the derived theory.

4) Liang et al. ^[32] derived the technique of BM operators for PFSs and their applications as part of initiated operators, since this technique contains only two functions, but the proposed model is the modified version. This is because they contained three functions, and if we ignored the radius function form the CPFSs, then the proposed theory will be converted to the existing models.

5) Further, Yang et al. ^[33] exposed the BM operators for PFSs based on triangular norms as part of initiated operators, since this technique contains only two functions, but the proposed model is the modified version. This is because they contained three functions, and if we ignored the radius function form the CPFSs, then the proposed theory will be converted to the existing models.

Thus, after our long analysis, we concluded that the proposed model is superior and more general than the existing technique in coping with vague and uncertain information. Hence, the proposed model is more reliable and more general than the existing information.

7.   Conclusions

The major themes of this manuscript are listed below:

1) We propose the technique of the CPFBM operator, and CPFWBM operator and describe their special cases with the help of two parameters, "s" and "t". Some describable properties are also proposed for the above techniques.

2) We present the technique of the EDAS technique for the CPFSs.

3) We show the flexibility and dominance of the proposed operators by comparing the proposed methods with some existing techniques.

In the future, we will discuss the novel technique of circular picture fuzzy sets and their extensions. Further, we will develop some new techniques for aggregation operators ^[34], similarity measures ^[35], and different kinds of methods ^[36]. Finally, we will discuss their application in artificial intelligence ^[37], data science ^[38], and decision-making theory ^[39] to enhance the worth of the proposed methods.

Author contributions

Weiwei Jiang: Conceptualization, Methodology, Formal analysis, Writing–review and editing, Visualization; Zeeshan Ali: Conceptualization, Software, Validation, Formal analysis, Investigation, Data Curation, Writing–review and editing; Muhammad Waqas: Conceptualization, Software, Validation, Formal analysis, Investigation, Data Curation, Writing–review and editing; Peide Liu: Software, Validation, Investigation, Resources, Data Curation, Writing–review and editing, Visualization Supervision, Project administration, Funding acquisition. All authors have read and approved the final version of the manuscript for publication.

Conflict of interest

The authors declare there is no conflict of interest.