TY - GEN
T1 - New bounds for the Relaxed Traveling Tournament Problems using an artificial immune algorithm
AU - Pérez, Leslie
AU - Riff, María Cristina
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80051968831&partnerID=8YFLogxK
U2 - 10.1109/CEC.2011.5949710
DO - 10.1109/CEC.2011.5949710
M3 - Conference contribution
AN - SCOPUS:80051968831
SN - 9781424478347
T3 - 2011 IEEE Congress of Evolutionary Computation, CEC 2011
SP - 873
EP - 879
BT - 2011 IEEE Congress of Evolutionary Computation, CEC 2011
T2 - 2011 IEEE Congress of Evolutionary Computation, CEC 2011
Y2 - 5 June 2011 through 8 June 2011
ER -