Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Clustering Search Approach for the Traveling Tournament Problem
verfasst von : Fabrício Lacerda Biajoli, Luiz Antonio Nogueira Lorena
Erschienen in: MICAI 2007: Advances in Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The
Traveling Tournament Problem
(TTP) is an optimization problem that represents some types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of a hybrid heuristic to solve the mirrored TTP (mTTP), called
Clustering Search
(*CS), that consists in detecting supposed promising search areas based on clustering. The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.