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...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Advances in Operations Research |
Online Access: | http://dx.doi.org/10.1155/2014/431749 |
id |
doaj-fd8f97b90f5d4696a422203da7eb82c8 |
---|---|
record_format |
Article |
spelling |
doaj-fd8f97b90f5d4696a422203da7eb82c82020-11-25T00:32:14ZengHindawi LimitedAdvances in Operations Research1687-91471687-91552014-01-01201410.1155/2014/431749431749Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel ProgrammingJuan Aparicio0Jose J. Lopez-Espin1Raul Martinez-Moreno2Jesus T. Pastor3Center of Operations Research (CIO), University Miguel Hernandez of Elche, Avenida de la Universidad s/n, 03202 Elche (Alicante), SpainCenter of Operations Research (CIO), University Miguel Hernandez of Elche, Avenida de la Universidad s/n, 03202 Elche (Alicante), SpainCenter of Operations Research (CIO), University Miguel Hernandez of Elche, Avenida de la Universidad s/n, 03202 Elche (Alicante), SpainCenter of Operations Research (CIO), University Miguel Hernandez of Elche, Avenida de la Universidad s/n, 03202 Elche (Alicante), SpainData 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.http://dx.doi.org/10.1155/2014/431749 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Juan Aparicio Jose J. Lopez-Espin Raul Martinez-Moreno Jesus T. Pastor |
spellingShingle |
Juan Aparicio Jose J. Lopez-Espin Raul Martinez-Moreno Jesus T. Pastor Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming Advances in Operations Research |
author_facet |
Juan Aparicio Jose J. Lopez-Espin Raul Martinez-Moreno Jesus T. Pastor |
author_sort |
Juan Aparicio |
title |
Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming |
title_short |
Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming |
title_full |
Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming |
title_fullStr |
Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming |
title_full_unstemmed |
Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming |
title_sort |
benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming |
publisher |
Hindawi Limited |
series |
Advances in Operations Research |
issn |
1687-9147 1687-9155 |
publishDate |
2014-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2014/431749 |
work_keys_str_mv |
AT juanaparicio benchmarkingindataenvelopmentanalysisanapproachbasedongeneticalgorithmsandparallelprogramming AT josejlopezespin benchmarkingindataenvelopmentanalysisanapproachbasedongeneticalgorithmsandparallelprogramming AT raulmartinezmoreno benchmarkingindataenvelopmentanalysisanapproachbasedongeneticalgorithmsandparallelprogramming AT jesustpastor benchmarkingindataenvelopmentanalysisanapproachbasedongeneticalgorithmsandparallelprogramming |
_version_ |
1725320206276886528 |