A Review of Metaheuristic Algorithms and Data Envelopment Analysis

Iranian Journal of Optimization

مقاله 11، دوره 12، شماره 1، شهریور 2020، صفحه 115-137   

نوع مقاله: Review Paper

نویسندگان

Mohsen Vaez-ghasemi¹؛ Zohreh Moghaddas²؛ Hamid Askari³؛ Feloora Valizadeh^{* 4}

¹Department of mathematics, Rasht IAu

²Department of Electrical, Computer and Biomedical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

³Ph.D. Candidate of Industrial Engineering, Qazvin Branch, Islamic Azad University, Rasht, Iran.

⁴Islamic azad university,Rasht Branch

چکیده

Today, many activities from businesses to engineering design, routing on the Internet, and even routing of foodstuff trucks require programming and optimization. Many of these problems have no determinate solution and cannot be solved easily. To solve these problems, algorithms have been developed inspired by nature based on particle intelligence, biological, physical, and chemical systems, and even human communities and have been named after their inspiration source. A metaheuristic optimization algorithm is an innovative way that can be applied to various optimization problems by slight modifications. These algorithms can improve the capability of finding high-quality answers for difficult optimization problems significantly. The present paper reviews the application of various metaheuristic algorithms and data envelopment analysis (DEA) to optimization problems in the literature published in recent years. Descriptions are provided about the application of metaheuristic algorithms in DEA along with their applications, the field of activity, overlaps, and the integration of these two robust methods to find the optimal answer.

کلیدواژه‌ها

metaheuristic algorithms؛ data envelopment analysis؛ optimization