DocumentCode :
2217761
Title :
New bounds for the Relaxed Traveling Tournament Problems using an artificial immune algorithm
Author :
Pérez, Leslie ; Riff, María Cristina
Author_Institution :
Comput. Sci. Dept., Univ. Tech. Federico Santa Maria, Valparaiso, Chile
fYear :
2011
fDate :
5-8 June 2011
Firstpage :
873
Lastpage :
879
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.
Keywords :
artificial immune systems; travelling salesman problems; artificial immune algorithm; relaxed traveling tournament problem; Algorithm design and analysis; Barium; Cloning; Equations; Immune system; Round robin; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation (CEC), 2011 IEEE Congress on
Conference_Location :
New Orleans, LA
ISSN :
Pending
Print_ISBN :
978-1-4244-7834-7
Type :
conf
DOI :
10.1109/CEC.2011.5949710
Filename :
5949710
Link To Document :
بازگشت