1.
Introduction
Multi-criteria decision-making (MCDM) is a process of choosing the best course of action among several alternatives that are evaluated based on multiple criteria. MCDM is widely used in real life to solve complex problems that involve multiple objectives or goals and where there is no clear or objective single criterion for decision-making. In MCDM, different criteria are identified, and weights are assigned to them based on their relative importances. Then, the alternatives are evaluated against each criterion, and scores are assigned based on their performances. Finally, the scores are combined to determine the overall ranking of the alternatives, and the best course of action is selected. MCDM is widely used in various fields, such as finance, engineering, healthcare, environmental management and business management. For example, in finance, MCDM can be used to select the best investment portfolio that balances risk and return. In healthcare, MCDM can be used to select the best treatment option for a patient based on factors such as efficacy, side effects and cost. Li and Sun [1] proposed an intelligent investment strategy for stocks using historical data by developing a support vector machine (SVM) parameter optimization algorithm. In their 2021 study [2], they also applied a radial basis function (RBF) neural network optimal segmentation algorithm to credit rating, demonstrating improved accuracy in predicting credit ratings and its potential usefulness in credit risk assessment in financial institutions.
Aggregation operators are mathematical functions that combine multiple criteria or objectives into a single value that represents the overall performance of an alternative. Aggregation operators are widely used in decision-making to simplify complex problems that involve multiple criteria and objectives. For example, Garg and Rani [3] introduced aggregation operators that incorporate weighted averaging to combine various intricate intuitionistic fuzzy sets through t-norm operations. By employing Aczel Alsina operations, Senapati et al. [4] developed a variety of new aggregation operators that handle interval-valued intuitionistic fuzzy sets. Liu and Wang [5] introduced a series of aggregation operators that combine decision information expressed through linguistic intuitionistic fuzzy numbers. Akram et al. [6] proposed Hamacher weighted averaging and geometric aggregation operators for aggregating complex intuitionistic fuzzy information. Picture fuzzy aggregation operators were introduced by Riaz [7] and offer several benefits in handling practical situations. Verma and Merigó [8] created arithmetic and geometric aggregation operators to combine information from 2-dimensional linguistic intuitionistic fuzzy variables. Garg [9] introduced several weighted averaging and geometric operators, which were then employed to address decision-making problems. Abdullah et al. [10] suggested the use of Pythagorean cubic fuzzy Hamacher aggregation operators in solving the green supplier selection problem. Interval-valued Pythagorean fuzzy aggregation operators were developed by Peng and Yang [11] to combine interval-valued Pythagorean fuzzy information. Zulqarnain et al. [12] developed operational laws for Pythagorean fuzzy hypersoft numbers which consider their interaction. This led to the introduction of a variety of aggregation operators that depend on the established interaction operational laws. Amin et al. [13] introduced a set of generalized cubic Pythagorean fuzzy aggregation operators. These operators are designed to aggregate fuzzy information that is expressed in the form of Pythagorean fuzzy numbers and offer a flexible framework that can handle a wide range of applications. Nevertheless, in addition to these methods, several other authors have introduced alternative approaches to tackle decision-making problems, including ranking functions and aggregation operators [14,15,16,17,18,19,20,21,22,23,24,25]. These techniques provide further options for decision-makers seeking to optimize their decision-making processes.
Einstein operations, which include Einstein addition and multiplication, have a wide range of applications in various fields such as physics, computer science and image processing. For example, Einstein addition is used to calculate the relativistic velocities of objects moving at high speeds. It allows for the addition of velocities that approach the speed of light, which cannot be accomplished using ordinary addition. In decision-making, Einstein operations can be used to aggregate fuzzy information to obtain a more accurate representation of the underlying data. This can help to improve the decision-making process and increase the quality of the decisions made. Einstein operations and related aggregation operators have been utilized by numerous researchers across various fields to handle fuzzy information in diverse environments. These methods have been proposed and implemented in multiple applications, ranging from finance and economics to image processing and decision-making. For example, Wang and Liu [26] proposed operational laws on intuitionistic fuzzy sets which consist of several fundamental operations, including Einstein sum, Einstein product and Einstein exponentiation. Furthermore, they developed a set of geometric aggregation operators based on these operations to enhance the ability to deal with uncertainty and imprecision in decision-making. Riaz et al. [27] have introduced a class of aggregation operators, called q-rung orthopair fuzzy Einstein prioritized aggregation operators, to handle decision-making problems that involve q-rung orthopair fuzzy information. Complex q-rung picture fuzzy Einstein averaging operators were suggested by Akram et al. [28] as a means of addressing MCDM problems. Riaz et al. presented some prioritized operators in a q-rung orthopair fuzzy environment. To obtain additional information concerning Einstein aggregation operators and their application in MCDM, we can consult [29,30,31,32,33,34,35,36,37]. Table 1 provides explanations for the abbreviations used in this article.
Although the above extensions only consider membership and non-membership degrees, in real-world scenarios, it can be challenging to express the degree of membership accurately using a fuzzy set. In such situations, it may be easier to represent vagueness and uncertainty in the real world by using both interval and exact values instead of unique interval/exact values. Consequently, a hybrid form of an interval value, such as the Pythagorean cubic fuzzy set (PCFS), can be very useful in representing uncertainties caused by hesitant judgments in complex decision-making problems. Khan et al. [15,38] introduced the concept of the PCFS, which is described in two parts simultaneously: One represents the membership degrees using an interval-valued Pythagorean fuzzy number (IVPFN), while the other represents the membership degrees using a fuzzy number (FN). Thus, a PCFS is a hybrid set that combines an IVPFN and an FN. The advantage of PCFS is that it can contain much more data to express both the IVPFN and FN simultaneously. Table 2 contains the list of notations utilized in this article.
Motivations
Scholars have proposed many aggregation operators in the past for solving real-world decision-making problems. However, traditional fuzzy sets assign only a single value of membership, whereas Pythagorean cubic fuzzy sets use cubic polynomials and offer more flexibility in handling uncertainty. This helps decision-makers to assess decision-making criteria more comprehensively and accurately, leading to better outcomes. Although PCFSs provide a more robust framework for uncertain information in MCDM problems, unfortunately, there has not yet been any study conducted on the aggregation operators for PCFSs using Einstein operations. The present study expands the current aggregation operators by utilizing Einstein norm operations and proposing a series of aggregation operators. For this, we defined some new operations based on Einstein norm and conorm for Pythagorean cubic fuzzy numbers (PCFNs). By using operational laws in aggregation operators, it is possible to simplify and manipulate expressions, which in turn can help to improve the efficiency of computations and optimize the performance of systems. In addition, it is necessary to create a scoring and accuracy function that can effectively compare two PCFNs. By developing these functions, it will be possible to make more informed decisions and draw more accurate conclusions based on the comparison of PCFNs. Finally, a new method for solving MCDM problems has been introduced in this paper, based on the use of the proposed operators. The proposed work is outlined, and its objectives are presented in a summary fashion. These objectives are itemized and listed below to provide a clear and concise overview of the study's goals.
(1) To construct new score and accuracy functions that can effectively evaluate the performance of PCFNs by taking into account their unique characteristics.
(2) To define a framework for data processing and analysis by developing new operational laws that employ the Einstein t-norm and t-conorm for Pythagorean cubic fuzzy numbers. These operational laws will enable a more accurate representation of available information and improve decision-making quality.
(3) To propose new aggregation operators based on the proposed operational laws to aggregate different preferences of decision-makers in the PCFS environment.
(4) To propose an algorithm that utilizes the aforementioned operators to address the challenges of multi-criteria decision-making (MCDM) problems. This technique offers a practical and effective means of handling decision-making scenarios where multiple criteria or factors need to be considered.
(5) The study demonstrates the practical application of the proposed approach by implementing an established MCDM model and conducting a case study focused on identifying the optimal investment market.
To attain this objective, the remainder of the paper is outlined in the following manner: Section 2 clarifies the fundamental terminologies of PCFS and Einstein operations. Within Section 3, we present basic operational laws and their corresponding weighted aggregation operators for a collection of PCFSs. Also, the properties of the proposed operators are analyzed in detail. In Section 4, we expound on an MCDM technique that depends on the proposed operators for ranking different alternatives, wherein assessments linked to the criteria are presented in the form of PCFNs. Section 5 provides an example to demonstrate the approach and verify its feasibility and effectiveness. Finally, Section 6 summarizes the study.
2.
Preliminaries
The crucial background information employed in this study is presented in this section.
2.1. Pythagorean cubic fuzzy sets
Definition 1. [15,38] Let H be a non-empty finite set. A PCFS D of an element h∈H is defined as
where CD(h)=⟨ZD(h);μD(h)⟩, the membership grade, while DD(h)=⟨˜ZD(h);νD(h)⟩ represents the non-membership grade. Furthermore, ZD(h) and ˜ZD(h) are interval-valued fuzzy sets, while ξD(h) and ζD(h) represent fuzzy sets. Let ZD(h)=[ξLD(h),ξUD(h)] and ˜ZD(h)=[ζLD(h),ζUD(h)]. Then, CD(h)=(⟨[ξLD(h),ξUD(h);ξD(h)⟩) describes the degree of membership, while DD(h)=(⟨[ζLD(h),ζUDˆp(h)];ζD(h)⟩) represents the non-membership degree of an element h∈H, such that 0≼(ξUD(h))2+(ζUD(h))≼1 and 0≼(ξD(h))2+(ζD(h))2≼1. For simplicity, we call (⟨Z(h);ξ(t)⟩,⟨˜Z(h);ζ(t)⟩) a CPF number (PCFN), denoted by β=(⟨Z;ξ⟩,⟨˜Z,ζ⟩).
Definition 2. [15,38] Let α=(⟨Z;ξ⟩,⟨˜Z,ζ⟩), α1=(⟨Z1;ξ1⟩,⟨˜Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩,˜Z2;ζ2) be three PCFNs, and η is any positive real number, where Z1=[ξL1,ξU1], ˜Z1=[ζL1,ζU1], Z2=[ξL2,ξU2], ˜Z2=[ζL2,ζU2], Z=[ξL,ξU], and ˜Z=[ζL,ζU]. Then, the operational laws are defined as
(1) α1⊕α2=(⟨[√(ξL1)2+(ξL2)2−(ξL1)2(ξL2)2,√(ξU1)2+(ξU1)2−(ξU1)2(ξU1)2];√ξ21+ξ22−ξ21ξ22⟩,⟨[ζL1ζL2,ζU1ζU2];ζ1ζ2⟩),
(2) α1⊗α2=(⟨[ξL1ξL2,ξU1ξU2];ξ1ξ2⟩,⟨[√(ζL1)2+(ζL2)2−(ζL1)2(ζL2)2,√(ζU1)2+(ζU1)2−(ζU1)2(ζU1)2];√ζ21+ζ22−ζ21ζ22⟩),
(3) ηα=(⟨[√1−(1−(ξL)2)η,√1−(1−(ξU)2)η];√1−(1−ξ2)η⟩,⟨[(ζ−)η,(ζ+)η];ζη⟩),
(4) αη=(⟨[(ξL)η,(ξU)η];ξη⟩,⟨[√1−(1−(ζL)2)η,√1−(1−(ζU)2)η];√1−(1−ζ2)η⟩).
Definition 3. [15,38] Let α=(⟨Z;ξ⟩,⟨˜Z;ζ⟩) be a PCFN, where Z=[ξL,ξU], and ˜Z=[ζL,ζU]. Then, the score function Sc(ρ) is defined as
while the accuracy function is defined as
where −1≼Sc(α)≼1 and 0≼Ac(α)≼1. Let α1=(⟨Z1;ξ1⟩,⟨˜Z1,ζ1⟩) and α2=(⟨Z2,ξ2⟩,⟨˜Z2,ζ2⟩) be two PCFNs. If Sc(α1)≺Sc(α2) or Ac(α1)≺Ac(α2), then α1≺α2. If Sc(α1)≻Sc(α2) or Ac(α1)≻Ac(α2), then α1≻α2. If Sc(α1)=Sc(α2) and Ac(α1)=Ac(α2), then α1=α2.
Definition 4. [15,38] Let α, α1 and α2 be any three PCFNs, and φ, φ1 and φ2 are positive real numbers. Then, the following properties hold.
(1) α1⊕α2=α2⨁α1,
(2) α1⨂α2=α2⨂α1,
(3) η(α1⨁α2)=ηα1⨁ηα2,
(4) (η1+η2)α=η1α⨁η2α,
(5) (α1⨂α2)η=αη1⨂αη2,
(6) α(η1+η2)=αη1⨂αη2.
2.2. Einstein operations
Definition 5. [39] Einstein product TE and Einstein sum SE are defined as follows:
(1) TE(a,b)=a.b1+(1−a)(1−b), for all a,b∈[0,1]2,
(2) SE(a,b)=a+b1+ab, for all a,b∈[0,1]2.
3.
Einstein operations for Pythagorean cubic fuzzy sets
This section is dedicated to establishing a set of operational laws for PCFSs using two key elements, namely, TE and SE. The operational laws outlined in this section represent a significant contribution to the study of PCFSs and their real-world applications.
Definition 6. Let α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩, Z2;ζ2) be two PCFNs, where Z1=[α1,ξU1], Z1=[ζL1,ζU1], Z2=[ξL2,ξU2], and Z2=[ζL2,ζU2]. Then, some of the Einstein operations over α1 and α2 are defined as follows:
(1) α1⊕Eα2=(⟨[√(ξL1)2+(ξL2)21+(ξL1)2×E(ξL2)2,√(ξU1)2+(ξU2)21+(ξU1)2×E(ξU2)2];√(ξ1)2+(ξ2)21+(ξ1)2×E(ξ2)2⟩,⟨[ζL1×EζL2√1+(1−(ζL1)2)×E(1−(ζL2)2),ζU1×EζU2√1+(1−(ζU1)2)×E(1−(ζU2)2)];ζ1×Eζ2√1+(1−(ζ1)2)×E(1−(ζ2)2)⟩),
(2) α1⊗Eα2=(⟨[ξL1×EξL2√1+(1−(ξL1)2)×E(1−(ξL2)2),ξU1×EξU2√1+(1−(ξU1)2)×E(1−(ξU2)2)];ξ1×Eξ2√1+(1−(ξ1)2)×E(1−(ξ2)2)⟩⟨[√(ζL1)2+(ζL2)21+(ζL1)2×E(ζL2)2,√(ζU1)2+(ζU2)21+(ζU1)2×E(ζU2)2];√(ζ1)2+(ζ2)21+(ζ1)2×E(ζ2)2⟩).
Example 1. Let α1=(⟨[0.5,0.6];0.6⟩,[0.3,0.4];0.2) and α2=(⟨[0.2,0.3];0.5⟩,[0.6,0.7];0.4) are two PCFNs. Then, the operations α1⊕Eα2 and α1⊗Eα2 can be calculated as follows:
Definition 7. Let α=(⟨Z;ξ⟩,⟨ Z,ζ⟩) be a PCFN, where Z=[ξL,ξU] and Z=[ζL,ζU]. For any positive real number η,
(1) η.Eα=(⟨[√(1+((ξL)2)η)−(1−((ξL)2)η)(1+((ξL)2)η)+(1−((ξL)2)η),√(1+((ξU)2)η)−(1−((ξU)2)η)(1+((ξU)2)η)+(1−((ξU)2)η)];√(1+((ξ)2)η)−(1−((ξ)2)η)(1+((ξ)2)η)+(1−((ξ)2)η)⟩,⟨[√2(ζL)η√(2−(ζL)2)η+((ζL)2)η,√2(ζU)η√(2−(ζU)2)η+((ζU)2)η];√2(ζ)η√(2−(ζ)2)η+((ζ)2)η⟩),
(2) αEη=(⟨[√2(ξL)η√(2−(ξL)2)η+((ξL)2)η,√2(ξU)η√(2−(ξU)2)η+((ξU)2)η];√2(ξ)η√(2−(ξ)2)η+((ξ)2)η⟩,⟨[√(1+((ζL)2)η)−(1−((ζL)2)η)(1+((ζL)2)η)+(1−((ζL)2)η),√(1+((ζU)2)η)−(1−((ζU)2)η)(1+((ζU)2)η)+(1−((ζU)2)η)];√(1+((ζ)2)η)−(1−((ζ)2)η)(1+((ζ)2)η)+(1−((ζ)2)η)⟩).
Example 2. Let α=(⟨[0.5,0.6];0.6⟩,[0.3,0.4];0.2) and η=0.5. Then, the operations η.Eα and αEη can be calculated as
Definition 8. Let α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩, Z2;ζ2) be two PCFNs, where Z1=[ξL1,ξU1], Z1=[ζL1,ζU1], Z2=[ξL2,ξU2], and Z2=[ζL2,ζU2]. Then, the Einstein union and Einstein intersection of α1 and α2 are defined as follows:
(1) α1∪Eα2=(⟨[max(ξL1,ξL2),max(ξU1,ξU2)];max(ξ1,ξ2)⟩,⟨[min(ζL1,ζL2),min(ζU1,ζU2)];min(ζ1,ζ2)⟩),
(2) α1∩Eα2=(⟨[min(ξL1,ξL2),min(ξU1,ξU2)];min(ξ1,ξ2)⟩,⟨[max(ζL1,ζL2),max(ζU1,ζU2)];max(ζ1,ζ2)⟩).
Example 3. Let α1=(⟨[0.5,0.6];0.6⟩,[0.3,0.4];0.2) and α2=(⟨[0.2,0.3];0.5⟩,[0.6,0.7];0.4). Then, the operations α1⊕Eα2 and α1⊗Eα2 can be calculated as
Theorem 1. Let α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩, Z2;ζ2) be any two PCFNs, where Z1=[ξL1,ξU1], Z1=[ζL1,ζU1], Z2=[ξL2,ξU2], and Z2=[ζL2,ζU2]. Then, their accumulated value is also a PCFNs, by using Definition 6.
Proof. For two PCFNs α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩, Z2;ζ2), we have, 0≼ξL1≼ξU1≼1, 0≼ζL1≼ζU1≼1, 0≼ξL2≼ξU2≼1, 0≼ζL2≼ζU2≼1, 0≼ξ1,ζ1≼1, and 0≼ξ1,ζ1≼1 such that (ξU1)2+(ζU1)2≼1, (ξU2)2+(ζU2)2≼1, 0≼ξ21+ζ21≼1, and 0≼ξ22+ζ22≼1. Therefore,
ξL1×EξL2√1+(1−(ξL1)2)×E(1−(ξL2)2)≼ξU1×EξU2√1+(1−(ξU1)2)×E(1−(ξU2)2)≼1, and
√(ζL1)2+(ζL2)21+(ζL1)2×E(ζL2)2≼√(ζU1)2+(ζU2)21+(ζU1)2×E(ζU2)2≼1, which implies that
ξU1×EξU2√1+(1−(ξU1)2)×E(1−(ξU2)2)+√(ζU1)2+(ζU2)21+(ζU1)2×E(ζU2)2≼1.
Similarly, we can prove that ξ1×Eξ2√1+(1−(ξ1)2)×E(1−(ξ2)2)+√(ζ1)2+(ζ2)21+(ζ1)2×E(ζ2)2≼1.
Thus, α1⊗Eα2 is a PCFN. Part (1) can be demonstrated using the same method.
Theorem 2. Let α=(⟨[0.5,0.6];0.6⟩,[0.3,0.4];0.2) and η=0.5. Then, the results of the operational laws η.Eα and αEη are also PCFNs.
Proof. The proof bears resemblance to Theorem 1.
Theorem 3. Let α=(⟨Z;ξ⟩,⟨ Z,ζ⟩), α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩, Z2;ζ2) be three PCFNs, and η, η2 and η3 are any positive real numbers, where Z1=[ξL1,ξU1], Z1=[ζL1,ζU1], Z2=[ξL2,ξU2], Z2=[ζL2,ζU2], Z=[ξL,ξU], and Z=[ζL,ζU]. Then, we have
(1) α1⊕Eα2=α2⊕Eα1,
(2) α1⊗Eα2=α2⊗Eα1,
(3) (α1⊗Eα2)η=(α1)η⊗E(α2)η,
(4) η.E(α1⊕Eα2)=η.Eα1⊕η.Eα2,
(5) αη1⊗αη2=αη1+η2,
(6) η1.Eα⊕η2.Eα=(η1+η1).Eα.
Proof. (1) By Definition 6, we have
(2) Again by Definition 6, we have
The proof of the remaining part is relatively straightforward.
Definition 9. Let α=(⟨Z;ξ⟩,⟨ Z,ζ⟩) be a PCFN, where Z=[ξL,ξU] and Z=[ζL,ζU]. The complement of α is denoted by αC and defined as αC=(⟨ Z,ζ⟩,⟨Z;ξ⟩).
Theorem 4. Let α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩) and α2=(⟨Z2;ξ2⟩, Z2;ζ2) be two PCFNs, where Z1=[ξL1,ξU1], Z1=[ζL1,ζU1], Z2=[ξL2,ξU2], and Z2=[ζL2,ζU2]. Then, we have
(1) αC1∩EαC2=(α1∪Eα2)C,
(2) αC1∪EαC2=(α1∩Eα2)C,
(3) αC1⊗EαC2=(α1⊕Eα2)C,
(4) αC1⊕EαC2=(α1⊗Eα2)C.
Proof. Since α1=(⟨Z1;ξ1⟩,⟨ Z1,ζ1⟩)=(⟨[ξL1,ξU1];ξ1⟩,⟨[ζL1,ζU1];ζ1⟩), and
α2=(⟨Z2;ξ2⟩,⟨ Z2,ζ2⟩)=(⟨[ξL2,ξU2];ξ2⟩,⟨[ζL2,ζU2];ζ2⟩), by Definition 9, we have
αC1=(⟨ Z1,ζ1⟩,⟨Z1;ξ1⟩)=(⟨[ζL1,ζU1];ζ1⟩,⟨[ξL1,ξU1];ξ1⟩), and
αC2=(⟨ Z2,ζ2⟩,⟨Z2;ξ2⟩)=(⟨[ζL2,ζU2];ζ2⟩,⟨[ξL2,ξU2];ξ2⟩).
By Definition 8, we have
On the other hand,
Thus, αC1∩EαC2=(α1∪Eα2)C.
As the proof of the remaining portion is relatively simple, it has been excluded from this discussion.
4.
Pythagorean cubic fuzzy Einstein weighted averaging AOs
This section focuses on exploring the Pythagorean cubic fuzzy averaging AOs using Einstein operations.
4.1. PCFEWA operator
Definition 10. Let αi=(⟨Zi;ξi⟩,⟨ Zi,ζi⟩) be a collection of PCFNs, and μi is the weight of αi(i=1,2,…,n) such that 0≼μi≼1and ∑ni=1μi=1. Then, a PCFEWA operator of dimension n is a mapping PCFEWA:Δn→Δ, and
Theorem 5. Let αi=(⟨[ξLi,ξUi];ξi⟩,⟨[[ζLi,ζUi]],ζi⟩) be a collection of PCFNs, and μi is the weight of αi(i=1,2,…,n) such that 0≼μi≼1 and ∑ni=1μi=1. Then, the aggregated value by using Eq (4) is PCFN, and
Proof. To demonstrate the validity of Eq (5), we will utilize the principle of mathematical induction for the variable n. This approach involves establishing a base case and then demonstrating that if the equation holds for any arbitrary value of n, it must also hold for the next value of n in succession. By using this iterative process, we can establish the equation's validity for all possible values of n.
When n=2, PCFEWA(α1,α2)=μ1.Eα1⊕Eμ2.Eα2. According to Theorem 1, μ1.Eα1 and μ2.Eα2 are PCFNs. Also, by Theorem 3, we can see that μ1.Eα1⊕Eμ2.Eα2 is a PCFN.
Thus, the result is true for n=2.
Suppose that the assertion is valid when n is equal to some particular value, denoted as k. In this case, we can state that Eq (5) holds, which means that the result holds for the given value of k. That is,
Our present goal is to demonstrate the truth of Eq (5) when n is equal to k+1. By Eq (4), we get
To summarize, the proof shows that Eq (2) is valid for n=k+1, and we can conclude that Eq (5) holds for all values of n. Therefore, we have successfully proven the validity of Eq (5) across all possible values of n.
Property 1. (Idempotency) If αi=α where α=(⟨[ξL,ξU];ξ⟩,⟨[ζL,ζU],ζ⟩), and μi is the associated weight of αi such that 0≼μi≼1 and ∑ni=1μi=1, then PCFEWA(α1,α2,…,αn)=α.
Proof. As αi=(⟨[ξL,ξU];ξ⟩,⟨[ζL,ζU],ζ⟩) for all i,
since ∑ni=1μi=1. Therefore, PCFEWA(α1,α2,…,αn)=(⟨[ξL,ξU];ξ⟩,⟨[ζL,ζU],ζ⟩)=α.
Property 2. (Monotonicity) Let αi=(⟨[ξLi,ξUi];ξi⟩,⟨[[ζLi,ζUi]],ζi⟩) and
˙αi=(⟨[˙ξLi,˙ξUi];˙ξi⟩,⟨[[˙ζLi,˙ζUi]],˙ζi⟩) be PCFNs. If αi≼˙αi, then
Proof. As the proof is straightforward, we will omit it here.
Property 3. (Boundedness) Let αi=(⟨[ξLi,ξUi];ξi⟩,⟨[[ζLi,ζUi]],ζi⟩)(i=1,2,…,n) be a collection of PCFNs. If
α+=(⟨[max(ξLi),max(ξUi)];max(ξi)⟩,⟨[min(ζLi),min(ζUi)];min(ζi)⟩),
α−=(⟨[min(ξLi),min(ξUi)];min(ξi)⟩,⟨[max(ζLi),max(ζUi)];max(ζi)⟩),
then α−≼PCFEWA(α1,α2,…,αn)≼α+.
Proof. As the proof is straightforward, we will omit it here.
Property 4. (Homogeneity) Let φ be a positive real number. Then, we have
Proof. It is simple to demonstrate.
Corollary 1. The relationship between the PCFEWA and PCFWA operators can be expressed as follows:
Example 4. Let α1=(⟨[0.5,0.6];0.6⟩,⟨[0.3,0.4];0.2⟩), α2=(⟨[0.2,0.3];0.5⟩,⟨[0.6,0.7];0.4⟩) and α3=(⟨[0.2,0.4];0.3⟩,⟨[0.5,0.6];0.4⟩) be three PCFNs. The weight vector is μ=(0.25.0.35,0.4). Then,
Now, by using the PCFWA operator [36] to aggregate these three PCFNs,
By Eq (2), we get
Clearly, we can see that PCFEWA(α1,α2,…,αn)≽PCFWA(α1,α2,…,αn).
4.2. PCFEWA operator
Definition 11. A PCFEOWA is a mapping defined as PCFEOWA:Δn→Δ on a collection of PCFNs βi, (i=1,2,…n) as follows:
where ρ is a permutation of (1,2,…,n), such that αρ(i−1)≽αρ(i) for i=1,2,…,n, and μ=(μ1,μ2…,μn)T is its weight vector, such that μ≻0 and ∑ni=1μi=1. Moreover, the ith largest PCFN among αi's is αρ(i).
Theorem 6. Let αi=(⟨[ξLi,ξUi];ξi⟩,⟨[[ζLi,ζUi]],ζi⟩) be a collection of PCFNs, and μi is the weight of αi(i=1,2,…,n) such that 0≼μi≼1and ∑ni=1μi=1. Then, the aggregated value by using Eq (4) is PCFN, and
Property 5. (Idempotency) If αi=α where α=(⟨[ξL,ξU];ξ⟩,⟨[ζL,ζU],ζ⟩), and μi is the associated weight of αi such that 0≼μi≼1 and ∑ni=1μi=1, then PCFEOWA(α1,α2,…,αn)=α.
Property 6. (Monotonicity) Let αi=(⟨[ξLi,ξUi];ξi⟩,⟨[[ζLi,ζUi]],ζi⟩) and
˙αi=(⟨[˙ξLi,˙ξUi];˙ξi⟩,⟨[[˙ζLi,˙ζUi]],˙ζi⟩) be PCFNs. If αi≼˙αi, then
Property 7. (Boundedness) Let αi=(⟨[ξLi,ξUi];ξi⟩,⟨[[ζLi,ζUi]],ζi⟩)(i=1,2,…,n) be a collection of PCFNs. If
then α−≼PCFEOWA(α1,α2,…,αn)≼α+.
Property 8. (Homogeneity) Let φ be a positive real number. Then, we have
Corollary 2. The relationship between the PCFEOWA and PCFOWA operators can be expressed as follows:
5.
MCDM approach based on proposed operators
This section will employ the proposed Einstein aggregation operator to address MCDM problems in the context of PCFSs. To facilitate this, we will introduce several assumptions and notations to define the MCDM problems and evaluate them using PCFSs.
Let ϑ={ϑ1,ϑ2,…,ϑm} be the set of m alternatives, which have been analyzed under the set of n different criteria ψ={ψ1,ψ2,…,ψn}. Suppose that an expert assesses the alternatives, providing their opinions on each alternative ϑi (where i ranges from 1 to m) within the context of a Pythagorean cubic fuzzy environment. The expert's evaluations are based on their preferences and priorities with respect to the different criteria in the set ψ, and these values can be considered as Pythagorean cubic fuzzy numbers (PCFNs) G=(gij)mn where gij=(⟨[ξLij,ξUij];ξij⟩,⟨[ζLij,ζUij],ζij⟩) refers to the priority values assigned to alternative ϑi by the decision maker such that [ξLij,ξUij], [ζLij,ζUij]⊆[0,1], 0≼ξij, ζij≼1, (ξUij)2+(ζUij)2≼1 and (ξij)2+(ζij)2≼1. Let μ=(μ1,μ2,…,μn)T be the weight vector of criteria such that 0≼μi≼1 and ∑nj=1μj=1 (i=1,2,…,m;j=1,2,…,n).
The proposed method is shown in Figure 1 for identifying the best alternative(s).
Step 1. To comprehensively evaluate various alternatives, it is necessary to collect relevant information and rate them based on specific criteria. The rating values are expressed as a decision matrix G:
where gij=(⟨[ξLij,ξUij];ξij⟩,⟨[ζLij,ζUij],ζij⟩) such that [ξLij,ξUij], [ζLij,ζUij]⊆[0,1], 0≼ξij, ζij≼1, (ξUij)2+(ζUij)2≼1 and (ξij)2+(ζij)2≼1.
Step 2. When making a decision, criteria are used to assess and compare alternative options. Two types of criteria exist: Benefit criteria and cost criteria. Benefit criteria evaluate the positive aspects of the alternatives being considered, measuring their advantages or benefits to determine the best solution to a particular problem. Cost criteria, on the other hand, assess the negative aspects or expenses associated with each alternative, measuring their disadvantages or costs, and are important for determining the overall feasibility of a solution. We will use the negation operator below for normalization.
To normalize the criteria, we will apply the following operator: If the criterion being assessed is a benefit criterion, no further action is necessary. However, if the criterion is a cost criterion, it will be converted into a benefit criterion, and the results will be condensed and organized into the decision matrix R=(rij)mn.
Step 3. One way to aggregate the various preference values rij of the alternatives ϑi into a single collective value ri is by utilizing either the PCFEWA or PCFEOWA operator.
Step 4. To calculate the score of the combined PCFN value ri, you can use Eq (2). Arrange the alternatives ϑi in order of their score value Sc(ri), starting with the highest value and ending with the lowest.
5.1. Illustrative example
To demonstrate the application of MCDM in engineering investment decision-making, we have chosen an illustrative example that highlights various investment alternatives. This example serves as a demonstration of how MCDM can be utilized to make informed decisions in complex engineering investment scenarios.
Let us examine the realm of investing, where an individual is interested in putting some amount of money into an investment. In current times, numerous companies are enticing customers by lowering prices and offering additional perks, making it challenging for investors to determine the optimal market for investment. To mitigate market risks and improve decision-making clarity, a committee was established to invest funds in four key markets: Southern Asian (ϑ1), Eastern Asian (ϑ2), Northern Asian (ϑ3) and Local (ϑ4). The committee enlisted the expertise of an analyst who evaluated each market based on four primary factors: risk (ψ1), growth potential (ψ2), environmental impact (ψ3) and social-political impact (ψ4). The weight vector, denoted as μ=(0.35,0.3,0.15,0.2)T, is associated with the four primary analyses ψi. Using the established method, we proceed to determine the optimal alternative as follows.
Step 1. The information about each alternative's preferences is condensed into a set of PCFNs. These PCFNs serve as a way to summarize the nuanced and complex preferences of the decision-makers. Additionally, the collection of ratings given for each alternative is recorded in a decision matrix, which is presented in Table 3. The decision matrix provides a clear and concise overview of the various ratings and their corresponding alternatives. The structure of the proposed model is systematically outlined in Figure 2.
Step 2. Since ψ1 and ψ4 pertain to costs, while ψ2 and ψ3 are related to benefits, the criteria can be categorized accordingly. Therefore, to create a normalized Pythagorean cubic fuzzy decision matrix R, Eq (10) is utilized. This process takes into account the various types of criteria and ensures that the resulting decision matrix accurately reflects the relative importances of both costs and benefits. The resulting decision matrix can be seen in Table 4.
Step 3. To combine the individual preference values rij associated with each alternative Ai into a unified value ri, two operators can be employed: PCFEWA or PCFEOWA. These operators offer a means of aggregation that can effectively take into account the diverse and often complex preferences of decision-makers.
(1) By PCFEWA operator
By utilizing the PCFEWA operator and taking into consideration the provided evidence, the various performance values can be effectively aggregated. This process allows for the calculation of comprehensive overall performance values for each alternative, which are summarized in Table 5.
(2) By PCFOWA operator
By taking into account the provided evidence and using the PCFEOWA operator, it is possible to aggregate the different performance values effectively. Before utilizing the PCFEOWA operator to aggregate different alternatives, we ranked their original positions based on their score. The results are summerized in Table 6.
Step 4. Equation (2) can be utilized to compute the score of the combined PCFN value ri. After obtaining the scores, arrange the alternatives ϑi in descending order of their score value, beginning with the highest value and concluding with the lowest. The outcomes are then summarized in Table 7.
Table 7 reveals that the alternative ϑ1 has the highest score value among all the alternatives. Therefore, it can be concluded that ϑ1 is the most suitable option for the investment based on the given criteria and the evaluation method used. It is noteworthy that the score values of the other alternatives are comparatively lower than ϑ1, indicating that they may not be as favorable as ϑ1 for the investment. Consequently, the decision-makers should consider investing in ϑ1, as it has demonstrated superior performance and has the potential to yield the desired outcomes. Figure 3 displays a graphical representation of the proposed aggregation operators. Upon examination of the figure, it becomes evident that the outcomes of both operators are quite similar. This similarity between the results supports the notion that the proposed method is stable, as it can consistently generate similar results using different aggregation operators.
5.2. Comparative study
To determine the effectiveness of our proposed method in identifying the best alternatives, we conducted a comparative analysis with several previous approaches described by various authors. The objective was to assess the performance of our method compared to these existing methods. The results of this comparison are presented in Table 8, where each method is evaluated based on its ability to identify the best alternatives according to the given criteria. This analysis provides valuable insights into the strengths and weaknesses of each method and allows us to determine the efficacy of our proposed approach in identifying the most suitable alternatives for the investment.
Based on the comparison, we can conclude that the best alternative identified by our proposed approach is consistent with the results obtained from the existing methods. However, the aggregated PCFN values generated by our approach are more conservative than those produced by the other methods. As observed from the table, the relative score values of the alternatives follow a similar trend (either increasing or decreasing) across all the methods. This indicates that our proposed approach is equally effective in addressing decision-making problems in a PCFS environment as the existing methods. Overall, the comparative analysis provides evidence of the efficacy of our proposed approach in identifying the most suitable alternatives for the investment.
Based on the information presented in Figure 4, it can be observed that the outcomes achieved through the proposed approach are comparable to those of other approaches. However, it is worth noting that the proposed approach exhibits a higher level of stability and provides significantly more detailed information when compared to the other approaches. These findings suggest that the proposed approach may have distinct advantages over the other methods in terms of reliability and the depth of information it can provide.
From the above discussion, we have observed that the proposed approach produces the best alternative, which validates its stability in comparison to the state-of-the-art methods. In contrast to the existing decision-making methods that use either IVPFSs or FSs, the proposed approach considers both IVPFSs and FSs simultaneously, resulting in a more comprehensive evaluation of the alternatives. This is important as existing approaches may lose crucial information on either IVPFNs or FNs, which could potentially impact the decision results. Additionally, the proposed approach uses a different computational procedure than the existing approaches, but it yields more realistic results due to the consideration of the consistent priority degree between argument pairs in the decision process.
Overall, the proposed model offers a significant improvement over existing approaches by relaxing many of their constraints and limitations. In doing so, it provides a more flexible and adaptable environment that can effectively address complex decision-making problems. By enabling decision-makers to consider a broader range of factors and criteria, the proposed model empowers them to make more informed and nuanced decisions that reflect the real-world complexities of their specific situations. Furthermore, the proposed model incorporates advanced algorithms and techniques that enhance its robustness and scalability, allowing it to handle large and diverse data sets with ease. By leveraging these innovative features, the proposed model provides decision-makers with a powerful and reliable tool that can help them achieve their goals more efficiently and effectively.
5.3. Advantages of proposed operators
(1) The Pythagorean cubic fuzzy aggregation operators that have been proposed exhibit a higher degree of flexibility in comparison to the currently existing Einstein aggregation operators for both Pythagorean fuzzy sets and interval-valued Pythagorean fuzzy sets. These new aggregation operators can incorporate more complex and nuanced relationships between input variables, allowing for more accurate and precise results. Moreover, the Pythagorean cubic fuzzy aggregation operators have a wider range of applications, making them a more versatile and adaptable tool for decision-making processes in a variety of fields.
(2) The Pythagorean cubic fuzzy set (PCFS) is a generalized form that can handle incomplete, indeterminate and inconsistent information commonly found in real-world problems. As a result, current studies using PCFS are more suitable for solving day-to-day problems than existing ones.
5.4. Limitations
Limitations are inherent in all research, and this study is no exception. As with any research, these limitations will serve as a guide for future studies in this area.
(1) The study proposes new weighted averaging and ordered weighted averaging operators that use Einstein operations within a PCF environment. It is important to note that further advancements can be made by defining weighted geometric and ordered weighted geometric operators that utilize Einstein operations in the PCF environment in the future.
(2) In the current study, the demonstration is conducted using four criteria and four alternatives. However, in future research, data can be collected from multiple experts across various locations to validate the results of this study.
6.
Conclusions
The Pythagorean cubic fuzzy set is a significant and innovative framework where the degrees of membership and non-membership of an element are represented by cubic sets. By leveraging the benefits offered by these sets, the existing Einstein operations are extended to the Pythagorean cubic fuzzy environment. This extension of the Einstein operations allows for a more accurate and nuanced representation of uncertain or imprecise information, which is often encountered in decision-making processes. Drawing on these operational laws, a collection of aggregation operators, namely, Pythagorean cubic fuzzy Einstein weighted averaging and Pythagorean cubic fuzzy Einstein ordered weighted averaging operators, has been proposed to facilitate the aggregation of Pythagorean cubic fuzzy information. These operators offer enhanced flexibility and accuracy in dealing with uncertain or vague information and can be applied in various decision-making contexts. Furthermore, an MCDM algorithm is provided to deal with PCF information. To illustrate the proposed approach, a relevant example of investment decision-making in an optimal market has been provided. Lastly, the proposed results are compared with other existing approaches to confirm the stability and reliability of the proposed method.
In the future, the applicability of the findings in this paper could be extended to various uncertain and fuzzy environments such as interval 2-tuple linguistic multi-attribute decision-making [42], risk analysis [43] and others [44]. Also, Pythagorean cubic fuzzy numbers can only be utilized when the condition (ξU)2+(ζU)2≼1 is met. However, in certain real-world situations, this condition may not be satisfied, thereby posing a challenge to decision-makers. For instance, when a decision-maker rates an alternative as (0.8, 0.7), it cannot be accommodated by the proposed algorithm. Consequently, it may be necessary to conduct additional research to investigate these limitations.
Acknowledgments
The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through the Small Groups Project under grant number (R.G.P.1/109/44).
Conflict of interest
The authors declare no conflict of interest.