1. Introduction
Zadeh [
1] proposed the idea of fuzzy sets in 1965 and further extended this idea to an interval-valued fuzzy set (IVFS) [
2]. Some complex decision-making problems in the economy, engineering, social science, environmental science, etc., exist that cannot be completely modeled by methods of classical mathematics because of the presence of various types of uncertainties. Others, on the other hand, use certain data processed by methods that are hybrid approaches, such as the INVAR method [
3] or the CODAS-COMET method [
4]. However, to handle the vagueness and uncertainty occurring in such decision-making problems, some well-known mathematical theories have been introduced, such as fuzzy set theory [
1], intuitionistic fuzzy set (IFS) theory [
5], interval-valued intuitionistic fuzzy set (IVIFS) theory [
6,
7], hesitant fuzzy set theory [
8], hesitant fuzzy linguistic set theory [
9], soft set theory [
10], fuzzy soft set theory [
11], etc. An example of this could be the use of triangular fuzzy numbers in a fuzzy extension of a simplified best–worst method [
12].
At times, uncertainty research uses generalized approaches to better cope with the decision-making process via approaches related to the Dempster–Shafer evidence theory (DSET) [
13], or quantum evidence theory (QET) [
14]. Other ways are to use methods based on either entropy [
15] or distance measures [
16]. Most of the researchers studied IVFS [
12]. For example, Zhang et al. [
17] investigated the entropy of IVFSs based on distance measures. Zeng and Guo [
18] discussed the similarity measure, inclusion of the measure, and entropy of IVFSs, while Grzegorzewski [
19] proposed IVFSs based on the Hausdorff metric. Furthermore, IVFSs have been widely used and applied in real-life applications. For example, Sambuc [
20] and Kohout [
21] used the concept of IVFSs in medical diagnoses in thyroid pathology and medicine in a CLINAID system, respectively. Gorzalczany [
22] used the idea of IVFSs in approximate reasoning. Turksen [
23,
24] further used the same idea of IVFSs in interval-valued logic in preference modeling [
25].
Jun et al. [
26] proposed the idea of a cubic set and presented its two important types, called the internal cubic set and the external cubic set by using the idea of the fuzzy set and IVFS. They further introduced some operations of union and intersection regarding the cubic sets, such as the P-(R-) union and P-(R-) intersection, and studied important related properties. Jun [
27] further extended the idea of the cubic set, introduced the notion of the cubic intuitionistic set, and discussed its useful applications in BCK/BCI-algebras. Recently, studies on the cubic set theory have rapidly grown. For example, Jun et al. [
28] proposed the concept of cubic IVIFS and discussed its important applications in BCK/BCI-algebra. With the help of using a cubic set and a neutrosophic set, Ali et al. [
29] presented the notion of a neutrosophic cubic set and studied some useful properties. Kang and Kim [
30] investigated the images and inverse images of almost-stable cubic sets and discussed the complement, the P-union, and the P-intersection of inverse images of almost-stable cubic sets. Chinnadurai et al. [
31] investigated several properties of the P-(R-) union and P-(R-) intersection of cubic sets and studied some properties of cubic ideals of near rings. Jun et al. [
32] proposed the ideas of cubic
-ideals and cubic
p-ideals and studied several useful properties.
Cubic sets are widely studied and are important in many areas, as discussed in the literature by various researchers. Motivated by the advantages of cubic sets, this paper proposes the notion of CIS based on IVFSs and intuitionistic fuzzy sets. Although Jun [
27] previously introduced the idea of CIS as cubic intuitionistic sets and discussed their applications in BCK/BCI-algebras, this paper presents a completely different research work under the framework of CIS. We first propose two important types of CIS, named ICIS and ECIS. We then investigate the complement of CIS, the P-(R-) cubic intuitionistic subsets, and the P-(R-) union and the intersection of CISs. Furthermore, we prove various important theorems and results related to the proposed union and intersection operations. Finally, we present an application example to demonstrate the validity of the proposed operations by solving a MCDM problem.
The remainder of the paper can be summarized briefly as follows. Some basic concepts related to the work are presented in
Section 2. The notions of CIS, ICIS, and ECIS are introduced in
Section 3. We further investigate P-(R-)order, P-(R-)union, P-(R-)intersection, and related important properties with proof in the same section. A MCDM approach using CISs is presented in
Section 4 along with an application example. We conclude the paper with some concluding remarks in
Section 5.
3. Some Operations on the Cubic Intuitionistic Set
This section introduces the concept of CIS with some modifications as proposed by Jun in [
27] as follows:
Definition 8. By CIS in a non-empty set X, we mean a mathematical structure of the formwhere and are IVFSs of the form , with the conditions that and denote, respectively, the membership and non-membership degrees of x and , are fuzzy sets in X. For simplicity, we denote as the collection of all CISs in X. In the rest of the paper, we will use the same notations with symbols for CIS as presented in the above definition. Remark 1. For any non-empty set X, let and for all Then, , and are all CISs in X.
Definition 9. For , the score value of is defined aswhere . Definition 10. Let and , then
- (i)
(Equality)
- (ii)
(P-order)
- (iii)
(R-order)
Definition 11. Let . Then, a CIS in which , , and (respectively, , , and is denoted by (respectively ).
A CIS in which , , , (respectively , , and is denoted by (respectively, ).
We can see that the score values of and can be computed, respectively, as , , and .
Definition 12. Consider the family of CISs , in X, we define
Remark 2. The complement of is defined asObviously, , , , , . Remark 3. For the family of CISs , in X, we have , and
Definition 13. Let X be a non-empty set.
- 1
A CIS is said to be ICIS if and
.
- 2
A CIS in X is said to be ECIS if and
Example 1. For a non-empty set X,
- 1
Let be a CIS with , , and , then is ICIS.
- 2
Let be a CIS with , , and , then is ECIS.
Remark 4. Every CIS in X can be considered a Zadeh fuzzy set, IFS, IVFS, IVIFS, and cubic set according to , , , and , respectively.
Theorem 1. Let be A CIS which is not an ECIS in X. Then there exist such that and
Proof. Straightforward. □
Theorem 2. Let be A CIS in X. If is both ICIS and ECIS, then and where , , and
Proof. Assume that is both ICIS and ECIS. Then, using Definition 13, we have and for all Thus Hence □
Theorem 3. Let be A CIS in X. If is ICIS (respectively, ECIS), then is ICIS (respectively ECIS).
Proof. Since
is ICIS in
X, we have
This implies that
Hence is ICIS (respectively, ECIS) □
We will show (through the following example) that the P-union and P-intersections of ECISs are not necessarily ECISs.
Example 2. Let and be two ECISs in X. Let , , , , , , and for all . Then and . Hence, and are not ECISs.
From the following example, it can be easily seen that the R-union and R-intersection of ICIS need not be ICISs.
Example 3. Let and be two ICISs in X. Let , , , , , , and for all . Then and . Hence, and are not ICISs.
In the following examples, we will show that the R-union and R-intersection of ECIS may not be ECIS.
Example 4. - 1
Let and be two ECISs in X. Let , , , , , , and for all . Then and note that ; therefore, is not ECIS.
- 2
Let and be two ECISs in X. Let , , , , , , and for all . Then and, hence, is not ECIS.
Theorem 4. Let and be two ICISs in X, such that and . Then the R-union and R-intersection of and are ICISs.
Proof. and
are ICISs; therefore,
which implies that
It follows that
and
Hence,
is ICIS. Similar arguments work in the case of
. □
Given two CISs and in X. If we exchange for and for , we denote these CISs by and , respectively.
The next example shows that, for any two ECISs in X, and need not be ICISs in X.
Example 5. - 1
Let and be ICIS in X. Let , , , , , , and for all . Then it is easy to see that and are not ICISs in X.
- 2
Let . Let and be two ECISs in X defined in Table 1. Moreover, and are not ICISs in X because , . Moreover, and .
We will show through the following example that the P-union of two ECISs in X may not be an ICIS in X.
Example 6. Consider again two ECISs, and , as shown in Table 1. In this case, is not ICIS in X because In the following result, we will find a condition for the P-union of two ECISs to be an ICIS.
Theorem 5. For two ECISs and in X. If and are ICISs in X. Then and are ICISs in X.
Proof. Since
and
are ECISs in
X, then
For all
Since
and
are ICISs in
X, then
for all
. Thus, we can consider the following cases for any
.
The arguments in all cases are similar; therefore, we consider the first case.
We have
Since
and
are ICISs in
X, then
It follows that
Hence, is ICIS. Similar steps can be used for . □
From Example 2, it can be easily seen that the P-union and P-intersections of ECISs are not necessarily the ECISs in X. In the next result, we will show when the P-union and P-intersection of two ECISs are ECISs in X.
Theorem 6. Let and be two ECISs in X, such thatthen is ECIS in X. Proof. Take
then
is one of
and
is one of
. We will consider the case when
and
or
and
. Similar arguments will work for all remaining cases.
If
and
, then
and so
and
. Thus,
and, hence,
If
and
, then
so
Assume that
and
, then
From the above inequality, we have the following cases
Case-1 contradicts the fact that CISs
and
are ECISs. From Case-2, it implies that
since
Assume that
and
, then
We now have two cases.
Case-1 contradicts that
and
are ECISs. From Case-2, it implies that
since
Similar results can be obtained if we assume
Hence, the P-intersection of
and
is ECIS in
X. □
Theorem 7. Let and be two ECISs in X, such thatthen is ECIS in X. Proof. The proof is similar to Theorem 6; therefore, we omit the details. □
Example 7. Let and be two ECISs in as shown in Table 2. Then, and always satisfy the following conditions.However, the P-union of and is not ECIS because and From Example 4, it can be easily observed that the R-union and R-intersection of ECISs may not be ECISs in X. In the next result, we will show that the R-union and R-intersection of two ECISs are ECISs in X.
Theorem 8. Let and be two ECISs in X, such thatthen is ECIS in X. Proof. Take
then
is one of
and
is one of
. We will consider the case when
and
or
and
. Similar arguments will work for all remaining cases.
If
and
, then
so
and
. Thus,
and, hence,
If
and
, then
and so
Assume that
and
, then
We have two cases
Case-1 contradicts the fact that CISs
and
are ECISs. From Case-2, it implies that
since
Assume that
and
, then
We have two cases
Case-1 contradicts the fact that CISs
and
are ECISs. From Case-2, it implies that
since
Similar results can be obtained if we assume
Hence
is ECIS in
X. □
Example 8. Let and be two ECISs in a set as shown in Table 3. Then it is easy to see that and satisfy the conditionsHowever, is not ECIS because and The following theorems can be easily verified and proved; therefore, we omit the details.
Theorem 9. Let and be two ECISs in X, such thatthen is also an ECIS in X. Theorem 10. Let and be two ICISs in Ifthen is an ECIS in X. Theorem 11. Let and be two ICISs in Ifthen is ECIS in X. 4. MCDM Method Based on Cubic Intuitionistic Sets
In this section, we will apply the proposed operations to deal with the MCDM problems using CISs.
Let be a set of alternatives, be a set of criteria, and be a set of experts. Suppose each alternative is assessed by the expert with respect to the criteria using CISs. The proposed MCDM method is based on the following steps.
- Step 1
Construct the decision matrices based on the assessed values of expert in the form of CISs .
- Step 2
Calculate the aggregated decision matrix by using the proposed operations as discussed in Definition 12 where or .
- Step 3
Calculate the score value of each of the aggregated decision matrix R by using Definition 9.
- Step 4
Calculate the preference values of each alternative where .
- Step 5
Generate the ranking order of alternatives according to the non-increasing order of the preference values.
An Application Example
Let us suppose that a technical committee composed of three technicians/experts wishes to select the best available washing machine on the market. Suppose, there are four types of washing machines available in the market and the experts are requested to select the best one amongst the four with respect to the criteria set . Suppose the expert assessed each alternative under the criteria by using the CISs. We will now proceed with the following steps.
- Step 1
According to the expert’s opinion, the individual decision matrices
are constructed, which can be seen in
Table 4,
Table 5 and
Table 6.
- Step 2
The aggregated decision matrix
is calculated with the help of the proposed operation (P-union) as introduced in Definition 12 where
. The aggregated decision matrix
R is shown in
Table 7.
- Step 3
By using Definition 9, we will calculate the score value of each
of the aggregated decision matrix
R. The matrix of the score values of the elements of
R is shown in
Table 8.
- Step 4,5
Finally, the preference value
of each alternative is calculated where
. The preference values of alternatives by using the P-union operation are given below:
We can see that the ranking order of alternatives according to the non-increasing order of their preference values is
. Similarly, the preference value of each alternative by using the R-union operation is calculated and given as follows:
In this case, the ranking order of alternatives is .
We can observe that the ranking order of alternatives by using the R-union operation is exactly the same as that obtained with the help of the P-union operation, which shows the robustness of the proposed approach. We can easily see that by using the P-intersection and R-intersection operations as discussed in Definition 12, the ranking order of alternatives will lead to the reverse order of the raking orders obtained in the P-union and R-union operations, respectively.