Solving scheduling tournament problems using a new version of CLONALG

LESLIE ANGELICA PEREZ CACERES, María Cristina Riff

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

The travelling tournament problem (TTP) is an important and well-known problem within the collective sports research community. The problem is NP-hard which makes difficult finding quality solution in short amount of time. Recently a new kind of TTP has been proposed ‘The Relaxed Travelling Tournament Problem’. This version of the problem allows teams to have some days off during the tournament. In this paper, we propose an immune algorithm that is able to solve both problem versions. The algorithm uses moves which are based on the team home/away patterns. One of these moves has been specially designed for the relaxed travel tournament instances. We have tested the algorithm using well-known problem benchmarks and the results obtained are very encouraging.

Original languageEnglish
Pages (from-to)5-21
Number of pages17
JournalConnection Science
Volume27
Issue number1
DOIs
StatePublished - 2 Jan 2015

Keywords

  • artificial immune algorithm
  • CLONALG
  • relaxed travelling tournament problem

Fingerprint Dive into the research topics of 'Solving scheduling tournament problems using a new version of CLONALG'. Together they form a unique fingerprint.

Cite this