Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming

DOI10.1155/2014/431749MaRDI QIDQ2248708zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Juan Aparicio, Raul Martinez-Moreno, Jose J. López-Espín, Jesus T. Pastor

Publication date 27 June 2014

Published in Advances in Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2014/431749

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: 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.

Recommendations

• scientific article; zbMATH DE number 7340807
• The relevance of DEA benchmarking information and the least-distance measure
• Seeking alternative DEA benchmarks
• Finding suitable benchmark for inefficient commercial bank branches, application of DEA
• scientific article; zbMATH DE number 6612271

Cites work

• A comment on multi-stage DEA methodology
• A Euclidean distance-based measure of efficiency in data envelopment analysis
• A multi-stage methodology for the solution of orientated DEA models
• An enhanced DEA Russell graph efficiency measure
• An extended set of FORTRAN basic linear algebra subprograms
• Automated empirical optimizations of software and the ATLAS project
• Determining a sequence of targets in DEA
• Finding the piecewise linear frontier production function in data envelopment analysis
• From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
• scientific article; zbMATH DE number 1131224 (Why is no real title available?)
• scientific article; zbMATH DE number 1169071 (Why is no real title available?)
• scientific article; zbMATH DE number 1776908 (Why is no real title available?)
• scientific article; zbMATH DE number 781814 (Why is no real title available?)
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Measuring the efficiency of decision making units
• Metric distance function and profit: Some duality results
• On how to properly calculate the Euclidean distance-based measure in DEA
• On measuring the inefficiency with the inner-product norm in data envelopment analysis
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Technical efficiency and distance to a reverse convex set
• The relevance of DEA benchmarking information and the least-distance measure
• The relevance of DEA benchmarking information and the least-distance measure: comment
• Using the minimum distance of DMUs from the frontier of the PPS for evaluating group performance of DMUs in DEA

Cited in

(4)

• Multidimensional frontier visualization based on optimization methods using parallel computations
• The relevance of DEA benchmarking information and the least-distance measure
• Seeking alternative DEA benchmarks
• The data anvelopment analysis method in benchmarking of technological incubators

Describes a project that uses

Uses Software

• ATLAS
• LAPACK

This page was built for publication: Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248708)