Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming

Data Envelopment Analysis (DEA) is a nonparametric technique to estimate the current level of efficiency of a set of entities. DEA also provides information on how to remove inefficiency through the determination of benchmarking information. This paper is devoted to study DEA models based on closest efficient targets, which are related to the shortest projection to the production frontier and allow inefficient firms to find the easiest way to improve their performance. Usually, these models have been solved by means of unsatisfactory methods since all of them are related in some sense to a combinatorial NP-hard problem. In this paper, the problem is approached by genetic algorithms and parallel programming. In addition, to produce reasonable solutions, a particular metaheuristic is proposed and checked through some numerical instances.

[1]  Rohit Chandra,et al.  Parallel programming in openMP , 2000 .

[2]  Patrick T. Harker,et al.  Projections Onto Efficient Frontiers: Theoretical and Computational Extensions to DEA , 1999 .

[3]  Abraham Charnes,et al.  Measuring the efficiency of decision making units , 1978 .

[4]  Jack J. Dongarra,et al.  Automated empirical optimizations of software and the ATLAS project , 2001, Parallel Comput..

[5]  Alireza Amirteimoori,et al.  A distance-based measure of super efficiency in data envelopment analysis: an application to gas companies , 2012, J. Glob. Optim..

[6]  Akiko Takeda,et al.  On measuring the inefficiency with the inner-product norm in data envelopment analysis , 2001, Eur. J. Oper. Res..

[7]  M. Farrell.  The Measurement of Productive Efficiency , 1957 .

[8]  J. Pastor,et al.  On how to properly calculate the Euclidean distance-based measure in DEA , 2014 .

[9]  F. Hosseinzadeh Lotfi,et al.  Finding the piecewise linear frontier production function in data envelopment analysis , 2005, Appl. Math. Comput..

[10]  W. Briec,et al.  Technical efficiency and distance to a reverse convex set , 1999, Eur. J. Oper. Res..

[11]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[12]  Eduardo González,et al.  From efficiency measurement to efficiency improvement: The choice of a relevant benchmark , 2001, Eur. J. Oper. Res..

[13]  Laurens Cherchye,et al.  A comment on multi-stage DEA methodology , 2001, Oper. Res. Lett..

[14]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[15]  Walter Briec,et al.  Hölder Distance Function and Measurement of Technical Efficiency , 1999 .

[16]  Juan Aparicio,et al.  The relevance of DEA benchmarking information and the Least-Distance Measure: Comment , 2010, Math. Comput. Model..

[17]  Jack J. Dongarra,et al.  An extended set of FORTRAN basic linear algebra subprograms , 1988, TOMS.

[18]  Lawrence M. Seiford,et al.  Data envelopment analysis (DEA) - Thirty years on , 2009, Eur. J. Oper. Res..

[19]  W. Cooper,et al.  Data Envelopment Analysis: A Comprehensive Text with Models, Applications, References and DEA-Solver Software , 1999 .

[20]  A. Charnes,et al.  Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis , 1984 .

[21]  Alireza Amirteimoori,et al.  A Euclidean distance-based measure of efficiency in data envelopment analysis , 2010 .

[22]  Walter Briec,et al.  Metric Distance Function and Profit: Some Duality Results , 1999 .

[23]  Kaoru Tone,et al.  A slacks-based measure of super-efficiency in data envelopment analysis , 2001, Eur. J. Oper. Res..

[24]  M. Zarepisheh,et al.  A Linear bilevel Programming Problem for Obtaining the Closest Targets and Minimum Distance of a Unit from the Strong Efficient Frontier , 2012, Asia Pac. J. Oper. Res..

[25]  Jesús T. Pastor,et al.  An enhanced DEA Russell graph efficiency measure , 1999, Eur. J. Oper. Res..

[26]  Emmanuel Thanassoulis,et al.  Finding Closest Targets in Non-Oriented DEA Models: The Case of Convex and Non-Convex Technologies , 2003 .

[27]  Yuefan Deng,et al.  New trends in high performance computing , 2001, Parallel Computing.

[28]  A. Charnes,et al.  Sensitivity and stability of efficiency classifications in Data Envelopment Analysis , 1996 .

[29]  F. Hosseinzadeh Lotfi,et al.  Finding strong defining hyperplanes of Production Possibility Set , 2007, Eur. J. Oper. Res..

[30]  Kaoru Tone,et al.  A slacks-based measure of efficiency in data envelopment analysis , 1997, Eur. J. Oper. Res..

[31]  Chulwoo Baek,et al.  The relevance of DEA benchmarking information and the Least-Distance Measure , 2009, Math. Comput. Model..

[32]  Tim Coelli,et al.  A multi-stage methodology for the solution of orientated DEA models , 1998, Oper. Res. Lett..

[33]  Timothy Coelli,et al.  An Introduction to Efficiency and Productivity Analysis , 1997 .

[34]  Sebastián Lozano,et al.  Determining a sequence of targets in DEA , 2005, J. Oper. Res. Soc..

[35]  Gholam Reza Jahanshahloo,et al.  Using the Minimum Distance of DMUs from the Frontier of the PPS for Evaluating Group Performance of DMUs in DEA , 2012, Asia Pac. J. Oper. Res..

[36]  Juan Aparicio,et al.  Closest targets and minimum distance to the Pareto-efficient frontier in DEA , 2007 .