Abstract:The Travelling Tournament Problem is a challenging sports timetabling problem which is widely believed to be NP-Hard. The objective is to establish a feasible double round robin tournament schedule, with minimum travel distances. This paper investigates the application of an ant based hyper-heuristic algorithm for this problem. Ant algorithms, a well known meta-heuristic, have been successfully applied to various problems. Whilst hyper-heuristics are an emerging technology, which operate at a higher level of abstraction than meta-heuristics. This paper presents a framework which employs ant algorithms as a hyper-heuristic. We show that this approach produces good quality solutions for the traveling tournament problem when compared with results from the literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.