An attempt to map the performance of a range of algorithm and heuristic combinations (1995)
| Venue: | IN HYBRID PROBLEMS, HYBRID SOLUTIONS |
| Citations: | 18 - 1 self |
BibTeX
@INPROCEEDINGS{Tsang95anattempt,
author = {Edward P. K. Tsang and James E. Borrett and Alvin C. M. Kwan},
title = { An attempt to map the performance of a range of algorithm and heuristic combinations},
booktitle = {IN HYBRID PROBLEMS, HYBRID SOLUTIONS},
year = {1995},
pages = {203--216},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Constraint satisfaction is the core of many AI and real life problems and much research has been done in this field in recent years. Work has been done in the past on comparing the performance of different algorithms and heuristics. Much of such work has focused on finding "the best" algorithm and heuristic combination for all problems. The objective of this paper is to prove that there is no universally best algorithm and heuristic for all problems-- different problems can be solved most efficiently by different algorithm and heuristic combinations. The implication of this is important because it means that instead of trying to find "the best " algorithms and heuristics, future research should try to identify the application domain of each algorithm and heuristic (i.e. when they are most effective). Furthermore our results point to future research which focuses on how to retrieve the most efficient algorithm for a given problem. The results in this paper provide a first step towards achieving such goals.
