The traveling tournament problem is a well-known and important problem within the collective sports communities. This is a NP-hard problem which makes difficult finding quality solutions in a short amount of time. In this paper, we include new components to the Clonal Selection Algorithm to tackle the Traveling Tournament Problem. We introduce a new selection procedure focused on improving diversity of the selected cells set. The algorithm also uses a new move which is based on the team home/away patterns. We have tested the algorithm with well-known benchmarks of the problem, and the results obtained are very encouraging. A statistical analysis is also reported. The results obtained show a new application of an artificial immune algorithm based on the CLONALG framework.
|Número de artículo||1250008|
|Publicación||International Journal of Computational Intelligence and Applications|
|Estado||Publicada - mar. 2012|
|Publicado de forma externa||Sí|