Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming
Author(s) -
Juan Aparicio,
José J. LópezEspín,
Raul Martinez-Moreno,
Jesús T. Pastor
Publication year - 2014
Publication title -
advances in operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.379
H-Index - 14
eISSN - 1687-9155
pISSN - 1687-9147
DOI - 10.1155/2014/431749
Subject(s) - benchmarking , data envelopment analysis , inefficiency , computer science , set (abstract data type) , nonparametric statistics , mathematical optimization , algorithm , genetic algorithm , operations research , data mining , mathematics , economics , machine learning , econometrics , management , programming language , microeconomics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom