![]() |
CiteULike | ![]() |
Group: Metaheuristics | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Determining Whether a Problem Characteristic Affects Heuristic Performanceby: Enda Ridge, Daniel Kudenko
Recent Advances in Evolutionary Computation for Combinatorial Optimization (2008), pp. 21-35.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThis chapter presents a rigorous Design of Experiments (DOE) approach for determining whether a problem characteristic affects the performance of a heuristic. Specifically, it reports a study on the effect of the cost matrix standard deviation of symmetric Travelling Salesman Problem (TSP) instances on the performance of Ant Colony Optimisation (ACO) heuristics. Results demonstrate that for a given instance size, an increase in the standard deviation of the cost matrix of instances results in an increase in the difficulty of the instances. This implies that for ACO, it is insufficient to report results on problems classified only by problem size, as has been commonly done in most ACO research to date. Some description of the cost matrix distribution is also required when attempting to explain and predict the performance of these heuristics on the TSP. The study should serve as a template for similar investigations with other problems and other heuristics.
BibTeX record
RIS record