Article ID Journal Published Year Pages File Type
474852 Computers & Operations Research 2007 22 Pages PDF
Abstract

Heuristic performance has been mainly measured by effectiveness (near optimality) and efficiency (computational complexity). More recently researchers have begun the difficult task of evaluating heuristic stability, or sensitivity, to perturbations in the problem specifications. Various stability measures have been proposed. Here we consider how Spearman's footrule, a measure of permutation disarray, may shed some further light on this, not as yet well understood, problem.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,