The Most Efficient Unit in Data Envelopment Analysis Using Genetic Algorithm

Theory of Approximation and Applications

مقالات آماده انتشار، پذیرفته شده ، انتشار آنلاین از تاریخ 05 آذر 1397  

نوع مقاله: Research Articles

نویسندگان

Mohsen Rostamy-Malkhalifeh ¹؛ Nastaran Matin Nejati¹؛ Reza Karegar²؛ Razie Mehrjou³

¹Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran

²Department of Mathematics, Qom Branch, Islamic Azad University, Qom, Iran

³Department of Mathematics, Qods Branch, Islamic Azad University, Tehran, Iran

چکیده

Data Envelopment Analysis (DEA) is a useful and practical to evaluate the performance based on multiple inputs and multiple outputs.Data Envelopment Analysis can determine efficient and non-efficient decision-making units (DMUs) through performance calculations.
The most efficient unit is the DMU that is ranked among the most efficient units. However, there is no need to rank all units in order to obtain the most efficient decision-making unit.The most efficient unit in data envelopment analysis (ٍَِDEA) using genetic algorithm can be applied to most organizations and companies.

In this paper, the efficient unit hyperplane is selected with the help of the genetic algorithm of all the efficient units, which is the total distance between all the units on the other side of this hyperplane is the maximum amount possible with this hyperplane.I hope that this article will be of interest to Dear readers.


Keywords: Data Envelopment Analysis (DEA), Genetic Algorithm, Hyperplane, Efficient Unit.

کلیدواژه‌ها

Data Envelopment Analysis؛ Genetic Algorithm؛ Hyperplane؛ Efficient Unit