Advertisement
Published in:
2013 | OriginalPaper | Chapter
Application of Genetic Algorithms to Determine Closest Targets in Data Envelopment Analysis
Authors : Raul Martinez-Moreno, Jose J. Lopez-Espin, Juan Aparicio, Jesus T. Pastor
Published in: Distributed Computing and Artificial Intelligence
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper studies the application of a genetic algorithm (GA) for determining closest efficient targets in Data Envelopment Analysis. Traditionally, this problem has been solved in the literature through unsatisfactory methods since all of them are related in some sense to a combinatorial NP-hard problem. This paper presents and studies some algorithms to be used in the creation, crossover and mutation of chromosomes in a GA, in order to obtain an efficient metaheuristic which obtains better solutions.