Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Heuristic optimization algorithms seek good feasible solutions to optimization problems in circumstances where the complexities of the problem or the limited time available for solution do not allow exact solution. Although worst case and probabilistic analysis of algorithms have produced insight on...

Full description

Saved in:
Bibliographic Details
Published inJournal of heuristics Vol. 7; no. 3; p. 261
Main Authors Rardin, Ronald L, Uzsoy, Reha
Format Journal Article
LanguageEnglish
Published Boston Springer Nature B.V 01.05.2001
Subjects
Algorithms
Design
Experiments
Group technology
Heuristic
Optimization
Optimization algorithms
Production planning
Scheduling
Software
Studies
Online AccessGet full text

Cover

More Information
Summary:Heuristic optimization algorithms seek good feasible solutions to optimization problems in circumstances where the complexities of the problem or the limited time available for solution do not allow exact solution. Although worst case and probabilistic analysis of algorithms have produced insight on some classic models, most of the heuristics developed for large optimization problem must be evaluated empirically--by applying procedures to a collection of specific instances and comparing the observed solution quality and computational burden. [PUBLICATION ABSTRACT] This paper focuses on the methodological issues that must be confronted by researchers undertaking such experimental evaluations of heuristics, including experimental design, sources of test instances, measures of algorithmic performance, analysis of results, and presentation in papers and talks. The questions are difficult, and there are no clear right answers. We seek only to highlight the main issues, present alternative ways of addressing them under different circumstances, and caution about pitfalls to avoid.
ISSN:1381-1231
1572-9397
DOI:10.1023/A:1011319115230