TY - JOUR
T1 - Solving scheduling tournament problems using a new version of CLONALG
AU - Pérez-Cáceres, Leslie
AU - Riff, María Cristina
N1 - Funding Information:
This work is supported by the Fondecyt Project 1120781.
Publisher Copyright:
© 2014, © 2014 Taylor & Francis.
PY - 2015/1/2
Y1 - 2015/1/2
N2 - 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.
AB - 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.
KW - CLONALG
KW - artificial immune algorithm
KW - relaxed travelling tournament problem
UR - http://www.scopus.com/inward/record.url?scp=84922212727&partnerID=8YFLogxK
U2 - 10.1080/09540091.2014.944099
DO - 10.1080/09540091.2014.944099
M3 - Article
AN - SCOPUS:84922212727
VL - 27
SP - 5
EP - 21
JO - Connection Science
JF - Connection Science
SN - 0954-0091
IS - 1
ER -