New bounds for the Relaxed Traveling Tournament Problems using an artificial immune algorithm

LESLIE ANGELICA PEREZ CACERES, María Cristina Riff

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper we tackle the Relaxed Traveling Tournament Problem by an artificial immune algorithm. We introduce new moves that allow the algorithm to group byes when it is useful. We have tested the algorithm in the recently proposed instances of the problem, the results obtained are very encouraging.

Original languageEnglish
Title of host publication2011 IEEE Congress of Evolutionary Computation, CEC 2011
Pages873-879
Number of pages7
DOIs
StatePublished - 29 Aug 2011
Event2011 IEEE Congress of Evolutionary Computation, CEC 2011 - New Orleans, LA, United States
Duration: 5 Jun 20118 Jun 2011

Publication series

Name2011 IEEE Congress of Evolutionary Computation, CEC 2011

Conference

Conference2011 IEEE Congress of Evolutionary Computation, CEC 2011
CountryUnited States
CityNew Orleans, LA
Period5/06/118/06/11

Fingerprint Dive into the research topics of 'New bounds for the Relaxed Traveling Tournament Problems using an artificial immune algorithm'. Together they form a unique fingerprint.

Cite this