Volume 23, Issue 3 (9-2026)                   jor 2026, 23(3): 0-0 | Back to browse issues page


XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Dormishi A, Hosseinzadeh Lotfi F, Rahmani Parchikolaei B, Najafi E, Azizi A. Introducing a Metaheuristic Algorithm for Solving Large-Scale Problems in Data Envelopment Analysis. jor 2026; 23 (3)
URL: http://jamlu.lahijan.iau.ir/article-1-2106-en.html
Department of Mathematics, SR.C., Islamic Azad University, Tehran, Iran , farhad@hosseinzadeh.ir
Abstract:   (65 Views)
Data Envelopment Analysis (DEA) is one of the most widely used methods for evaluating the relative efficiency of Decision Making Units (DMUs). In conventional DEA, the optimization model must be solved separately for each DMU, resulting in a significant increase in computational time as the number of units grows. Furthermore, the limitations of linear programming solvers and the accumulation of numerical errors reduce the applicability of exact approaches for large-scale problems. This paper proposes a novel deterministic population-based metaheuristic algorithm to efficiently estimate the efficiency scores of large-scale DEA problems. The proposed approach incorporates an increasing gradient strategy to generate high-quality initial solutions close to the optimal region, thereby accelerating convergence and improving solution quality. Computational experiments conducted on randomly generated datasets and a real-world case study demonstrate that the proposed algorithm provides accurate and stable efficiency estimates within a reasonable computational time, making it suitable for large-scale DEA applications.  
 
     
Type of Study: Research | Subject: Special
Received: 2021/12/13 | Accepted: 2022/07/5 | Published: 2026/09/11

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.