A Parallel Application of Matheuristics in Data Envelopment Analysis

Data Envelopment Analysis (DEA) is a non-parametric methodology for estimating technical efficiency and benchmarking. In general, it is desirable that DEA generates the efficient closest targets as benchmarks for each assessed unit. This may be achieved through the application of the Principle of Least Action. However, the mathematical models associated with this principle are based fundamentally on combinatorial NP-hard problems, difficult to be solved. For this reason, this paper uses a parallel matheuristic algorithm, where metaheuristics and exact methods work together to find optimal solutions. Several parallel schemes are used in the algorithm, being possible for them to be configured at different stages of the algorithm. The main intention is to divide the number of problems to be evaluated in equal groups, so that they are resolved in different threads. The DEA problems to be evaluated in this paper are independent of each other, an indispensable requirement for this algorithm. In addition, taking into account that the main algorithm uses exact methods to solve the mathematical problems, different optimization software has been evaluated to compare their performance when executed in parallel. The method is competitive with exact methods, obtaining fitness close to the optimum with low computational time.