Research Article  Open Access
A Novel Method for IntervalValue Intuitionistic Fuzzy Multicriteria DecisionMaking Problems with Immediate Probabilities Based on OWA Distance Operators
Abstract
The goal of this work is to develop a novel decisionmaking method which can solve some complex decision problems that include the following threeaspect information: information represented in the form of intervalvalued intuitionistic fuzzy values (IVIFVs) not only intuitionistic fuzzy values (IFVs), the probability information and the weighted information, and the importance degree of each concept in the process of decisionmaking. Firstly, by integrating OWA operator, probabilistic weight (PW), and individual distance of two IVIFNs in the same formulation, we introduce two new distance operators named PIVIFOWAD operator and IPIVIFOWAD operator, respectively. Secondly, satisfaction degree of an alternative is proposed based on the positive ideal IVIFS and the negative ideal IVIFS and applied to MCDM. Finally, we use an illustrative example to show the feasibility and validity of the new method by comparing with the other existing methods.
1. Introduction
Atanassov and Gargov [1, 2] introduced the theory of IntervalValued Intuitionistic Fuzzy Set (IVIFS), which is a generalization of the Intuitionistic Fuzzy Set (IFS) proposed by Atanassov [3]. The IVIFS has attracted more and more attention since its appearance. Some decisionmaking methods under IVIF environment have been developed by many scholars. To sum up, there are mainly four aspects on the decisionmaking under IVIF environment: some decisionmaking methods are developed based on information measures (specially, distance, similarity, and entropy) because information measures for IVIFSs have great effects on the development of the IVIFS theory and its applications. For example, similarity measures [4â€“6], inclusion measure [7], entropy measure [8], crossentropy measure [9], and distance measures [10] are developed and applied to corresponding MCDM and MADM problems; many new aggregation operators are also investigated in the IVIFSs and applied to some decisionmaking problems, such as linguistic intuitionistic fuzzy power Bonferroni Mean operators [11], Hamacher aggregation operators [12], fuzzy power Heronian aggregation operators [13], fuzzy generalized aggregation operator [11, 14â€“18], (fuzzy Einstein) hybrid weighted aggregation operators [19, 20], fuzzy prioritized hybrid weighted aggregation operator [21], and fuzzy Hamacher ordered weighted geometric operator [22]; other methods for decisionmaking with IVIF information are also explored, such as evidential reasoning methodology [23], particle swarm optimization techniques [4], transform technique [24], nonlinear programming methods [25], and VIKOR methods in IVIFS [26], and others methods [27â€“32] are also developed for decisionmaking problems. Distance measure has great effects on obtaining the desirable choice in some decision problems. Motivated by the OWA operator, Xu [33] introduced ordered weighted distance operator based on known Haming distance. Many extensions of distance operator have been developed; for example, Merigo et al. [34] introduced a series of aggregation operators related to distance measures [35â€“38] which were applied to related decision problems [37, 39, 40].
In some real decision problems, many problems are very complex. Aiming at solving some of these complicated decision problems, it is necessary to develop a new kind of decisionmaking method to solve this kind of problems including the following threeaspect information: information represented in the form of IVIFVs not only IFVs, the weighted information and the probability information, and the degree of importance of each concept in the process of decisionmaking. Motivated by the ideas of existing operators, we propose new IVIF distance measures by using related weighted operators with probabilistic information and their applications in MCDM in the present work.
The rest of the paper is organized as follows. In Section 2, we review some related definitions on IVIFSs which are in the analysis throughout this paper. Section 3 is focused on PIVPFOWAD and IPIVIFOWAD. In Section 4, the concept of satisfaction degree is proposed and the MCDM approach based on the satisfaction degree is also constructed. Section 5, a practical example, is given to explain proposed method and compare and analyze the availability of proposed MCDM methods. This paper is concluded in Section 6.
2. IVIFSs and OWA Distance Operator
In this section, some related basic concepts of VIFSs, OWA operator, and OWAD operator are recapped.
2.1. IntervalValued Intuitionistic Fuzzy Sets
Assume that is the collection of all closed subintervals of , and is a universe of discourse. An IVIFS [1, 2] on has such a structurewhere denotes the membership degree and denotes the nonmembership degree of the element to the set , respectively, with the condition that .
For each , and denote , , respectively. Therefore, may be also expressed asEq. (2) satisfies the condition .is called the indeterminacy degree. For the convenience, is called an intervalvalued intuitionistic fuzzy value (IVIFV).
Hereafter, denotes the collection of all IVIFVs of a IVIFS on .
For two IVIFVs and , a relation on the IVIFVs is defined as follows:
In order to compare two IVIFVs, score function and accuracy function [41] of an IVIFV are introduced.
For any IVIFV , the score function of is defined as follows:where .
For any IVIFV , the accuracy function of is defined as follows:where .
Based on the above definitions, comparison rules are defined as follows.
For any two IVIFVs ,(1)if , then ;(2)if , then(a)if , then ;(b)if , then .
2.2. OWA Distance Operator
In this section, we will review the OWAD operator and then introduce IVIFOWAD operator.
An OWA operator [42] is a function that has an associated weight vector (WV) with and , such thatwhere and is the th largest of .
Similarly, OWAD operator is introduced as a generalization of OWA operator. Let be two collections of arguments. An OWAD operator [36] is a function that has an associated WV with and , such thatwhere is the th largest of .
Let and be two collections of IVIFVs, where , , and . We first recall the distance [10] between two IVIFVs and .
3. IPIVIFOWA Distance Operator
In this subsection, by combining OWA operator, individual distances, and PWs, two new distances named PIVIFOWAD operator and IPIVIFOWAD operator will be introduced. PIVIFOWAD operator is defined as follows.
Definition 1. A PIVIFOWAD is a function PIVIFOWAD: , that has an associated WV with , such thatwhere is the th largest of and each has associated a probabilistic , .
In Definition 1, if , it will be reduced to intervalvalued intuitionistic fuzzy ordered weighted distant (IVIFOWAD) operator:where is the th largest of and is the argument variable represented in the form of individual distance between IVIFVs .
Example 2. Letbe two collections of IVIFVs on the set and the WV is . Take ; according to Definition 1, we have
Now, we can also develop the IPIVIFOWAD operator by applying IVIF information, individual distance, and immediate probability (IP)[43].
Definition 3. An IPIVIFOWAD is a function which has an associated WV with , such that where is the th largest of and is the argument variable represented in the form of individual distance between IVIFVs and a PW , . and is the probabilistic according to , that is, according to the th largest of the .
It is worth pointing out that IPIVIFOWAD operator is a good approach for unifying probabilities and IVIFOWAD in some particular situations. But it is not always useful. In order to show why this unification does not seem to be a final model, we could also consider other ways of representing as in [40].
Example 4. In Example 2, since the following WV and the PW , now we aggregate this information according to IPIVIFOWAD, as we have calculated by employing (7) as follows:According to the above distance, we reorder the PW ,Therefore, , and similarly, we have , , Therefore, we have
Monotonicity is a kind of vital property in the research of aggregation operators. The aggregation operator with monotonicity will be more reliable in decisionmaking process. The lack of monotonicity may depress the reliability of the final results. PIVIFOWAD and IPIVIFOWAD are new distance measure and are aggregation operators. We can prove that PIVIFOWAD and IPIVIFOWAD have the properties of boundness, monotonicity, and reflexivity. The proof of these properties is similar to Theorems 13 in [44].
4. Method for MCDM Based on IPIVIFOWA Operator
4.1. Formal Description of MCDM with IVIFs
The MCDM with IVIF information can be formally presented as follows.
Assume that is a set of alternatives, is the collection of attributes, and are the WV of all attributes, which satisfy . Assume that alternative with respect to attribute is evaluated by an IVIFVs and is an IVIF decision matrix. A new kind MCDM approach will be developed based on the distance operators proposed in Section 3.
For a MCDM problem with IVIFVs, the decision matrix and can be constructed or given in advance.
We give the concepts of IVIFPIS, IVIFNIS, and satisfaction degree before the decisionmaking algorithm is given.
Considering the decision information represents the form of IVIFVs, we use (5) and (6) based on comparison approach to identify the IVIFPIS and the IVIFNIS. We use to represent IVIFPIS and to represent IVIFNIS; they are determined as follows:
Let D be one of IPIVIFOWAD and PIVIFOWAD, and D and D denote the distance of and alternative and the and alternative , respectively. Motivated by the wellknown TOPSIS, we take both D and D into consideration simultaneously rather than separately. This leads naturally to the concept of satisfaction degree.
Definition 5. Let be a collection of alternatives. The satisfaction degree of a given alternative over the criteria is defined asIn (21), denotes the risk preference of the DM and : means that the decision maker is pessimist, while means the opposite. : satisfaction degree is of relative closeness using the classic TOPSIS method. The parameter is provided by the DM in advance. It is obvious that . The higher the satisfaction degree, the better the alternative.
4.2. Decision Algorithm for MCDM with IVIF
Step 1. Determine the IVIFPIS and the IVIFNIS.
Step 2. Calculate the distance between IVIFVs in and IVIFVs in according to (9).
Step 3. Recalculate the probability according to distance calculated in Step 2.
Step 4. Compute the distance D of the positive ideal IVIFS and alternative and the distance D of the negative ideal IVIFS and alternative , respectively.
Step 5. Calculate the satisfaction degree according to Definition 5. And get the priority of the alternative by ranking ; the bigger the satisfaction degree , the better the alternation .
Step 6. End.
5. Case Study
In this section, we will give a practical example about the optimal invest strategy to show the application of the proposed IPIVIFOWAD and PIVIFOWAD.
Technological innovation not only is directly related to the survival and development of an enterprise, but also affects the economic development of a region or even a country. As we all know, the management of an enterpriseâ€™s technological innovation activities is an important manifestation of its technological innovation capability. In evaluating the technological innovation capability of enterprises, the following evaluation index system should be considered:
â€‰â€‰: innovation system construction, attitude to innovation failure, and incentives for innovation by the enterprise distribution system;
: establishment and implementation of technological innovation strategy, the formation, and maintenance of enterprise innovation culture;
: the feasibility of research and development project feasibility report;
: the completeness of the monitoring;
: evaluation system and innovation awareness of leaders and staff.
DM assesses the technical innovation management of 5 large enterprises by questionnaires survey and discussion and uses the IVIFVs for evaluation and constructs the IVIF decision matrix as shown in Table 1.

To find the desirable alternative, the experts give the probabilistic weight information as follows: . They assume that the importance degree of each characteristic is .
5.1. DecisionMaking Using IPIVIFOWAD Operator
Step 1. Determine the IVIFPIS and the IVIFNIS by (5) and (6) which are shown in Table 2.
We can see from Table 2 that all are different, so do , . Therefore, we do not need to compute the accuracy function. And so, IVIFPIS and IVIFNIS are obtained, respectively, and shown as follows:

Step 2. Denote , . Now we calculate the distance between IVIFVs , between the IVIFVs , respectively. The results can be found in Tables 3 and 4.


Step 3. Calculate IP by using the above probabilities and weights according to Tables 3 and 4. The results are shown in Tables 5 and 6.


Step 4. Calculate the IPIVIFOWAD and IPIVIFOWAD according to Step 2 and Step 3. For convenience, we denote IPIVIFOWAD and IPIVIFOWAD as and , respectively. The results are as follows.
Step 5. Calculate the satisfaction degree according to the distance in Step 4. The results can be found in Table 7 under different risk preference .
It follows from Table 7 that the order of alternatives is consistent with results by using IPIVIFOWAD when parameter changes. We can obtain the ranking . All of the results show that is the desirable alternative. Such a conclusion can be drawn directly from Figure 1.

5.2. DecisionMaking Using PIVIFOWAD
Now we use the PIVIFOWAD to this decisionmaking problem. According to the distance matrices in Tables 3 and 4, note that the WA has an importance of 40 percent and the probabilistic information has an importance of 60 percent. We can rearrange the probabilistic information according the distance. The results can be found in Tables 8 and 9.


Therefore, we can calculate PIVIFOWAD distances () as follows:Therefore, we can obtain the satisfaction degree under difference risk preference parameters ; please refer to Table 10.

It follows from Table 10 that the ranking is consistent with the results by using the PIVIFOWAD operators when parameter changes. We can obtain the order of alternatives: . All of the results show that is the desirable one. Such a conclusion can be also drawn directly from Figure 2.
If we change the weight important degree , we can obtain other satisfaction degrees listed in Table 11. From Table 11, we can see that the desirable alternative is consistent with the ranking obtained by PIVIFOWAD when parameter changes although the ranking of alternatives is not the same. All of the results show that is the desirable one. Such a conclusion can be drawn directly from Figure 3.

5.3. Effectiveness Test of the Proposed Method
For MCDM problems, Wang and Triantaphyllou [45] established assessing criteria (please refer to [45]) to assess the effectiveness of MCDM methods. In what follows, we will use the above MCDM criteria to test our proposed methods in Section 4. As far as the proposed method based on IPIVIFOWAD is concerned, we choose the satisfactory degree to analyze the above criteria.
Validity Test for Criterion 1. In Section 5.2, we obtained that is the desirable one and the order of alternatives is . In order to test the effectiveness of the developed IPIVIFOWAD method under criterion 1, we construct the modified IVIF decision matrix (Table 12) by interchanging the membership and nonmembership of alternatives and in Table 1.

Repeating the same steps 12 in Section 5.1, we can obtain the modified IVIFPIS and the IVIFNIS which are listed as follows:
Using Step 3Step 5 of IPIVIFOWAD method, the IPIVIFOWAD distances between alternatives and and the IPIVIFOWAD distances between alternatives and are calculated, respectively, where .
According to the satisfaction degree formula when , we have
We can see from the above satisfaction degrees that the rank is ; that is, is the best one. Therefore, the best alternative coincides with the best alternative obtained in Section 5.1 by the same method, and the relative orders of the rest of the unchanged alternatives keep constant. That is, Criterion 1 is suitable for the proposed method.
Validity Test for Criterion 2 and Criterion 3. According to the requirements of criterion 2 and test criterion 3 introduced in [45], the original problem should be decomposed into two smaller MCDM problems, such as and . For the subproblem , we can obtain the satisfaction degree by repeating Step 1 to Step 6 as follows:Therefore, the ranking of the subproblem is . For the subproblem , we can obtain the satisfaction degree by repeating Step 1 to Step 6 as follows:The ranking of the subproblem is .
We obtain the final ranking by combining the order of alternatives of subproblems and , and the final order is the same as the order of original decision problem and it also exhibits transitive property. Criterion 2 and criterion 3 proposed in [45] are also suitable for the proposed method.
5.4. Comparison with Existing Work
For the comparison with HadiVencheh and Mirjaberiâ€™s method [46], in the classical TOPSIS method, we often need to compute the relative closeness of the alternative with respect to the PIS as below: