2015
DOI: 10.1016/j.procs.2015.05.257
|View full text |Cite
|
Sign up to set email alerts
|

Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis

Abstract: Data Envelopment Analysis (DEA) is a non-parametric technique for estimating the technical efficiency of a set of Decision Making Units (DMUs) from a database consisting of inputs and outputs. This paper studies DEA models based on maximizing technical efficiency, which aim to determine the least distance from the evaluated DMU to the production frontier. Usually, these models have been solved through unsatisfactory methods used for combinatorial NP-hard problems. Here, the problem is approached by metaheurist… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 13 publications
(12 reference statements)
0
8
0
Order By: Relevance
“…Before proposing the model based on DDEA and OCT, it is important to know how to solve these kinds of models. According to Gonzalez et al (2015), some metaheuristics leads to unsatisfactory solutions when solving DEA problems, and Alves Junior and Cari (2017) state that solving a nonlinear OCT problems without a good initial guess of the solution or even with some metaheuristics, as genetic algorithm, takes an unworkable time to be solved.…”
Section: Proposed Modelmentioning
confidence: 99%
“…Before proposing the model based on DDEA and OCT, it is important to know how to solve these kinds of models. According to Gonzalez et al (2015), some metaheuristics leads to unsatisfactory solutions when solving DEA problems, and Alves Junior and Cari (2017) state that solving a nonlinear OCT problems without a good initial guess of the solution or even with some metaheuristics, as genetic algorithm, takes an unworkable time to be solved.…”
Section: Proposed Modelmentioning
confidence: 99%
“…In view of the preceding discussion, from a computational point of view, the determination of the least distance in DEA has not yet been satisfactorily solved, and consequently, the effort to apply new methods to overcome the problem is, therefore, justified. In this respect, other related papers are those by Martinez-Moreno et al (2013), Lopez-Espin et al (2014), Aparicio et al (2014b) and Gonzalez et al (2015), who apply genetic algorithms, meta-heuristics and parallel programming for determining closest efficient targets in DEA.…”
Section: Modeling and Computational Aspectsmentioning
confidence: 99%
“…The application of the Principle of Least Action has been recently studied from a metaheuristic perspective (Benavente et al [8], López-Espín et al [9] and González et al [10]). In [8,9] heuristics were used to generate valid solutions for a subset of restrictions of the problem, while in [10] all the constraints are incorporated, the heuristics are improved, and new ones are developed, thereby generating initial populations of solutions that satisfy all constraints.…”
Section: Introductionmentioning
confidence: 99%
“…Our paper takes up where González et al [10] left off in the application of metaheuristics to the approach in [1]. The improvement of previous heuristics for the generation of valid solutions is a possible option, but greatly limits the search for valid solutions for large problem sizes, because when the number of variables grows, the number of valid solutions decreases.…”
Section: Introductionmentioning
confidence: 99%