Research Article  Open Access
Anrong Yang, Zigang Zhang, Yishi Zhang, Dunliang Chen, "Gap Minimization for PeerEvaluation in DEA CrossEfficiency", Journal of Applied Mathematics, vol. 2014, Article ID 453749, 7 pages, 2014. https://doi.org/10.1155/2014/453749
Gap Minimization for PeerEvaluation in DEA CrossEfficiency
Abstract
Crossefficiency evaluation is an effective and widely used method for ranking decision making units (DMUs) in data envelopment analysis (DEA). Gap minimization criterion is introduced in aggressive and benevolent crossefficiency methods to avoid possible extreme efficiency from peerevaluation and to get equitable results. On the basis of this criterion, a weighted crossefficiency method with similarity distance that, respectively, considers the aggressive and the benevolent formulations is proposed to determine crossefficiency. The weights of the crossevaluation determined by this method are positively influenced by selfevaluation and thus are propitious to resolving conflict. Numerical demonstration reveals the feasibility of the proposed method.
1. Introduction
Data envelopment analysis (DEA) is an effective and widely used nonparametric method for assessing the relative efficiency of a set of decision making units (DMUs) with structures of multiple inputs and outputs. Using the traditional DEA models like CCR model proposed by Charnes et al. [1] and BCC model by Banker et al. [2], DMUs can be divided into efficient and inefficient groups. DEA is a typical application of linear programming and has already been widely used for solving many real world problems [3–6]. While in practice, there is often a need to discriminate efficient DMUs. Besides, DEA may result in unrealistic weight distribution, thus leading to the efficiency results being not equitable and acceptable in some cases. A series of approaches have been proposed to rank DMUs and to overcome the shortcomings of traditional DEA methods [7–17].
Crossefficiency method originated by Sexton et al. [18] extends the basic DEA methods and thus can rank DMUs according to their efficiency scores. In addition, it can avoid unrealistic DEA weighting schemes by incorporating additional weight restrictions into DEA. The core idea of the crossefficiency is to evaluate each DMU according to both its and peers’ optimal input and output weights. The efficiency scores of a DMU will thus be calculated times and the average score of self and peerevaluations will be chosen as its ranking score. However, this may fall into a dilemma of multiple solutions [19]. Doyle and Green [20] propose an aggressive crossefficiency method and a benevolent one to avoid the problem. They introduce secondary objective functions to select the optimal weights minimizing and maximizing the sum of the outputs of other DMUs, respectively. Wang and Chin [16] propose a neutral crossefficiency method to reduce the number of zero weights of the outputs. The crossefficiency scores are determined by the profiles of weights that are used. To effectively select weights from multiple optimal solutions, goal programming formulations are considered to be an effective method in recent literature (e.g., SWAT proposed by Jahanshahloo et al. [21] and the novel secondary objective function proposed by HosseinzadehLotfi et al. [22]). Many alternative secondary goals for the purpose of crossefficiency are proposed in the literature, where minimizing the summation of deviations from the ideal point and minimizing the maximum quantity among all deviation variables are typically applied in [23, 24]. In addition, multicriteria method proposed by Li and Reeves [23] and its extensions like preemptive programming formulation by Bal and Örkcü [8] and weighted programming formulation by [9] have the ability to select weights with realistic weight distribution. Örkcü and Bal [14] refine goal programming models in the crossefficiency evaluation. Recently, Wang et al. [17] propose a simultaneously input and outputoriented weight determination crossefficiency model for reducing the number of zero weights of the inputs.
In this paper, we mainly focus on the promotion of the acceptance of the crossefficiency ranking results for each DMU. We introduce a regularization term to minimize the gap between the upper and lower bounds of the peerevaluation scores. In addition, we evaluate DMUs in a more neutral manner both considering the pessimistic and optimistic attitudes from the aggressive and benevolent methods and propose a weighted neutral crossefficiency method to determine the crossefficiency scores according to the similarity distances between DMUs. Our method has a greater ability to discriminate DEAefficient and DEAinefficient DMUs compared to the extant crossefficiency methods. In addition, the gap minimization criterion and the manner of determining the weights for each crossefficiency score in our method are propitious to resolving conflict among DMUs during crossevaluation process.
The rest of this paper is organized as follows. Section 2 briefly introduces the aggressive and benevolent crossefficiency models. Section 3 proposes a secondary goal to minimize the gap between the upper and lower bounds of the peerevaluation scores and a new weighted method for neutral DEA crossefficiency evaluation based on the similarity distance between pairs of DMUs. Then Section 4 demonstrates the feasibility of proposed method with a numerical example. Section 5 finally summarizes the concluding remarks.
2. Aggressive and Benevolent CrossEfficiency Models
Let there be DMUs where uses inputs to produce outputs . And suppose that all input and output indices are nonnegative constant numbers. Then for a given , the relative efficiency score under the CCR model is determined by solving the following linear programming [1]: where and are the weights assigned to th input and th output, respectively. Let and be the optimal solutions to model (1); then is the CCRefficiency of and reflects the selfevaluation of this unit. is considered to be efficient if ; otherwise, it is referred to as nonefficient.
As an extension to basic DEA models, crossefficiency evaluation not only generates a ranking among the DMUs according to their efficiency but also removes unrealistic DEA weighting schemes without requiring any additional information on weight restrictions. The crossefficiency of which contains ’s peerevaluation to is obtained as Using the average crossefficiency values, all of the DMUs can be compared and ranked. However, a factor that possibly reduces the usefulness of the crossefficiency evaluation method is that the crossefficiency results may not be unique due to the presence of alternate optima. To resolve the problem of having multiple optimal solutions from model (1) so as to keep unchanged, Sexton et al. [18] introduce a secondary goal to select the optimal input and output weights from multiple optimal solutions while keeping the CCR efficiency unchanged. The most representative secondary goals are shown in the following models [18, 20]: where is the efficiency value for obtained from model (1). Model (4) with a minobjective function is known as the aggressive efficiency model, which minimizes the crossefficiencies of other DMUs while preserving the efficiency of itself under evaluation. Model (4) with a maxobjective function is known as the benevolent efficiency model, which maximizes the crossefficiencies of other DMUs while preserving the efficiency of itself under evaluation.
3. A Weighted Neutral CrossEfficiency Method
3.1. Gap Minimization Criterion for PeerEvaluation
In the case of the benevolent model, the idea is to identify the optimal weights that not only maximize the efficiency of a particular DMU under evaluation but, at the same time, maximize the average efficiency of other DMUs. In the case of the aggressive model, one seeks weights that minimize the average efficiency of those other units. Although these two goals have been proposed as a remedy for the issue of nonuniqueness, they only focus on maximizing or minimizing the value of the efficiencies of self and peerevaluations but never consider the rationality of possible extreme results of peerevaluation, for example, selecting weights making the value of peerevaluation for a certain DMU too small or too large. This may result in dispute and impair the rationality of the selected weights and the corresponding peerefficiency scores, especially for the DMUs in a cooperative mode. To this end, the objective function of the crossefficiency model should not only consider the issue of nonuniqueness but also take into account the rationality of the results of peerevaluation. For the aggressive and the benevolent models, the extreme results of peerevaluation can be partially avoided by introducing an additional goal or a regularization term focusing on such issue. In this paper, we try to avoid the extreme positions by means of minimizing the gap between the extreme large value and the extreme small one of the peerevaluation. This can be formed as Hence, we apply (5) as the regularization term and add it as a part of the objective function for both the aggressive and the benevolent models. We show the modified aggressive and benevolent models, respectively, as where is the importance weight of the regularization term (5) in the objective functions of models (6) and (7). Note that makes models (6) and (7) the same as the original aggressive model and the original benevolent one, respectively. If is large enough, (6) and (7) are equivalent to the model that always focuses on the gap between extremes.
Models (6) and (7) can be expressed equivalently in the following forms, respectively: where and are the upper and lower bounds of , respectively.
3.2. A Neutral Method for PeerEfficiency Determination
In order to eliminate bias to other DMUs brought by both of the aggressive goal and the benevolent one as well as keep the objectivity of the evaluation process, we try to evaluate DMUs in a more neutral manner and to reduce conflict and disputes by applying both of the models. That is, we can make compromised results between the aggressive and the benevolent formulations if the final peerefficiency scores are determined in terms of such two formulations. To illustrate this, for , we denote its self and peerefficiency scores and , respectively, by solving models (8) and (3) and self and peerefficiency scores and , respectively, by solving models (9) and (3). We hence have the following convex combinatorial expression for peerefficiency score : where the convex combinatorial coefficients and satisfy and , . Such a combination effectively balances the two extreme attitudes from the aggressive and the benevolent formulations and thus results in a more “neutral” peerefficiency score. Thus proposed method can be taken as a neutral crossefficiency method. For , we have the following proposition.
Proposition 1. .
Proof. Let the optimum solutions of from model (8) be and , respectively, and let those from model (9) be and , respectively. Note that both the optimum solutions from models (8) and (9) satisfy the following constraint: Recall that denotes the optimum value of the CCR model (i.e., model (1)). This constraint can be rewrite as Hence, feasible solutions from models (8) and (9) are always optimum to the CCR model. Thus we have Meanwhile, implies With (13) and (14), we have .
To reduce inconsistency between peerevaluation and selfevaluation, we determine and from the viewpoint of efficiency distance between pairs of DMUs. From an individual’s viewpoint, DMUs with more similar efficiency scores are more important to be referred during the crossefficiency evaluation process. More specifically, for and , the more () is similar to , the more likely the profile of weights of inputs and outputs of is to be accepted by . Thus, we define the distance from to as and that from to as Note that and in most cases. Since small (large) value of implies strong (weak) similarity between and , we hence introduce a total distance as and conflict reduction may be implemented by keeping and in proportion to and , respectively; that is, To determine the value of and , normalization is needed to make them satisfy . Hence we have With Proposition 1, it is easy to find that (19) can be transferred into easytosolve forms as follows:
3.3. CrossEvaluation Based on Similarity Distance
To further reduce the inconsistency between peerevaluation and selfevaluation, we also determine the weight for crossevaluation from the viewpoint of efficiency distance between pairs of DMUs. We define the crossevaluationbased distance from to as Let ; the crossefficiency weight of should be proportional to . Taking normalization into consideration, we apply as the crossefficiency weight of . To make (22) easy to solve, we have (with Proposition 1) Let , (22) be equivalent to And finally we have We use (10) in neither aggressive nor benevolent manners but a more neutral way to calculate peerevaluation and use (26) to get the weighted crossefficiency according to the distance between the currently evaluated DMU and peers. Peers’ evaluation with different weights according to the distance can partially mitigate conflict among DMUs because the evaluation perspective of peers with short distance is more likely to be accepted by the currently evaluated DMU. We use a numeric example in the following section to illustrate the advantages of our method.
4. An Illustrative Example
In this section, our method is illustrated with a numerical example. In the example, fourteen major international passenger airlines (DMUs) are needed to be evaluated in terms of three inputs () and two outputs () [25]. Description of the inputs and the outputs is shown in Table 1. We apply in this section the aggressive and benevolent models (shown in model (4)) as the comparison models. We also apply CCR model as the basic DEA model and report their CCRefficiency scores for some necessary analysis. Recall that the importance weight in models (8) and (9) reflects the magnitude of the gap minimization goal (see (5)) and thus may result in various solutions if its value changes. To balance the importance of the gap minimization goal, should be neither too large nor too small. In this example, we heuristically set .

Table 2 shows the input and output data, proposed neutral weighted crossefficiency results, the aggressive and benevolent crossefficiency results (shown in “” and “#” columns), and the CCRefficiency results (shown in “” column) of the fourteen passenger airlines. Efficiency scores from proposed method, aggressive and benevolent methods, and CCR are also shown in Figure 1. It can be seen that seven DMUs are CCRefficient (i.e., the 5th, 7th, and 10–14th DMUs). For these CCRefficient DMUs, three of the crossefficiency methods all fully rank them with peer and selfevaluation scores. Compared with the aggressive and benevolent methods, proposed method produces different efficiency rankings for 14 international passenger airlines. Specifically speaking, all CCRefficient DMUs are topranked from top 1 to top 7, respectively, using proposed method, whereas neither aggressive nor benevolent methods can achieve this. For example, at least one CCRinefficient DMU (e.g., evaluated by both aggressive and benevolent methods) is ranked as one of the top 7 DMUs while at least one CCRefficient DMU (e.g., evaluated by aggressive method and evaluated by benevolent method) is out of them. For CCRefficient DMUs, proposed method is flexible in balancing the different attitudes from aggressive and benevolent methods, for example, the results of . For CCRinefficient DMUs, it is less likely that proposed method regards them to be more efficient than CCRefficient ones. This illustrates that proposed method is effective to discriminate CCRefficient from CCRinefficient DMUs and to evaluate and rank DMUs from a more neutral perspective. We believe that our method is more equitable and reliable than the methods that rank DMUs according to either the aggressive or the benevolent crossefficiency scores, for the gap minimization goal to avoid extreme efficiency scores is more acceptable and an integration of both pessimistic and optimistic attitudes is more effective to mitigate conflict especially for DMUs in a cooperative mode.

5. Conclusions
Crossefficiency evaluation is an important method for comparing and ranking DMUs. Extant research has made efforts to tackle the shortcomings of crossefficiency but seldom considers how to effectively discriminate DEAefficient from DEAinefficient DMUs and to reduce conflict during the crossevaluation process. Based on two typical crossefficiency methods, we propose a secondary goal to minimize the gap between the upper and lower bounds of the peerevaluation scores and a weighted neutral crossefficiency method to determine crossefficiency of each DMU with a combination of its aggressive and benevolent crossefficiency. A numerical example is conducted to illustrate the proposed method. The results show that the proposed method has the ability to discriminate DEAefficient from DEAinefficient DMUs and rank DMUs from a more neutral perspective. In addition, the gap minimization criterion to reduce extreme peerevaluation results and the weights of the crossefficiency positively influenced by the DEAefficiency scores of the currently evaluated DMU are also beneficial to conflict mitigation. The results also indicate that the proposed method is compatible with typical crossefficiency models and makes valid contributions to crossefficiency evaluation. Future work may focus on how to determine the importance weight of the gap minimization goal in different application contexts.
Conflict of Interests
All of the authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The authors are grateful to the editor and the anonymous referees for their valuable and constructive comments. This work is partially supported by the Fundamental Research Funds for the Central Universities, HUST (CXY13Q035, CXY12Q044), and the Graduates’ Innovation Fund of Huazhong University of Science & Technology (HF11202013). The corresponding author thanks the Doctorate Fellowship Foundation of Huazhong University of Science & Technology and the financial support from China Scholarship Council (201406160046).
References
 A. Charnes, W. W. Cooper, and E. Rhodes, “Measuring the efficiency of decision making units,” European Journal of Operational Research, vol. 2, no. 6, pp. 429–444, 1978. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 R. D. Banker, A. Charnes, and W. W. Cooper, “Some models for estimating technical a nd scale inefficiencies in data envelopment analysis,” Management Science, vol. 30, no. 9, pp. 1078–1092, 1984. View at: Publisher Site  Google Scholar
 A. Ebrahimnejad, M. Tavana, F. HosseinzadehLotfi, R. Shahverdi, and M. Yousefpour, “A threestage data envelopment analysis model with application to banking industry,” Journal of Basic and Applied Scientific Research, vol. 49, pp. 308–319, 2014. View at: Google Scholar
 M. Khodabakhshi and K. Aryavash, “The fair allocation of common fixed cost or revenue using DEA concept,” Annals of Operations Research, vol. 214, pp. 187–194, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 S. G. Jalali Naini and H. R. Nouralizadeh, “A twostage DEA to analyze the effect of entrance deregulation on Iranian insurers: a robust approach,” Mathematical Problems in Engineering, vol. 2012, Article ID 423524, 24 pages, 2012. View at: Publisher Site  Google Scholar
 A. Payan, A. A. Noora, F. HosseinzadehLotfi, and A. Khodabakhshi, “Relative efficiency in twostage dea and its application to bank branches,” Journal of Basic and Applied Scientific Research, vol. 3, pp. 396–404, 2013. View at: Google Scholar
 P. Andersen and N. Petersen, “A procedure for ranking efficient units in data envelopment analysis,” Management Science, vol. 39, pp. 1261–1264, 1993. View at: Google Scholar
 H. Bal and H. H. Örkcü, “A goal programming approach to weight dispersion in data envelopment analysis,” Gazi University Journal of Science, vol. 20, pp. 117–125, 2007. View at: Google Scholar
 H. Bal, H. H. Örkcü, and S. Çelebioǧlu, “Improving the discrimination power and weights dispersion in the data envelopment analysis,” Computers and Operations Research, vol. 37, no. 1, pp. 99–107, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Y. Chen, “Measuring superefficiency in DEA in the presence of infeasibility,” European Journal of Operational Research, vol. 161, no. 2, pp. 545–551, 2005. View at: Publisher Site  Google Scholar  MathSciNet
 F. HosseinzadehLotfi, G. R. Jahanshahloo, and M. Mohammadpour, “An extension of cross redundancy of interval scale outputs and inputs in DEA,” Journal of Applied Mathematics, vol. 2013, Article ID 658635, 7 pages, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 M. Khodabakhshi, M. M. Goudarzi, M. Y. Maryaki, and M. Hajiani, “A onemodel approach for computation of congestion with productions tradeoffs and weight restrictions,” International Journal of Applied Mathematics, vol. 3, pp. 69–80, 2013. View at: Google Scholar
 S. Li, G. R. Jahanshahloo, and M. Khodabakhshi, “A superefficiency model for ranking efficient units in data envelopment analysis,” Applied Mathematics and Computation, vol. 184, no. 2, pp. 638–648, 2007. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 H. H. Örkcü and H. Bal, “Goal programming approaches for data envelopment analysis cross efficiency evaluation,” Applied Mathematics and Computation, vol. 218, no. 2, pp. 346–356, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 S. Saati, M. Zarafat, A. Memariani, and G. R. Jahanshahloo, “A model for ranking decision making units in data envelopment analysis,” Ricerca Operativa, vol. 31, pp. 47–59, 2001. View at: Google Scholar
 Y. Wang and K. Chin, “A neutral DEA model for crossefficiency evaluation and its extension,” Expert Systems with Applications, vol. 37, no. 5, pp. 3666–3675, 2010. View at: Publisher Site  Google Scholar
 Y. Wang, K. Chin, and P. Jiang, “Weight determination in the crossefficiency evaluation,” Computers and Industrial Engineering, vol. 61, no. 3, pp. 497–502, 2011. View at: Publisher Site  Google Scholar
 T. R. Sexton, R. H. Silkman, and A. J. Hogan, “Data envelopment analysis: critique and extensions,” in Measuring Efficiency: An Assessment of Data Envelopment Analysis, H. R. Silkman, Ed., pp. 73–105, JosseyBass, San Francisco, Calif, USA, 1986. View at: Google Scholar
 F. Hosseinzadeh Lotfi, G. R. Jahanshahloo, M. Khodabakhshi, M. RostamyMalkhlifeh, Z. Moghaddas, and M. VaezGhasemi, “A review of ranking models in data envelopment analysis,” Journal of Applied Mathematics, vol. 2013, Article ID 492421, 20 pages, 2013. View at: Publisher Site  Google Scholar
 J. Doyle and R. Green, “Efficiency and crossefficiency in DEA: derivations, meanings and uses,” Journal of the Operational Research Society, vol. 45, no. 5, pp. 567–578, 1994. View at: Publisher Site  Google Scholar
 G. R. Jahanshahloo, F. H. Lotfi, Y. Jafari, and R. Maddahi, “Selecting symmetric weights as a secondary goal in DEA crossefficiency evaluation,” Applied Mathematical Modelling: Simulation and Computation for Engineering and Environmental Systems, vol. 35, no. 1, pp. 544–549, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 F. HosseinzadehLotfi, G. R. Jahanshahloo, and P. Zamani, “A new ranking method based on crossefficiency in data envelopment analysis,” African Journal of Business Management, vol. 5, pp. 7923–7930, 2011. View at: Google Scholar
 X. Li and G. R. Reeves, “Multiple criteria approach to data envelopment analysis,” European Journal of Operational Research, vol. 115, no. 3, pp. 507–517, 1999. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 L. Liang, J. Wu, W. D. Cook, and J. Zhu, “Alternative secondary goals in DEA crossefficiency evaluation,” International Journal of Production Economics, vol. 113, no. 2, pp. 1025–1030, 2008. View at: Publisher Site  Google Scholar
 C. Tofallis, “Input efficiency profiling: an application to airlines,” Computers and Operations Research, vol. 24, no. 3, pp. 253–258, 1997. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Anrong Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.