Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach

Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach

Jose Humberto Ablanedo-Rosas, Cesar Rego
Copyright: © 2018 |Volume: 9 |Issue: 1 |Pages: 17
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781522544524|DOI: 10.4018/ijamc.2018010106
Cite Article Cite Article

MLA

Ablanedo-Rosas, Jose Humberto, and Cesar Rego. "Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach." IJAMC vol.9, no.1 2018: pp.78-94. http://doi.org/10.4018/ijamc.2018010106

APA

Ablanedo-Rosas, J. H. & Rego, C. (2018). Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach. International Journal of Applied Metaheuristic Computing (IJAMC), 9(1), 78-94. http://doi.org/10.4018/ijamc.2018010106

Chicago

Ablanedo-Rosas, Jose Humberto, and Cesar Rego. "Assessing Algorithmic Performance by Frontier Analysis: A DEA Approach," International Journal of Applied Metaheuristic Computing (IJAMC) 9, no.1: 78-94. http://doi.org/10.4018/ijamc.2018010106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In Combinatorial Optimization the evaluation of heuristic algorithms often requires the consideration of multiple performance metrics that are relevant for the application of interest. Traditional empirical analysis of algorithms relies on evaluating individual performance metrics where the overall assessment is conducted by subjective judgment without the support of rigorous scientific methods. The authors propose an analytical approach based on data envelopment analysis (DEA) to rank algorithms by their relative efficiency scores that result from combining multiple performance metrics. To evaluate their approach, they perform a pilot study examining the relative performance of ten surrogate constraint algorithms for different classes of the set covering problem. The analysis shows their DEA-based approach is highly effective, establishing a clear difference between the algorithms' performances at appropriate statistical significance levels, and in consequence providing useful insights into the selection of algorithms to address each class of instances. Their approach is general and can be used with all types of performance metrics and algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.