Solving scheduling tournament problems using a new version of CLONALG

Leslie Pérez-Cáceres; María Cristina Riff

doi:10.1080/09540091.2014.944099

Solving scheduling tournament problems using a new version of CLONALG

Leslie Pérez-Cáceres, María Cristina Riff

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	5-21
Number of pages	17
Journal	Connection Science
Volume	27
Issue number	1
DOIs	https://doi.org/10.1080/09540091.2014.944099
State	Published - 2 Jan 2015
Externally published	Yes

Keywords

CLONALG
artificial immune algorithm
relaxed travelling tournament problem

Access to Document

10.1080/09540091.2014.944099

Cite this

@article{53a9ebe3229d4ac090cd8b30f0559914,

title = "Solving scheduling tournament problems using a new version of CLONALG",

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 {\textquoteleft}The Relaxed Travelling Tournament Problem{\textquoteright}. 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.",

keywords = "CLONALG, artificial immune algorithm, relaxed travelling tournament problem",

author = "Leslie P{\'e}rez-C{\'a}ceres and Riff, {Mar{\'i}a Cristina}",

note = "Publisher Copyright: {\textcopyright} 2014, {\textcopyright} 2014 Taylor & Francis.",

year = "2015",

month = jan,

day = "2",

doi = "10.1080/09540091.2014.944099",

language = "English",

volume = "27",

pages = "5--21",

journal = "Connection Science",

issn = "0954-0091",

publisher = "Taylor and Francis AS",

number = "1",

}

TY - JOUR

T1 - Solving scheduling tournament problems using a new version of CLONALG

AU - Pérez-Cáceres, Leslie

AU - Riff, María Cristina

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

SN - 0954-0091

VL - 27

SP - 5

EP - 21

JO - Connection Science

JF - Connection Science

IS - 1

ER -

Solving scheduling tournament problems using a new version of CLONALG

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this