# A Parametric Method for Ranking Intuitionistic Fuzzy Numbers and Its Application to Solve Intuitionistic Fuzzy Network Data Envelopment Analysis Models

Authors: B. Shakouri; R. Abbasi Shureshjani; B. Daneshian; F. Hosseinzadeh Lotfi
Journal: Complexity
 (2020)

---

## Abstract

In this study, a new parametric method is proposed to rank intuitionistic fuzzy numbers in a general form. One of the advantages of the proposed method is that the decision maker’s idea is taken into account by selecting appropriate amounts of decision level and hesitation degree parameters. In some illustrative examples, the superiority of the proposed method over some other approaches is demonstrated. Furthermore, to show the ability of the method to solve intuitionistic fuzzy optimization problems, the proposed method is applied to solve intuitionistic fuzzy network data envelopment analysis (IFNDEA) problems. Also, in three appropriate examples, the validity of the suggested method and its capacity to solve real-world problems are illustrated.


---

## Body

## 1. Introduction

Intuitionistic fuzzy sets (IFSs), first proposed by Atanassov [1, 2], are a generalization of Zadeh’s fuzzy sets [3, 4] to model noncrisp and uncertain sets. For these sets, we define both membership and nonmembership functions. In this case, we will be able to define a hesitation function that is the difference between the “membership function” and “one minus nonmembership function.” Thus, by IFSs, we can efficiently model imperfect information. Many researchers provided enormous works on IFSs in both theory and applications (see e.g., [5–8]). As an application, Akram et al. [9] proposed a novel decision-making method based on hypergraphs in the intuitionistic fuzzy environment and applied it to real-life problems.In 1994, by proposing intuitionistic fuzzy numbers (IFNs), Burillo et al. [10] generalized a fuzzy numbers concept and paved the way for applying intuitionistic fuzzy logic in real-life problems such as decision-making and risk analysis. For example, Liu and Wang [11] and Wang and Liu [12] proposed new Schweizer–Sklar Maclaurin and Einstein operation rules for IFNs and applied them to solve real-life decision-making problems.Ranking IFNs is one of the important subjects in IFS theory, and a considerable number of articles have been published in this field. In these papers, different approaches are employed to compare and rank IFNs. For example, Grzegorzewski [13] generalized the ranking approach of fuzzy numbers in Grzegorzewski [14] and suggested a new method for ranking IFNs by defining concepts of expected interval and expected value. Later, Ye [15] calculated the expected value of a TraIFN that was introduced by Grzegorzewski [13] and applied it to a trapezoidal intuitionistic fuzzy multicriteria decision-making problem. Using four pairwise ranking functions, Mitchel [16] defined the average intuitionistic fuzzy rank index and proposed an approach to compare each pair of IFNs. Using score and accuracy functions of trapezoidal intuitionistic fuzzy numbers (TraIFNs), Jianqiang and Zhong [17] proposed a stepwise ranking method and applied it to a multicriteria decision-making problem. Wang and Zhang [18] ranked TraIFNs by converting them into interval numbers. Nehi [19] proposed a generalization of the characteristic value first suggested by Chiao [20] and ranked IFNs. In the work of Nan et al. [21], by introducing average indexes of membership and nonmembership functions, TraIFNs are ranked, and then, the approach is applied to matrix games with payoffs. Later, in a note, Verma and Kumar [22] modified some mathematical incorrect assumptions in the work of Nan et al. [21]. Value and ambiguity concepts were first introduced by Delgado et al. [23], and employing these concepts is a famous approach for ranking IFNs (see e.g., [24–28]). For example, in the work of Li [26], value and ambiguity are used to rank nonnormal triangular intuitionistic fuzzy numbers (TriIFNs), and then, the proposed method is applied to a personnel selection problem. In addition, Chutia and Saikia [25] generalized value and ambiguity concepts for membership and nonmembership functions and proposed a ranking method for IFNs using α and β cuts. They also applied the proposed method in a risk analysis problem with intuitionistic fuzzy data. Wan [29], using possibility mean, possibility variance, standard deviation, and variance coefficient of TriIFNs, introduced possibility variance coefficients of membership and nonmembership functions to create a lexicographic ranking method. Das and Guha [30] ranked TraIFNs by calculating the centroid points and compared them. Li and Chen [31] proposed a distance index between two arbitrary TraIFNs based on α-cuts, which was, then, applied to the intuitionistic fuzzy multicriteria group decision-making problem. In the work of Lakshmana Gomathi Nayagam et al. [32], eight score functions are defined and applied to rank TraIFNs. By appropriate examples, the method is compared with some other approaches in this field. Also, Nayagam et al. [33] generalized a lexicographic ranking method to propose a total ordering of IFNs using α-cut and β-cut sets. In another work, Nayagam et al. [28] proposed a parametric score function using improved value and ambiguity indexes to rank TraIFNs and applied it to solve a multicriteria decision-making problem. Aggarwal and Gupta [34] defined an index to rank generalized symmetrical TraIFNs and solved an intuitionistic fuzzy solid transportation problem. Prakash et al. [35] introduced a ranking method by calculating the centroid of TraIFNs. Singh and Yadav [36] defined score and accuracy indices for the LR type of normal IFNs and proposed an order relation. Furthermore, by applying these indices, they proposed a method for solving a fully intuitionistic fuzzy linear-programming problem. Later, Canedo and Morales [37] analyzed this approach and modified it to obtain unique optimal solutions. Darehmiraki [38] extended the method by Shureshjani and Daremiraki [39] to rank IFNs and applied it to the partner selection problem. Table 1 summarizes the abovementioned studies based on the relevant themes. Although many methods have been proposed, there is still not a method to rank different kinds of IFNs, which can also be easily employed in optimization problems such as Data Envelopment Analysis (DEA) under intuitionistic fuzzy environment via the decision-maker idea.Table 1
Summary of the literature review.
Ranking IFNsStudies to develop a ranking method using the expected value conceptGrzegorzewski [13], Ye [15], and Jianqiang and Zong [17]Studies to develop a ranking method using the statistical viewpointMitchell [16] and Wan [29]Studies to develop a ranking method using average indexes of membership and nonmembership functionsNan et al. [21] and Verma and Kumar [22]Studies to develop a ranking method using the distance indexWang and Zhang [18], Aggarwal and Gupta [34], and Li and Chen [31]Studies to develop a ranking method using score and accuracy indicesLakshmana Gomathi Nayagam et al. [32], Nayagam et al. [33], Singh and Yadav [36], and Canedo and Morales [37]Studies to develop a ranking method using value and ambiguity conceptsLi [26], Li et al. [27], Chutia and Chutia [24], Nayagam et al. [28], and Chutia and Saikia [25]Studies to develop a ranking method using a centroid conceptDas and Guha [30] and Prakash et al. [35]Studies to develop a ranking method using an integral value of membership and nonmembership functionsNehi [19] and Darehmiraki [38]IFDEA modelsA superefficient cross-DEA model based on the Bayesian network in the interval-intuitionistic fuzzy environmentXu et al. [40]An intuitionistic fuzzy BCC modelRazavi Hajiagha et al. [41]Optimistic and pessimistic IFDEA models with triangular intuitionistic fuzzy dataPuri and Yadav [42]An intuitionistic fuzzy DEA/AR model with triangular intuitionistic fuzzy dataSingh [43]Intuitionistic fuzzy SBM and superefficiency intuitionistic fuzzy SBM models with triangular intuitionistic fuzzy dataArya and Yadav [44]An intuitionistic fuzzy CCR model with triangular intuitionistic fuzzy dataArya and Yadav [45]Intuitionistic fuzzy BCC and intuitionistic fuzzy superefficient BCC models with triangular intuitionistic fuzzy dataArya and Yadav [46]IFNDEA modelsStudy to develop a parallel intuitionistic fuzzy network DEA modelAmeri et al. [47]DEA is a nonparametric and linear-programming-based approach for evaluating the efficiency of decision-making units (DMUs) with multiple inputs and outputs data. From the first work by Charnes et al. [48], there are many studies on both theory and applications in this field. In DEA models, a DMU is considered as a black box with its interior structures not taken into account. However, in many applications, DMUs have important interior structures, and ignoring them has led to inappropriate results. Network DEA is an attempt to consider the interior structures of DMUs. Among all the proposed structures, the simplest and most basic network DEA model is two-stage network DEA models. Also, in conventional DEA models, all the data should be crisp and certain which is not always possible in real applications. To solve these problems, fuzzy numbers and IFNs, fuzzy DEA, and intuitionistic fuzzy DEA (IFDEA) models are proposed, respectively (see Emrouznejad et al. [49] for a literature review on fuzzy DEA models and its applications until 2013). Fuzzy DEA can efficiently model DEA problems with noncrisp data, but when we face both noncrisp and uncertain data, IFDEA models are the best alternative. Although many papers have been published on fuzzy DEA, the proposed works in the IFDEA field are limited. For example, Xu et al. [40] introduced a fuzzy superefficient cross-DEA model to measure the efficiency of logistics enterprises using an interval-valued intuitionistic fuzzy Bayesian network. Using a weighted aggregation operator, Razavi Hajiagha et al. [41] proposed an approach to evaluate the efficiency of DMUs in an intuitionistic fuzzy BCC model. Puri and Yadav [42], by applying the expected interval and expected value (Grzegorzewski [13]), proposed an index to estimate triangular intuitionistic fuzzy input and output data in an IFDEA model. Similar to the work of Puri and Yadav [42], by applying the expected value (Grzegorzewski [13]), Singh [43] transformed an intuitionistic fuzzy DEA/AR model into a conventional DEA/AR model. Using α-cut and β-cut concepts in IFS theory, Arya and Yadav [44] introduced lower and upper bounds for the efficiency of DMUs in intuitionistic fuzzy SBM and superefficiency intuitionistic fuzzy SBM models. In another paper, Arya and Yadav [45] proposed appropriate models based on α-cuts and β-cuts to provide lower and upper bounds of efficiency measures in IFDEA, and then, by applying the index proposed by Chen and Klein [50], they ranked DMUs. Also, their method was applied to evaluate and rank 16 hospitals in India. Moreover, Arya and Yadav [46] developed intuitionistic fuzzy BCC and intuitionistic fuzzy superefficiency BCC models with triangular IF inputs and outputs data. They developed the proposed approach to determine the efficiencies and rankings of DMUs in the presence of infeasibility. Finally, in Ameri et al. [47], by substituting the IF inputs and IF outputs of a parallel IFNDEA model with their assigned expected values (Grzegorzewski [13]), the parallel IFNDEA model transforms into a linear program. In a case study, their method was applied for the self-assessment of an Iranian hospital (See Table 1).Two important limitations of the abovementioned approaches in IFDEA are that, almost all of them work for a specific group of IFNs (triangular IFNs) only and the decision maker does not play any role in the decision-making process. In addition, they are not easily generalizable to intuitionistic fuzzy network DEA (IFNDEA) models. Despite a large number of papers published in the IFDEA field, there has been one published paper (by Ameri et al. [47]) in the IFNDEA field.The main motive of this study is to overcome the shortcomings listed above by assigning an appropriate parametric index to IFNs considering two main concepts in IFSs, i.e., alpha cut and hesitation degree. In this case, by proper selection of the decision level (alpha cut) and the hesitation degree, the decision maker’s idea is accounted for in the decision-making process, and less information is lost in IFNs. This parametric index can be applied to compare and rank IFNs.Also, by substituting the IF data with their assigned parametric indexes, an intuitionistic fuzzy decision-making problem transforms into a parametric decision-making problem that can be easily solved by proper selection of the parameters. In this study, a new parametric method is developed to rank IFNs. Also, some reasonable properties to rank IFNs are examined based on the work of Wang and Kerre [51]. To show the ability of the method in real-life problems, it is applied to solve the IFDEA problem in single-stage, series, and parallel structures. As will be seen, the proposed method is also easily generalizable to other kinds of IFNDEA problems.The remainder of this research is organized as follows. In Section2, some preliminaries of IFSs, IFNs, and the related arithmetic operators are introduced. In Section 3, using decision level and hesitation degree concepts, a new parametric method is proposed to rank IFNs in a general form, by appropriate examples, the advantages of the proposed method are illustrated, and the obtained results are finally compared with some other approaches in this field. In Section 4, we applied our proposed method to solve the IFNDEA problem. In this method, IFDEA and IFNDEA models are transformed into parametric DEA and parametric NDEA models, respectively. Three examples illustrate the method. Finally, Section 5 concludes the paper.


## 2. Preliminaries

This section includes some basic concepts and notions. To easily understand the equations in this paper, some mathematical symbols are summarized in Table2.Table 2
Mathematical symbols utilized in the following formulas.
Mathematical symbolsMeaningsA˜An intuitionistic fuzzy numberμA˜xMembership function ofA˜vA˜xNonmembership function ofA˜πA˜xHesitation function ofA˜wMaximum degree of the membership functionuMinimum degree of the nonmembership functionA˜αα-cut set of A˜A˜ββ-cut set of A˜A˜α,βα,β-cut set of A˜Sα,kA˜The assigned function toA˜ for the selected decision level α and hesitation degree km¯r, n¯r, and n′¯rBounded monotonic decreasing left continuous functionsm¯r, n¯r, and n¯′rBounded monotonic increasing left continuous functionsθ˜oIntuitionistic fuzzy efficiency score of the decision-making unit under evaluationx˜ijTheith intuitionistic fuzzy input data of the jth decision-making unity˜rjTherth intuitionistic fuzzy output data of the jth decision-making unitz˜djThedth intuitionistic fuzzy intermediate data of the jth decision-making unitviThe given weight to intuitionistic fuzzy input dataiurThe given weight to intuitionistic fuzzy output datarwdThe given weight to intuitionistic fuzzy intermediate datadDefinition 1.
(see [1, 2]). Let X be a fixed universe. An IFS A˜ in X is given as(1)x,μA˜x,vA˜xx∈X,where μA˜x,vA˜x are the degrees of membership and nonmembership functions from X to 0,1, respectively. Also, 0≤μA˜x,vA˜x≤1 and 0≤μA˜x+vA˜x≤1.Definition 2 (see [1, 2]).
The hesitation function of an IFSA˜ is defined as(2)πA˜x=1−μA˜x−vA˜x.
It is clear that0≤πA˜x≤1. This function indicates the hesitation degree of an element x (indeterminacy) belonging or not belonging to A˜.
In fuzzy sets, we do not have a hesitation degree (hesitation degree is zero). Thus, we can consider each fuzzy set as a special case of an IFS as(3)x,μA˜x,1−μA˜xx∈X.Definition 3 (see [5]).
An IFNA˜=μA˜,vA˜ is an IFS in the set of real numbers ℝ with the membership function as(4)μA˜x=fA˜x,a≤x≤b,w,b≤x≤c,gA˜x,c≤x≤d,0,otherwise,and the nonmembership function as(5)vA˜x=hA˜x,a′≤x≤b′,u,b′≤x≤c′,rA˜x,c′≤x≤d′,1,otherwise,where fA˜ and rA˜ are nondecreasing continuous functions from ℝ to 0,1 and gA˜ and hA˜ are nonincreasing continuous functions from ℝ to 0,1. Also, a′≤a,b′≤b≤c≤c′,d≤d′. In this definition, w is the maximum degree of the membership function and u is the minimum degree of the nonmembership function. So, according to the Definition 1, 0≤w,u≤1 and 0≤w+u≤1 (Figure 1).
In Definition3, if w=1 and u=0, then, we have a normal IFN.
Considering the abovementioned definition (Definition3), α-cut, β-cut, and α,β-cut sets of an IFN are defined as follows.Figure 1
An IFNA˜=μA˜,vA˜.Definition 4 (see [2]).
α-cut, β-cut, and α,β-cut sets of an IFN A˜=μA˜,vA˜ are crisp subsets of ℝ that are defined as follows:
α-cut set: A˜α=xμA˜x≥α, 0≤α≤w, β-cut set: A˜β=xvA˜x≤β, u≤β≤1, and α,β-cut set:(6)A˜α,β=xμA˜x≥α,vA˜x≤β,0≤α≤w,u≤β≤1,0≤α+β≤1.
Li et al. [27] proposed a new approach for defining a TriIFN, and here, we generalized their approach for TraIFNs as follows:Definition 5.
A TraIFNA˜ is an IFN with membership and nonmembership functions as follows:(7)μA˜x=wx−ab−a,a≤x≤b,w,b≤x≤c,wd−xd−c,c≤x≤d,0,otherwise,vA˜x=u−1x−a′b′−a′+1,a′≤x≤b′,u,b′≤x≤c′,u−1x−d′c′−d′+1,c′≤x≤d′,1,otherwise.
We denote a TraIFNA˜ by A˜=a,b,c,d;w,a′,b′,c′,d′;u (Figure 2).
In Definition5, if w=1 and u=0, then, we have a normal TraIFN. Also, TriIFN is a special case of TraIFN in which b=c and b′=c′.
Figure3 shows the hesitation degree of belonging or not belonging an element x to TraIFN A˜.
By Definition4, α-cut, β-cut, and α,β-cut sets of a TraIFN A˜=a,b,c,d;w,a′,b′,c′,d′;u are the following closed intervals, respectively,(8)A˜α=xμA˜x≥α=a+αwb−a,d+αwc−d,A˜β=xvA˜x≤β=a′+1−β1−ub′−a′,d′+1−β1−uc′−d′,A˜α,β=xμA˜x≥α,vA˜x≤β,=a+αwb−a,d+αwc−d∩​a′+1−β1−ub′−a′,d′+1−β1−uc′−d′.
We can see that the (α)-cut set of a TraIFN A˜ can be calculated from the intersection of the closed intervals obtained from the α-cut and β-cut sets of A˜. These three cut sets (α-cut, β-cut, and α,β-cut sets) remove some of the elements of a given TraIFN, whose degrees of its membership and nonmembership functions do not satisfy the levels given as arguments of the corresponding operators.Figure 2
A TraIFNA˜=a,b,c,d;w,a′,b′,c′,d′;u.Figure 3
Hesitation degree of elementxπA˜x=1−μA˜x−vA˜x.Definition 6.
(see [25]). Let A˜1=a1,b1,c1,d1;w1,a1′,b1′,c1′,d1′;u1 and A˜2=a2,b2,c2,d2;w2,a2′,b2′,c2′,d2′;u2 be two arbitrary TraIFNs and λ∈ℝ; then, the arithmetic operations are stipulated as follows:(9)A˜1⊕A˜2=a1+a2,b1+b2,c1+c2,d1+d2;minw1,w2,a1′+a2′,b1′+b2′,c1′+c2′,d1′+d2′;maxu1,u2,A˜1⊖A˜2=a1−d2,b1−c2,c1−b2,d1−a2;minw1,w2,a1′−d2′,b1′−c2′,c1′−b2′,d1′−a2′;maxu1,u2,λA˜1=λa1,λb1,λc1,λd1;w1,λa1′,λb1′,λc1′,λd1′;u1,ifλ≥0,λd1,λc1,λb1,λa1;w1,λd1′,λc1′,λb1′,λa1′;u1,ifλ<0.
Ma et al. [52] proposed a new approach for defining a fuzzy number. In this approach, the variable on the vertical axis in Figure 1 is considered as an independent variable. By generalizing this approach, we obtain the following definition for IFNs.Definition 7.
A˜=μA˜′,vA˜′ is an IFN, in which μA˜′ is a pair m¯r,m¯r of functions m¯randm¯r;0≤r≤w which satisfy the following requirements:(1)
m¯r is a bounded monotonic increasing left continuous function(2)
m¯r is a bounded monotonic decreasing left continuous function(3)
m¯r≤m¯r,0≤r≤w,
andvA˜′ is a pair n¯r,n¯r of functions n¯randn¯r;u≤r≤1 which satisfy the following requirements:(1)
n¯r is a bounded monotonic decreasing left continuous function(2)
n¯r is a bounded monotonic increasing left continuous function(3)
n¯r≤n¯r,u≤r≤1
So, by Definition7, we can represent a TraIFN as A˜=μA˜′,vA˜′, where μA˜′r=m¯r,m¯r=a+r/wb−a,d+r/wc−d,0≤r≤w, and vA˜′r=n¯r,n¯r=a′+1−r/1−ub′−a′,d′+1−r/1−uc′−d′,u≤r≤1 (Figure 4).
As mentioned above, in Definition7, the variable on the vertical axis is considered as an independent variable. It provides the ability to obtain the location of the left and right parts of the membership and nonmembership functions of an IFN on the horizontal axis for different amounts of the independent variable. In the following, we will use this property to assign an appropriate parametric index to IFNs.Figure 4
Representation of a TraIFN by Definition7.


## 3. Ranking Intuitionistic Fuzzy Numbers (IFNs)

In real-world applications, dealing with imprecise information is a common problem, and the uncertainty is unavoidably involved in every real-world problem. To model these problems, we should correctly incorporate the uncertainty concept into the problem description. Because of the ability of the intuitionistic fuzzy numbers to express imprecise information (by applying the hesitation concept), they are a useful tool to model these problems. One of the first important issues after the definition of intuitionistic fuzzy numbers is how to compare and rank them. The comparison and ranking of intuitionistic fuzzy numbers are complicated, and different methods have been proposed to address this problem.Engaging the decision maker in the decision process provides flexibility and is a fascinating phenomenon [24]. Using α-cuts, Shureshjani and Darehmiraki [39] proposed a parametric method to rank fuzzy numbers based on the decision maker’s opinion. In addition to α-cuts, we have another important concept in IFSs, namely, hesitation. Hesitation in an IFN, as shown in Figure 3, is an area between “one minus nonmembership function” and “membership function.” It is clear that, optimally, this area will be added to the membership function, and in the most pessimistic view, we should consider this area as a part of the nonmembership function. Thus, in ranking IFNs, it would be appropriate to consider a degree of optimism (or pessimism) on the part of the decision maker in the decision-making process.In this section, to consider the abovementioned points, we generalize Shureshjani and Darehmiraki’s method [39] and propose a new parametric method for ranking IFNs based on the decision level and hesitation degree parameters.


### 3.1. The Proposed Index

For an arbitrary IFNA˜=μA˜′,vA˜′, we assign the following index:(10)Sα,kA˜=∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr−∫αwm¯r+m¯rdr,0≤α<w,k∈0,1,where n¯′r and n′¯r belong to 1−vA˜′r.The selection ofα and k parameters depend on the decision maker’s idea. From the Sα,k index definition, we can see that, after the selection of α parameter, only the elements of an IFN with the membership and hesitation values of larger than or equal to α will be important. Therefore, if we choose α parameter close to one, we have a “high-level decision,” and a “low-level decision” is made when the selected α is close to zero.If we rewrite the abovementioned formula, we will have(11)Sα,kA˜=1−k∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr.It is clear that if the decision maker setsk=0, we have a pessimistic decision because we have not considered the hesitation area in our decision (hesitation area is added to the nonmembership function). Also, if the decision maker sets k=1, an optimistic decision has been made because all the hesitation areas are added to the membership function. It should be noted that any choice of k0<k<1 reflects the desirable hesitation degree that is considered by the decision maker in ranking IFNs process.For example, for a TraIFNA˜=μA˜′,vA˜′, m¯r,m¯r,n¯′r, and n′¯r are represented in Figure 5.Figure 5
m¯r,m¯r,n¯′r, and n′¯r of a TraIFN A˜.LetA˜=a,b,c,d;w,a′,b′,c′,d′;u be a TraIFN; then, we have(12)∫αwm¯r+m¯rdr=∫αwa+rwb−a+d+rwc−ddr=a+dw−α+b+c−a−dw2−α22w,∫α1−un¯′r+n′¯rdr=∫α1−ua′+r1−ub′−a′+d′+r1−uc′−d′dr=a′+d′1−u−α+b′+c′−a′−d′1−u2−α221−u.So, the assignedSα,k index to a TraIFN will be as follows:(13)Sα,kA˜=∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr−∫αwm¯r+m¯rdr,=1−k∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr,=1−ka+dw−α+b+c−a−dw2−α22w+ka′+d′1−u−α+b′+c′−a′−d′1−u2−α221−u,0≤α<w,k∈0,1.Figure6 shows the geometric meaning of the Sα,k index for an arbitrary TraIFN A˜ with k=0 and k=1, respectively. We can see that the value of the Sα,k index is the summation of the marked areas with solid and empty dots.Figure 6
The geometric representation ofSα,k index with k=0 (a) and k=1 (b).
(a)(b)The following theorems demonstrate the reasonable behavior of the proposed index for specific types of IFNs.Theorem 1.
IfA˜=a,b,c,d;w,a′,b′,c′,d′;u and B˜=−d,−c,−b,−a;w,−d′,−c′,−b′,−a′;u, then, ∀α,k0≤α<w,k∈0,1, we have(14)Sα,kB˜=−Sα,kA˜.Proof.
(15)Sα,kB˜=1−k−d−aw−α+−c−b+d+aw2−α22w+k−d′−a′1−u−α+−c′−b′+d′+a′1−u2−α221−u,=1−k−d+aw−α−c+b−d−aw2−α22w+k−d′+a′1−u−α−c′+b′−d′−a′1−u2−α221−u,=−1−kd+aw−α+c+b−d−aw2−α22w−kd′+a′1−u−α+c′+b′−d′−a′1−u2−α221−u,=−Sα,kA˜.Theorem 2.
LetA˜1=a1,b1,c1,d1;w1,a1′,b1′,c1′,d1′;u1 and A˜2=a2,b2,c2,d2;w2,a2′,b2′,c2′,d2′;u2 be two arbitrary TraIFNs where w1=w2 and u1=u2; then, we have(16)Sα,kA˜1⊕A˜2=Sα,kA˜1+Sα,kA˜2.Proof.
From Definition6, we have(17)A˜1⊕A˜2=a1+a2,b1+b2,c1+c2,d1+d2;w1,a1′+a2′,b1′+b2′,c1′+c2′,d1′+d2′;u1,(18)Sα,kA˜1⊕A˜2=1−ka1+a2+d1+d2w1−α+b1+b2+c1+c2−a1+a2−d1+d2w12−α22w1+ka1′+a2′+d1′+d2′1−u1−α+b1′+b2′+c1′+c2′−a1′+a2′−d1′+d2′1−u2−α221−u1,=1−ka1+d1w1−α+b1+c1−a1−d1w12−α22w1+ka1′+d1′1−u1−α+b1′+c1′−a1′−d1′1−u2−α221−u1+1−ka2+d2w1−α+b2+c2−a2−d2w12−α22w1+ka2′+d2′1−u1−α+b2′+c2′−a2′−d2′1−u2−α221−u1,=Sα,kA˜1+Sα,kA˜2.Theorem 3.
LetA˜=a,b,c,d;w,a′,b′,c′,d′;u and λ∈ℝ; then, we have(19)Sα,kλA˜=λSα,kA˜.Proof.
From Definition6, we have(20)λA˜=λa,λb,λc,λd;w,λa′,λb′,λc′,λd′;u,λ>0,λd,λc,λb,λa;w,λd′,λc′,λb′,λa′;u,λ<0.
Letλ≥0; then, we have(21)λA˜=λa,λb,λc,λd;w,λa′,λb′,λc′,λd′;u,Sα,kλA˜=1−kλa+λdw−α+λb+λc−λa−λdw2−α22w+kλa′+λd′1−u−α+λb′+λc′−λa′−λd′1−u2−α221−u,=λ1−ka+dw−α+b+c−a−dw2−α22w+λka′+d′1−u−α+b′+c′−a′−d′1−u2−α221−u,=λSα,kA˜.
Now, ifλ<0, then, we have(22)λA˜=λd,λc,λb,λa;w1,λd′,λc′,λb′,λa′;u1,Sα,kλA˜=1−kλd+λaw−α+λc+λb−λd−λaw2−α22w+kλd′+λa′1−u−α+λc′+λb′−λd′−λa′1−u2−α221−u,=λ1−kd+aw−α+c+b−d−aw2−α22w+λkd′+a′1−u−α+c′+b′−d′−a′1−u2−α221−u,=λSα,kA˜.Corollary 1.
IfA˜=0,0,0,0;w,0,0,0,0;u and B˜=a,a,a,a;w,a,a,a,a;u, then, we have(23)Sα,kA˜=0,Sα,kB˜=1−k2aw−α+k2a1−u−α,0≤α<w,k∈0,1.


### 3.2. Our Proposed Ranking Approach

Based on the proposedSα,k index, we can give the following definitions to rank IFNs.Definition 8.
LetA˜=μA˜′,vA˜′ and B˜=μB˜′,vB˜′ be two arbitrary IFNs; then, for a decision level higher than α and a selected hesitation degree k0≤α<minwA˜,wB˜,k∈0,1, we have(1)
A˜≺α,kB˜⟷Sα,kA˜<Sα,kB˜,(2)
A˜∼α,kB˜⟷Sα,kA˜=Sα,kB˜,(3)
A˜≻α,kB˜⟷Sα,kA˜>Sα,kB˜.Definition 9.
LetA˜=μA˜′,vA˜′ and B˜=μB˜′,vB˜′ be two arbitrary IFNs; then, by considering 0≤α<minwA˜,wB˜,k∈0,1, we have(1)
A˜≺B˜⟷∀α,k:Sα,kA˜<Sα,kB˜,(2)
A˜∼B˜⟷∀α,k:Sα,kA˜=Sα,kB˜,(3)
A˜≻B˜⟷∀α,k:Sα,kA˜>Sα,kB˜.
Wang and Kerre [51] suggested seven reasonable properties to evaluate the rationality of the proposed indices for ranking fuzzy numbers. Here, we examine the validity of our proposed index for ranking IFNs based on Wang and Kerre’s [51] approach.
LetI be the set of intuitionistic fuzzy quantities and A be a finite subset of I.Property 1.
For an arbitrary finite subsetA of I and A˜∈A, A˜≲A˜ (A˜ has at least the same ranking as A˜) by the proposed ranking method on A.Proof.
After calculating theSα,kA˜, it is clear that we have ∀α,k:Sα,kA˜=Sα,kA˜. So, according to Definition 9, A˜∼A˜.Property 2.
For an arbitrary finite subsetA of I and A˜,B˜∈A2, A˜≿B˜ and A˜≲B˜ by the proposed ranking method on A, we should have A˜∼B˜ by the proposed ranking method on A.Proof.
LetA˜≿B˜ and A˜≲B˜; then, simultaneously, we have ∀α,k:Sα,kA˜≥Sα,kB˜ and Sα,kA˜≤Sα,kB˜ So, ∀α,k:Sα,kA˜=Sα,kB˜ and according to Definition 9, A˜∼B˜.Property 3.
For an arbitrary finite subsetA of I and A˜,B˜,C˜∈A3, A˜≿B˜ and B˜≿C˜ by the proposed ranking method on A, we should have A˜≿C˜ by the proposed ranking method on A.Proof.
FromA˜≿B˜ and B˜≿C˜, we have ∀α,k:Sα,kA˜≥Sα,kB˜ and Sα,kB˜≥Sα,kC˜. These imply that ∀α,k:Sα,kA˜≥Sα,kC˜ that means A˜≿C˜.Property 4.
LetA˜ and B˜ be two arbitrary IFNs of an arbitrary finite subset A of I with w=wA˜=wB˜ and u=uA˜=uB˜, infsuppμA˜>supsuppμB˜ and inf suppvA˜>suppvB˜, we should have A˜≻B˜ by the proposed ranking method on A.Proof.
Using theSα,k index, we have Sα,kA˜=1−k∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr=1−k∫αw2⋅M1A˜rdr+k∫α1−u2⋅M2A˜rdr≥1−k∫αw2⋅inf suppμA˜dr+k∫α1−u2⋅infsuppvA˜dr, where M1A˜r is the mean value of α-cut A˜r and M2A˜r is the mean value of β-cut A˜r.
Similarly,Sα,kB˜≤1−k∫αw2⋅sup suppμB˜dr+k∫α1−u2⋅supsuppvB˜dr Therefore, ∀α,k:Sα,kA˜>Sα,kB˜, i.e., A˜≻B˜.Property 5.
Let I andI′ be two arbitrary finite sets of intuitionistic fuzzy quantities in which the proposed ranking method can be applied and A˜ and B˜ are in I∩I′. By the proposed ranking method A˜≻B˜ on I′ iff A˜≻B˜ on I.Proof.
Trivial.Property 6.
LetA˜,B˜, and C˜ are three arbitrary TraIFNs of an arbitrary finite subset A of I and A˜,B˜,C˜∈A3 with wA˜=wB˜=wC˜ and uA˜=uB˜=uC˜. If A˜≻B˜, we should have A˜⊕C˜≻B˜⊕C˜ by the proposed ranking method on A.Proof.
LetA˜≻B˜, so ∀α,k:Sα,kA˜>Sα,kB˜. From Theorem 2, we have Sα,kA˜⊕C˜=Sα,kA˜+Sα,kC˜>Sα,kB˜+Sα,kC˜=Sα,kB˜⊕C˜, which means A˜⊕C˜≻B˜⊕C˜.Property 7.
LetA˜ and B˜ are two arbitrary TraIFNs of an arbitrary finite subset A of I and A˜,B˜∈A2, A˜≻B˜ by the proposed ranking method on A and λ∈ℝ, for λ>0 we should have λA˜≻λB˜ and for λ<0 we should have λA˜≺λB˜ by the proposed ranking method on A.Proof.
A˜≻B˜ implies that ∀α,k:Sα,kA˜>Sα,kB˜. From Theorem 3, if λ>0, we have Sα,kλA˜=λSα,kA˜>λSα,kB˜=Sα,kλB˜ that means λA˜≻λB˜. Also, for λ<0, Sα,kλA˜=λSα,kA˜<λSα,kB˜=Sα,kλB˜ that means λA˜≺λB˜.


### 3.3. The Advantages of the Proposed Method

We demonstrate the advantages of the proposed method over some other approaches by illustrative examples.In Example1, we will see that the proposed method can efficiently compare intersected TraIFNs, and the decision maker can apply his/her preferences by choosing appropriate amounts of decision level (α) and hesitation degree (k). Similar to our proposed method, Darehmiraki [38] tried to extend Shureshjani and Daremiraki’s [39] method to rank IFNs. However, Example 2 shows that there are some situations where this method led to inappropriate results. As mentioned in the introduction section, various methods have been proposed for ranking IFNs. All these methods can be classified into two categories: parametric and nonparametric. In the parametric approach, using value and ambiguity concepts is the most popular (see e.g. [25–28]). Among these papers, two of the newest are that of Nayagam et al. [28] and Chutia and Saikia [25]. In Example 3, our parametric method is compared with that proposed by Nayagam et al. [28] and Chutia and Saikia [25] and two other nonparametric methods (by Ye [15] and Nayagam et al. [32]).Example 1.
Consider two intersected TraIFNsA˜=0,1,2,3;0.6,0,1,2,5;0.1 and B˜=0,1,2,3;0.8,0,1,2,3;0.1. Sα,k index of A˜ and B˜ are calculated as follows: Sα,kA˜=1−k30.6−α+k50.9−α−2/1.80.81−α2 and Sα,kB˜=1−k30.8−α+k30.9−α, 0≤α<0.6,k∈0,1.
In Figure7, Sα,k functions of TraIFNs A˜ and B˜ are plotted. As can be seen, different decision levels (α-levels) and hesitation degrees (k) led to different ranking results. For example, in an intermediate-level decision α=0.5, if a low hesitation degree (k = 0) is selected by a decision maker, we have A˜≺0.5,0B˜, but for a high hesitation degree (k = 1), we obtain A˜≻0.5,1B˜. Also, for a relatively high hesitation degree (k = 0.7), if a low-level decision α=0 is chosen, A˜≻0,0.7B˜, but for an intermediate-level decision α=0.5, A˜≺0.5,0.7B˜. Equality can happen for different amounts of α and k too (see Table 3).Figure 7
Sα,k index of two TraIFNs A˜ and B˜.Table 3
Ranking results for some different amounts ofα and k.
αkSα,kA˜Sα,kB˜Rank0.500.30.9A˜≺0.5,0B˜0.511.381.2A˜≻0.5,1B˜00.73.062.61A˜≻0,0.7B˜0.50.71.051.11A˜≺0.5,0.7B˜00.42.522.52A˜∼0,0.4B˜0.30.61.681.68A˜∼0.3,0.6B˜Example 2.
Consider two TraIFNsA˜=2,3,4,5;0.8,2,3,4,5;0.1 and B˜=7,8,9,10;0.8,7,8,9,10;0.1. It is clear that the acceptable result will be A˜≺B˜ (see Figure 8).
In an attempt to generalize Shureshjani and Darehmiraki’s [39] method to rank IFNs, Darehmiraki [38] proposed an index using α- and β-cuts. Practically, however, it is evident that this index leads to inappropriate results.
The obtained results from Darehmiraki’s [38] method for different amounts of the parameters are presented in Table 4. As observed, the results are not correct.
But from our proposed method, we have(24)Sα,kA˜=71−k0.8−α+k0.9−α,Sα,kB˜=171−k0.8−α+k0.9−α,0≤α<0.8,k∈0,1.
It is clear that, for all decision levels ofα and hesitation degrees of k, we have(25)Sα,kA˜<Sα,kB˜,0≤α<0.8,k∈0,1.
(See Figure9). So from Definition 9, we obtain A˜≺B˜ that is a reasonable result.Figure 8
TraIFNsA˜=2,3,4,5;0.8,2,3,4,5;0.1 and B˜=7,8,9,10;0.8,7,8,9,10;0.1.Table 4
The obtained results from Darehmiraki’s [38] method.
α and β parametersQα,βA˜Qα,βB˜Ranking resultα=0.7,β=0.3−0.7−1.7B˜≺A˜α=0.6,β=0.4−0.7−1.7B˜≺A˜α=0.7,β=0.200B˜∼A˜Figure 9
Sα,k index of two TraIFNs A˜ and B˜.Example 3.
Consider three intersected TraIFNsA˜=0,0.4,0.7,0.8;1,0,0.3,0.8,0.9;0, B˜=0.2,0.5,0.5,0.9;1,0.2,0.5,0.5,1;0, and C˜=0,0.6,0.6,0.8;1,0,0.6,0.6,0.9;0.
From the proposed index, we have(26)Sα,kA˜=1−k0.81−α+0.151−α2+k0.91−α+0.11−α2,Sα,kB˜=1−k1.11−α−0.051−α2+k1.21−α−0.11−α2,Sα,kC˜=1−k0.81−α+0.21−α2+k0.91−α+0.151−α2.
These parametric functions are compared and plotted at different decision levels ofα0≤α<1 and hesitation degrees of k0≤k≤1 in Figure 10.
As can be seen from Figure10, for different amounts of α and k, we obtain 5 different ranking results as follows:(1)
If0≤α<0.2,k∈0,1, then, Sα,kA˜<Sα,kC˜<Sα,kB˜, and from Definition 8, we have A˜≺α,kC˜≺α,kB˜(2)
Ifα=0.2,k∈0,1, then, Sα,kA˜<Sα,kC˜=Sα,kB˜, and so A˜≺α,kC˜∼α,kB˜(3)
If0.2<α<0.5,k∈0,1, then, Sα,kA˜<Sα,kB˜<Sα,kC˜, and so A˜≺α,kB˜≺α,kC˜(4)
Ifα=0.5,k∈0,1: Sα,kA˜=Sα,kB˜<Sα,kC˜, and so A˜∼α,kB˜≺α,kC˜(5)
If0.5<α<1,k∈0,1: Sα,kB˜<Sα,kA˜<Sα,kC˜, and so B˜≺α,kA˜≺α,kC˜
By applying Chutia and Saikia’s [25] method, after plotting value function Vα,β of A˜,B˜, and C˜, it can be seen that, for most values of α and β, we obtain Vα,βA˜<Vα,βB˜ (see Figure 11), so for these values, we have A˜≺B˜. For specific amounts of α and β such as α=0.8,β=0.05, we have Vα,βB˜<Vα,βA˜, so B˜≺A˜ (see Figure 11). Also, for all amounts of α and β, we obtain Vα,βA˜<Vα,βC˜, so we have A˜≺C˜ (see Figure 11). Moreover, for different amounts of α and β, we obtain different ranking results between B˜ and C˜ (see Figure 11). So, by appropriate amounts of α and β, we can obtain the following ranking results:(27)A˜≺C˜≺B˜,A˜≺B˜≺C˜,B˜≺A˜≺C˜.
Ambiguity functionAα,β of A˜,B˜, and C˜ is plotted in Figure 12 too. We can see that the equality condition between these IFNs will not occur by Chutia and Saikia’s [25] method. Therefore, unlike our method, the ranking results of A˜≺C˜∼B˜ or A˜∼B˜≺C˜ are not obtained by Chutia and Saikia’s [25] method. Besides, unlike Chutia and Saikia’s [25] method that apply a two-level approach to compare and rank IFNs, we assign a parametric index to IFNs which is dependent on the decision maker’s idea. Therefore, we can easily apply our method for solving optimization problems under intuitionistic fuzzy environments.
Using the parametric score function of Nayagam et al. [28], we have(28)JA˜,λ=0.69331−λ+0.6817λ1+0.4267λ+0.48171−λ,JB˜,λ=0.76331−λ+0.7917λ1+0.3633λ+0.39171−λ,JC˜,λ=0.79331−λ+0.8200λ1+0.3933λ+0.42001−λ.∀λ∈0,1.
We can see that, for all amounts ofλ parameter λ∈0,1, we obtain JA˜<JB˜<JC˜(see Figure 13), so from the work of Nayagam et al. [28], A˜≺B˜≺C˜,∀λ∈0,1. This result is the same as our obtained ranking results for 0.2<α<0.5,k∈0,1.
If we use Ye [15] index, we obtain EVA˜=0.4875, EVB˜=0.5375, and EVC˜=0.5125, so we have A˜≺C˜≺B˜, which agrees with our results for 0≤α<0.2 and k∈0,1.
In another paper, Lakshmana Gomathi Nayagam et al. [32] proposed a nonparametric index for ranking IFNs. By considering Lakshmana Gomathi Nayagam et al.’s [32] index, we obtain LA˜=0.3087, LB˜=0.2987, and LC˜=0.2824. Thus, based on their index, we have C˜≺B˜≺A˜ which is not achieved by Ye [15], Chutia and Saikia [25], and our proposed method.
From the abovementioned examples, we can see that the proposed parametric method has appropriate discrimination power to rank IFNs based on the decision level (α) and hesitation degree (k).Figure 10
Sα,k index of three TraIFNs A˜, B˜, and C˜.Figure 11
Vα,β functions of A˜ and B˜, A˜ and C˜, and B˜ and C˜ from Chutia and Saikia’s [25] method.
(a)(b)(c)Figure 12
Aα,β functions of A˜ and B˜, A˜ and C˜, and B˜ and C˜ from Chutia and Saikia’s [25] method.
(a)(b)(c)Figure 13
JA˜,λ,JB˜,λ, and JC˜,λ score functions from Nayagam et al.’s [28] method.


## 3.1. The Proposed Index

For an arbitrary IFNA˜=μA˜′,vA˜′, we assign the following index:(10)Sα,kA˜=∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr−∫αwm¯r+m¯rdr,0≤α<w,k∈0,1,where n¯′r and n′¯r belong to 1−vA˜′r.The selection ofα and k parameters depend on the decision maker’s idea. From the Sα,k index definition, we can see that, after the selection of α parameter, only the elements of an IFN with the membership and hesitation values of larger than or equal to α will be important. Therefore, if we choose α parameter close to one, we have a “high-level decision,” and a “low-level decision” is made when the selected α is close to zero.If we rewrite the abovementioned formula, we will have(11)Sα,kA˜=1−k∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr.It is clear that if the decision maker setsk=0, we have a pessimistic decision because we have not considered the hesitation area in our decision (hesitation area is added to the nonmembership function). Also, if the decision maker sets k=1, an optimistic decision has been made because all the hesitation areas are added to the membership function. It should be noted that any choice of k0<k<1 reflects the desirable hesitation degree that is considered by the decision maker in ranking IFNs process.For example, for a TraIFNA˜=μA˜′,vA˜′, m¯r,m¯r,n¯′r, and n′¯r are represented in Figure 5.Figure 5
m¯r,m¯r,n¯′r, and n′¯r of a TraIFN A˜.LetA˜=a,b,c,d;w,a′,b′,c′,d′;u be a TraIFN; then, we have(12)∫αwm¯r+m¯rdr=∫αwa+rwb−a+d+rwc−ddr=a+dw−α+b+c−a−dw2−α22w,∫α1−un¯′r+n′¯rdr=∫α1−ua′+r1−ub′−a′+d′+r1−uc′−d′dr=a′+d′1−u−α+b′+c′−a′−d′1−u2−α221−u.So, the assignedSα,k index to a TraIFN will be as follows:(13)Sα,kA˜=∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr−∫αwm¯r+m¯rdr,=1−k∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr,=1−ka+dw−α+b+c−a−dw2−α22w+ka′+d′1−u−α+b′+c′−a′−d′1−u2−α221−u,0≤α<w,k∈0,1.Figure6 shows the geometric meaning of the Sα,k index for an arbitrary TraIFN A˜ with k=0 and k=1, respectively. We can see that the value of the Sα,k index is the summation of the marked areas with solid and empty dots.Figure 6
The geometric representation ofSα,k index with k=0 (a) and k=1 (b).
(a)(b)The following theorems demonstrate the reasonable behavior of the proposed index for specific types of IFNs.Theorem 1.
IfA˜=a,b,c,d;w,a′,b′,c′,d′;u and B˜=−d,−c,−b,−a;w,−d′,−c′,−b′,−a′;u, then, ∀α,k0≤α<w,k∈0,1, we have(14)Sα,kB˜=−Sα,kA˜.Proof.
(15)Sα,kB˜=1−k−d−aw−α+−c−b+d+aw2−α22w+k−d′−a′1−u−α+−c′−b′+d′+a′1−u2−α221−u,=1−k−d+aw−α−c+b−d−aw2−α22w+k−d′+a′1−u−α−c′+b′−d′−a′1−u2−α221−u,=−1−kd+aw−α+c+b−d−aw2−α22w−kd′+a′1−u−α+c′+b′−d′−a′1−u2−α221−u,=−Sα,kA˜.Theorem 2.
LetA˜1=a1,b1,c1,d1;w1,a1′,b1′,c1′,d1′;u1 and A˜2=a2,b2,c2,d2;w2,a2′,b2′,c2′,d2′;u2 be two arbitrary TraIFNs where w1=w2 and u1=u2; then, we have(16)Sα,kA˜1⊕A˜2=Sα,kA˜1+Sα,kA˜2.Proof.
From Definition6, we have(17)A˜1⊕A˜2=a1+a2,b1+b2,c1+c2,d1+d2;w1,a1′+a2′,b1′+b2′,c1′+c2′,d1′+d2′;u1,(18)Sα,kA˜1⊕A˜2=1−ka1+a2+d1+d2w1−α+b1+b2+c1+c2−a1+a2−d1+d2w12−α22w1+ka1′+a2′+d1′+d2′1−u1−α+b1′+b2′+c1′+c2′−a1′+a2′−d1′+d2′1−u2−α221−u1,=1−ka1+d1w1−α+b1+c1−a1−d1w12−α22w1+ka1′+d1′1−u1−α+b1′+c1′−a1′−d1′1−u2−α221−u1+1−ka2+d2w1−α+b2+c2−a2−d2w12−α22w1+ka2′+d2′1−u1−α+b2′+c2′−a2′−d2′1−u2−α221−u1,=Sα,kA˜1+Sα,kA˜2.Theorem 3.
LetA˜=a,b,c,d;w,a′,b′,c′,d′;u and λ∈ℝ; then, we have(19)Sα,kλA˜=λSα,kA˜.Proof.
From Definition6, we have(20)λA˜=λa,λb,λc,λd;w,λa′,λb′,λc′,λd′;u,λ>0,λd,λc,λb,λa;w,λd′,λc′,λb′,λa′;u,λ<0.
Letλ≥0; then, we have(21)λA˜=λa,λb,λc,λd;w,λa′,λb′,λc′,λd′;u,Sα,kλA˜=1−kλa+λdw−α+λb+λc−λa−λdw2−α22w+kλa′+λd′1−u−α+λb′+λc′−λa′−λd′1−u2−α221−u,=λ1−ka+dw−α+b+c−a−dw2−α22w+λka′+d′1−u−α+b′+c′−a′−d′1−u2−α221−u,=λSα,kA˜.
Now, ifλ<0, then, we have(22)λA˜=λd,λc,λb,λa;w1,λd′,λc′,λb′,λa′;u1,Sα,kλA˜=1−kλd+λaw−α+λc+λb−λd−λaw2−α22w+kλd′+λa′1−u−α+λc′+λb′−λd′−λa′1−u2−α221−u,=λ1−kd+aw−α+c+b−d−aw2−α22w+λkd′+a′1−u−α+c′+b′−d′−a′1−u2−α221−u,=λSα,kA˜.Corollary 1.
IfA˜=0,0,0,0;w,0,0,0,0;u and B˜=a,a,a,a;w,a,a,a,a;u, then, we have(23)Sα,kA˜=0,Sα,kB˜=1−k2aw−α+k2a1−u−α,0≤α<w,k∈0,1.


## 3.2. Our Proposed Ranking Approach

Based on the proposedSα,k index, we can give the following definitions to rank IFNs.Definition 8.
LetA˜=μA˜′,vA˜′ and B˜=μB˜′,vB˜′ be two arbitrary IFNs; then, for a decision level higher than α and a selected hesitation degree k0≤α<minwA˜,wB˜,k∈0,1, we have(1)
A˜≺α,kB˜⟷Sα,kA˜<Sα,kB˜,(2)
A˜∼α,kB˜⟷Sα,kA˜=Sα,kB˜,(3)
A˜≻α,kB˜⟷Sα,kA˜>Sα,kB˜.Definition 9.
LetA˜=μA˜′,vA˜′ and B˜=μB˜′,vB˜′ be two arbitrary IFNs; then, by considering 0≤α<minwA˜,wB˜,k∈0,1, we have(1)
A˜≺B˜⟷∀α,k:Sα,kA˜<Sα,kB˜,(2)
A˜∼B˜⟷∀α,k:Sα,kA˜=Sα,kB˜,(3)
A˜≻B˜⟷∀α,k:Sα,kA˜>Sα,kB˜.
Wang and Kerre [51] suggested seven reasonable properties to evaluate the rationality of the proposed indices for ranking fuzzy numbers. Here, we examine the validity of our proposed index for ranking IFNs based on Wang and Kerre’s [51] approach.
LetI be the set of intuitionistic fuzzy quantities and A be a finite subset of I.Property 1.
For an arbitrary finite subsetA of I and A˜∈A, A˜≲A˜ (A˜ has at least the same ranking as A˜) by the proposed ranking method on A.Proof.
After calculating theSα,kA˜, it is clear that we have ∀α,k:Sα,kA˜=Sα,kA˜. So, according to Definition 9, A˜∼A˜.Property 2.
For an arbitrary finite subsetA of I and A˜,B˜∈A2, A˜≿B˜ and A˜≲B˜ by the proposed ranking method on A, we should have A˜∼B˜ by the proposed ranking method on A.Proof.
LetA˜≿B˜ and A˜≲B˜; then, simultaneously, we have ∀α,k:Sα,kA˜≥Sα,kB˜ and Sα,kA˜≤Sα,kB˜ So, ∀α,k:Sα,kA˜=Sα,kB˜ and according to Definition 9, A˜∼B˜.Property 3.
For an arbitrary finite subsetA of I and A˜,B˜,C˜∈A3, A˜≿B˜ and B˜≿C˜ by the proposed ranking method on A, we should have A˜≿C˜ by the proposed ranking method on A.Proof.
FromA˜≿B˜ and B˜≿C˜, we have ∀α,k:Sα,kA˜≥Sα,kB˜ and Sα,kB˜≥Sα,kC˜. These imply that ∀α,k:Sα,kA˜≥Sα,kC˜ that means A˜≿C˜.Property 4.
LetA˜ and B˜ be two arbitrary IFNs of an arbitrary finite subset A of I with w=wA˜=wB˜ and u=uA˜=uB˜, infsuppμA˜>supsuppμB˜ and inf suppvA˜>suppvB˜, we should have A˜≻B˜ by the proposed ranking method on A.Proof.
Using theSα,k index, we have Sα,kA˜=1−k∫αwm¯r+m¯rdr+k∫α1−un¯′r+n′¯rdr=1−k∫αw2⋅M1A˜rdr+k∫α1−u2⋅M2A˜rdr≥1−k∫αw2⋅inf suppμA˜dr+k∫α1−u2⋅infsuppvA˜dr, where M1A˜r is the mean value of α-cut A˜r and M2A˜r is the mean value of β-cut A˜r.
Similarly,Sα,kB˜≤1−k∫αw2⋅sup suppμB˜dr+k∫α1−u2⋅supsuppvB˜dr Therefore, ∀α,k:Sα,kA˜>Sα,kB˜, i.e., A˜≻B˜.Property 5.
Let I andI′ be two arbitrary finite sets of intuitionistic fuzzy quantities in which the proposed ranking method can be applied and A˜ and B˜ are in I∩I′. By the proposed ranking method A˜≻B˜ on I′ iff A˜≻B˜ on I.Proof.
Trivial.Property 6.
LetA˜,B˜, and C˜ are three arbitrary TraIFNs of an arbitrary finite subset A of I and A˜,B˜,C˜∈A3 with wA˜=wB˜=wC˜ and uA˜=uB˜=uC˜. If A˜≻B˜, we should have A˜⊕C˜≻B˜⊕C˜ by the proposed ranking method on A.Proof.
LetA˜≻B˜, so ∀α,k:Sα,kA˜>Sα,kB˜. From Theorem 2, we have Sα,kA˜⊕C˜=Sα,kA˜+Sα,kC˜>Sα,kB˜+Sα,kC˜=Sα,kB˜⊕C˜, which means A˜⊕C˜≻B˜⊕C˜.Property 7.
LetA˜ and B˜ are two arbitrary TraIFNs of an arbitrary finite subset A of I and A˜,B˜∈A2, A˜≻B˜ by the proposed ranking method on A and λ∈ℝ, for λ>0 we should have λA˜≻λB˜ and for λ<0 we should have λA˜≺λB˜ by the proposed ranking method on A.Proof.
A˜≻B˜ implies that ∀α,k:Sα,kA˜>Sα,kB˜. From Theorem 3, if λ>0, we have Sα,kλA˜=λSα,kA˜>λSα,kB˜=Sα,kλB˜ that means λA˜≻λB˜. Also, for λ<0, Sα,kλA˜=λSα,kA˜<λSα,kB˜=Sα,kλB˜ that means λA˜≺λB˜.


## 3.3. The Advantages of the Proposed Method

We demonstrate the advantages of the proposed method over some other approaches by illustrative examples.In Example1, we will see that the proposed method can efficiently compare intersected TraIFNs, and the decision maker can apply his/her preferences by choosing appropriate amounts of decision level (α) and hesitation degree (k). Similar to our proposed method, Darehmiraki [38] tried to extend Shureshjani and Daremiraki’s [39] method to rank IFNs. However, Example 2 shows that there are some situations where this method led to inappropriate results. As mentioned in the introduction section, various methods have been proposed for ranking IFNs. All these methods can be classified into two categories: parametric and nonparametric. In the parametric approach, using value and ambiguity concepts is the most popular (see e.g. [25–28]). Among these papers, two of the newest are that of Nayagam et al. [28] and Chutia and Saikia [25]. In Example 3, our parametric method is compared with that proposed by Nayagam et al. [28] and Chutia and Saikia [25] and two other nonparametric methods (by Ye [15] and Nayagam et al. [32]).Example 1.
Consider two intersected TraIFNsA˜=0,1,2,3;0.6,0,1,2,5;0.1 and B˜=0,1,2,3;0.8,0,1,2,3;0.1. Sα,k index of A˜ and B˜ are calculated as follows: Sα,kA˜=1−k30.6−α+k50.9−α−2/1.80.81−α2 and Sα,kB˜=1−k30.8−α+k30.9−α, 0≤α<0.6,k∈0,1.
In Figure7, Sα,k functions of TraIFNs A˜ and B˜ are plotted. As can be seen, different decision levels (α-levels) and hesitation degrees (k) led to different ranking results. For example, in an intermediate-level decision α=0.5, if a low hesitation degree (k = 0) is selected by a decision maker, we have A˜≺0.5,0B˜, but for a high hesitation degree (k = 1), we obtain A˜≻0.5,1B˜. Also, for a relatively high hesitation degree (k = 0.7), if a low-level decision α=0 is chosen, A˜≻0,0.7B˜, but for an intermediate-level decision α=0.5, A˜≺0.5,0.7B˜. Equality can happen for different amounts of α and k too (see Table 3).Figure 7
Sα,k index of two TraIFNs A˜ and B˜.Table 3
Ranking results for some different amounts ofα and k.
αkSα,kA˜Sα,kB˜Rank0.500.30.9A˜≺0.5,0B˜0.511.381.2A˜≻0.5,1B˜00.73.062.61A˜≻0,0.7B˜0.50.71.051.11A˜≺0.5,0.7B˜00.42.522.52A˜∼0,0.4B˜0.30.61.681.68A˜∼0.3,0.6B˜Example 2.
Consider two TraIFNsA˜=2,3,4,5;0.8,2,3,4,5;0.1 and B˜=7,8,9,10;0.8,7,8,9,10;0.1. It is clear that the acceptable result will be A˜≺B˜ (see Figure 8).
In an attempt to generalize Shureshjani and Darehmiraki’s [39] method to rank IFNs, Darehmiraki [38] proposed an index using α- and β-cuts. Practically, however, it is evident that this index leads to inappropriate results.
The obtained results from Darehmiraki’s [38] method for different amounts of the parameters are presented in Table 4. As observed, the results are not correct.
But from our proposed method, we have(24)Sα,kA˜=71−k0.8−α+k0.9−α,Sα,kB˜=171−k0.8−α+k0.9−α,0≤α<0.8,k∈0,1.
It is clear that, for all decision levels ofα and hesitation degrees of k, we have(25)Sα,kA˜<Sα,kB˜,0≤α<0.8,k∈0,1.
(See Figure9). So from Definition 9, we obtain A˜≺B˜ that is a reasonable result.Figure 8
TraIFNsA˜=2,3,4,5;0.8,2,3,4,5;0.1 and B˜=7,8,9,10;0.8,7,8,9,10;0.1.Table 4
The obtained results from Darehmiraki’s [38] method.
α and β parametersQα,βA˜Qα,βB˜Ranking resultα=0.7,β=0.3−0.7−1.7B˜≺A˜α=0.6,β=0.4−0.7−1.7B˜≺A˜α=0.7,β=0.200B˜∼A˜Figure 9
Sα,k index of two TraIFNs A˜ and B˜.Example 3.
Consider three intersected TraIFNsA˜=0,0.4,0.7,0.8;1,0,0.3,0.8,0.9;0, B˜=0.2,0.5,0.5,0.9;1,0.2,0.5,0.5,1;0, and C˜=0,0.6,0.6,0.8;1,0,0.6,0.6,0.9;0.
From the proposed index, we have(26)Sα,kA˜=1−k0.81−α+0.151−α2+k0.91−α+0.11−α2,Sα,kB˜=1−k1.11−α−0.051−α2+k1.21−α−0.11−α2,Sα,kC˜=1−k0.81−α+0.21−α2+k0.91−α+0.151−α2.
These parametric functions are compared and plotted at different decision levels ofα0≤α<1 and hesitation degrees of k0≤k≤1 in Figure 10.
As can be seen from Figure10, for different amounts of α and k, we obtain 5 different ranking results as follows:(1)
If0≤α<0.2,k∈0,1, then, Sα,kA˜<Sα,kC˜<Sα,kB˜, and from Definition 8, we have A˜≺α,kC˜≺α,kB˜(2)
Ifα=0.2,k∈0,1, then, Sα,kA˜<Sα,kC˜=Sα,kB˜, and so A˜≺α,kC˜∼α,kB˜(3)
If0.2<α<0.5,k∈0,1, then, Sα,kA˜<Sα,kB˜<Sα,kC˜, and so A˜≺α,kB˜≺α,kC˜(4)
Ifα=0.5,k∈0,1: Sα,kA˜=Sα,kB˜<Sα,kC˜, and so A˜∼α,kB˜≺α,kC˜(5)
If0.5<α<1,k∈0,1: Sα,kB˜<Sα,kA˜<Sα,kC˜, and so B˜≺α,kA˜≺α,kC˜
By applying Chutia and Saikia’s [25] method, after plotting value function Vα,β of A˜,B˜, and C˜, it can be seen that, for most values of α and β, we obtain Vα,βA˜<Vα,βB˜ (see Figure 11), so for these values, we have A˜≺B˜. For specific amounts of α and β such as α=0.8,β=0.05, we have Vα,βB˜<Vα,βA˜, so B˜≺A˜ (see Figure 11). Also, for all amounts of α and β, we obtain Vα,βA˜<Vα,βC˜, so we have A˜≺C˜ (see Figure 11). Moreover, for different amounts of α and β, we obtain different ranking results between B˜ and C˜ (see Figure 11). So, by appropriate amounts of α and β, we can obtain the following ranking results:(27)A˜≺C˜≺B˜,A˜≺B˜≺C˜,B˜≺A˜≺C˜.
Ambiguity functionAα,β of A˜,B˜, and C˜ is plotted in Figure 12 too. We can see that the equality condition between these IFNs will not occur by Chutia and Saikia’s [25] method. Therefore, unlike our method, the ranking results of A˜≺C˜∼B˜ or A˜∼B˜≺C˜ are not obtained by Chutia and Saikia’s [25] method. Besides, unlike Chutia and Saikia’s [25] method that apply a two-level approach to compare and rank IFNs, we assign a parametric index to IFNs which is dependent on the decision maker’s idea. Therefore, we can easily apply our method for solving optimization problems under intuitionistic fuzzy environments.
Using the parametric score function of Nayagam et al. [28], we have(28)JA˜,λ=0.69331−λ+0.6817λ1+0.4267λ+0.48171−λ,JB˜,λ=0.76331−λ+0.7917λ1+0.3633λ+0.39171−λ,JC˜,λ=0.79331−λ+0.8200λ1+0.3933λ+0.42001−λ.∀λ∈0,1.
We can see that, for all amounts ofλ parameter λ∈0,1, we obtain JA˜<JB˜<JC˜(see Figure 13), so from the work of Nayagam et al. [28], A˜≺B˜≺C˜,∀λ∈0,1. This result is the same as our obtained ranking results for 0.2<α<0.5,k∈0,1.
If we use Ye [15] index, we obtain EVA˜=0.4875, EVB˜=0.5375, and EVC˜=0.5125, so we have A˜≺C˜≺B˜, which agrees with our results for 0≤α<0.2 and k∈0,1.
In another paper, Lakshmana Gomathi Nayagam et al. [32] proposed a nonparametric index for ranking IFNs. By considering Lakshmana Gomathi Nayagam et al.’s [32] index, we obtain LA˜=0.3087, LB˜=0.2987, and LC˜=0.2824. Thus, based on their index, we have C˜≺B˜≺A˜ which is not achieved by Ye [15], Chutia and Saikia [25], and our proposed method.
From the abovementioned examples, we can see that the proposed parametric method has appropriate discrimination power to rank IFNs based on the decision level (α) and hesitation degree (k).Figure 10
Sα,k index of three TraIFNs A˜, B˜, and C˜.Figure 11
Vα,β functions of A˜ and B˜, A˜ and C˜, and B˜ and C˜ from Chutia and Saikia’s [25] method.
(a)(b)(c)Figure 12
Aα,β functions of A˜ and B˜, A˜ and C˜, and B˜ and C˜ from Chutia and Saikia’s [25] method.
(a)(b)(c)Figure 13
JA˜,λ,JB˜,λ, and JC˜,λ score functions from Nayagam et al.’s [28] method.


## 4. Application in Intuitionistic Fuzzy Network DEA (IFNDEA) Problems

In this section, to propose the advantages of the suggested index in application problems, we apply it to solve IFDEA and IFNDEA problems.


### 4.1. Intuitionistic Fuzzy DEA (IFDEA) Problem

DEA is an optimization problem in a linear form to evaluate the efficiency of decision-making units (DMUs) with multiple-input/multiple-outputs assumptions. Despite the advantages of the traditional DEA models, there are some drawbacks in practical applications.One drawback is that they do not work with noncrispy and uncertainty data in real-life problems. As we know, IFNs can efficiently describe fuzzy appearing in the data in the presence of hesitation. By considering IFNs in DEA problems, we should solve an IFDEA problem. Figure14 shows an IFDEA model with m IF inputs x˜ij,i=1,…,m and s IF outputs y˜rj,r=1,…,s.Figure 14
A DMU withm IF inputs and s IF outputs.There have been suggested various DEA models for evaluating the efficiency of DMUs. Among them, the Charnes, Cooper, and Rhodes (CCR) model proposed by Charnes et al. [48] is the dominant DEA model. Considering IF inputs and IF outputs, the basic CCR model is converted to the following IFCCR model:(29)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r=1sury˜rj−∑i=1mvix˜ij≤0,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where θ˜o is the IF efficiency score of the DMU under evaluation DMUo and vi and ur are the given weights to IF input i and IF output r, respectively.By substituting the IF inputs and IF outputs with their assignedSα,k functions, the abovementioned IFCCR model is transformed into the following parametric programming which is dependent on decision level (α) and hesitation degree (k).(30)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mviSα,kx˜io=1,∑r=1surSα,ky˜rj−∑i=1mviSα,kx˜ij≤0,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where 0≤α<ww=minwx˜ij,wy˜rj/i=1,…,m,r=1,…,s,j=1,…,n and 0≤k≤1.Clearly, after determining the amounts of decision level (α) and hesitation degree (k), the abovementioned parametric programming model will be converted to a simple linear program. Thus, we can easily compute the efficiency of DMUs for different amounts of α and k. Generally, the amounts of α and k will be selected based on the decision maker’s idea. If the decision maker considers α close to one, only the elements of an IFN with high membership values are of importance, and so, the obtained efficiency results are made with a high-level decision. Also, by assuming α close to zero, we obtain efficiency results under a low-level decision [53]. Moreover, if the decision maker considers k close to zero, DMUs will be evaluated with a low hesitation degree (pessimistic decision), whereas for a high hesitation degree (optimistic decision), k should be chosen near to one.Although we display our method for the IFCCR model, it can be easily generalizable to other kinds of IFDEA models.For more explanation, consider the following example that is proposed by Arya and Yadav [45].Example 4.
The following data are collected from 16 public hospitals of Meerut in the Indian state of Uttar Pradesh (Arya and Yadav [45]). There are two IF inputs and two IF outputs. The IF inputs are the total number of beds x˜1 and the sum of pathologists and laboratory technicians x˜2, and the IF outputs are the number of pathology operations y˜1 and the sum of plasters and tubal ligations y˜2 (see Table 5).
Using model (30), the efficiency of 16 public hospitals for different amounts of decision level (α=0,α=0.5, and α=0.95) and hesitation degree (k=0,k=0.5, and k=1) are calculated and shown in Table 6. As can be seen, different efficiency and ranking results are obtained for different amounts of α and k. For example, for a fixed decision level α=0, if we set k=0, then HCM will be efficient θ=1 and ranked 1, but for k=1, HCM will be inefficient θ=0.852528 and ranked 2. Also, for a fixed hesitation degree k=0.5, if we set α=0, then the obtained efficiency result of GFD will be 0.517736 and ranked 8, but for α=0.95, the efficiency result of GFD is 0.743246 and ranked 3. Also, from Table 6, for all the selected amounts of decision level α and hesitation degree (k), the BD, BLD, and GBD hospitals are recognized as efficient hospitals and ranked one.
Inspired by theα-level-based approach in fuzzy DEA (see Emrouznejad et al. [49]), Arya and Yadav [45] developed an approach to solve IFDEA models based on α-cuts and β-cuts. The method provided lower and upper bounds of DMUs’ efficiencies for different amounts of α and β. Then, by applying Chen and Klein’s [50] index, they combined the obtained lower and upper bounds to rank DMUs. This approach assigns a wide range of efficiencies to a DMU for different amounts of α and β. Specifically, when they combine these obtained efficiency ranges, it can lead to incorrect ranking results. To illustrate, consider the obtained ranking results for 16 public hospitals based on Arya and Yadav’s [45] method that is shown in the last column of Table 6.
Evidently, there are fundamental differences between our proposed method and Arya and Yadav’s [45] method in ranking DMUs.
For example, if we compare inputs and outputs of GBD and MC hospitals, the outputs of GBD will be larger than the outputs of MC, and the inputs of GBD are smaller than the inputs of MC. Thus, the obtained efficiency and ranking results of GBD should be better than that of MC. Our method confirms this result for different amounts ofα and k. Despite that, MC is considered better than GBD by Arya and Yadav’s [45] method (MC ranked 2 and GBD ranked 10).
Similarly, the outputs of GBD are larger than the outputs of GC, and the inputs of GBD are smaller than the inputs of GC. Hence, GBD should be more efficient than GC. Our method confirms this result for different amounts ofα and k, but by Arya and Yadav’s [45] method, GC is considered better than GBD (GC ranked 1 and GBD ranked 10).Table 5
IFNs as inputs and outputs of 16 public hospitals of Meerut in the Indian state of Uttar Pradesh (Arya and Yadav [45]).
DMUsInputsOutputsx˜1x˜2y˜1y˜2BC(140, 144, 150; 135, 144, 155)(2, 2, 8; 1, 2, 15)(83085, 83089, 83092; 83082, 83089, 83096)(6, 7, 9; 5, 7, 12)BD(18, 20, 25; 15, 20, 28)(2, 3, 5; 1, 3, 10)(14105, 14107, 14110; 14103, 14107, 14115)(897, 900, 904; 895, 900, 908)BLC(442, 446, 449; 440, 446, 451)(2, 3, 6; 1, 3, 10)(115855, 115858, 115862; 115852, 115858, 115865)(1910, 1913, 1915; 1908, 1913, 1919)BLD(145, 149, 152; 140, 149, 155)(1, 1, 4; 1, 1, 8)(165120, 165121, 165125; 165118, 165121, 165129)(1560, 1563, 1567; 1558, 1563, 1570)BLFD(58, 60, 63; 55, 60, 65)(1, 1, 6; 1, 1, 10)(34095, 34099, 340105; 34092, 34099, 340110)(1620, 1622, 1626; 1617, 1622, 1630)BLK(65, 68, 70; 62, 68, 75)(1, 1, 6; 1, 1, 10)(12185, 12189, 12195; 12180, 12189, 12199)(1280, 1283, 1287; 1277, 1283, 1290)GC(122, 124, 126; 120, 124, 130)(6, 7, 10; 4, 7, 15)(65290, 65293, 65298; 65286, 65293, 652102)(215, 218, 222; 210, 218, 227)GD(162, 166, 168; 160, 166, 172)(3, 5, 8; 2, 5, 12)(258750, 258754, 258758; 258745, 258754, 258765)(423, 426, 428; 420, 426, 432)GFD(65, 68, 75; 62, 68, 80)(1, 1, 5; 1, 1, 10)(77852, 77856, 77859; 77850, 77856, 77865)(1160, 1164, 1168; 1155, 1164, 1175)GS(98, 100, 105; 95, 100, 115)(2, 2, 6; 1, 2, 12)(79720, 79725, 79729; 79718, 79725, 79735)(910, 913, 916; 905, 913, 920)GBC(130, 132, 135; 125, 132, 145)(2, 2, 7; 1, 2, 13)(25385, 25387, 25392; 25380, 25387, 25397)(1756, 1761, 1765; 1750, 1761, 1770)GBD(97, 100, 105; 95, 100, 110)(2, 3, 8; 1, 3, 14)(297445, 297449, 297453; 297440, 297449, 297458)(4000, 4004, 4008; 3995, 4004, 4012)MC(248, 250, 255; 245, 250, 260)(6, 8, 12; 5, 8, 15)(61190, 61192, 61196; 61185, 61192, 611102)(635, 638, 642; 630, 638, 648)MD(248, 250, 255; 245, 250, 258)(6, 8, 13; 4, 8, 15)(129432, 129435, 129438; 129430, 129435, 129445)(1050, 1052, 1057; 1046, 1052, 1062)MFD(90, 93, 95; 85, 93, 100)(2, 2, 8; 1, 2, 13)(78275, 78278, 78282; 78272, 78278, 78288)(1600, 1606, 1610; 1595, 1606, 1610)HCM100, 104, 110; 95, 104, 120)(1, 1, 5; 1, 1, 10)(44902, 44906, 44909; 44900, 44906, 44916)(2110, 2113, 2116; 2106, 2113, 2120)Table 6
Efficiency results of 16 public hospitals for different amounts of decision level (α) and hesitation degree (k).
DMUsEfficiency and ranking resultsRanking results from Arya and Yadav [45]α=0k=0Rα=0k=0.5Rα=0k=1Rα=0.5k=0Rα=0.5k=0.5Rα=0.5k=1Rα=0.95k=0Rα=0.95k=0.5Rα=0.95k=1RBC0.297644100.292598120.288515130.316437100.312105100.308308110.339668100.338932100.338208106BD1.00000011.00000011.00000011.00000011.00000011.00000011.00000011.00000011.000000112BLC0.53853760.58140150.61674950.46437780.51630570.54036770.36340590.37081680.37813685BLD1.00000011.00000011.00000011.00000011.00000011.00000011.00000011.00000011.000000114BLFD0.71796520.68158040.68294640.83321720.80773120.78362020.97683020.97317020.969535216BLK0.56401550.53902660.51775070.64247040.62967730.61745740.73538540.73364240.731907413GC0.177911120.378420100.57961060.177467120.277389110.37748290.177068110.187031110.196994111GD0.64427730.69819330.75031430.58290250.61047240.63755330.52836660.53118160.53399069GFD0.57715640.51773680.46983890.65217630.60309650.56257450.75158030.74324630.735188311GS0.34429490.335306110.328358120.35410490.34799490.342735100.36542380.36458190.36375493GBC0.52453770.52483970.51299880.52223160.53552860.54931160.51990770.52122670.52255078GBD1.00000011.00000011.00000011.00000011.00000011.00000011.00000011.00000011.000000110MC0.094946130.225928130.383890110.086511130.143869130.207719130.082297130.086932130.091567132MD0.195820110.225089140.256935140.180680110.194881120.209677120.174077120.174110120.174143127MFD0.45697280.46346090.467468100.49600270.50143680.50675080.53760750.53826450.53892054HCM1.00000010.92982520.85252821.00000011.00000011.00000011.00000011.00000011.000000115


### 4.2. Intuitionistic Fuzzy Network DEA (IFNDEA) Problems

Another drawback of traditional DEA models is that the structure of the decision-making units (DMUs) is assumed to be a black box, which takes no account of internal relations, operations, and structures. However, in real-world applications, we face DEA problems with important internal structures that cannot be ignored. Network DEA (NDEA) is an attempt to consider important interior structures of DMUs to DEA models. Assuming intuitionistic fuzzy data in an NDEA model, we will have an IFNDEA model. Among the various proposed structures, series and parallel are the two famous structures of NDEA models. But, although there are many papers on FDEA, IFDEA, and FNDEA fields, we found only one paper on IFNDEA (see [47]). In the work of Ameri et al. [47], IFNs are considered as inputs and outputs of a parallel NDEA model. In the following sections, we apply our proposed method in both series and parallel structures. Also, in a real-world application of the parallel IFNDEA models, the obtained results from our proposed method are compared with those of Ameri et al. [47].


#### 4.2.1. Series Structure

Among all the proposed NDEA models, two-stage network processes have the simplest structure.Consider a simple two-stage IFNDEA model in series form withm IF inputs x˜ij,i=1,…,m, d IF intermediates z˜dj,d=1,…,D, and s IF outputs y˜rj,r=1,…,s data (Figure 15).Figure 15
The generic IF two-stage network process.Different approaches have been proposed to evaluate the efficiency of DMUs in a two-stage NDEA model (see Cook and Zhu [54]), the multiplicative method initially proposed by Kao and Hwang [55] being well-known. In this method, overall efficiency is defined as a production of the stage’s efficiencies.If we consider IFNs for inputs, intermediates, and outputs data, the multiplicative two-stage IFNDEA model will be as follows:(31)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r=1sury˜rj−∑d=1Dwdz˜dj≤0,j=1,…,n,∑d=1Dwdz˜dj−∑i=1mvix˜ij≤0,j=1,…,n,vi,wd,ur≥0,i=1,…,m,d=1,…,D,r=1,…,s,where θ˜o is the IF efficiency score of the DMU under evaluation DMUo and vi,wd, and ur are the given weights to IF input i, IF intermediate data d, and IF output r, respectively.Now, by substituting the IF input, IF intermediate, and IF output data with their assignedSα,k functions, the two-stage IFNDEA model will be converted to the following parametric program:(32)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mviSα,kx˜io=1,∑r=1surSα,ky˜rj−∑d=1DwdSα,kz˜dj≤0,j=1,…,n,∑d=1DwdSα,kz˜dj−∑i=1mviSα,kx˜ij≤0,j=1,…n,vi,wd,ur≥0,i=1,…,m,d=1,…,D,r=1,…,s,where 0≤α<ww=minwx˜ij,wz˜drj,wy˜rj/i=1,…,m,d=1,…,D,r=1,…,s,j=1,…,n and 0≤k≤1.Based on the decision maker’s opinion, by appropriate selection of the decision level (α) and hesitation degree (k), model (32) will be converted to a linear program.The following numerical example is proposed to illustrate the abovementioned method.Example 5.
Consider five hypothetical DMUs with two IF inputs, two IF intermediate products, and two IF outputs in a two-stage NDEA structure (Table7).
As can be seen from Table7, all the input, intermediate, and output data are assumed to be asymmetric TraIFNs. Expectedly, different selection of the decision level (alpha) and hesitation degree (k) led to different ranking and efficiency results. Using model (32), the efficiency results of DMUs are calculated and shown in Table 8 for different amounts of decision level (α=0,α=0.5, and α=0.75) and hesitation degree (k=0,k=0.5, and k=1). We can observe that different amounts of α and k have led to different efficiency and ranking results. For example, the efficiency score of DMU1 for α=0,k=1 (a low-level decision with a high hesitation degree) is 0.377979 and ranked 2, but for α=0.75,k=0 (a high-level decision with a low hesitation degree), the score is 0.114912 and it ranked 5. Also, the efficiency score of DMU4 for α=0.75,k=0 (a high-level decision with a low hesitation degree) is 0.498449 and ranked 1, but for α=0.75,k=1(a high-level decision with a high hesitation degree), the score is 0.223572 and it ranked 4. In most cases, DMU2 is the worst DMU and DMU3 is the best DMU. Also, DMU4 and DMU5 experience most changes in their rankings (from the first to fourth).
Since crisp or fuzzy numbers are special cases of IFNs, our proposed method can solve NDEA models with a collection of crisp, fuzzy, and intuitionistic fuzzy numbers as data too.Table 7
Five DMUs with two IF input, two IF intermediate, and two IF output data in a two-stage structure.
DMUX˜1X˜2Z˜1Z˜2Y˜1Y˜217,9,11,16;0.9,3,9,11,17;0.13,6,7;1,1,6,8;052,53,54;0.9,31,53,56;0.151,52,53;0.9,21,52,56;0.196,97,98,103;1,39,97,98,105;077,79,80,81;0.8,76,79,80,95;0.123,5,8;1,2,5,11;07,9,12;0.9,6,9,23;0.13,4,6;0.9,2,4,18;0.14,5,7;0.9,1,5,8;0.1221,222,223,225;0.9,163,222,223,226;0.19,11,16,18;0.9,9,11,16,21;0.1311,11,16;0.9,10,11,29;0.112,13,14;1,7,13,14;047,49,50;1,44,49,53;036,37,38;1,25,37,38;07,9,11,16;0.9,4,9,11,17;0.1123,124,126,131;1,107,124,126,163;0422,22,41;0.8,21,22,42;0.13,10,10;1,3,10,11;025,27,28;0.9,25,27,30;0.18,8,14;0.8,7,8,15;0.27,8,9,10;1,3,8,9,11;0141,142,143,144;0.9,113,142,143,145;0.1510,30,31;0.8,7,30,33;0.16,6,31;1,5,6,33;027,29,32,35;0.9,21,29,32,36;0.16,9,12,13;0.9,6,9,12,29;0.17,9,10;0.9,2,9,11;0.1131,133,135,137;0.9,117,133,135,148;0Table 8
Efficiency results of five hypothetical DMUs for different amounts of decision level (α) and hesitation degree (k).
DMUsEfficiency resultsα=0k=0Rankα=0k=0.5Rankα=0k=1Rankα=0.5k=0Rankα=0.5k=0.5Rankα=0.5k=1Rankα=0.75k=0Rankα=0.75k=0.5Rankα=0.75k=1RankDMU10.26479430.31927830.37797920.22774940.27973640.31429330.11491250.18332340.2439693DMU20.18605850.18863650.22707850.15854450.15338750.15598750.11545640.11388650.1124575DMU30.43533310.41164210.39187110.48452410.48488010.43764210.48418820.38901020.3511432DMU40.33647820.34228920.34662830.31969220.32177230.30044640.49844910.26336730.2235724DMU50.22732040.23644540.25678840.30062330.34348820.35915620.43533330.44359610.4428981


#### 4.2.2. Parallel Structure

Unlike series structures, there is no flow of intermediate products in the parallel structures. In parallel structures, the input and output data are divided among processes (Figure16).Figure 16
A parallel system.Consider a parallel IFNDEA model withq independent processes (Figure 16). In this model, each process p uses IF inputs x˜ip,i∈Ip to produce IF outputs y˜rp,r∈Op. In this system, the sum of the IF inputs used by all the q processes ∑p=1qx˜ijp=x˜ij is equal to the system IF inputs, and the sum of the IF outputs used by all the q processes ∑p=1qy˜rjp=y˜rj is equal to the system IF outputs. Based on Kao’s [56] method, to evaluate the system and process efficiencies, first, the following IFNDEA model should be solved:(33)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r∈Opury˜rjp−∑i∈Ipvix˜ijp≤0,p=1,...,q,j=1,...,n,vi,ur≥0,i=1,...,m,r=1,...,s.By our proposed method, we should first substitute the IF inputs and IF outputs with their assignedSα,k functions. So, the abovementioned IFNDEA model will transform into the following parametric programming which is dependent on decision level (α) and hesitation degree (k):(34)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mvix˜io=1,∑r∈OpurSα,ky˜rjp−∑i∈IpviSα,kx˜ijp≤0,p=1,…,q,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where 0≤α<ww=minwx˜ij,wy˜rj/i=1,…,m,r=1,…,s,j=1,…,n and 0≤k≤1.Consequently, after the selection of the decision level (α) and hesitation degree (k), we can solve the obtained linear program.Letvi∗,ur∗ be an optimal solution of the model (34). We can calculate the process and system efficiencies by the following formulas:(35)Process efficiencies :θop=∑r∈Opur∗Sα,ky˜rop∑i∈Ipvi∗Sα,kx˜iop,p=1,…,q,System efficiencies :θo=∑r=1sur∗Sα,ky˜ro.To apply our proposed method in a real-world application, we consider the following example proposed by Ameri et al. [47]. In Ameri et al.’s [47] method, by substituting the IF inputs and IF outputs with their assigned expected values (Grzegorzewski [13]), the model (34) is transformed into a linear program. Unlike our proposed method, in the work of Ameri [47], we are allowed only to use a specific group of IFNs (normal TraIFNs), and the decision maker’s opinion is not considered in the decision-making process.Example 6.
Imam Khomeini is one of the most famous hospitals in Iran. For the purpose of self-assessment of the Imam Khomeini hospital, Ameri et al. [47] collected the hospital data in eight different periods. So, we have eight DMUs that are made by one hospital data in these different eight periods of time. The internal structure of the hospital department is considered as a parallel structure with four processes in the following sections: internal, general surgery, pediatric, and CCU. Table 9 shows the hospital data, and we can see that each process has three inputs and four outputs. The input data are the physician x1, the number of nurses x2, and the number of beds x3. Also, the output data are the bed occupancy percentage (BOP) y1, satisfaction with physician performance y2, satisfaction with nurse performance y3, and satisfaction with environmental conditions y4. As evident in Table 9, x1, x2, x3, and y1 data are real numbers, while to control the uncertainty and for better modeling of the real data represented by organizations’ decision makers, y2, y3, and y4 data are represented by normal TriIFNs.
Using model34, the efficiency results of the hospital and its sections are calculated for eight different periods of time (see Table 10). Unlike the previous example, in this example, there are no significant differences among the obtained efficiency results for the sections based on different values of the decision level (α) or hesitation degree (k). To explain, all the input data and an input datum are real numbers. Also, the other three output data are not represented by asymmetric or intersected TriIFNs. From Table 10, the greatest differences among the obtained efficiency results for different amounts of α and k is for the CCU section in part 6 (from 0.84959443 α=0,k=1 to 0.91640810 α=0.95,k=0). We can see that there are not any efficient sections in parts 1, 2, 3, and 5. Also, the pediatrics section in parts 4 and 6, CCU section in parts 4 and 7, and general surgery section in part 8 are reported as efficient sections.
The obtained efficiency results from Ameri et al.’s [47] method is shown in the last column of Table 10. As can be seen, although the problem is solved with two different approaches, the obtained efficiency results from our proposed method are nearly identical to those of Ameri et al. [47]. However, the general surgery section in part 6 from our proposed method is an inefficient section for all the selected amounts of α and k, but from Ameri et al.’s [47] method, it is an efficient section.
As mentioned earlier, in our proposed method, the decision maker’s idea is accounted for in the decision-making process by proper selection of the decision level (alpha cut) and the hesitation degree, and so, less information is lost in IFNs. But, in Ameri et al. [47], only a real number (expected value) is assigned to each IF data, and the decision maker does not play any role in the decision-making process.
Although we adopted our method in the multiplicative two-stage IFNDEA and parallel IFNDEA models, it will be easily generalizable to other kinds of IFNDEA models.
We can summarize the algorithm of the proposed method to solve IFNDEA models in real-world applications as follows:Step 1. An appropriate IFNDEA model is chosen based on the structure of the real-world problemStep 2. The input, intermediate, and output data of the problem are determined and represented by crisp, fuzzy, or intuitionistic fuzzy numbersStep 3. The appropriate decision level (α) and hesitation degree (k) are selected based on the decision maker’s opinionStep 4. Input, intermediate, and output data are replaced with their assigned Sα,k indexStep 5. The transformed IFNDEA model is solved to obtain the efficiency score of the DMU under evaluation based on the selected decision level (α) and hesitation degree (k)
As evident in the algorithm, after replacing input, intermediate, and output data with their assignedSα,k indexes, we should solve a transformed IFNDEA model that is a linear-programming model. Different methods are proposed for solving linear-programming problems such as the simplex method or Karmarkar method. Thus, the time complexity of our proposed method depends on the selected method for solving the obtained linear program.Table 9
Input and output of Imam Khomeini hospital ([47]).
PeriodsInputOutputx1x2x3y1y2y3y4Spring 2015 (part 1)3370103215.5(133, 149, 163; 124, 149, 169)(240, 268, 295; 220, 268, 307)(70, 79, 93; 49, 79, 108)Internal section12244761.45(40, 43, 47; 37, 43, 48)(65, 68, 77; 58, 68, 81)(48, 50, 59; 32, 50, 67)General surgery section10152432.22(26, 30, 33; 24, 30, 35)(61, 68, 72; 58, 68, 74)(8, 10, 12; 6, 10, 13)Pediatrics section7171243.63(22, 28, 31; 20, 28, 33)(42, 51, 58; 37, 51, 61)(9, 11, 13; 7, 11, 15)CCU section4142075.20(45, 48, 52; 43, 48, 53)(72, 81, 88; 67, 81, 91)(5, 8, 9; 4, 8, 13)Summer 2015 (part 2)3771108212.74(131, 156, 169; 119, 156, 199)(136, 157, 187; 116, 157, 217)(126, 141, 151; 114, 141, 162)Internal section14245059.01(80, 97, 102; 75, 97, 124)(35, 40, 42; 22, 40, 59)(23, 27, 29; 21, 27, 32)General surgery section10162436.23(13, 17, 20; 10, 17, 24)(40, 47, 65; 38, .47, 73)(29, 32, 35; 24, 32, 38)Pediatrics section8161338.58(10, 12, 14; 9, 12, 16)(43, 50, 57; 41, 50, 60)(19, 22, 24; 17, 22, 28)CCU section5152178.92(28, 30, 33; 25, 30, 35)(18, 20, 23; 15, 20, 25)(55, 60, 63; 52, 60, 64)Autumn 2015 (part 3)4070114203.57(129, 154, 167; 109, 154, 190)(209, 224, 256; 199, 224, 274)(71, 87, 104; 61, 87, 118)Internal section15265079.23(30, 34, 36; 28, 34, 40)(145, 149, 152; 143, 149, 154)(26, 30, 39; 22, 30, 43)General surgery section12152625.96(31, 40, 45; 18, 40, 57)(34, 35, 41; 32, 35, 48)(15, 18, 21; 13, 18, 23)Pediatrics section8161353.02(45, 50, 54; 42, 50, 56)(12, 20, 38; 9, 20, 45)(14, 20, 22; 11, 20, 26)CCU section5132545.36(23, 30, 32; 21, 30, 37)(18, 20, 25; 15, 20, 27)(16, 19, 22; 15, 19, 26)Winter 2016 (part 4)4071118244.89(160, 176, 191; 143, 176, 212)(210, 225, 242; 190, 225, 257)(190, 201, 214; 179, 201, 222)Internal section13255245.56(3, 7, 10; 2, 7, 17)(14, 16, 25; 12, 16, 28)(32, 35, 37; 30, 35, 39)General surgery section14162748.32(81, 84, 86; 80, 84, 87)(60, 67, 71; 50, 67, 73)(51, 53, 56; 48, 53, 58)Pediatrics section9181361.45(28, 35, 39; 18, 35, 50)(39, 42, 44; 36, 42, 46)(45, 48, 51; 43, 48, 53)CCU section4122689.56(48, 50, 56; 43, 50, 58)(97, 100, 102; 92, 100, 110)(62, 65, 70; 58, 65, 72)Spring 2016 (part 5)4473121283.92(232, 246, 257; 213, 246, 266)(485, 497, 512; 476, 497, 529)(189, 207, 244; 157, 207, 257)Internal section15275149.26(76, 80, 85; 64, 80, 89)(250, 252, 254; 247, 252, 255)(69, 75, 98; 58, 75, 102)General surgery section15152978.23(35, 40, 42; 32, 40, 43)(78, 80, 83; 75, 80, 95)(87, 95, 100; 70, 95, 105)Pediatrics section10181682.11(52, 54, 57; 50, 54, 59)(82, 85, 92; 81, 85, 94)(14, 17, 23; 12, 17, 25)CCU section4132574.32(69, 72, 73; 67, 72, 75)(75, 80, 83; 73, 80, 85)(19, 20, 23; 17, 20, 25)Summer 2016 (part 6)4282126239.84(212, 232, 244; 196, 232, 254)(513, 524, 533; 495, 524, 550)(233, 243, 255; 199, 243, 264)Internal section12305552.56(22, 32, 36; 18, 32, 37)(178, 180, 182; 176, 180, 184)(52, 56, 58; 49, 56, 60)General surgery section15163032.45(47, 50, 52; 46, 50, 53)(81, 84, 87; 79, 84, 89)(89, 90, 94; 82, 90, 96)Pediatrics section9211789.25(87, 90, 93; 78, 90, 99)(238, 240, 241; 226, 240, 251)(24, 27, 32; 22, 27, 36)CCU section6152465.58(56, 60, 63; 54, 60, 65)(16, 20, 23; 14, 20, 26)(68, 70, 71; 46, 70, 72)Autumn 2016 (part 7)5090136258.8(258, 283, 294; 240, 283, 301)(227, 240, 253; 217, 240, 265)(61, 72, 78; 51, 72, 87)Internal section15325365.14(59, 64, 66; 46, 64, 68)(24, 29, 31; 22, 29, 35)(16, 19, 20; 14, 19, 22)General surgery section17193584.11(35, 44, 46; 34, 44, 48)(128, 129, 130; 124, 129, 131)(9, 11, 12; 8, 11, 13)Pediatrics section10212235.24(45, 54, 58; 42, 54, 60)(20, 22, 24; 19, 22, 25)(19, 22, 24; 15, 22, 27)CCU section8182674.31(119, 121, 124; 118, 121, 125)(55, 60, 68; 52, 60, 74)(17, 20, 22; 14, 20, 25)Winter 2017 (part 8)5496140228.34(194, 221, 233; 181, 221, 248)(308, 331, 342; 298, 331, 351)(147, 158, 165; 139, 158, 173)Internal section14365456.85(19, 22, 25; 16, 22, 29)(17, 20, 25; 13, 20, 32)(12, 14, 16; 9, 14, 19)General surgery section20233848.25(79, 88, 90; 76, 88; 95)(74, 86, 89; 71, 86, 89)(115, 118, 119; 113, 118, 122)Pediatrics section12202154.68(31, 32, 34; 27, 32; 36)(8, 12, 13; 7, 12, 14)(3, 6, 8; 2, 6, 9)CCU section8172768.56(65, 79, 84; 62, 79; 88)(209, 213, 215; 207, 213, 216)(17, 20, 22; 15, 20, 23)Table 10
Part and section efficiencies of Imam Khomeini hospital.
PeriodsEfficiency resultsEfficiency results from [47]α=0k=0α=0k=1α=0.5k=0.5α=0.95k=0α=0.95k=1Spring 2015 (part 1)0.520193830.520382970.520467510.520621960.52063228053Internal section0.370497400.370598180.370615540.370673240.370679160.37General surgery section0.358145220.358632550.358494740.358579850.358604360.36Pediatrics section0.615636990.615416650.616109180.616626770.616617330.62CCU section0.930768920.930953260.930983600.931087500.931097740.93Summer 2015 (part 2)0.529511190.539886540.535657510.536544240.537030370.58Internal section0.407433510.443575560.420804100.417148030.418769040.63General surgery section0.426099760.426372420.427190740.427991120.428016710.44Pediatrics section0.506417850.491472570.505978560.511839700.511203910.42CCU section0.926055800.910393780.926554940.933422570.932778530.78Autumn 2015 (part 3)0.481108170.483544840.484125800.485682930.485803860.50Internal section0.402056010.405467860.404641780.405343010.405514560.40General surgery section0.372471890.371316250.374931140.377701320.377642970.46Pediatrics section0.757331150.758634900.758451800.758841160.758904790.76CCU section0.510405300.516218430.516291300.518824120.519111250.54Winter 2016 (part 4)0.633809520.648021760.637479870.634653620.635279380.66Internal section0.216594330.214332580.218183990.220558490.220475660.22General surgery section0.831853470.894733010.842578720.825287460.828007160.91Pediatrics section1.000000001.000000001.000000001.000000001.000000001CCU section1.000000001.000000001.000000001.000000001.000000001Spring 2016 (part 5)0.763291450.758327790.762609600.764387920.764150830.80Internal section0.702773560.698970330.702270990.703809620.703631430.75General surgery section0.930576810.911378600.927929530.934417290.933475990.97Pediatrics section0.646415990.644074820.638871490.633296590.633193970.67CCU section0.812237950.820875390.823261230.829252280.829691950.82Summer 2016 (part 6)0.753325450.744495450.751543480.754109190.753669590.77Internal section0.473060060.473620120.475979250.478339960.478371780.48General surgery section0.946031930.956612460.942467050.934463200.934956691Pediatrics section1.000000001.000000001.000000001.000000001.000000001CCU section0.910552210.849594430.898429990.916408100.913360490.93Autumn 2016 (part 7)0.564223350.563008550.566027340.568235010.568171470.57Internal section0.368257870.362889630.368299790.370905070.370633150.37General surgery section0.620170780.624022810.625824840.629085740.629275340.63Pediatrics section0.436634120.436049030.439036470.441478490.441445220.44CCU section1.000000001.000000001.000000001.000000001.000000001Winter 2017 (part 8)0.499686590.505211190.504562060.506412630.506663200.52Internal section0.133154050.149408290.139009970.136803730.137571470.16General surgery section1.000000001.000000001.000000001.000000001.000000001Pediatrics section0.296736920.330979340.307892280.302901020.304423670.34CCU section0.758399560.711227340.760330760.783468300.781216720.76


## 4.1. Intuitionistic Fuzzy DEA (IFDEA) Problem

DEA is an optimization problem in a linear form to evaluate the efficiency of decision-making units (DMUs) with multiple-input/multiple-outputs assumptions. Despite the advantages of the traditional DEA models, there are some drawbacks in practical applications.One drawback is that they do not work with noncrispy and uncertainty data in real-life problems. As we know, IFNs can efficiently describe fuzzy appearing in the data in the presence of hesitation. By considering IFNs in DEA problems, we should solve an IFDEA problem. Figure14 shows an IFDEA model with m IF inputs x˜ij,i=1,…,m and s IF outputs y˜rj,r=1,…,s.Figure 14
A DMU withm IF inputs and s IF outputs.There have been suggested various DEA models for evaluating the efficiency of DMUs. Among them, the Charnes, Cooper, and Rhodes (CCR) model proposed by Charnes et al. [48] is the dominant DEA model. Considering IF inputs and IF outputs, the basic CCR model is converted to the following IFCCR model:(29)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r=1sury˜rj−∑i=1mvix˜ij≤0,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where θ˜o is the IF efficiency score of the DMU under evaluation DMUo and vi and ur are the given weights to IF input i and IF output r, respectively.By substituting the IF inputs and IF outputs with their assignedSα,k functions, the abovementioned IFCCR model is transformed into the following parametric programming which is dependent on decision level (α) and hesitation degree (k).(30)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mviSα,kx˜io=1,∑r=1surSα,ky˜rj−∑i=1mviSα,kx˜ij≤0,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where 0≤α<ww=minwx˜ij,wy˜rj/i=1,…,m,r=1,…,s,j=1,…,n and 0≤k≤1.Clearly, after determining the amounts of decision level (α) and hesitation degree (k), the abovementioned parametric programming model will be converted to a simple linear program. Thus, we can easily compute the efficiency of DMUs for different amounts of α and k. Generally, the amounts of α and k will be selected based on the decision maker’s idea. If the decision maker considers α close to one, only the elements of an IFN with high membership values are of importance, and so, the obtained efficiency results are made with a high-level decision. Also, by assuming α close to zero, we obtain efficiency results under a low-level decision [53]. Moreover, if the decision maker considers k close to zero, DMUs will be evaluated with a low hesitation degree (pessimistic decision), whereas for a high hesitation degree (optimistic decision), k should be chosen near to one.Although we display our method for the IFCCR model, it can be easily generalizable to other kinds of IFDEA models.For more explanation, consider the following example that is proposed by Arya and Yadav [45].Example 4.
The following data are collected from 16 public hospitals of Meerut in the Indian state of Uttar Pradesh (Arya and Yadav [45]). There are two IF inputs and two IF outputs. The IF inputs are the total number of beds x˜1 and the sum of pathologists and laboratory technicians x˜2, and the IF outputs are the number of pathology operations y˜1 and the sum of plasters and tubal ligations y˜2 (see Table 5).
Using model (30), the efficiency of 16 public hospitals for different amounts of decision level (α=0,α=0.5, and α=0.95) and hesitation degree (k=0,k=0.5, and k=1) are calculated and shown in Table 6. As can be seen, different efficiency and ranking results are obtained for different amounts of α and k. For example, for a fixed decision level α=0, if we set k=0, then HCM will be efficient θ=1 and ranked 1, but for k=1, HCM will be inefficient θ=0.852528 and ranked 2. Also, for a fixed hesitation degree k=0.5, if we set α=0, then the obtained efficiency result of GFD will be 0.517736 and ranked 8, but for α=0.95, the efficiency result of GFD is 0.743246 and ranked 3. Also, from Table 6, for all the selected amounts of decision level α and hesitation degree (k), the BD, BLD, and GBD hospitals are recognized as efficient hospitals and ranked one.
Inspired by theα-level-based approach in fuzzy DEA (see Emrouznejad et al. [49]), Arya and Yadav [45] developed an approach to solve IFDEA models based on α-cuts and β-cuts. The method provided lower and upper bounds of DMUs’ efficiencies for different amounts of α and β. Then, by applying Chen and Klein’s [50] index, they combined the obtained lower and upper bounds to rank DMUs. This approach assigns a wide range of efficiencies to a DMU for different amounts of α and β. Specifically, when they combine these obtained efficiency ranges, it can lead to incorrect ranking results. To illustrate, consider the obtained ranking results for 16 public hospitals based on Arya and Yadav’s [45] method that is shown in the last column of Table 6.
Evidently, there are fundamental differences between our proposed method and Arya and Yadav’s [45] method in ranking DMUs.
For example, if we compare inputs and outputs of GBD and MC hospitals, the outputs of GBD will be larger than the outputs of MC, and the inputs of GBD are smaller than the inputs of MC. Thus, the obtained efficiency and ranking results of GBD should be better than that of MC. Our method confirms this result for different amounts ofα and k. Despite that, MC is considered better than GBD by Arya and Yadav’s [45] method (MC ranked 2 and GBD ranked 10).
Similarly, the outputs of GBD are larger than the outputs of GC, and the inputs of GBD are smaller than the inputs of GC. Hence, GBD should be more efficient than GC. Our method confirms this result for different amounts ofα and k, but by Arya and Yadav’s [45] method, GC is considered better than GBD (GC ranked 1 and GBD ranked 10).Table 5
IFNs as inputs and outputs of 16 public hospitals of Meerut in the Indian state of Uttar Pradesh (Arya and Yadav [45]).
DMUsInputsOutputsx˜1x˜2y˜1y˜2BC(140, 144, 150; 135, 144, 155)(2, 2, 8; 1, 2, 15)(83085, 83089, 83092; 83082, 83089, 83096)(6, 7, 9; 5, 7, 12)BD(18, 20, 25; 15, 20, 28)(2, 3, 5; 1, 3, 10)(14105, 14107, 14110; 14103, 14107, 14115)(897, 900, 904; 895, 900, 908)BLC(442, 446, 449; 440, 446, 451)(2, 3, 6; 1, 3, 10)(115855, 115858, 115862; 115852, 115858, 115865)(1910, 1913, 1915; 1908, 1913, 1919)BLD(145, 149, 152; 140, 149, 155)(1, 1, 4; 1, 1, 8)(165120, 165121, 165125; 165118, 165121, 165129)(1560, 1563, 1567; 1558, 1563, 1570)BLFD(58, 60, 63; 55, 60, 65)(1, 1, 6; 1, 1, 10)(34095, 34099, 340105; 34092, 34099, 340110)(1620, 1622, 1626; 1617, 1622, 1630)BLK(65, 68, 70; 62, 68, 75)(1, 1, 6; 1, 1, 10)(12185, 12189, 12195; 12180, 12189, 12199)(1280, 1283, 1287; 1277, 1283, 1290)GC(122, 124, 126; 120, 124, 130)(6, 7, 10; 4, 7, 15)(65290, 65293, 65298; 65286, 65293, 652102)(215, 218, 222; 210, 218, 227)GD(162, 166, 168; 160, 166, 172)(3, 5, 8; 2, 5, 12)(258750, 258754, 258758; 258745, 258754, 258765)(423, 426, 428; 420, 426, 432)GFD(65, 68, 75; 62, 68, 80)(1, 1, 5; 1, 1, 10)(77852, 77856, 77859; 77850, 77856, 77865)(1160, 1164, 1168; 1155, 1164, 1175)GS(98, 100, 105; 95, 100, 115)(2, 2, 6; 1, 2, 12)(79720, 79725, 79729; 79718, 79725, 79735)(910, 913, 916; 905, 913, 920)GBC(130, 132, 135; 125, 132, 145)(2, 2, 7; 1, 2, 13)(25385, 25387, 25392; 25380, 25387, 25397)(1756, 1761, 1765; 1750, 1761, 1770)GBD(97, 100, 105; 95, 100, 110)(2, 3, 8; 1, 3, 14)(297445, 297449, 297453; 297440, 297449, 297458)(4000, 4004, 4008; 3995, 4004, 4012)MC(248, 250, 255; 245, 250, 260)(6, 8, 12; 5, 8, 15)(61190, 61192, 61196; 61185, 61192, 611102)(635, 638, 642; 630, 638, 648)MD(248, 250, 255; 245, 250, 258)(6, 8, 13; 4, 8, 15)(129432, 129435, 129438; 129430, 129435, 129445)(1050, 1052, 1057; 1046, 1052, 1062)MFD(90, 93, 95; 85, 93, 100)(2, 2, 8; 1, 2, 13)(78275, 78278, 78282; 78272, 78278, 78288)(1600, 1606, 1610; 1595, 1606, 1610)HCM100, 104, 110; 95, 104, 120)(1, 1, 5; 1, 1, 10)(44902, 44906, 44909; 44900, 44906, 44916)(2110, 2113, 2116; 2106, 2113, 2120)Table 6
Efficiency results of 16 public hospitals for different amounts of decision level (α) and hesitation degree (k).
DMUsEfficiency and ranking resultsRanking results from Arya and Yadav [45]α=0k=0Rα=0k=0.5Rα=0k=1Rα=0.5k=0Rα=0.5k=0.5Rα=0.5k=1Rα=0.95k=0Rα=0.95k=0.5Rα=0.95k=1RBC0.297644100.292598120.288515130.316437100.312105100.308308110.339668100.338932100.338208106BD1.00000011.00000011.00000011.00000011.00000011.00000011.00000011.00000011.000000112BLC0.53853760.58140150.61674950.46437780.51630570.54036770.36340590.37081680.37813685BLD1.00000011.00000011.00000011.00000011.00000011.00000011.00000011.00000011.000000114BLFD0.71796520.68158040.68294640.83321720.80773120.78362020.97683020.97317020.969535216BLK0.56401550.53902660.51775070.64247040.62967730.61745740.73538540.73364240.731907413GC0.177911120.378420100.57961060.177467120.277389110.37748290.177068110.187031110.196994111GD0.64427730.69819330.75031430.58290250.61047240.63755330.52836660.53118160.53399069GFD0.57715640.51773680.46983890.65217630.60309650.56257450.75158030.74324630.735188311GS0.34429490.335306110.328358120.35410490.34799490.342735100.36542380.36458190.36375493GBC0.52453770.52483970.51299880.52223160.53552860.54931160.51990770.52122670.52255078GBD1.00000011.00000011.00000011.00000011.00000011.00000011.00000011.00000011.000000110MC0.094946130.225928130.383890110.086511130.143869130.207719130.082297130.086932130.091567132MD0.195820110.225089140.256935140.180680110.194881120.209677120.174077120.174110120.174143127MFD0.45697280.46346090.467468100.49600270.50143680.50675080.53760750.53826450.53892054HCM1.00000010.92982520.85252821.00000011.00000011.00000011.00000011.00000011.000000115


## 4.2. Intuitionistic Fuzzy Network DEA (IFNDEA) Problems

Another drawback of traditional DEA models is that the structure of the decision-making units (DMUs) is assumed to be a black box, which takes no account of internal relations, operations, and structures. However, in real-world applications, we face DEA problems with important internal structures that cannot be ignored. Network DEA (NDEA) is an attempt to consider important interior structures of DMUs to DEA models. Assuming intuitionistic fuzzy data in an NDEA model, we will have an IFNDEA model. Among the various proposed structures, series and parallel are the two famous structures of NDEA models. But, although there are many papers on FDEA, IFDEA, and FNDEA fields, we found only one paper on IFNDEA (see [47]). In the work of Ameri et al. [47], IFNs are considered as inputs and outputs of a parallel NDEA model. In the following sections, we apply our proposed method in both series and parallel structures. Also, in a real-world application of the parallel IFNDEA models, the obtained results from our proposed method are compared with those of Ameri et al. [47].


### 4.2.1. Series Structure

Among all the proposed NDEA models, two-stage network processes have the simplest structure.Consider a simple two-stage IFNDEA model in series form withm IF inputs x˜ij,i=1,…,m, d IF intermediates z˜dj,d=1,…,D, and s IF outputs y˜rj,r=1,…,s data (Figure 15).Figure 15
The generic IF two-stage network process.Different approaches have been proposed to evaluate the efficiency of DMUs in a two-stage NDEA model (see Cook and Zhu [54]), the multiplicative method initially proposed by Kao and Hwang [55] being well-known. In this method, overall efficiency is defined as a production of the stage’s efficiencies.If we consider IFNs for inputs, intermediates, and outputs data, the multiplicative two-stage IFNDEA model will be as follows:(31)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r=1sury˜rj−∑d=1Dwdz˜dj≤0,j=1,…,n,∑d=1Dwdz˜dj−∑i=1mvix˜ij≤0,j=1,…,n,vi,wd,ur≥0,i=1,…,m,d=1,…,D,r=1,…,s,where θ˜o is the IF efficiency score of the DMU under evaluation DMUo and vi,wd, and ur are the given weights to IF input i, IF intermediate data d, and IF output r, respectively.Now, by substituting the IF input, IF intermediate, and IF output data with their assignedSα,k functions, the two-stage IFNDEA model will be converted to the following parametric program:(32)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mviSα,kx˜io=1,∑r=1surSα,ky˜rj−∑d=1DwdSα,kz˜dj≤0,j=1,…,n,∑d=1DwdSα,kz˜dj−∑i=1mviSα,kx˜ij≤0,j=1,…n,vi,wd,ur≥0,i=1,…,m,d=1,…,D,r=1,…,s,where 0≤α<ww=minwx˜ij,wz˜drj,wy˜rj/i=1,…,m,d=1,…,D,r=1,…,s,j=1,…,n and 0≤k≤1.Based on the decision maker’s opinion, by appropriate selection of the decision level (α) and hesitation degree (k), model (32) will be converted to a linear program.The following numerical example is proposed to illustrate the abovementioned method.Example 5.
Consider five hypothetical DMUs with two IF inputs, two IF intermediate products, and two IF outputs in a two-stage NDEA structure (Table7).
As can be seen from Table7, all the input, intermediate, and output data are assumed to be asymmetric TraIFNs. Expectedly, different selection of the decision level (alpha) and hesitation degree (k) led to different ranking and efficiency results. Using model (32), the efficiency results of DMUs are calculated and shown in Table 8 for different amounts of decision level (α=0,α=0.5, and α=0.75) and hesitation degree (k=0,k=0.5, and k=1). We can observe that different amounts of α and k have led to different efficiency and ranking results. For example, the efficiency score of DMU1 for α=0,k=1 (a low-level decision with a high hesitation degree) is 0.377979 and ranked 2, but for α=0.75,k=0 (a high-level decision with a low hesitation degree), the score is 0.114912 and it ranked 5. Also, the efficiency score of DMU4 for α=0.75,k=0 (a high-level decision with a low hesitation degree) is 0.498449 and ranked 1, but for α=0.75,k=1(a high-level decision with a high hesitation degree), the score is 0.223572 and it ranked 4. In most cases, DMU2 is the worst DMU and DMU3 is the best DMU. Also, DMU4 and DMU5 experience most changes in their rankings (from the first to fourth).
Since crisp or fuzzy numbers are special cases of IFNs, our proposed method can solve NDEA models with a collection of crisp, fuzzy, and intuitionistic fuzzy numbers as data too.Table 7
Five DMUs with two IF input, two IF intermediate, and two IF output data in a two-stage structure.
DMUX˜1X˜2Z˜1Z˜2Y˜1Y˜217,9,11,16;0.9,3,9,11,17;0.13,6,7;1,1,6,8;052,53,54;0.9,31,53,56;0.151,52,53;0.9,21,52,56;0.196,97,98,103;1,39,97,98,105;077,79,80,81;0.8,76,79,80,95;0.123,5,8;1,2,5,11;07,9,12;0.9,6,9,23;0.13,4,6;0.9,2,4,18;0.14,5,7;0.9,1,5,8;0.1221,222,223,225;0.9,163,222,223,226;0.19,11,16,18;0.9,9,11,16,21;0.1311,11,16;0.9,10,11,29;0.112,13,14;1,7,13,14;047,49,50;1,44,49,53;036,37,38;1,25,37,38;07,9,11,16;0.9,4,9,11,17;0.1123,124,126,131;1,107,124,126,163;0422,22,41;0.8,21,22,42;0.13,10,10;1,3,10,11;025,27,28;0.9,25,27,30;0.18,8,14;0.8,7,8,15;0.27,8,9,10;1,3,8,9,11;0141,142,143,144;0.9,113,142,143,145;0.1510,30,31;0.8,7,30,33;0.16,6,31;1,5,6,33;027,29,32,35;0.9,21,29,32,36;0.16,9,12,13;0.9,6,9,12,29;0.17,9,10;0.9,2,9,11;0.1131,133,135,137;0.9,117,133,135,148;0Table 8
Efficiency results of five hypothetical DMUs for different amounts of decision level (α) and hesitation degree (k).
DMUsEfficiency resultsα=0k=0Rankα=0k=0.5Rankα=0k=1Rankα=0.5k=0Rankα=0.5k=0.5Rankα=0.5k=1Rankα=0.75k=0Rankα=0.75k=0.5Rankα=0.75k=1RankDMU10.26479430.31927830.37797920.22774940.27973640.31429330.11491250.18332340.2439693DMU20.18605850.18863650.22707850.15854450.15338750.15598750.11545640.11388650.1124575DMU30.43533310.41164210.39187110.48452410.48488010.43764210.48418820.38901020.3511432DMU40.33647820.34228920.34662830.31969220.32177230.30044640.49844910.26336730.2235724DMU50.22732040.23644540.25678840.30062330.34348820.35915620.43533330.44359610.4428981


### 4.2.2. Parallel Structure

Unlike series structures, there is no flow of intermediate products in the parallel structures. In parallel structures, the input and output data are divided among processes (Figure16).Figure 16
A parallel system.Consider a parallel IFNDEA model withq independent processes (Figure 16). In this model, each process p uses IF inputs x˜ip,i∈Ip to produce IF outputs y˜rp,r∈Op. In this system, the sum of the IF inputs used by all the q processes ∑p=1qx˜ijp=x˜ij is equal to the system IF inputs, and the sum of the IF outputs used by all the q processes ∑p=1qy˜rjp=y˜rj is equal to the system IF outputs. Based on Kao’s [56] method, to evaluate the system and process efficiencies, first, the following IFNDEA model should be solved:(33)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r∈Opury˜rjp−∑i∈Ipvix˜ijp≤0,p=1,...,q,j=1,...,n,vi,ur≥0,i=1,...,m,r=1,...,s.By our proposed method, we should first substitute the IF inputs and IF outputs with their assignedSα,k functions. So, the abovementioned IFNDEA model will transform into the following parametric programming which is dependent on decision level (α) and hesitation degree (k):(34)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mvix˜io=1,∑r∈OpurSα,ky˜rjp−∑i∈IpviSα,kx˜ijp≤0,p=1,…,q,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where 0≤α<ww=minwx˜ij,wy˜rj/i=1,…,m,r=1,…,s,j=1,…,n and 0≤k≤1.Consequently, after the selection of the decision level (α) and hesitation degree (k), we can solve the obtained linear program.Letvi∗,ur∗ be an optimal solution of the model (34). We can calculate the process and system efficiencies by the following formulas:(35)Process efficiencies :θop=∑r∈Opur∗Sα,ky˜rop∑i∈Ipvi∗Sα,kx˜iop,p=1,…,q,System efficiencies :θo=∑r=1sur∗Sα,ky˜ro.To apply our proposed method in a real-world application, we consider the following example proposed by Ameri et al. [47]. In Ameri et al.’s [47] method, by substituting the IF inputs and IF outputs with their assigned expected values (Grzegorzewski [13]), the model (34) is transformed into a linear program. Unlike our proposed method, in the work of Ameri [47], we are allowed only to use a specific group of IFNs (normal TraIFNs), and the decision maker’s opinion is not considered in the decision-making process.Example 6.
Imam Khomeini is one of the most famous hospitals in Iran. For the purpose of self-assessment of the Imam Khomeini hospital, Ameri et al. [47] collected the hospital data in eight different periods. So, we have eight DMUs that are made by one hospital data in these different eight periods of time. The internal structure of the hospital department is considered as a parallel structure with four processes in the following sections: internal, general surgery, pediatric, and CCU. Table 9 shows the hospital data, and we can see that each process has three inputs and four outputs. The input data are the physician x1, the number of nurses x2, and the number of beds x3. Also, the output data are the bed occupancy percentage (BOP) y1, satisfaction with physician performance y2, satisfaction with nurse performance y3, and satisfaction with environmental conditions y4. As evident in Table 9, x1, x2, x3, and y1 data are real numbers, while to control the uncertainty and for better modeling of the real data represented by organizations’ decision makers, y2, y3, and y4 data are represented by normal TriIFNs.
Using model34, the efficiency results of the hospital and its sections are calculated for eight different periods of time (see Table 10). Unlike the previous example, in this example, there are no significant differences among the obtained efficiency results for the sections based on different values of the decision level (α) or hesitation degree (k). To explain, all the input data and an input datum are real numbers. Also, the other three output data are not represented by asymmetric or intersected TriIFNs. From Table 10, the greatest differences among the obtained efficiency results for different amounts of α and k is for the CCU section in part 6 (from 0.84959443 α=0,k=1 to 0.91640810 α=0.95,k=0). We can see that there are not any efficient sections in parts 1, 2, 3, and 5. Also, the pediatrics section in parts 4 and 6, CCU section in parts 4 and 7, and general surgery section in part 8 are reported as efficient sections.
The obtained efficiency results from Ameri et al.’s [47] method is shown in the last column of Table 10. As can be seen, although the problem is solved with two different approaches, the obtained efficiency results from our proposed method are nearly identical to those of Ameri et al. [47]. However, the general surgery section in part 6 from our proposed method is an inefficient section for all the selected amounts of α and k, but from Ameri et al.’s [47] method, it is an efficient section.
As mentioned earlier, in our proposed method, the decision maker’s idea is accounted for in the decision-making process by proper selection of the decision level (alpha cut) and the hesitation degree, and so, less information is lost in IFNs. But, in Ameri et al. [47], only a real number (expected value) is assigned to each IF data, and the decision maker does not play any role in the decision-making process.
Although we adopted our method in the multiplicative two-stage IFNDEA and parallel IFNDEA models, it will be easily generalizable to other kinds of IFNDEA models.
We can summarize the algorithm of the proposed method to solve IFNDEA models in real-world applications as follows:Step 1. An appropriate IFNDEA model is chosen based on the structure of the real-world problemStep 2. The input, intermediate, and output data of the problem are determined and represented by crisp, fuzzy, or intuitionistic fuzzy numbersStep 3. The appropriate decision level (α) and hesitation degree (k) are selected based on the decision maker’s opinionStep 4. Input, intermediate, and output data are replaced with their assigned Sα,k indexStep 5. The transformed IFNDEA model is solved to obtain the efficiency score of the DMU under evaluation based on the selected decision level (α) and hesitation degree (k)
As evident in the algorithm, after replacing input, intermediate, and output data with their assignedSα,k indexes, we should solve a transformed IFNDEA model that is a linear-programming model. Different methods are proposed for solving linear-programming problems such as the simplex method or Karmarkar method. Thus, the time complexity of our proposed method depends on the selected method for solving the obtained linear program.Table 9
Input and output of Imam Khomeini hospital ([47]).
PeriodsInputOutputx1x2x3y1y2y3y4Spring 2015 (part 1)3370103215.5(133, 149, 163; 124, 149, 169)(240, 268, 295; 220, 268, 307)(70, 79, 93; 49, 79, 108)Internal section12244761.45(40, 43, 47; 37, 43, 48)(65, 68, 77; 58, 68, 81)(48, 50, 59; 32, 50, 67)General surgery section10152432.22(26, 30, 33; 24, 30, 35)(61, 68, 72; 58, 68, 74)(8, 10, 12; 6, 10, 13)Pediatrics section7171243.63(22, 28, 31; 20, 28, 33)(42, 51, 58; 37, 51, 61)(9, 11, 13; 7, 11, 15)CCU section4142075.20(45, 48, 52; 43, 48, 53)(72, 81, 88; 67, 81, 91)(5, 8, 9; 4, 8, 13)Summer 2015 (part 2)3771108212.74(131, 156, 169; 119, 156, 199)(136, 157, 187; 116, 157, 217)(126, 141, 151; 114, 141, 162)Internal section14245059.01(80, 97, 102; 75, 97, 124)(35, 40, 42; 22, 40, 59)(23, 27, 29; 21, 27, 32)General surgery section10162436.23(13, 17, 20; 10, 17, 24)(40, 47, 65; 38, .47, 73)(29, 32, 35; 24, 32, 38)Pediatrics section8161338.58(10, 12, 14; 9, 12, 16)(43, 50, 57; 41, 50, 60)(19, 22, 24; 17, 22, 28)CCU section5152178.92(28, 30, 33; 25, 30, 35)(18, 20, 23; 15, 20, 25)(55, 60, 63; 52, 60, 64)Autumn 2015 (part 3)4070114203.57(129, 154, 167; 109, 154, 190)(209, 224, 256; 199, 224, 274)(71, 87, 104; 61, 87, 118)Internal section15265079.23(30, 34, 36; 28, 34, 40)(145, 149, 152; 143, 149, 154)(26, 30, 39; 22, 30, 43)General surgery section12152625.96(31, 40, 45; 18, 40, 57)(34, 35, 41; 32, 35, 48)(15, 18, 21; 13, 18, 23)Pediatrics section8161353.02(45, 50, 54; 42, 50, 56)(12, 20, 38; 9, 20, 45)(14, 20, 22; 11, 20, 26)CCU section5132545.36(23, 30, 32; 21, 30, 37)(18, 20, 25; 15, 20, 27)(16, 19, 22; 15, 19, 26)Winter 2016 (part 4)4071118244.89(160, 176, 191; 143, 176, 212)(210, 225, 242; 190, 225, 257)(190, 201, 214; 179, 201, 222)Internal section13255245.56(3, 7, 10; 2, 7, 17)(14, 16, 25; 12, 16, 28)(32, 35, 37; 30, 35, 39)General surgery section14162748.32(81, 84, 86; 80, 84, 87)(60, 67, 71; 50, 67, 73)(51, 53, 56; 48, 53, 58)Pediatrics section9181361.45(28, 35, 39; 18, 35, 50)(39, 42, 44; 36, 42, 46)(45, 48, 51; 43, 48, 53)CCU section4122689.56(48, 50, 56; 43, 50, 58)(97, 100, 102; 92, 100, 110)(62, 65, 70; 58, 65, 72)Spring 2016 (part 5)4473121283.92(232, 246, 257; 213, 246, 266)(485, 497, 512; 476, 497, 529)(189, 207, 244; 157, 207, 257)Internal section15275149.26(76, 80, 85; 64, 80, 89)(250, 252, 254; 247, 252, 255)(69, 75, 98; 58, 75, 102)General surgery section15152978.23(35, 40, 42; 32, 40, 43)(78, 80, 83; 75, 80, 95)(87, 95, 100; 70, 95, 105)Pediatrics section10181682.11(52, 54, 57; 50, 54, 59)(82, 85, 92; 81, 85, 94)(14, 17, 23; 12, 17, 25)CCU section4132574.32(69, 72, 73; 67, 72, 75)(75, 80, 83; 73, 80, 85)(19, 20, 23; 17, 20, 25)Summer 2016 (part 6)4282126239.84(212, 232, 244; 196, 232, 254)(513, 524, 533; 495, 524, 550)(233, 243, 255; 199, 243, 264)Internal section12305552.56(22, 32, 36; 18, 32, 37)(178, 180, 182; 176, 180, 184)(52, 56, 58; 49, 56, 60)General surgery section15163032.45(47, 50, 52; 46, 50, 53)(81, 84, 87; 79, 84, 89)(89, 90, 94; 82, 90, 96)Pediatrics section9211789.25(87, 90, 93; 78, 90, 99)(238, 240, 241; 226, 240, 251)(24, 27, 32; 22, 27, 36)CCU section6152465.58(56, 60, 63; 54, 60, 65)(16, 20, 23; 14, 20, 26)(68, 70, 71; 46, 70, 72)Autumn 2016 (part 7)5090136258.8(258, 283, 294; 240, 283, 301)(227, 240, 253; 217, 240, 265)(61, 72, 78; 51, 72, 87)Internal section15325365.14(59, 64, 66; 46, 64, 68)(24, 29, 31; 22, 29, 35)(16, 19, 20; 14, 19, 22)General surgery section17193584.11(35, 44, 46; 34, 44, 48)(128, 129, 130; 124, 129, 131)(9, 11, 12; 8, 11, 13)Pediatrics section10212235.24(45, 54, 58; 42, 54, 60)(20, 22, 24; 19, 22, 25)(19, 22, 24; 15, 22, 27)CCU section8182674.31(119, 121, 124; 118, 121, 125)(55, 60, 68; 52, 60, 74)(17, 20, 22; 14, 20, 25)Winter 2017 (part 8)5496140228.34(194, 221, 233; 181, 221, 248)(308, 331, 342; 298, 331, 351)(147, 158, 165; 139, 158, 173)Internal section14365456.85(19, 22, 25; 16, 22, 29)(17, 20, 25; 13, 20, 32)(12, 14, 16; 9, 14, 19)General surgery section20233848.25(79, 88, 90; 76, 88; 95)(74, 86, 89; 71, 86, 89)(115, 118, 119; 113, 118, 122)Pediatrics section12202154.68(31, 32, 34; 27, 32; 36)(8, 12, 13; 7, 12, 14)(3, 6, 8; 2, 6, 9)CCU section8172768.56(65, 79, 84; 62, 79; 88)(209, 213, 215; 207, 213, 216)(17, 20, 22; 15, 20, 23)Table 10
Part and section efficiencies of Imam Khomeini hospital.
PeriodsEfficiency resultsEfficiency results from [47]α=0k=0α=0k=1α=0.5k=0.5α=0.95k=0α=0.95k=1Spring 2015 (part 1)0.520193830.520382970.520467510.520621960.52063228053Internal section0.370497400.370598180.370615540.370673240.370679160.37General surgery section0.358145220.358632550.358494740.358579850.358604360.36Pediatrics section0.615636990.615416650.616109180.616626770.616617330.62CCU section0.930768920.930953260.930983600.931087500.931097740.93Summer 2015 (part 2)0.529511190.539886540.535657510.536544240.537030370.58Internal section0.407433510.443575560.420804100.417148030.418769040.63General surgery section0.426099760.426372420.427190740.427991120.428016710.44Pediatrics section0.506417850.491472570.505978560.511839700.511203910.42CCU section0.926055800.910393780.926554940.933422570.932778530.78Autumn 2015 (part 3)0.481108170.483544840.484125800.485682930.485803860.50Internal section0.402056010.405467860.404641780.405343010.405514560.40General surgery section0.372471890.371316250.374931140.377701320.377642970.46Pediatrics section0.757331150.758634900.758451800.758841160.758904790.76CCU section0.510405300.516218430.516291300.518824120.519111250.54Winter 2016 (part 4)0.633809520.648021760.637479870.634653620.635279380.66Internal section0.216594330.214332580.218183990.220558490.220475660.22General surgery section0.831853470.894733010.842578720.825287460.828007160.91Pediatrics section1.000000001.000000001.000000001.000000001.000000001CCU section1.000000001.000000001.000000001.000000001.000000001Spring 2016 (part 5)0.763291450.758327790.762609600.764387920.764150830.80Internal section0.702773560.698970330.702270990.703809620.703631430.75General surgery section0.930576810.911378600.927929530.934417290.933475990.97Pediatrics section0.646415990.644074820.638871490.633296590.633193970.67CCU section0.812237950.820875390.823261230.829252280.829691950.82Summer 2016 (part 6)0.753325450.744495450.751543480.754109190.753669590.77Internal section0.473060060.473620120.475979250.478339960.478371780.48General surgery section0.946031930.956612460.942467050.934463200.934956691Pediatrics section1.000000001.000000001.000000001.000000001.000000001CCU section0.910552210.849594430.898429990.916408100.913360490.93Autumn 2016 (part 7)0.564223350.563008550.566027340.568235010.568171470.57Internal section0.368257870.362889630.368299790.370905070.370633150.37General surgery section0.620170780.624022810.625824840.629085740.629275340.63Pediatrics section0.436634120.436049030.439036470.441478490.441445220.44CCU section1.000000001.000000001.000000001.000000001.000000001Winter 2017 (part 8)0.499686590.505211190.504562060.506412630.506663200.52Internal section0.133154050.149408290.139009970.136803730.137571470.16General surgery section1.000000001.000000001.000000001.000000001.000000001Pediatrics section0.296736920.330979340.307892280.302901020.304423670.34CCU section0.758399560.711227340.760330760.783468300.781216720.76


## 4.2.1. Series Structure

Among all the proposed NDEA models, two-stage network processes have the simplest structure.Consider a simple two-stage IFNDEA model in series form withm IF inputs x˜ij,i=1,…,m, d IF intermediates z˜dj,d=1,…,D, and s IF outputs y˜rj,r=1,…,s data (Figure 15).Figure 15
The generic IF two-stage network process.Different approaches have been proposed to evaluate the efficiency of DMUs in a two-stage NDEA model (see Cook and Zhu [54]), the multiplicative method initially proposed by Kao and Hwang [55] being well-known. In this method, overall efficiency is defined as a production of the stage’s efficiencies.If we consider IFNs for inputs, intermediates, and outputs data, the multiplicative two-stage IFNDEA model will be as follows:(31)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r=1sury˜rj−∑d=1Dwdz˜dj≤0,j=1,…,n,∑d=1Dwdz˜dj−∑i=1mvix˜ij≤0,j=1,…,n,vi,wd,ur≥0,i=1,…,m,d=1,…,D,r=1,…,s,where θ˜o is the IF efficiency score of the DMU under evaluation DMUo and vi,wd, and ur are the given weights to IF input i, IF intermediate data d, and IF output r, respectively.Now, by substituting the IF input, IF intermediate, and IF output data with their assignedSα,k functions, the two-stage IFNDEA model will be converted to the following parametric program:(32)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mviSα,kx˜io=1,∑r=1surSα,ky˜rj−∑d=1DwdSα,kz˜dj≤0,j=1,…,n,∑d=1DwdSα,kz˜dj−∑i=1mviSα,kx˜ij≤0,j=1,…n,vi,wd,ur≥0,i=1,…,m,d=1,…,D,r=1,…,s,where 0≤α<ww=minwx˜ij,wz˜drj,wy˜rj/i=1,…,m,d=1,…,D,r=1,…,s,j=1,…,n and 0≤k≤1.Based on the decision maker’s opinion, by appropriate selection of the decision level (α) and hesitation degree (k), model (32) will be converted to a linear program.The following numerical example is proposed to illustrate the abovementioned method.Example 5.
Consider five hypothetical DMUs with two IF inputs, two IF intermediate products, and two IF outputs in a two-stage NDEA structure (Table7).
As can be seen from Table7, all the input, intermediate, and output data are assumed to be asymmetric TraIFNs. Expectedly, different selection of the decision level (alpha) and hesitation degree (k) led to different ranking and efficiency results. Using model (32), the efficiency results of DMUs are calculated and shown in Table 8 for different amounts of decision level (α=0,α=0.5, and α=0.75) and hesitation degree (k=0,k=0.5, and k=1). We can observe that different amounts of α and k have led to different efficiency and ranking results. For example, the efficiency score of DMU1 for α=0,k=1 (a low-level decision with a high hesitation degree) is 0.377979 and ranked 2, but for α=0.75,k=0 (a high-level decision with a low hesitation degree), the score is 0.114912 and it ranked 5. Also, the efficiency score of DMU4 for α=0.75,k=0 (a high-level decision with a low hesitation degree) is 0.498449 and ranked 1, but for α=0.75,k=1(a high-level decision with a high hesitation degree), the score is 0.223572 and it ranked 4. In most cases, DMU2 is the worst DMU and DMU3 is the best DMU. Also, DMU4 and DMU5 experience most changes in their rankings (from the first to fourth).
Since crisp or fuzzy numbers are special cases of IFNs, our proposed method can solve NDEA models with a collection of crisp, fuzzy, and intuitionistic fuzzy numbers as data too.Table 7
Five DMUs with two IF input, two IF intermediate, and two IF output data in a two-stage structure.
DMUX˜1X˜2Z˜1Z˜2Y˜1Y˜217,9,11,16;0.9,3,9,11,17;0.13,6,7;1,1,6,8;052,53,54;0.9,31,53,56;0.151,52,53;0.9,21,52,56;0.196,97,98,103;1,39,97,98,105;077,79,80,81;0.8,76,79,80,95;0.123,5,8;1,2,5,11;07,9,12;0.9,6,9,23;0.13,4,6;0.9,2,4,18;0.14,5,7;0.9,1,5,8;0.1221,222,223,225;0.9,163,222,223,226;0.19,11,16,18;0.9,9,11,16,21;0.1311,11,16;0.9,10,11,29;0.112,13,14;1,7,13,14;047,49,50;1,44,49,53;036,37,38;1,25,37,38;07,9,11,16;0.9,4,9,11,17;0.1123,124,126,131;1,107,124,126,163;0422,22,41;0.8,21,22,42;0.13,10,10;1,3,10,11;025,27,28;0.9,25,27,30;0.18,8,14;0.8,7,8,15;0.27,8,9,10;1,3,8,9,11;0141,142,143,144;0.9,113,142,143,145;0.1510,30,31;0.8,7,30,33;0.16,6,31;1,5,6,33;027,29,32,35;0.9,21,29,32,36;0.16,9,12,13;0.9,6,9,12,29;0.17,9,10;0.9,2,9,11;0.1131,133,135,137;0.9,117,133,135,148;0Table 8
Efficiency results of five hypothetical DMUs for different amounts of decision level (α) and hesitation degree (k).
DMUsEfficiency resultsα=0k=0Rankα=0k=0.5Rankα=0k=1Rankα=0.5k=0Rankα=0.5k=0.5Rankα=0.5k=1Rankα=0.75k=0Rankα=0.75k=0.5Rankα=0.75k=1RankDMU10.26479430.31927830.37797920.22774940.27973640.31429330.11491250.18332340.2439693DMU20.18605850.18863650.22707850.15854450.15338750.15598750.11545640.11388650.1124575DMU30.43533310.41164210.39187110.48452410.48488010.43764210.48418820.38901020.3511432DMU40.33647820.34228920.34662830.31969220.32177230.30044640.49844910.26336730.2235724DMU50.22732040.23644540.25678840.30062330.34348820.35915620.43533330.44359610.4428981


## 4.2.2. Parallel Structure

Unlike series structures, there is no flow of intermediate products in the parallel structures. In parallel structures, the input and output data are divided among processes (Figure16).Figure 16
A parallel system.Consider a parallel IFNDEA model withq independent processes (Figure 16). In this model, each process p uses IF inputs x˜ip,i∈Ip to produce IF outputs y˜rp,r∈Op. In this system, the sum of the IF inputs used by all the q processes ∑p=1qx˜ijp=x˜ij is equal to the system IF inputs, and the sum of the IF outputs used by all the q processes ∑p=1qy˜rjp=y˜rj is equal to the system IF outputs. Based on Kao’s [56] method, to evaluate the system and process efficiencies, first, the following IFNDEA model should be solved:(33)θ˜o=max∑r=1sury˜ro,s.t.∑i=1mvix˜io=1,∑r∈Opury˜rjp−∑i∈Ipvix˜ijp≤0,p=1,...,q,j=1,...,n,vi,ur≥0,i=1,...,m,r=1,...,s.By our proposed method, we should first substitute the IF inputs and IF outputs with their assignedSα,k functions. So, the abovementioned IFNDEA model will transform into the following parametric programming which is dependent on decision level (α) and hesitation degree (k):(34)θoα,k=max∑r=1surSα,ky˜ro,s.t.∑i=1mvix˜io=1,∑r∈OpurSα,ky˜rjp−∑i∈IpviSα,kx˜ijp≤0,p=1,…,q,j=1,…,n,vi,ur≥0,i=1,…,m,r=1,…,s,where 0≤α<ww=minwx˜ij,wy˜rj/i=1,…,m,r=1,…,s,j=1,…,n and 0≤k≤1.Consequently, after the selection of the decision level (α) and hesitation degree (k), we can solve the obtained linear program.Letvi∗,ur∗ be an optimal solution of the model (34). We can calculate the process and system efficiencies by the following formulas:(35)Process efficiencies :θop=∑r∈Opur∗Sα,ky˜rop∑i∈Ipvi∗Sα,kx˜iop,p=1,…,q,System efficiencies :θo=∑r=1sur∗Sα,ky˜ro.To apply our proposed method in a real-world application, we consider the following example proposed by Ameri et al. [47]. In Ameri et al.’s [47] method, by substituting the IF inputs and IF outputs with their assigned expected values (Grzegorzewski [13]), the model (34) is transformed into a linear program. Unlike our proposed method, in the work of Ameri [47], we are allowed only to use a specific group of IFNs (normal TraIFNs), and the decision maker’s opinion is not considered in the decision-making process.Example 6.
Imam Khomeini is one of the most famous hospitals in Iran. For the purpose of self-assessment of the Imam Khomeini hospital, Ameri et al. [47] collected the hospital data in eight different periods. So, we have eight DMUs that are made by one hospital data in these different eight periods of time. The internal structure of the hospital department is considered as a parallel structure with four processes in the following sections: internal, general surgery, pediatric, and CCU. Table 9 shows the hospital data, and we can see that each process has three inputs and four outputs. The input data are the physician x1, the number of nurses x2, and the number of beds x3. Also, the output data are the bed occupancy percentage (BOP) y1, satisfaction with physician performance y2, satisfaction with nurse performance y3, and satisfaction with environmental conditions y4. As evident in Table 9, x1, x2, x3, and y1 data are real numbers, while to control the uncertainty and for better modeling of the real data represented by organizations’ decision makers, y2, y3, and y4 data are represented by normal TriIFNs.
Using model34, the efficiency results of the hospital and its sections are calculated for eight different periods of time (see Table 10). Unlike the previous example, in this example, there are no significant differences among the obtained efficiency results for the sections based on different values of the decision level (α) or hesitation degree (k). To explain, all the input data and an input datum are real numbers. Also, the other three output data are not represented by asymmetric or intersected TriIFNs. From Table 10, the greatest differences among the obtained efficiency results for different amounts of α and k is for the CCU section in part 6 (from 0.84959443 α=0,k=1 to 0.91640810 α=0.95,k=0). We can see that there are not any efficient sections in parts 1, 2, 3, and 5. Also, the pediatrics section in parts 4 and 6, CCU section in parts 4 and 7, and general surgery section in part 8 are reported as efficient sections.
The obtained efficiency results from Ameri et al.’s [47] method is shown in the last column of Table 10. As can be seen, although the problem is solved with two different approaches, the obtained efficiency results from our proposed method are nearly identical to those of Ameri et al. [47]. However, the general surgery section in part 6 from our proposed method is an inefficient section for all the selected amounts of α and k, but from Ameri et al.’s [47] method, it is an efficient section.
As mentioned earlier, in our proposed method, the decision maker’s idea is accounted for in the decision-making process by proper selection of the decision level (alpha cut) and the hesitation degree, and so, less information is lost in IFNs. But, in Ameri et al. [47], only a real number (expected value) is assigned to each IF data, and the decision maker does not play any role in the decision-making process.
Although we adopted our method in the multiplicative two-stage IFNDEA and parallel IFNDEA models, it will be easily generalizable to other kinds of IFNDEA models.
We can summarize the algorithm of the proposed method to solve IFNDEA models in real-world applications as follows:Step 1. An appropriate IFNDEA model is chosen based on the structure of the real-world problemStep 2. The input, intermediate, and output data of the problem are determined and represented by crisp, fuzzy, or intuitionistic fuzzy numbersStep 3. The appropriate decision level (α) and hesitation degree (k) are selected based on the decision maker’s opinionStep 4. Input, intermediate, and output data are replaced with their assigned Sα,k indexStep 5. The transformed IFNDEA model is solved to obtain the efficiency score of the DMU under evaluation based on the selected decision level (α) and hesitation degree (k)
As evident in the algorithm, after replacing input, intermediate, and output data with their assignedSα,k indexes, we should solve a transformed IFNDEA model that is a linear-programming model. Different methods are proposed for solving linear-programming problems such as the simplex method or Karmarkar method. Thus, the time complexity of our proposed method depends on the selected method for solving the obtained linear program.Table 9
Input and output of Imam Khomeini hospital ([47]).
PeriodsInputOutputx1x2x3y1y2y3y4Spring 2015 (part 1)3370103215.5(133, 149, 163; 124, 149, 169)(240, 268, 295; 220, 268, 307)(70, 79, 93; 49, 79, 108)Internal section12244761.45(40, 43, 47; 37, 43, 48)(65, 68, 77; 58, 68, 81)(48, 50, 59; 32, 50, 67)General surgery section10152432.22(26, 30, 33; 24, 30, 35)(61, 68, 72; 58, 68, 74)(8, 10, 12; 6, 10, 13)Pediatrics section7171243.63(22, 28, 31; 20, 28, 33)(42, 51, 58; 37, 51, 61)(9, 11, 13; 7, 11, 15)CCU section4142075.20(45, 48, 52; 43, 48, 53)(72, 81, 88; 67, 81, 91)(5, 8, 9; 4, 8, 13)Summer 2015 (part 2)3771108212.74(131, 156, 169; 119, 156, 199)(136, 157, 187; 116, 157, 217)(126, 141, 151; 114, 141, 162)Internal section14245059.01(80, 97, 102; 75, 97, 124)(35, 40, 42; 22, 40, 59)(23, 27, 29; 21, 27, 32)General surgery section10162436.23(13, 17, 20; 10, 17, 24)(40, 47, 65; 38, .47, 73)(29, 32, 35; 24, 32, 38)Pediatrics section8161338.58(10, 12, 14; 9, 12, 16)(43, 50, 57; 41, 50, 60)(19, 22, 24; 17, 22, 28)CCU section5152178.92(28, 30, 33; 25, 30, 35)(18, 20, 23; 15, 20, 25)(55, 60, 63; 52, 60, 64)Autumn 2015 (part 3)4070114203.57(129, 154, 167; 109, 154, 190)(209, 224, 256; 199, 224, 274)(71, 87, 104; 61, 87, 118)Internal section15265079.23(30, 34, 36; 28, 34, 40)(145, 149, 152; 143, 149, 154)(26, 30, 39; 22, 30, 43)General surgery section12152625.96(31, 40, 45; 18, 40, 57)(34, 35, 41; 32, 35, 48)(15, 18, 21; 13, 18, 23)Pediatrics section8161353.02(45, 50, 54; 42, 50, 56)(12, 20, 38; 9, 20, 45)(14, 20, 22; 11, 20, 26)CCU section5132545.36(23, 30, 32; 21, 30, 37)(18, 20, 25; 15, 20, 27)(16, 19, 22; 15, 19, 26)Winter 2016 (part 4)4071118244.89(160, 176, 191; 143, 176, 212)(210, 225, 242; 190, 225, 257)(190, 201, 214; 179, 201, 222)Internal section13255245.56(3, 7, 10; 2, 7, 17)(14, 16, 25; 12, 16, 28)(32, 35, 37; 30, 35, 39)General surgery section14162748.32(81, 84, 86; 80, 84, 87)(60, 67, 71; 50, 67, 73)(51, 53, 56; 48, 53, 58)Pediatrics section9181361.45(28, 35, 39; 18, 35, 50)(39, 42, 44; 36, 42, 46)(45, 48, 51; 43, 48, 53)CCU section4122689.56(48, 50, 56; 43, 50, 58)(97, 100, 102; 92, 100, 110)(62, 65, 70; 58, 65, 72)Spring 2016 (part 5)4473121283.92(232, 246, 257; 213, 246, 266)(485, 497, 512; 476, 497, 529)(189, 207, 244; 157, 207, 257)Internal section15275149.26(76, 80, 85; 64, 80, 89)(250, 252, 254; 247, 252, 255)(69, 75, 98; 58, 75, 102)General surgery section15152978.23(35, 40, 42; 32, 40, 43)(78, 80, 83; 75, 80, 95)(87, 95, 100; 70, 95, 105)Pediatrics section10181682.11(52, 54, 57; 50, 54, 59)(82, 85, 92; 81, 85, 94)(14, 17, 23; 12, 17, 25)CCU section4132574.32(69, 72, 73; 67, 72, 75)(75, 80, 83; 73, 80, 85)(19, 20, 23; 17, 20, 25)Summer 2016 (part 6)4282126239.84(212, 232, 244; 196, 232, 254)(513, 524, 533; 495, 524, 550)(233, 243, 255; 199, 243, 264)Internal section12305552.56(22, 32, 36; 18, 32, 37)(178, 180, 182; 176, 180, 184)(52, 56, 58; 49, 56, 60)General surgery section15163032.45(47, 50, 52; 46, 50, 53)(81, 84, 87; 79, 84, 89)(89, 90, 94; 82, 90, 96)Pediatrics section9211789.25(87, 90, 93; 78, 90, 99)(238, 240, 241; 226, 240, 251)(24, 27, 32; 22, 27, 36)CCU section6152465.58(56, 60, 63; 54, 60, 65)(16, 20, 23; 14, 20, 26)(68, 70, 71; 46, 70, 72)Autumn 2016 (part 7)5090136258.8(258, 283, 294; 240, 283, 301)(227, 240, 253; 217, 240, 265)(61, 72, 78; 51, 72, 87)Internal section15325365.14(59, 64, 66; 46, 64, 68)(24, 29, 31; 22, 29, 35)(16, 19, 20; 14, 19, 22)General surgery section17193584.11(35, 44, 46; 34, 44, 48)(128, 129, 130; 124, 129, 131)(9, 11, 12; 8, 11, 13)Pediatrics section10212235.24(45, 54, 58; 42, 54, 60)(20, 22, 24; 19, 22, 25)(19, 22, 24; 15, 22, 27)CCU section8182674.31(119, 121, 124; 118, 121, 125)(55, 60, 68; 52, 60, 74)(17, 20, 22; 14, 20, 25)Winter 2017 (part 8)5496140228.34(194, 221, 233; 181, 221, 248)(308, 331, 342; 298, 331, 351)(147, 158, 165; 139, 158, 173)Internal section14365456.85(19, 22, 25; 16, 22, 29)(17, 20, 25; 13, 20, 32)(12, 14, 16; 9, 14, 19)General surgery section20233848.25(79, 88, 90; 76, 88; 95)(74, 86, 89; 71, 86, 89)(115, 118, 119; 113, 118, 122)Pediatrics section12202154.68(31, 32, 34; 27, 32; 36)(8, 12, 13; 7, 12, 14)(3, 6, 8; 2, 6, 9)CCU section8172768.56(65, 79, 84; 62, 79; 88)(209, 213, 215; 207, 213, 216)(17, 20, 22; 15, 20, 23)Table 10
Part and section efficiencies of Imam Khomeini hospital.
PeriodsEfficiency resultsEfficiency results from [47]α=0k=0α=0k=1α=0.5k=0.5α=0.95k=0α=0.95k=1Spring 2015 (part 1)0.520193830.520382970.520467510.520621960.52063228053Internal section0.370497400.370598180.370615540.370673240.370679160.37General surgery section0.358145220.358632550.358494740.358579850.358604360.36Pediatrics section0.615636990.615416650.616109180.616626770.616617330.62CCU section0.930768920.930953260.930983600.931087500.931097740.93Summer 2015 (part 2)0.529511190.539886540.535657510.536544240.537030370.58Internal section0.407433510.443575560.420804100.417148030.418769040.63General surgery section0.426099760.426372420.427190740.427991120.428016710.44Pediatrics section0.506417850.491472570.505978560.511839700.511203910.42CCU section0.926055800.910393780.926554940.933422570.932778530.78Autumn 2015 (part 3)0.481108170.483544840.484125800.485682930.485803860.50Internal section0.402056010.405467860.404641780.405343010.405514560.40General surgery section0.372471890.371316250.374931140.377701320.377642970.46Pediatrics section0.757331150.758634900.758451800.758841160.758904790.76CCU section0.510405300.516218430.516291300.518824120.519111250.54Winter 2016 (part 4)0.633809520.648021760.637479870.634653620.635279380.66Internal section0.216594330.214332580.218183990.220558490.220475660.22General surgery section0.831853470.894733010.842578720.825287460.828007160.91Pediatrics section1.000000001.000000001.000000001.000000001.000000001CCU section1.000000001.000000001.000000001.000000001.000000001Spring 2016 (part 5)0.763291450.758327790.762609600.764387920.764150830.80Internal section0.702773560.698970330.702270990.703809620.703631430.75General surgery section0.930576810.911378600.927929530.934417290.933475990.97Pediatrics section0.646415990.644074820.638871490.633296590.633193970.67CCU section0.812237950.820875390.823261230.829252280.829691950.82Summer 2016 (part 6)0.753325450.744495450.751543480.754109190.753669590.77Internal section0.473060060.473620120.475979250.478339960.478371780.48General surgery section0.946031930.956612460.942467050.934463200.934956691Pediatrics section1.000000001.000000001.000000001.000000001.000000001CCU section0.910552210.849594430.898429990.916408100.913360490.93Autumn 2016 (part 7)0.564223350.563008550.566027340.568235010.568171470.57Internal section0.368257870.362889630.368299790.370905070.370633150.37General surgery section0.620170780.624022810.625824840.629085740.629275340.63Pediatrics section0.436634120.436049030.439036470.441478490.441445220.44CCU section1.000000001.000000001.000000001.000000001.000000001Winter 2017 (part 8)0.499686590.505211190.504562060.506412630.506663200.52Internal section0.133154050.149408290.139009970.136803730.137571470.16General surgery section1.000000001.000000001.000000001.000000001.000000001Pediatrics section0.296736920.330979340.307892280.302901020.304423670.34CCU section0.758399560.711227340.760330760.783468300.781216720.76


## 5. Conclusions

IFNs can efficiently model noncrispy and uncertainty in real-world data. Ranking is the second most important issue after IFNs definition. In this study, a new parametric method was proposed for ranking IFNs, and by appropriate examples, its superiority over some other methods was explained. Engaging the decision maker in the decision-making process is an important advantage of the proposed method. It was observed that the decision maker’s opinion about the decision level and hesitation degree parameters can affect the obtained ranking results. Many proposed methods to date rank only a special group of IFNs (e.g., TriIFNs, TraIFNs, or normal IFNs), but the proposed method is able to simultaneously rank all kinds of IFNs. Also, to show the ability of the proposed method in real-world applications, we applied our method to solve IFDEA, two-stage IFNDEA, and parallel IFNDEA models. The proposed approach is easily generalizable to solve other kinds of IFNDEA models too.As future studies, we aim to apply our proposed method to multicriteria decision-making (MCDM) techniques, such as the analytic hierarchy process (AHP), best-worst method (BWM), and VIKOR, to solve intuitionistic fuzzy MCDM problems.



---

*Source: 6408613-2020-09-02.xml*